func_code_string: #include <bits/stdc++.h>   using namespace std;   long long int power(long long int a, long long int b) {     long long int result = 1;     while (b > 0) {       int lastbit = (b & 1);       if (lastbit) {         result = (result * a);       }       a = (a * a);       b = b >> 1;     }     return result;   }   long long int power2(long long int a, long long int b, long long int p) {     long long int result = 1;     while (b > 0) {       int lastbit = (b & 1);       if (lastbit) {         result = (result * a) % p;       }       a = (a * a) % p;       b = b >> 1;     }     return result % p;   }   long long int gcd(long long int a, long long int b) {     if (b == 0) return a;     return gcd(b, a % b);   }   vector<int> SieveOfEratosthenes(int n) {     bool prime[n + 1];     memset(prime, true, sizeof(prime));     for (int p = 2; p * p <= n; p++) {       if (prime[p] == true) {         for (int i = p * p; i <= n; i += p) prime[i] = false;       }     }     vector<int> v;     v.push_back(0);     for (int p = 2; p <= n; p++)       if (prime[p]) v.push_back(p);     return v;   }   void InverseofNumber(long long int p) {     long long int n[1000001];     n[0] = n[1] = 1;     for (int i = 2; i <= 1000000; i++) n[i] = n[p % i] * (p - p / i) % p;   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     cout.tie(NULL);     int xxx;     cin >> xxx;     for (int tt = 1; tt <= xxx; tt++) {       long long int n;       cin >> n;       long long int t = ceil(sqrt(n));       long long int x = n / t;       if (n % t == 0) {         x--;       }       cout << t + x - 1;       cout << endl;     }     return 0;   }   