POJ-----3641快速幂

最新推荐文章于 2020-04-27 18:59:46 发布

pupil_blue

最新推荐文章于 2020-04-27 18:59:46 发布

阅读量229

点赞数

分类专栏：快速幂与同余

本文链接：https://blog.csdn.net/blue_hpu/article/details/52004948

版权

快速幂与同余专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Pseudoprime numbers

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 8656		Accepted: 3634

Description

Fermat's theorem states that for any prime number p and for any integer a > 1, a^p = a (mod p). That is, if we raise a to the p^th 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-a pseudoprimes for all a.)

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

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的p次方和a对p的余数相同，a^p == a（mod p），而且，而且，而且，，，p不能是质数，mdzz

#include<cstdio>
int main(){
    long long a, b, c, p;
    while(~scanf("%lld%lld", &p, &a), a || p){
    	int ok = 1;
		for(int i = 2; i * i <= p; i++){
	    	if(p % i == 0){
	    		ok = 0;
	    		break;
			}
		}
		if(ok){
    		printf("no\n");
    		continue;
		}
        long long ans = 1;
        c = p;
        b = a;
        while(p){
            if(p & 1){
                ans = ans * a % c;
            }
            p >>= 1;
            a = a * a % c;
        }
        printf(ans == b ? "yes\n" : "no\n");
    }
    return 0;
}