Buying Shovels CodeForces - 1360D（数论+找因子）题意：题目：分析：AC代码：

62 阅读 0 评论 41 点赞

我是靠谱客的博主儒雅鱼，最近开发中收集的这篇文章主要介绍Buying Shovels CodeForces - 1360D（数论+找因子）题意：题目：分析：AC代码：，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

题意：

想买n个铲子，一共有k种包装，第i种包装里有i个铲子（1<=i<=k），问如何才能正好买n个铲子,要求买相同包装的，而且买的包书数最少

题目：

Polycarp wants to buy exactly n shovels. The shop sells packages with shovels. The store has k types of packages: the package of the i-th type consists of exactly i shovels (1≤i≤k). The store has an infinite number of packages of each type.

Polycarp wants to choose one type of packages and then buy several (one or more) packages of this type. What is the smallest number of packages Polycarp will have to buy to get exactly n shovels?

For example, if n=8 and k=7, then Polycarp will buy 2 packages of 4 shovels.

Help Polycarp find the minimum number of packages that he needs to buy, given that he:

will buy exactly n shovels in total;
the sizes of all packages he will buy are all the same and the number of shovels in each package is an integer from 1 to k, inclusive.

Input

The first line contains an integer t (1≤t≤100) — the number of test cases in the input. Then, t test cases follow, one per line.

Each test case consists of two positive integers n (1≤n≤109) and k (1≤k≤109) — the number of shovels and the number of types of packages.

Output

Print t answers to the test cases. Each answer is a positive integer — the minimum number of packages.

Example

Input

5
8 7
8 1
6 10
999999733 999999732
999999733 999999733

Output

2
8
1
999999733
1

Note

The answer to the first test case was explained in the statement.

In the second test case, there is only one way to buy 8 shovels — 8 packages of one shovel.

In the third test case, you need to buy a 1 package of 6 shovels.

分析：

直接枚举n的所有因子x，如果这个因子在1−k那么计算一下n/x，并取最小值

AC代码：

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
typedef long long ll;
int t,n,m,ans;
int main()
{
    scanf("%d",&t);
    while(t--)
    {
        ans=0;
        scanf("%d%d",&n,&m);
        for(int i=1;i<=sqrt(n);i++)
            if(n%i==0)
            {
                if(i<=m)
                    ans=max(ans,i);
                if(n/i<=m)
                    ans=max(ans,n/i);
            }
        printf("%dn",n/ans);
    }
    return 0;
}