UVa 10006 Carmichael Numbers

筛选法产生素数表+快速幂

#include <cstdio>
#include <cmath>
#include <cstring>
#define M  65010
bool prime[M];
void make_prime()
{
    int len = sqrt(M+0.5);
    memset(prime,0,sizeof(prime));
    for(int i = 2; i <= len; i++)
        if(prime[i]==0)
        {
            for(int j = i*i; j <= M; j+=i) prime[j] = 1;
        }
}
int mod (int a, int n, int m)//整合了快速幂
{
    if(n==0) return 1;
    if(n==1) return a%m;
    long long x = mod(a, n/2, m);
    long long ans = x*x%m;
    if(n&1) ans = ans*a%m;//某数与1按位取与，将得到其二进制下的最后一位
    //所以，奇数会得1，偶数会得0
    return (int)ans;
}
int judge(int n)
{
    for(int i = 2; i < n; i++)
        if(mod(i,n,n)!=i) return 0;
    return 1;
}
int main ()
{
    int n;
    make_prime();
    while(scanf("%d",&n),n)
    {
        if(prime[n]==0)
        {
            printf("%d is normal.\n",n);
            continue;
        }
        if(judge(n)) printf("The number %d is a Carmichael number.\n",n);
        else printf("%d is normal.\n",n);
    }
    return 0;
}