hdoj 4196 Remoteland 【阶乘因式分解中质因子个数 + 费马小定理】

最新推荐文章于 2020-12-11 13:10:04 发布

笑着走完自己的路

最新推荐文章于 2020-12-11 13:10:04 发布

阅读量753

点赞数

分类专栏：欧拉、费马小定理数学

本文链接：https://blog.csdn.net/chenzhenyu123456/article/details/48679047

版权

数学同时被 2 个专栏收录

94 篇文章 0 订阅

订阅专栏

欧拉、费马小定理

5 篇文章 0 订阅

订阅专栏

Remoteland

Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 262144/131072 K (Java/Others)
Total Submission(s): 1122 Accepted Submission(s): 427

Problem Description

In the Republic of Remoteland, the people celebrate their independence day every year. However, as it was a long long time ago, nobody can remember when it was exactly. The only thing people can remember is that today, the number of days elapsed since their independence (D) is a perfect square, and moreover it is the largest possible such number one can form as a product of distinct numbers less than or equal to n.
As the years in Remoteland have 1,000,000,007 days, their citizens just need D modulo 1,000,000,007. Note that they are interested in the largest D, not in the largest D modulo 1,000,000,007.

Input

Every test case is described by a single line with an integer n, (1<=n<=10,000, 000). The input ends with a line containing 0.

Output

For each test case, output the number of days ago the Republic became independent, modulo 1,000,000,007, one per line.

Sample Input

Sample Output

题意：给一个数n，要求从[1, n]中选出若干个数，使它们乘积为完全平方数A。现在问你最大的A % 100000007是多少。

由算术基本定理——

任何一个大于1的自然数

，都可以唯一分解成有限个质数的乘积

，这里

均为质数，其诸指数

是正整数。

这样我们就可以得出结论：最大的完全平方数A = n! / (res)，其中res=[1, n]中所有指数为奇数的质数乘积。

求解阶乘中质数p的指数:

int sum = 0;
while(n)
{
    sum += n / p;
    n /= p;
}
sum...

由费马小定理——

a ^ (m-1) = 1 (%m) ——> a ^ (m-2) = a ^ -1 (%m)，其中a为整数，m为质数且a不是m的倍数。

上述结果转化A = n! * res ^ (MOD-2) % MOD。

AC代码：

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#define MAXN 10000000+1
#define MOD 1000000007
#define LL long long
using namespace std;
int Prime[MAXN];
int vis[MAXN];
int top;
void getp()
{
    memset(vis, 0, sizeof(vis));
    for(int i = 2; i < MAXN; i++)
    {
        if(!vis[i])
        {
            for(int j = 2*i; j < MAXN; j+=i)
                vis[j] = 1;
        }
    }
    top = 0;
    for(int i = 2; i < MAXN; i++)
        if(!vis[i])
            Prime[top++] = i;
}
LL f[MAXN];//存储阶乘
void getf()
{
    f[1] = 1;
    for(int i = 2; i < MAXN; i++)
        f[i] = f[i-1] * i % MOD;
}
int num(int n, int p)
{
    int sum = 0;
    while(n)
    {
        sum += n / p;
        n /= p;
    }
    return sum;
}
LL pow_mod(LL a, LL n)
{
    LL ans = 1;
    while(n)
    {
        if(n & 1)
            ans = ans * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return ans;
}
int main()
{
    getp();
    getf();
    int n;
    while(scanf("%d", &n), n)
    {
        LL res = 1;
        for(int i = 0; i < top && Prime[i] <= n; i++)//注意结束条件 还有i < top
        {
            if(num(n, Prime[i]) & 1)
                res = res * Prime[i] % MOD;
        }
        printf("%lld\n", f[n] * pow_mod(res, MOD-2) % MOD);
    }
    return 0;
}