Educational Codeforces Round 90 (Rated for Div. 2) A. Donut Shops (1000)

1373A - Donut Shops
题意&&思路：

if(a<c)cout<<1;
else cout<<-1;if(a*b>c)cout<<b;
else cout<<-1;

代码附：

#pragma GCC optimize("Ofast","inline","-ffast-math")
#pragma GCC target("avx,sse2,sse3,sse4,mmx")
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 2e5+10;
signed main()
{ios::sync_with_stdio(false);cin.tie(0);int t,a,b,c;cin>>t;while(t--){cin>>a>>b>>c;if(a<c)cout<<1<<" ";elsecout<<-1<<" ";if(a*b>c)cout<<b<<endl;elsecout<<-1<<endl;}return 0;
}

Educational Codeforces Round 90 (Rated for Div. 2) A. Donut Shops (1000)相关推荐

Educational Codeforces Round 90 (Rated for Div. 2)（A, B, C, D, E）
Educational Codeforces Round 90 (Rated for Div. 2) Donut Shops 思路分三种情况: a==c/ba == c / ba==c/b这个时候两 ...
Educational Codeforces Round 90 (Rated for Div. 2)(D 思维 E 打表)
题目链接 D. Maximum Sum on Even Positions 题意:给你n长度的数组a 要求翻转子区间使得偶数上的数之和尽量最大. 做法:用偶数位置减去奇数位置的值就相当 ...
Educational Codeforces Round 90 (Rated for Div. 2)部分题解
A - Donut Shops 题解: 1.我们首先特判一下包装盒里面只有一个物品的情况,如果只装了一个物品,那我们就直接比较这两个物品的单价即可. 2.如果盒子里面装的不止是一键物品,那么我们就需要 ...
贪心 ---- Educational Codeforces Round 90 (Rated for Div. 2)E. Sum of Digits[数位贡献+思维题+贪心]
题目链接题目大意:就是给你nnn和kkk然后再定义一个函数f(x)是十进制数x各个位数之和f(x)是十进制数x各个位数之和f(x)是十进制数x各个位数之和叫你求出最小的x使得f(x)+f(x+1) ...
贪心 ---- Educational Codeforces Round 90 (Rated for Div. 2)D Maximum Sum on Even Positions[偶数子段最大和]
题目链接题目大意:给你一个序列你可以选择一个连续的子段将其反转,反转后使得偶数位置上的数字和最大 1.很明显我们可以看出反转的字符串的长度一定是偶数的,因为是奇数的话偶数位还是在偶数位不变所以没有用 ...
Educational Codeforces Round 114 (Rated for Div. 2) （A ~ F）全题解
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Educational Codeforces Round 114 (Rated for Div. 2) ...
Educational Codeforces Round 106 (Rated for Div. 2)（A ~ E）题解（每日训练 Day.16 ）
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划目录 Educational Codeforces Round 106 (Rated for Div. ...
Educational Codeforces Round 37 (Rated for Div. 2) 1
Educational Codeforces Round 37 (Rated for Div. 2) A.Water The Garden 题意:Max想给花园浇水.花园可被视为长度为n的花园床,花园 ...
Educational Codeforces Round 89 (Rated for Div. 2)（A, B, C, D）
Educational Codeforces Round 89 (Rated for Div. 2) A. Shovels and Swords 思路题意非常简单,就是得到最多的物品嘛,我们假定a, ...

Educational Codeforces Round 90 (Rated for Div. 2) A. Donut Shops (1000)

Educational Codeforces Round 90 (Rated for Div. 2) A. Donut Shops (1000)相关推荐

最新文章

热门文章