HDU 5750 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
题目大意：

$$正整数x称为n的positive\quad proper\quad divisor, 当且仅当x | n并且1 \le x < n 例如, 1, 2, 和3是6的positive\quad proper\quad divisor, 但是6不是. Peter给你两个正整数n和d. 他想要知道有多少小于n的整数, 满足他们的最大positive \quad proper\quad divisor恰好是d$$

解题思路：
$官方题解：$
随便推导下, 令$y=xd$, 如果$d$是$y$的maximum positive proper divisor, 显然要求$x$是$y$的最小质因子. 令$mp(n)$表示$n$的最小质因子, 那么就有$x \le mp(d)$, 同时有$y &lt; n$, 那么$x \le \lfloor \frac{n-1}{d} \rfloor$. 于是就是计算有多少个素数$x$满足$x \le \min\{mp(d), \lfloor \frac{n-1}{d} \rfloor\}$.

当$d$比较大的时候, $\lfloor \frac{n-1}{d} \rfloor$比较小, 暴力枚举$x$即可. 当$d$比较小的时候, 可以直接预处理出答案。预处理的时候采用素数筛，先将每个数的最小素因子保存在一个数组中，处理的时候采用二分来操作减少时间，要不然很容易超时，当时我们就是超时了，掉分了。。。

My Code：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cstdlib>
using namespace std;
const int MAXN = 5e4+5;
typedef long long LL;
bool prime[MAXN];
int p[MAXN], ret[MAXN];
int k;
void isprime()
{
    k = 0;
    memset(prime, 0, sizeof(prime));
    memset(ret, 0, sizeof(ret));
    for(LL i=2; i<MAXN; i++)
    {
        if(!prime[i])
        {
            p[k++] = i;
            ret[i] = i;
            for(LL j=i+i; j<MAXN; j+=i)
            {
                prime[j] = 1;
                if(!ret[j])
                    ret[j] = i;
            }
        }
    }
}
int main()
{
    isprime();
    int T;
    scanf("%d",&T);
    while(T--)
    {
        int n, d;
        scanf("%d%d",&n,&d);
        int tmp = (n-1)/d;
        if(n >= MAXN)
        {
            int ok = 0;
            for(int i=0; p[i]<=tmp; i++)
            {
                if(d%p[i]==0)
                {
                    ok = 1;
                    int ans = upper_bound(p,p+k,p[i])-p;
                    printf("%d\n",ans);
                    break;
                }
            }
            if(!ok)
            {
                int ans = upper_bound(p,p+k,tmp)-p;
                printf("%d\n",ans);
            }
            continue;
        }
        int Min = min(tmp,ret[d]);
        int ans = upper_bound(p,p+k,Min)-p;
        printf("%d\n",ans);
    }
    return 0;
}