結果
問題 | No.1339 循環小数 |
ユーザー |
|
提出日時 | 2021-01-15 21:40:18 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 83 ms / 2,000 ms |
コード長 | 2,787 bytes |
コンパイル時間 | 288 ms |
コンパイル使用メモリ | 82,328 KB |
実行使用メモリ | 76,732 KB |
最終ジャッジ日時 | 2024-11-26 13:41:11 |
合計ジャッジ時間 | 3,996 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 36 |
ソースコード
import sysfrom math import gcdinput = sys.stdin.readlinedef euler_phi(n):res = nfor x in range(2, int(n**.5)+1):if n % x == 0:res = res // x * (x-1)while n % x == 0:n //= xif n!=1:res = (res//n) * (n-1)return resdef ind(b,n):res=0while n%b==0:res+=1n//=breturn resdef isPrimeMR(n):d = n - 1d = d // (d & -d)L = [2, 3, 5, 7, 11, 13, 17]for a in L:t = dy = pow(a, t, n)if y == 1: continuewhile y != n - 1:y = (y * y) % nif y == 1 or t == n - 1: return 0t <<= 1return 1def findFactorRho(n):m = 1 << n.bit_length() // 8for c in range(1, 99):f = lambda x: (x * x + c) % ny, r, q, g = 2, 1, 1, 1while g == 1:x = yfor i in range(r):y = f(y)k = 0while k < r and g == 1:ys = yfor i in range(min(m, r - k)):y = f(y)q = q * abs(x - y) % ng = gcd(q, n)k += mr <<= 1if g == n:g = 1while g == 1:ys = f(ys)g = gcd(abs(x - ys), n)if g < n:if isPrimeMR(g): return gelif isPrimeMR(n // g): return n // greturn findFactorRho(g)def primeFactor(n):i = 2ret = {}rhoFlg = 0while i*i <= n:k = 0while n % i == 0:n //= ik += 1if k: ret[i] = ki += 1 + i % 2if i == 101 and n >= 2 ** 20:while n > 1:if isPrimeMR(n):ret[n], n = 1, 1else:rhoFlg = 1j = findFactorRho(n)k = 0while n % j == 0:n //= jk += 1ret[j] = kif n > 1: ret[n] = 1if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}return retdef divisors(n):prime = primeFactor(n)res = [1]for p in prime:new = []for a in res:for j in range(prime[p]+1):new.append(a*p**j)res = newreturn resans = []import randomfor _ in range(int(input())):N = int(input())while N%2==0:N //= 2while N%5==0:N //= 5primef = primeFactor(N)phi = Nfor p in primef:phi *= (p-1)phi //= pdivi = divisors(phi)#print(divi)for d in divi:if pow(10,d,N)==1:ans.append(d)breakif N==1:ans.append(1)print(*ans,sep="\n")