蓝桥杯b组(C)
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
const int N = 1e4 + 10;
int a[N],b[N];
int n;
int main()
{
scanf("%d",&n);
for(int i = 0;i < n;i ++)
cin >> a[i] >> b[i];
int maxn = 0;
int minn = 1e9 + 10;
for(int i = 0;i < n;i ++)
{
minn = min (a[i]/b[i],minn);
maxn = max(a[i] / (b[i] + 1) + (a[i] % (b[i] + 1 ) != 0),maxn);
}
cout << maxn << ' ' << minn << endl;
return 0;
}
up如果是35,6的话,你maxn = max(a[i] / (b[i] + 1) + (a[i] % (b[i] + 1 ) != 0),maxn);这一句话有问题吧,因为你这个得数会是5;但是5的话就是7了就不是6了吧,我觉得应该直接+1不用判断的
是这样的