ZOJ 1049 2^x mod n = 1
2011-05-05 14:55
330 查看
题意是:求出满足2^x mod n = 1的x。
这样的x叫做2模n的次数。我使用余数的性质递推的,应该还有好的算法。
#include"stdio.h"
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==1||n%2==0)
{ printf("2^? mod %d = 1\n",n);continue;}
int ans,k=1;long long s=2;
ans=s%n;
while(ans!=1)
{
s=ans*2;
ans=s%n;
k++;
}
printf("2^%d mod %d = 1\n",k,n);
}
return 0;
}
这样的x叫做2模n的次数。我使用余数的性质递推的,应该还有好的算法。
#include"stdio.h"
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
if(n==1||n%2==0)
{ printf("2^? mod %d = 1\n",n);continue;}
int ans,k=1;long long s=2;
ans=s%n;
while(ans!=1)
{
s=ans*2;
ans=s%n;
k++;
}
printf("2^%d mod %d = 1\n",k,n);
}
return 0;
}
相关文章推荐
- 【ACM打卡】ZOJ 1037 1049
- ZOJ 1489 2^x mod n = 1 数论
- POJ 1005 & ZOJ 1049 & UVA 2363
- 【大水题】ZOJ 1049 I Think I need a Houseboat
- ZOJ 1489 2^x mod n = 1
- ZOJ Problem Set - 1049
- ZOJ-1049
- ZOJ 1049 I Think I Need a Houseboat
- ZOJ-1048,1049
- ZOJ 1049 判断坐标点
- zoj1049-I Think I Need a Houseboart.cpp
- zoj 1049
- ZOJ Problem Set - 1049 I Think I Need a Houseboat
- ZOJ 1049
- ZOJ 1049
- ZOJ 1049 I Think I Need a Houseboat
- ZOJ_1049_I Think I Need a Houseboat
- ZOJ1049-I Think I Need a Houseboat
- ZOJ Problem Set - 1049 I Think I Need a Houseboat
- ZOJ 1049 I Think I Need a Houseboat