50同问

#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
ll solve(ll n)
{
    ll ans=0;
    ll kmax=sqrt(n);
    for (ll k=1;k<=kmax;k++) {
        if (k*k<=n)ans++;
        if (k*(k+1)<=n)ans++;
        if (k*(k+2)<=n&&k*(k+2)<(k+1)*(k+1))
        {
            ans++;
        }
    }
    return ans;
}
int main()
{
ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int q;
    cin>>q;
    while(q--)
    {
        ll n;
        cin>>n;
        cout<<solve(n)<<"\n";
    }
}