Pseudoprime numbers POJ - 3641

最新推荐文章于 2022-01-15 15:18:59 发布

titi2018815

最新推荐文章于 2022-01-15 15:18:59 发布

阅读量121

点赞数

分类专栏：快速幂算法

本文链接：https://blog.csdn.net/titi2018815/article/details/102635230

版权

快速幂算法专栏收录该内容

1 篇文章 0 订阅

订阅专栏

题目：

Fermat's theorem states that for any prime number p and for any integer a > 1, ap = a (mod p). That is, if we raise a to the pth power and divide by p, the remainder is a. Some (but not very many) non-prime values of p, known as base-a pseudoprimes, have this property for some a. (And some, known as Carmichael Numbers, are base-apseudoprimes for all a.)

Given 2 < p ≤ 1000000000 and 1 < a < p, determine whether or not p is a base-apseudoprime.

Input

Input contains several test cases followed by a line containing "0 0". Each test case consists of a line containing p and a.

Output

For each test case, output "yes" if p is a base-a pseudoprime; otherwise output "no".

Sample Input

Sample Output

no
no
yes
no
yes
yes

题意：

如果 a^p = a (mod p)，那么称p是数字a的伪素数；

如果是，输出yes；

否则输出no；

思路：

因为数据范围很大，那么就不能直接进行计算，所以要使用快速幂运算；

举个例子:

如果n = 2^k ,那么n =( （x^2)^2)……；

那么很明显只要进行k次平方运算就可以求出来n的值；

那么我们可以把k转换成二进制，例如 n = x ^22,那么22转换成二进制就是：10110，

所以 x^22 = x^16 + x^4 + x^2;

代码如下：

#include<stdio.h>
#include<string.h>

typedef long long LL;

int prime(LL a)
{
    int z=1;
    if(a<2)
        return 0;
    for(int i=2; i*i<=a; i++)
    {
        if(a%i==0)
        return 0;
    }
    return 1;
}

LL mod_pow(LL x,LL n,LL mod)
{
    LL res=1;
    while(n)
    {
        if(n&1)
            res=res*x%mod;
        x=x*x%mod;
        n>>=1;
    }
    return res;
}

int main()
{
    LL p,a;
    while(~scanf("%lld%lld",&p,&a))
    {
        if(p==0&&a==0)
            break;
        if(prime(p))
            printf("no\n");
        else if(mod_pow(a,p,p)==a)
            printf("yes\n");
        else
            printf("no\n");
    }
    return 0;
}