fork download
copy 
  1. #define _CRT_SECURE_NO_WARNINGS
  2. #include <bits/stdc++.h>
  3. #include <unordered_map>
  4. #include <unordered_set>
  5.  
  6. #define ll long long
  7. #define ld long double
  8. #define pl pair<ll, ll>
  9. #define vi vector<long long>
  10. #define vii vector<vi>
  11. #define vc vector<char>
  12. #define vcc vector<vc>
  13. #define vp vector<pl>
  14. #define mi map<ll,ll>
  15. #define mc map<char,int>
  16. #define sortx(X) sort(X.begin(),X.end());
  17. #define all(X) X.begin(),X.end()
  18. #define allr(X) X.rbegin(),X.rend()
  19. #define ln '\n'
  20. #define YES {cout << "YES\n"; return;}
  21. #define NO {cout << "NO\n"; return;}
  22. #define MUN {cout << "-1\n"; return;}
  23. #define int ll
  24. using namespace std;
  25.  
  26. const ld pi = acos(-1);
  27.  
  28. void solve(int tc)  {
  29.     ld n, m, rad;
  30.     cin >> n >> m >> rad;
  31.  
  32.     ll l = 0, r = 2e4;
  33.     while (l < r)
  34.     {
  35.         ll mid = (l + r) / 2;
  36.         ld dis = rad * (mid+1);
  37.         dis += m * (mid * (mid+1) / 2);
  38.         dis *= 2*pi;
  39.         if (dis >= n) r = mid;
  40.         else l = mid + 1;
  41.     }
  42.  
  43.     ll res = l * m + rad;
  44.     cout <<  res << '\n';
  45. }
  46.  
  47. signed main()
  48. {
  49.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  50.     int size = 1;
  51.  
  52.     // freopen("tree.in", "r", stdin);
  53.     // freopen("island.out", "w", stdout);
  54.  
  55.      cin >> size;
  56.     for (int i = 1; i <= size; i++)
  57.         solve(i);
  58. }
Success #stdin #stdout 0s 5308KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
-9223372036854775808
https://ideone.com/KafVGP
language:
C++ (gcc 8.3)
created:
2 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!