A - Carmichael Numbers

An important topic nowadays in computer science is cryptography. Some people even think that
cryptography is the only important eld 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 con dence at low cost. One of them is the
Fermat test.
Let
a
be a random number between 2 and
n

#include <iostream>
#include <bits/stdc++.h>
#include <string.h>
#include <math.h>
using namespace std;

long long int quickmi(long long int a,int b,int c)
{
    long long int ans=1;
    while(b)
    {
        if(b&1)
        {
            ans=ans*a;
            ans=ans%c;
        }
        a=a*a;
        a=a%c;
        b=b/2;
    }
    return ans;
}

int main()
{
    bool as[650];
    int a;
    int t;
    int f=1;
    memset(as,false,sizeof(as));
    int i,j;
    for(i=2; i<sqrt(65000); i++)
    {
        if(as[i]==false)
        {
            for(j=2*i; j<65000; j+=i)
            {
                as[j]=true;
            }
        }
    }
    while(scanf("%d",&a)!=EOF)
    {

        if(a==0)
        {
            break;
        }
        if(as[a]==false)
        {
            cout << a << " " << "is normal."  << endl;
        }
        else
        {
            f=1;
            for(i=2; i<=a-1; i++)
            {
                t=quickmi(i,a,a);
                if(t!=i)
                {
                    f=0;
                    break;
                }
            }
            if(f==1)
            {
                cout << "The number" << " " << a << " " << "is a Carmichael number."  << endl;
            }
            else
            {
                cout << a << " " << "is normal."  << endl;
            }
        }
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

ZZ --瑞 hopeACMer

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付:¥1
获取中
扫码支付

您的余额不足,请更换扫码支付或充值

打赏作者

实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值