fork download
  1. #include <iostream>
  2. #define ll long long
  3. using namespace std;
  4.  
  5. void solve() {
  6. ll n, m, k;
  7. cin >> n >> m >> k;
  8.  
  9. ll l = 1, r = m, ans = m;
  10.  
  11. while (l <= r) {
  12. ll mid = (l + r) / 2;
  13.  
  14. ll full = m / (mid + 1);
  15. ll mod = m % (mid + 1);
  16.  
  17. ll row = full * mid + min(mod, mid);
  18.  
  19. if (row * n >= k) {
  20. ans = mid;
  21. r = mid - 1;
  22. } else {
  23. l = mid + 1;
  24. }
  25. }
  26.  
  27. cout << ans << endl;
  28. }
  29.  
  30. int main() {
  31. ll t;
  32. cin >> t;
  33. while (t--) solve();
  34. }
Success #stdin #stdout 0s 5316KB
stdin
5
3 4 7
5 5 5
1 13 2
2 4 7
1 5 4
stdout
2
1
1
4
2