求个质因数叭O(∩_∩)O

最新推荐文章于 2022-06-14 14:07:44 发布

lesley_du

最新推荐文章于 2022-06-14 14:07:44 发布

阅读量202

点赞数

分类专栏：认真做题的好孩子文章标签：质因数

本文链接：https://blog.csdn.net/lesley_du/article/details/76163970

版权

认真做题的好孩子专栏收录该内容

8 篇文章 0 订阅

订阅专栏

题目是这样的：

D. Soldier and Number Game

time limit per test
3 seconds

memory limit per test
256 megabytes

input
standard input

output
standard output

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.

Examples

Input
2
3 1
6 3

Output
2
5

简单来说就是求a!/b!的质因数。。。

最暴力的方法肯定是过不了的了orz

发现：这个题实际上是让你求出每个数可以分解质因数的个数，最后用一个加的运算就可以算出来啦。

重点就在怎么分解质因数咯，虽然这个很简单，但是还是把自己会的记下
来叭。

第一种方法：

while (n != 1)
        {
            ans++;
            for (int i = 2; i <= n; i++)
            {
                if (n%i != 0)
                    continue;
                else
                {
                    n = n / i;
                    break;
                }
            }
        }

第二种方法：
（实际上我看到了其他帖子上面的方法很多，但我就看懂这一个orz）


void work()
{
    memset(sum, 0, sizeof(sum));
    sum[1] = 1;
    int ans = 0;
    for (int i = 2; i <= 5000000; i++)
    {
        if (sum[i] == 0) 
        {
            for (int j = i; j <= 5000000; j += i)
            {
                int J = j;
                while (J%i == 0&&J>0)
                {
                    sum[j]++;
                    J = J / i;
                }
            }
        }
        sum[i] = sum[i] + sum[i - 1];
    }
}

开始的时候没有加 sum[i] = sum[i] + sum[i - 1];这一行啦，然后就果断超时。
这个方法的精髓就在于提前记录好每一个数的质因数数量（及之前各数）
j+=i这一步！！！！可以把后面的都算好很优秀。
i可以理解为质数因子，j是被除数。
PS初始化memset这个操作的头文件是string.h一定要加.h啊喂非常的骚。
以上。

哇不是很懂这道题这么简单为什么会肝了一下午可能是个zz叭QAQ
还有好多不会呀你怕是要××了加个油叭2333