Codeforces Round #304 (Div. 2) D. Soldier and Number Game (打表)
来源:互联网 发布:mac 视频压缩工具 编辑:程序博客网 时间:2024/05/24 01:37
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?
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.
For each game output a maximum score that the second soldier can get.
23 16 3
25
给出一个n,n开始是a!/b!,每次用一个x去整除n得到新的n,最后当n变成1的时候经过了几轮得分就是这个轮数,要求最大的分数是多少
思路:
很明显,就是一个求整数质因子个数的题目,阶乘我们不需要算,我们知道在a>b的时候,b!都约掉了,那么我们只需压迫计算出每个数的质因数有几个,然后计算出1~n的质因子之和,那么就可以迅速得到答案了
#include <stdio.h>#include<string.h>#include<algorithm> using namespace std; int num[5000010]; int main() { memset(num,0,sizeof(num)); for(int i=2;i<5000000;i++) if(num[i]==0) for(int j=i;j<=5000000;j+=i) num[j]=num[j/i]+1; for(int i=1;i<=5000000;i++) num[i]+=num[i-1]; int n; scanf("%d",&n); while(n--) { int a,b; scanf("%d%d",&a,&b); printf("%d\n",num[a]-num[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
- 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
- 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) 546D Soldier and Number Game 质因子个数
- codeforces #546D# Soldier and Number Game(Dp,素数打表)
- Codeforces-546D Soldier and Number Game 【质因子分解+打表+DP】
- CodeForces 546D Soldier and Number Game
- CodeForces-546D Soldier and Number Game
- Codeforces 546D Soldier and Number Game
- CodeForces-546D.Soldier and Number Game
- codeforces 546D. Soldier and Number Game
- CodeForces 546D Soldier and Number Game
- 炎炎夏日冰凉一下:纳西族圣山玉龙雪山之行
- 注册COM组件
- Java面试题集分类汇总
- 堆排序C++实现
- 【GaoJueYi 2016.08.14初中部 NOIP普及组 】模拟赛总结
- Codeforces Round #304 (Div. 2) D. Soldier and Number Game (打表)
- Java异常学习笔记
- UIWebView 获取内容实际高度,关闭滚动效果
- 【HDU 2120 Ice_cream's world I】
- iOS开发 - 第05篇 - 项目 - 09 - 发微博
- CSS页面布局基础
- 搜狗输入法中文状态下,打出来还是英文
- 实例方法类方法
- js代码笔记