题目:LINK
对于10进制小数转化为2进制小数,我们采用乘2取整法。
对于1/10, 1/10, 2/10, 4/10, 8/10, 16/10, 32/10, 64/10
p对10取余 1/10, 2/10, 4/10, 8/10, 6/10, 2/10, 4/10
发现循环节,且循环节就是题目要求的循环节.
对p/q
首先p'=p/gcd(p,q)
q'=q/gcd(p,q);
然后 p'*2^i = p'*2^j (mod q') (i<j)
经过变换得到:
p'*2^i*(2^(j-i)-1) ==0 (mod q')
也就是 q' | p'*2^i*(2^(j-i)-1)
由于gcd(p',q')=1,
得到: q' | 2^i*(2^(j-i)-1)
因为2^(j-i)-1为奇数,所以q'有多少个2的幂,i就是多少,而且i就是循环开始位置的前一位。
q''为q'除去2的幂之后的数
2^x ==1 (mod q'') , q''和2互质,可以利用欧拉定理求解
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<map>
#include<set>
using namespace std;
#define INF 1000000000
typedef __int64 LL;
LL p, q;
vector<LL > save;
LL gcd(LL x, LL y)
{
if(!y) return x;
return gcd(y, x%y);
}
LL pow_(LL x, LL y, LL mod)
{
LL ret = 1;
while(y) {
if(y&1) {
ret *= x; ret %= mod;
}
y >>= 1;
x *= x; x %= mod;
}
return ret;
}
LL eular(LL n)
{
LL ret = 1;
for(LL i = 2; i*i <=n; i++) {
if(n%i == 0) {
n/= i;
ret *= i-1;
while(n%i == 0) {
n/=i; ret *= i;
}
}
}
if(n>1) ret *= n-1;
return ret;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif // ONLINE_JUDGE
int time = 0;
while(scanf("%I64d/%I64d", &p, &q) != EOF) {
LL d = gcd(p, q);
p = p / d;
q = q / d;
printf("Case #%d: ", ++time);
save.clear();
LL t = 0;
while( q % 2 == 0) {
t ++ ; q /= 2;
}
printf("%d,", t+1);
LL mm = q;
q = eular(q);
for(LL i=1; i*i <= q; i++) {
if(q%i == 0) {
save.push_back(i);
save.push_back(q/i);
}
}
sort(save.begin(), save.end());
for(int i = 0; i < save.size(); i++) {
LL num = save[i];
if(pow_(2, num, mm) == 1) {
printf("%I64d\n", num);
break;
}
}
}
return 0;
}