fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6. inline int power(int a, int b) {
  7. int x = 1;
  8. while (b) {
  9. if (b & 1) x *= a;
  10. a *= a;
  11. b >>= 1;
  12. }
  13. return x;
  14. }
  15.  
  16.  
  17. const int M = 1000000007;
  18. const int N = 3e5+9;
  19. const int INF = 2e9+1;
  20. const int LINF = 2000000000000000001;
  21.  
  22. //_ ***************************** START Below *******************************
  23.  
  24.  
  25.  
  26.  
  27.  
  28.  
  29. int consistency(int n){
  30.  
  31. int s = 2, e = INF;
  32.  
  33. while(s<e){
  34. int mid = s + (e-s+1)/2;
  35.  
  36. if( (mid*mid) <= 2*n-1){
  37. s = mid;
  38. }
  39. else e = mid-1;
  40. }
  41.  
  42. return (s-1)/2;
  43.  
  44. }
  45.  
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62. int practice(int n){
  63.  
  64. return 0;
  65.  
  66. }
  67.  
  68.  
  69.  
  70.  
  71.  
  72. void solve() {
  73.  
  74. int n;
  75. cin>> n;
  76.  
  77. cout << consistency(n) << endl;
  78.  
  79. // cout << consistency(n) << " -> " << practice(n) << endl;
  80.  
  81.  
  82.  
  83. }
  84.  
  85.  
  86.  
  87.  
  88.  
  89. int32_t main() {
  90. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  91.  
  92. int t = 1;
  93. cin >> t;
  94. while (t--) {
  95. solve();
  96. }
  97.  
  98. return 0;
  99. }
  100.  
  101.  
Success #stdin #stdout 0.01s 5316KB
stdin
3
3
6
9
stdout
0
1
1