CodeForce 546D 素数筛+前缀和
来源:互联网 发布:平安交易软件下载 编辑:程序博客网 时间:2024/06/03 22:26
Description
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?
Then follow t lines, each contains pair of integers a and b (1≤b≤a≤5000000) defining the value of n for a game.
Output
2
3 1
6 3
Output
2
5
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≤1000000) denoting number of games soldiers play.Then follow t lines, each contains pair of integers a and b (1≤b≤a≤5000000) defining the value of n for a game.
Output
For each game output a maximum score that the second soldier can get.
Sample Input
Input2
3 1
6 3
Output
2
5
题解:就是让求a!/b!的质因子个数。用到了素数筛。
<span style="font-family:SimSun;">#include<cstdio>#include<iostream>using namespace std;#define N 5000100int vis[N],s[N];int main(){fill(s,s+N,0);fill(vis,vis+N,0);for(int i=2;i<=N;i++){if(!vis[i]){for(int j=i;j<=N;j+=i){int k=j;while(k%i==0){s[j]++;k/=i;}vis[j]=1;}}}for(int i=2;i<=N;i++) s[i]+=s[i-1]; //表示前 i个数因子个数之和 int t,a,b;scanf("%d",&t);while(t--){scanf("%d%d",&a,&b);printf("%d\n",s[a]-s[b]);}return 0; } </span>
0 0
- CodeForce 546D 素数筛+前缀和
- hdu 2824 线性筛素数求欧拉函数+前缀和
- hdu 5317 (普通素数筛的应用)+(前缀和预处理)
- A%BProblem——线性筛素数与前缀和
- POJ3978 Primes【素数筛选+前缀和】
- UVALive6050 Primes【素数筛选+前缀和】
- HDU 4548 美素数 (素数打表+前缀和)
- codeforces #304D 546D. Soldier and Number Game(数论+动态规划+前缀和)
- [高维前缀和] Codeforces 449D
- POJ 2739 - Sum of Consecutive Prime Numbers(素数筛法+前缀和 / 尺取法)
- 多校第三场 1002 hdu 5317 RGCDQ (筛素数+前缀和)
- POJ 2739 Sum of Consecutive Prime Numbers(线性素数筛+前缀和)
- codeforce 11D
- codeforce 161 D
- codeforce 237 C D
- codeforce 143D dp
- codeforce D. Password
- Codeforce 340D
- 百度文字转语音免费接口使用实例
- POJ3680 Intervals (区间K覆盖问题)
- 那些java中的 == 跟 equals的理解
- App store最新审核指南
- 联合贝叶斯(joint_bayesian)人脸识别 C++/C# 实现
- CodeForce 546D 素数筛+前缀和
- HDU 5833 Zhu and 772002 高斯消元
- 多线程的创建、启动
- Codeforces 514C . Watto and Mechanism
- eclipse 的环境需求
- Codeforces 589F Gourmet and Banquet(二分+贪心)
- PHP的数据类型
- java笔记之多态
- codeforces 505B Mr. Kitayuta's Colorful Graph