hdu1395 2^x mod n = 1（欧拉函数）

2^x mod n = 1

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20133    Accepted Submission(s): 6321

Problem Description

Give a number n, find the minimum x(x>0) that satisfies 2^x mod n = 1.

 

Input

One positive integer on each line, the value of n.

 

Output

If the minimum x exists, print a line with 2^x mod n = 1.

Print 2^? mod n = 1 otherwise.

You should replace x and n with specific numbers.

 

Sample Input

2

5

 

Sample Output

2^? mod 2 = 1

2^4 mod 5 = 1

 

Author

MA, Xiao

 

题意：求满足2^x mod n = 1的最小x的值

 

直接暴力：

#include<iostream>
#include<math.h>
#define ll long long
using namespace std;
int main()
{
  ll n;
  while(~scanf("%lld",&n))
  {
    if(n==||n%==)
      printf("2^? mod %d = 1\n",n );
    else
    {
      ll s=;
      for(int i=;;i++)
      {
        s=s*%n;
        if(s==)
        {
          printf("2^%d mod %d = 1\n",i,n );
          break;
        }
      }

    }
  }
  return ;

}

欧拉函数：

先求欧拉函数的值phi(n)，在对phi(n)进行因数分解,把phi(n)的因数存在数组e[i]里面

然后依次枚举e[i]的每一个数，同时判断这个数e[i]是否满足2^e[i]%m==1，不断更新一个最小值，最后得到答案

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
using namespace std;
#define LL __int64
LL t,e[];
LL mod;
LL euler_phi(LL n)//欧拉函数
{
    LL m=sqrt(n+0.5);
    LL ans=n,i;
    for(i=;i<=m;i++)
    {
        if(n%i==)
        {
            ans=ans/i*(i-);
            while(n%i==)n=n/i;
        }
    }
    if(n>)ans=ans/n*(n-);
    return ans;
}
void find(LL n)//找出m的所有因子
{
    LL i;
    e[t++]=n;
    for(i=;i*i<=n;i++)
    {
        if(n%i==)
        {
            if(i*i==n)
                e[t++]=i;
            else
            {
                e[t++]=i;
                e[t++]=n/i;
            }
        }
    }
}
LL pows(LL a,LL b)
{
    LL s=;
    while(b)
    {
        if(b&)
            s=(s*a)%mod;
        a=(a*a)%mod;
        b=b>>;
    }
    return s;
}
int main()
{
    LL n;
    while(cin>>n)
    {
        if(n%==||n==)
            cout<<"2^? mod "<<n<<" = 1"<<endl;
        else
        {
            LL m,ans,i;
            m=euler_phi(n);
            t=;
            find(m);
            sort(e,e+t);
            mod=n;
            for(i=;i<t;i++)
            {
                if(pows(,e[i])==)
                {
                    ans=e[i];
                    break;
                }
            }
            cout<<"2^"<<ans<<" mod "<<n<<" = 1"<<endl;
        }
    }
    return ;
}