C. Increase and Copy

cf 1426 c
最小的时候即是趋近于我们输入的n的算术平方根的时候

#include<bits/stdc++.h>
#include<algorithm>
#include<iostream>
#include<cstdio>
#include<map>
#include<set>
#include<string>
#include<utility>
#include<stack>
#include<queue>
#include<vector>
#pragma GCC optimize(3)
#pragma GCC optimize(2)
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int maxn = 1000010;
const int mod = 1e9+7;
ll i,j,t;
ll ans,sum,cnt,num;
ll a[maxn],b[maxn],vis[maxn];
ll flag=0,n,m,q,k,l,r,T,x,y;
template <typename T>
void read(T &x) /*快读*/
{
    x = 0;
    int f = 1;
    char ch = getchar();
    while (!isdigit(ch))
    {
        if (ch == '-')
            f = -1;
        ch = getchar();
    }
    while (isdigit(ch))
    {
        x = x * 10 + (ch ^ 48);
        ch = getchar();
    }
    x *= f;
    return;
}
template <typename T>
void write(T x)  /*快写*/
{
    if(x < 0)
    {
        putchar('-');
        x = -x;
    }
    if(x > 9)
        write(x/10);
    putchar(x % 10 + '0');
    return;
}
int main()
{
    cin>>t;
    while(t--)
    {
        read(n);
        num=sqrt(n);
        if(n%num==0) ans=n/num+num-1-1;
        else ans=n/num+num-1;
        write(ans);
        cout<<endl;
    }
    return 0;
}