結果

問題 No.1915 Addition
ユーザー kozykozy
提出日時 2022-04-29 21:27:18
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 100 ms / 2,000 ms
コード長 3,161 bytes
コンパイル時間 939 ms
コンパイル使用メモリ 82,300 KB
実行使用メモリ 76,788 KB
最終ジャッジ日時 2024-06-29 02:45:51
合計ジャッジ時間 3,138 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 10
権限があれば一括ダウンロードができます

ソースコード

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

import sys
input = sys.stdin.readline
def gcd(a, b):
while b: a, b = b, a % b
return a
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37]
for a in L:
t = d
y = pow(a, t, n)
if y == 1: continue
while y != n - 1:
y = (y * y) % n
if y == 1 or t == n - 1: return 0
t <<= 1
return 1
def findFactorRho(n):
m = 1 << n.bit_length() // 8
for c in range(1, 99):
f = lambda x: (x * x + c) % n
y, r, q, g = 2, 1, 1, 1
while g == 1:
x = y
for i in range(r):
y = f(y)
k = 0
while k < r and g == 1:
ys = y
for i in range(min(m, r - k)):
y = f(y)
q = q * abs(x - y) % n
g = gcd(q, n)
k += m
r <<= 1
if g == n:
g = 1
while g == 1:
ys = f(ys)
g = gcd(abs(x - ys), n)
if g < n:
if isPrimeMR(g): return g
elif isPrimeMR(n // g): return n // g
return findFactorRho(g)
def primeFactor(n):
i = 2
ret = {}
rhoFlg = 0
while i*i <= n:
k = 0
while n % i == 0:
n //= i
k += 1
if k: ret[i] = k
i += 1 + i % 2
if i == 101 and n >= 2 ** 20:
while n > 1:
if isPrimeMR(n):
ret[n], n = 1, 1
else:
rhoFlg = 1
j = findFactorRho(n)
k = 0
while n % j == 0:
n //= j
k += 1
ret[j] = k
if n > 1: ret[n] = 1
if rhoFlg: ret = {x: ret[x] for x in sorted(ret)}
return ret
def yakusu(N):
c=primeFactor(N)
A=list(c.keys())
B=list(c.values())
S=len(A)
cou=1
for i in B:
cou*=(i+1)
yakusulist=[1]*cou
for i in range(cou):
a=i
for j in range(S):
yakusulist[i]*=pow(A[j],a%(B[j]+1))
a//=(B[j]+1)
yakusulist.sort()
return yakusulist
def phi(n):
c=primeFactor(n)
A=list(c.keys())
for i in A:
n=n*(i-1)//i
return n
import math
def extgcd(A,B):
a,b=max(A,B),min(A,B)
if a==1 and b==0:
return 1,0
else:
s=a//b
t=a%b
c,d=extgcd(b,t)
if A<B:
return c-s*d,d
else:
return d,c-s*d
#251896766
def root(P):#P
L=yakusu(P-1)
for i in range(2,P):
for k in L:
if pow(i,k,P)==1 and k!=P-1:
break
if k==P-1:
return i
L=list()
L.append(list())
for k in range(1,18):
T=list()
L.append(yakusu(10**k-1))
T=int(input())
for i in range(T):
N=int(input())
S=yakusu(N)
flag=False
for k in range(1,18):
for x in S:
for y in L[k]:
if 10**(k-1)<=(x*y-N)<10**k:
print(x*y-N)
flag=True
break
if flag:
break
if flag:
break
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0