D. Buying Shovels1300 / 求约数

Posted 2021-12-05 幽殇默

https://codeforces.com/problemset/problem/1360/D
就是看可不可以整除，这不就是约数么，注意要不大于k

#include<bits/stdc++.h>
using namespace std;
int main(void)
{
	int t; cin>>t;
	while(t--)
	{
		int n,k; cin>>n>>k;
		int ans=n;
		for(int i=1;i<=n/i;i++) 
		{
			if(n%i==0)
			{
				if(i<=k) ans=min(ans,n/i);
				if(n/i<=k) ans=min(ans,n/(n/i));
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}