Codeforces Round #304 (Div. 2)——D素数筛+dp——Soldier and Number Game

时间：2015-05-26 21:06:35 阅读：198 评论：0 收藏：0 [点我收藏+]

标签：

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

大意：原文博客http://blog.csdn.net/catglory/article/details/45932593

新技能get,...素数筛复杂度O(nloglogn)

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn = 5000100;
int prime[maxn];
bool judge[maxn];
long long  dp[maxn];
int p = 1;
void prim()
{
    memset(judge,false,sizeof(judge));
    for(int i = 2; i <= maxn ; i++){
        if(judge[i] == false){
            prime[p++] = i;
            for(int j = i+i;j <= maxn ; j += i)
                judge[j] = true;
        }
    }
}
int main()
{
    prim();
    memset(dp,0,sizeof(dp));
    dp[1] = 1;
    for(int i = 2; i <= maxn; i++){
        if(judge[i] == false){
            dp[i] = 1;
        }
        else {
            for(int j = 1; j < p ;j++){
                if(i%prime[j] == 0){
                    dp[i] = dp[i/prime[j]] + 1;
                    break;
                }
            }
        }
        
    }
    
    for(int i = 2; i < maxn; i++)
        dp[i] += dp[i-1];
    int a,b,n;
    scanf("%d",&n);
    while(n--){
        scanf("%d%d",&a,&b);
        printf("%lld\n",dp[a] - dp[b]);
    }
    return 0;
}

Codeforces Round #304 (Div. 2)——D素数筛+dp——Soldier and Number Game

标签：

原文地址：http://www.cnblogs.com/zero-begin/p/4531647.html

踩

(0)

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行