题目
题解思路
AC代码
#include <bits/stdc++.h>
//#include <unordered_map>
//priority_queue
#define PII pair<int,int>
#define ll long long
using namespace std;
const int INF = 0x3f3f3f3f;
int main()
{
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int T ;
cin >> T ;
while (T--)
{
long long n , k ;
cin >> n >> k ;
if ( k*k <= n )
{
cout << k << "\n" ;
}else
{
long long sq = sqrt(n);
long long ag = 0 ;
if ( sq*(sq+2) == n )
{
ag ++ ;
}
cout << sq + (n/sq -n/k ) - ag << "\n" ;
}
}
return 0 ;
}