https://ac.nowcoder.com/acm/contest/13926/I
有n个瓶子,每个箱子最多装k个瓶子,尽可能多装,问最少装多少个
思路:
tmp = n / k
n / (tmp+1)
除以tmp+1 ,肯定可以装完。
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
ll n, k;
cin >> n >> k;
if(n <= k) {
cout << n;
return 0;
}
ll tmp = n / k;
if (n % k == 0) cout << k;
else cout << n / (tmp+1);
return 0;
}