文章标题 Dertouzos

Problem Description
A positive proper divisor is a positive divisor of a number n, excluding n itself. For example, 1, 2, and 3 are positive proper divisors of 6, but 6 itself is not.

Peter has two positive integers n and d. He would like to know the number of integers below n whose maximum positive proper divisor is d.

Input
There are multiple test cases. The first line of input contains an integer T (1≤T≤106), indicating the number of test cases. For each test case:

The first line contains two integers n and d (2≤n,d≤109).

Output
For each test case, output an integer denoting the answer.

Sample Input
9
10 2
10 3
10 4
10 5
10 6
10 7
10 8
10 9
100 13

Sample Output
1
2
1
0
0
0
0
0
4

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define maxn 1123456
int x[maxn],l,vis[maxn];
void sieve()
{
    memset(vis,0,sizeof(vis));
    l=0;
    for(int i=2;i<maxn;i++)
    {
        if(vis[i]==0)
        {
            x[l++]=i;
            for(int j=i*2; j<maxn;  j+=i)
                vis[j]=1;
        }
    }
}
int main()
{
    sieve()；
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n,m;
        int ans=0,i;
        scanf("%d %d",&n,&m);
        for(i=0;i<l&&x[i]*m<n&&x[i]<=m;i++)
        {
            if(m%x[i]==0)
            {
                ans=i+1;
                break;
            }
            ans++;
        }
        printf("%d\n",ans);
    }
    return 0;
}