結果

問題 No.1339 循環小数
ユーザー 👑 Kazun
提出日時 2021-01-15 21:51:54
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 164 ms / 2,000 ms
コード長 3,810 bytes
コンパイル時間 443 ms
コンパイル使用メモリ 82,288 KB
実行使用メモリ 69,004 KB
最終ジャッジ日時 2024-11-26 14:15:14
合計ジャッジ時間 4,401 ms
ジャッジサーバーID
(参考情報)
judge2 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 36
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

class Modulo_Error(Exception):
pass
class Modulo():
def __init__(self,a,n):
self.a=a%n
self.n=n
def __str__(self):
return "{} (mod {})".format(self.a,self.n)
def __repr__(self):
return self.__str__()
#+,-
def __pos__(self):
return self
def __neg__(self):
return Modulo(-self.a,self.n)
#,
def __eq__(self,other):
if isinstance(other,Modulo):
return (self.a==other.a) and (self.n==other.n)
elif isinstance(other,int):
return (self-other).a==0
def __neq__(self,other):
return not(self==other)
def __le__(self,other):
a,p=self.a,self.n
b,q=other.a,other.n
return (a-b)%q==0 and p%q==0
def __ge__(self,other):
return other<=self
def __lt__(self,other):
return (self<=other) and (self!=other)
def __gt__(self,other):
return (self>=other) and (self!=other)
#
def __add__(self,other):
if isinstance(other,Modulo):
if self.n!=other.n:
raise Modulo_Error(".")
return Modulo(self.a+other.a,self.n)
elif isinstance(other,int):
return Modulo(self.a+other,self.n)
def __radd__(self,other):
if isinstance(other,int):
return Modulo(self.a+other,self.n)
#
def __sub__(self,other):
return self+(-other)
def __rsub__(self,other):
if isinstance(other,int):
return -self+other
#
def __mul__(self,other):
if isinstance(other,Modulo):
if self.n!=other.n:
raise Modulo_Error(".")
return Modulo(self.a*other.a,self.n)
elif isinstance(other,int):
return Modulo(self.a*other,self.n)
def __rmul__(self,other):
if isinstance(other,int):
return Modulo(self.a*other,self.n)
#Modulo
def inverse(self):
return self.Modulo_Inverse()
def Modulo_Inverse(self):
x0, y0, x1, y1 = 1, 0, 0, 1
a,b=self.a,self.n
while b != 0:
q, a, b = a // b, b, a % b
x0, x1 = x1, x0 - q * x1
y0, y1 = y1, y0 - q * y1
if a!=1:
raise Modulo_Error("{}".format(self))
else:
return Modulo(x0,self.n)
#
def __truediv__(self,other):
return self*(other.Modulo_Inverse())
def __rtruediv__(self,other):
return other*(self.Modulo_Inverse())
#
def __pow__(self,other):
if isinstance(other,int):
u=abs(other)
r=Modulo(pow(self.a,u,self.n),self.n)
if other>=0:
return r
else:
return r.Modulo_Inverse()
else:
b,n=other.a,other.n
if pow(self.a,n,self.n)!=1:
raise Modulo_Error(".")
else:
return self**b
def Order(X):
"""X. , X^k=[1] k .
"""
R=X.n
N=X.n
k=2
while k*k<=N:
if N%k==0:
R-=R//k
while N%k==0:
N//=k
k+=1
if N>1:
R-=R//N
D=[]
k=1
while k*k<=R:
if R%k==0:
D.append(k)
D.append(R//k)
k+=1
a=float("inf")
for k in D:
if pow(X,k)==1:
a=min(a,k)
return a
#================================================
T=int(input())
for _ in range(T):
N=int(input())
while N%2==0:
N//=2
while N%5==0:
N//=5
print(Order(Modulo(10,N)))
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0