codeforces #546D# Soldier and Number Game(Dp，素数打表)

题目链接：http://codeforces.com/contest/546/problem/D

Two soldiers are playing a game. At the beginning first of them chooses a positive integer n and gives it to the second soldier. Then the second one tries to make maximum possible number of rounds. Each round consists of choosing a positive integer x > 1, such that n is divisible by x and replacing n with n / x. When n becomes equal to 1 and there is no more possible valid moves the game is over and the score of the second soldier is equal to the number of rounds he performed.

To make the game more interesting, first soldier chooses n of form a! / b! for some positive integer a and b (a ≥ b). Here by k! we denote the factorial of k that is defined as a product of all positive integers not large than k.

What is the maximum possible score of the second soldier?

Input

First line of input consists of single integer t (1 ≤ t ≤ 1 000 000) denoting number of games soldiers play.

Then follow t lines, each contains pair of integers a and b (1 ≤ b ≤ a ≤ 5 000 000) defining the value of n for a game.

Output

For each game output a maximum score that the second soldier can get.

Sample test(s)

Input

2
3 1
6 3

Output

2
5

解题报告：计算a! / b! 最多能由几个数乘积组成，考虑a！最多能够由几个数乘积组成，再考虑任何数n最多能由几个数组成。考虑n一定是多个素数的乘积，所以要先进行素数打表，然后我通过完全背包求出所有的n最多能由几个数乘积得到，然后再求a！的阶乘最多能由几个数乘积得到，a!/b!就是两个数的对应结果相减。

具体代码如下：

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn = 5000001;
int prime[maxn];
int allprime[maxn];
int dp[maxn];
int ans[maxn];
int primenum = 0;
void getPrime() {
    for (int i = 2; i < maxn; i ++) {
        prime[i] = 1;
        dp[i] = 1;
    }
    int tmp = sqrt(maxn);
    for (int i = 2; i <= tmp; i ++) {
        if (prime[i] == 1) {
            for (int j = i + i; j < maxn; j += i) {
                prime[j] = 0;
                dp[j] = -1;
            }
        }
    }
    for(int i = 2; i < maxn; i ++) {
        if(prime[i] == 1) {
            allprime[primenum++] = i;
        }
    }
}
int main() {
    int t, a, b;
    getPrime();
    dp[1] = 0;
//    cout << primenum << endl;
    for (int i = 2; i < maxn; i ++) {
        for(int k = 0; k < primenum && i * allprime[k] < maxn; k ++) {
            int j = allprime[k];
            dp[i*j] = max(dp[i]+1, dp[i*j]);
        }
    }

    for (int i = 1; i <= maxn; i ++) {
        ans[i] = ans[i-1] + dp[i];
    }

    cin >> t;
    while (t--) {
        scanf ("%d%d", &a, &b);
        printf("%d\n", ans[a] - ans[b]);
    }
    return 0;
}