1360D - Buying Shovels(因数)

题目

思路：求一遍因数，取其中最小且满足<=k即可。

Code:

#include<iostream>
#include<string>
#include<map>
#include<algorithm>
#include<memory.h>
#include<cmath>
#define pii pair<int,int>
#define FAST ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
const int Max = 1e6 + 5;
int lst[Max];
int Mod = 1e9 + 7;

int main()
{
	int t;cin >> t;
	while (t--)
	{
		ll n, k;cin >> n >> k;
		ll p = Mod;
		for (ll i = 1;i<= sqrt(n);i++)
		{
			if (n % i == 0)
			{
				if (i <= k)p = min(p,n/i);
				if (n / i <= k)p = min(p,i);
			}
		}
		cout << p << endl;
	}
}