-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathG-The Ultimate Square
More file actions
36 lines (34 loc) · 1.3 KB
/
Copy pathG-The Ultimate Square
File metadata and controls
36 lines (34 loc) · 1.3 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
//////////////// PRANTA KUMER PANDIT ///////////////
// Test Case Less Template ||
// ||
// BANGLADESH UNIVERSITY OF BUSINESS AND TECHNOLOGY ||
// INTAKE 52 ||
// DEPARTMENT OF CSE ||
//||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
// So, WELCOME TO ISHAN'S PERADISE //
// (-.-) Want to be a Secret tool of next ICPC (-.-) //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
#define all(x) (x).begin(), (x).end()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/__gcd(a,b)
#define optimize() ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void solve(){
int t; cin >> t;
while (t--) {
ll n; cin >> n;
ll m = (n + 1) / 2;
ll t = m * (m + 1);
ll x = min(n, (ll)floor(sqrt((long double)t)));
cout << x << "\n";
}
}
int32_t main() {
optimize();
solve();
}
// THANKS //