#pragma region Macros #include #if defined(LOCAL) || defined(ONLINE_JUDGE) || defined(_DEBUG) #include #endif using namespace std; #define REP(i, n) for(int i=0, i##_len=(n); i=0; --i) #define FOR(i, n, m) for(int i=(m), i##_len=(n); ibool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (busing vec = vector; templateusing umap = unordered_map; templateusing uset = unordered_set; using ll = long long; using ld = long double; using P = pair; using T = tuple; using vl = vec; #define fi first #define se second #define el endl constexpr ll INF = numeric_limits::max()/2-1; #pragma endregion #pragma region IOMacros template istream &operator>>(istream &stream, vec& o){REP(i, o.size())stream >> o[i];return stream;} template ostream &operator<<(ostream &stream, vec& objs){REP(i, objs.size())stream << objs[i] << " ";stream << el;return stream;} #define I(T, ...) ;T __VA_ARGS__;__i(__VA_ARGS__); void __i() {} template void __i(T&& o, Ts&&... args){cin >> o;__i(forward(args)...);} void O() {cout << el;} template void O(T&& o, Ts&&... args){cerr << o << " ";O(forward(args)...);} #pragma endregion void Main(); int main(){ std::cin.tie(nullptr); std::cout << std::fixed << std::setprecision(15); Main(); return 0; } // x∈[l, r] | f(x) = true となる最大のxを返す template ll BinarySearch(ll l, ll r, Func f){ while(l < r){ const ll m = (l+r+1)/2; if(f(m)) l = m; else r = m-1; } return l; } void Main(){ I(ll, T); REP(r, T){ I(ll, N); ll ans = BinarySearch(0, 1e9, [=](ll m){ return m*m<=N; }); cout << ans << el; } }