Codeforces Round #304 (Div. 2)——D素数筛+dp——Soldier and Number Game
2015-05-26 20:15
507 查看
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
output
大意:原文博客/article/1852811.html
新技能get,...素数筛 复杂度O(nloglogn)
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
大意:原文博客/article/1852811.html
新技能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. Soldier and Number Game
- Codeforces Round #304 (Div. 2) D Soldier and Number Game
- Codeforces Round #304 (Div. 2)D. Soldier and Number Game
- 数学+DP Codeforces Round #304 (Div. 2) D. Soldier and Number Game
- Codeforces Round #304 (Div. 2) D - Soldier and Number Game
- D-Soldier and Number Game(CF546D) Codeforces Round #304 (Div. 2)
- Codeforces Round #304 (Div. 2)-D. Soldier and Number Game,素因子打表!
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game 数学 质因数个数
- DP+埃氏筛法 Codeforces Round #304 (Div. 2) D. Soldier and Number Game
- codeforces Soldier and Number Game(dp+素数筛选)
- [Codeforces546D]Soldier and Number Game[dp][实现][素数筛][分解整数][数学]
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game 数论 筛表法
- Soldier and Number Game--筛素数
- CodeForces546D:Soldier and Number Game(筛区间素数因子个数和)
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game(筛选素因子,前缀和)
- Codeforces#304-D - Soldier and Number Game-求因子个数/数学
- D. Soldier and Number Game
- Soldier and Number Game
- Codeforces Round #228 (Div. 2)A.Fox and Number Game