For this Question: Given an integer N. The task is to find the square root of N. If N is not a perfect square, then return floor(√N). Try to solve the problem using Binary Search.The first line of input contains the number of test cases T. For each test case, the only line contains the number N.

<b>Constraints:</b>
1 &le; T &le; 10000
0 &le; x &le; 10<sup>8</sup>For each testcase, print square root of given integer.Sample Input:
2
5
4

Sample Output:
2
2

<b>Explanation:</b.
Testcase 1: Since, 5 is not a perfect square, the floor of square_root of 5 is 2.
Testcase 2: Since 4 is a perfect square, its square root is 2., I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;

#define pu push_back
#define fi first
#define se second
#define mp make_pair
#define int long long
#define ll long long
#define pii pair<int,int>
#define mm (s+e)/2
#define all(x) x.begin(), x.end()
#define For(i, st, en) for(int i=st; i<en; i++)
#define tr(x) for(auto it=x.begin(); it!=x.end(); it++)
#define fast std::ios::sync_with_stdio(false);cin.tie(NULL);
#define sz 200000
int sqr(int a) {
   
int A=a;
if(A<2) return A;
ll l=1,r=A;
ll k=1;
while(l<=r)
{
    ll mid=(l+r)/2;
    ll u=mid*mid;
    if(u<=A) 
    { 
        k=max(mid,k);
        l=mid+1;
    }else
    {
        r=mid-1;
    }
}
return k;
}
signed main()
{
	
	int t;
	cin>>t;
	while(t>0)
	{
		t--;
		long a;
		cin>>a;
long x = sqrt(a);
		cout<<x<<endl;
	}
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?