快速幂题

An important topic nowadays in computer science is cryptography. Some people even think that cryptography is the only important field in computer science, and that life would not matter at all without cryptography. Alvaro is one of such persons, and is designing a set of cryptographic procedures for cooking paella. Some of the cryptographic algorithms he is implementing make use of big prime numbers. However, checking if a big number is prime is not so easy. An exhaustive approach can require the division of the number by all the prime numbers smaller or equal than its square root. For big numbers, the amount of time and storage needed for such operations would certainly ruin the paella.

However, some probabilistic tests exist that offer high confidence at low cost. One of them is the Fermat test.

Let a be a random number between 2 and n - 1 (being n the number whose primality we are testing). Then, n is probably prime if the following equation holds:

If a number passes the Fermat test several times then it is prime with a high probability.
Unfortunately, there are bad news. Some numbers that are not prime still pass the Fermat test with every number smaller than themselves. These numbers are called Carmichael numbers.

In this problem you are asked to write a program to test if a given number is a Carmichael number. Hopefully, the teams that fulfill the task will one day be able to taste a delicious portion of encrypted paella. As a side note, we need to mention that, according to Alvaro, the main advantage of encrypted paella over conventional paella is that nobody but you knows what you are eating.

Input
The input will consist of a series of lines, each containing a small positive number n ( 2 < n < 65000). A number n = 0 will mark the end of the input, and must not be processed.
Output
For each number in the input, you have to print if it is a Carmichael number or not, as shown in the sample output.
Sample Input
1729
17
561
1109
431
0
Sample Output
The number 1729 is a Carmichael number.
17 is normal.
The number 561 is a Carmichael number.
1109 is normal.
431 is normal.

include<stdio.h>
#include<string.h>
#include
using namespace std;
typedef long long ll;
const int maxn=1e5+10;
int prim[maxn];
void so()
{
prim[0]=prim[1]=1;
for(int i=2;i<=maxn;i++)
{
if(!prim[i])
for(int j=i2;j<=maxn;j+=i)
prim[j]=1;
}
}
ll pi(ll a,ll b,int mod)
{
ll res=1;
while(b)
{
if(b&1)
res=resa%mod;
a=a*a%mod;
b>>=1;
}
return res%mod;
}
int main()
{
so();
int n;
while(~scanf("%d",&n)&&n)
{
if(prim[n])
{
int flag=0;
for(int i=2;i<n;i++)
{
if(pi(i,n,n)!=i)
{
flag=1;
break;
}
}
if(!flag)
printf(“The number %d is a Carmichael number.\n”,n);
else
printf("%d is normal.\n",n);
}
else
printf("%d is normal.\n",n);
}
return 0;
}

https://blog.csdn.net/u013050857/article/details/38109705
快速幂取模法
上面的测试可知，30的30次方，就超过计算机的取值范围了，那么快速取模的数可以是很大很大的数，因此需要进行取模。
由以上算法可以，最终的幂值就是各个值相乘，其中的某个乘式取模和算出整个值取模效果是一样的，确切的说是更好。例如，2^8求出值256，再对4求模为0,8 = 2^4*24,2个乘式2^4%4 == 0，最终的结果是一样的。还避免了数值太大，

//为了使数字不会超过最大值，所以每次都取模
//2^n = 13 呢，拆分成 13 = 1 + 4 + 8，即 2^13 = 2^1 * 2^4 * 2^8。
//所以在下面两处取模对结果没有影响的。
//也需要取模，不然稍微大点的数，就超过了取值范围。

long long power(long long x,long long n,long long mode)
{
long long res = 1;
while(n>0)
{
if(n%2 == 1) //if(n & 1)是一样的
{
res = (resx)%mode;
}
n = n >>1;
x = (xx)%mode;
}
return res;
}

原文链接
https://blog.csdn.net/huang1600301017/article/details/91474279