-
Notifications
You must be signed in to change notification settings - Fork 1
/
1360D codeforces solution.cpp
66 lines (60 loc) · 1.39 KB
/
1360D codeforces solution.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<iostream>
#include<cstdlib>
#include<cmath>
#include<vector>
#define ll long long int
using namespace std;
int main()
{
//ffreopen("input.txt","r",stdin);
ll t;
cin>>t;
while(t--)
{
ll n,k;
cin>>n>>k;
if(n<=k)
{
cout<<1<<endl;
}
else if(k==1)
{
cout<<n<<endl;
}
else
{
vector<ll> fact;
for(ll i=1; i<=sqrt(n);i++)
{
if(n%i == 0)
{
if(n/i == i && i<=k)
{
fact.push_back(i);
}
else
{
if(i<=k)
fact.push_back(i);
if(n/i <=k )
fact.push_back(n/i);
}
// cout<<fact[i]<<" ";
}
}
ll ans = 2e9;
for(ll i=0;i<fact.size();i++)
{
if(n%fact[i] == 0)
{
if(ans >(n/fact[i]))
{
ans =n/fact[i];
}
}
}
cout<<ans<<endl;
}
}
return 0;
}