HDU - 2619 Love you Ten thousand years

最新推荐文章于 2020-10-11 22:34:11 发布

原创最新推荐文章于 2020-10-11 22:34:11 发布 · 258 阅读

0 ·

CC 4.0 BY-SA版权

题解专栏收录该内容

81 篇文章

订阅专栏

本文探讨了在数学中，爱点（Love Point）的概念及其与原根的关系。通过定义和示例，解释了如何判断一个数是否为特定奇质数n的爱点，并给出了求解爱点数量的算法实现，即计算原根的数量。

Love you Ten thousand years------Earth’s rotation is a day that is the representative of a day I love you. True love, there is no limit and no defects. Earth’s revolution once a year, it is on behalf of my love you more than a year. Permanent horizon, and my heart will never change ……

We say that integer x, 0 < x < n,(n is a odd prime number) is a LovePoint-based-on n if and only if the set { (x i mod n) | 1 <= i <= n-1 } is equal to { 1, …, n-1 }. For example, the powers of 3 modulo 7 are 3, 2, 6, 4, 5, 1, and thus 3 is a LovePoint-based-on 7.
Now give you a integer n >= 3(n will not exceed 2 31).
We say the number of LovePoint-based-on n is the number of days the earth rotating.
Your task is to calculate the number of days someone loved you.
Input
Each line of the input contains an integer n. Input is terminated by the end-of-file.
Output
For each n, print a single number that gives the number of days someone loved you.
Sample Input
5
Sample Output
2

题意：一个x（0 < x < n，n是素数），如果集合{ (x i mod n) | 1 <= i <= n-1}等于集合{ 1, …, n-1 }我们叫x是n的一个爱点，现在给出一个n，让你求n有多少个爱点。
思路：根据原根的定义：g^φ§对p取模等于1我们可以得出g ^ i(1<=i<=φ§)都不同(在区间1~p-1上），当p是素数时φ( p)=p-1,所以我们看出这里的爱点就是原根，题目就时求原根的个数，这个我们有公式：φ( n-1)

AC代码：

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
typedef long long LL;
int phi(int x){
    int ans = x;
    for(int i = 2; i*i <= x; i++){
        if(x % i == 0){
            ans = ans / i * (i-1);
            while(x % i == 0) x /= i;
        }
    }
    if(x > 1) ans = ans / x * (x-1);
    return ans;
}
int main()
{
    LL n;
    while(scanf("%lld",&n)!=EOF)
    {
        LL t;
        t=phi(n-1);
        printf("%lld\n",t);
    }
}