結果
問題 | No.1339 循環小数 |
ユーザー | vwxyz |
提出日時 | 2023-12-08 06:53:50 |
言語 | Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0) |
結果 |
AC
|
実行時間 | 499 ms / 2,000 ms |
コード長 | 3,652 bytes |
コンパイル時間 | 133 ms |
コンパイル使用メモリ | 13,056 KB |
実行使用メモリ | 11,392 KB |
最終ジャッジ日時 | 2024-09-27 02:41:21 |
合計ジャッジ時間 | 4,813 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
11,264 KB |
testcase_01 | AC | 29 ms
11,136 KB |
testcase_02 | AC | 29 ms
11,136 KB |
testcase_03 | AC | 28 ms
11,264 KB |
testcase_04 | AC | 30 ms
11,392 KB |
testcase_05 | AC | 28 ms
11,136 KB |
testcase_06 | AC | 29 ms
11,264 KB |
testcase_07 | AC | 28 ms
11,392 KB |
testcase_08 | AC | 28 ms
11,264 KB |
testcase_09 | AC | 28 ms
11,392 KB |
testcase_10 | AC | 28 ms
11,136 KB |
testcase_11 | AC | 31 ms
11,392 KB |
testcase_12 | AC | 31 ms
11,264 KB |
testcase_13 | AC | 31 ms
11,136 KB |
testcase_14 | AC | 30 ms
11,264 KB |
testcase_15 | AC | 31 ms
11,392 KB |
testcase_16 | AC | 33 ms
11,136 KB |
testcase_17 | AC | 32 ms
11,392 KB |
testcase_18 | AC | 31 ms
11,264 KB |
testcase_19 | AC | 31 ms
11,136 KB |
testcase_20 | AC | 31 ms
11,264 KB |
testcase_21 | AC | 96 ms
11,264 KB |
testcase_22 | AC | 104 ms
11,264 KB |
testcase_23 | AC | 116 ms
11,264 KB |
testcase_24 | AC | 94 ms
11,136 KB |
testcase_25 | AC | 121 ms
11,264 KB |
testcase_26 | AC | 131 ms
11,264 KB |
testcase_27 | AC | 104 ms
11,264 KB |
testcase_28 | AC | 119 ms
11,392 KB |
testcase_29 | AC | 79 ms
11,264 KB |
testcase_30 | AC | 100 ms
11,136 KB |
testcase_31 | AC | 458 ms
11,136 KB |
testcase_32 | AC | 461 ms
11,392 KB |
testcase_33 | AC | 90 ms
11,264 KB |
testcase_34 | AC | 34 ms
11,136 KB |
testcase_35 | AC | 499 ms
11,264 KB |
testcase_36 | AC | 109 ms
11,264 KB |
ソースコード
import sys readline=sys.stdin.readline from collections import defaultdict def Factorize(N): assert N>=1 factors=defaultdict(int) for p in range(2,N): if p**2>N: break while N%p==0: factors[p]+=1 N//=p if N!=1: factors[N]+=1 return factors def Divisors(N): divisors=[] for i in range(1,N+1): if i**2>=N: break elif N%i==0: divisors.append(i) if i**2==N: divisors+=[i]+[N//i for i in divisors[::-1]] else: divisors+=[N//i for i in divisors[::-1]] return divisors def Extended_Euclid(n,m): stack=[] while m: stack.append((n,m)) n,m=m,n%m if n>=0: x,y=1,0 else: x,y=-1,0 for i in range(len(stack)-1,-1,-1): n,m=stack[i] x,y=y,x-(n//m)*y return x,y class MOD: def __init__(self,p,e=None): self.p=p self.e=e if self.e==None: self.mod=self.p else: self.mod=self.p**self.e def Pow(self,a,n): a%=self.mod if n>=0: return pow(a,n,self.mod) else: #assert math.gcd(a,self.mod)==1 x=Extended_Euclid(a,self.mod)[0] return pow(x,-n,self.mod) def Build_Fact(self,N): assert N>=0 self.factorial=[1] if self.e==None: for i in range(1,N+1): self.factorial.append(self.factorial[-1]*i%self.mod) else: self.cnt=[0]*(N+1) for i in range(1,N+1): self.cnt[i]=self.cnt[i-1] ii=i while ii%self.p==0: ii//=self.p self.cnt[i]+=1 self.factorial.append(self.factorial[-1]*ii%self.mod) self.factorial_inve=[None]*(N+1) self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1) for i in range(N-1,-1,-1): ii=i+1 while ii%self.p==0: ii//=self.p self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod def Build_Inverse(self,N): self.inverse=[None]*(N+1) assert self.p>N self.inverse[1]=1 for n in range(2,N+1): if n%self.p==0: continue a,b=divmod(self.mod,n) self.inverse[n]=(-a*self.inverse[b])%self.mod def Inverse(self,n): return self.inverse[n] def Fact(self,N): if N<0: return 0 retu=self.factorial[N] if self.e!=None and self.cnt[N]: retu*=pow(self.p,self.cnt[N],self.mod)%self.mod retu%=self.mod return retu def Fact_Inve(self,N): if self.e!=None and self.cnt[N]: return None return self.factorial_inve[N] def Comb(self,N,K,divisible_count=False): if K<0 or K>N: return 0 retu=self.factorial[N]*self.factorial_inve[K]%self.mod*self.factorial_inve[N-K]%self.mod if self.e!=None: cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K] if divisible_count: return retu,cnt else: retu*=pow(self.p,cnt,self.mod) retu%=self.mod return retu T=int(readline()) for t in range(T): N=int(readline()) while N%2==0: N//=2 while N%5==0: N//=5 if N==1: ans=1 else: ans=N for p in Factorize(N): ans*=p-1 ans//=p for p in Factorize(ans): while ans%p==0 and pow(10,ans//p,N)==1: ans//=p print(ans)