#include<bits/stdc++.h>
#include<iostream>
using namespace std;
// #define int long long
int main()
{
int t;
cin>>t;
while(t--)
{
long long n;
cin>>n;
long long p=sqrt(n);
if(n==1)
{
cout<<0<<endl;
}
else if(p*p==n)
{
cout<<p-1<<endl;
}
else
{
cout<<p<<endl;
}
}
}
#include<bits/stdc++.h>
#include<iostream>
using namespace std;
// #define int long long
int main()
{
int t;
cin>>t;
while(t--)
{
long long n;
cin>>n;
long long p=sqrt(n);
if(n==1)
{
cout<<0<<endl;
}
else if(p*p==n)
{
cout<<p-1<<endl;
}
else
{
cout<<p<<endl;
}
}
}
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |
123. Best Time to Buy and Sell Stock III | 85. Maximal Rectangle |
84. Largest Rectangle in Histogram | 60. Permutation Sequence |
42. Trapping Rain Water | 32. Longest Valid Parentheses |
Cutting a material | Bubble Sort |
Number of triangles | AND path in a binary tree |
Factorial equations | Removal of vertices |
Happy segments | Cyclic shifts |
Zoos | Build a graph |
Almost correct bracket sequence | Count of integers |
Differences of the permutations | Doctor's Secret |
Back to School | I am Easy |
Teddy and Tweety | Partitioning binary strings |
Special sets | Smallest chosen word |