Codeforces D. Buying Shovels

https://codeforces.ml/contest/1360/problem/D
（ Title link above ）
The question ：
To sum up, it is in 1~k Found within the range of n The maximum factor of x,ans=n/x
Start thinking ：
from min(k,n) Start traversing down to sqrt(n) Find the maximum factor .
But the data range 1e9, The first sample will time out .
Positive solution ：
from 1 Start to sqrt(n) Traverse all the factors x, And judge whether it is k Within the scope of , If in k Within the scope of ans=min(ans,n/(x)).
Complexity O(n^(1/2)), No timeout .
Some make complaints about ：
I'm sorry for 1 To sqrt(n) and sqrt(n) To n The cognition of the gap is not enough .
AC Code ：

#include <iostream>
#include <cmath> 
#include <algorithm>
using namespace std;
int main(){
    
	int t,n,k;
	cin>>t;
	while(t--){
    
		cin>>n>>k;
		int ans=n;
		for(int i=1;i<=sqrt(n);i++){
    
			if(n%i==0){
    
				if(n/i<=k){
    
					ans=min(ans,n/(n/i));
				}
				if(i<=k){
    
					ans=min(ans,n/i);
				}
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}