結果

問題 No.3028 No.9999
ユーザー Michael6783746
提出日時 2025-02-22 01:12:35
言語 Python3
(3.13.1 + numpy 2.2.1 + scipy 1.14.1)
結果
AC  
実行時間 110 ms / 4,000 ms
コード長 1,425 bytes
コンパイル時間 293 ms
コンパイル使用メモリ 12,672 KB
実行使用メモリ 11,008 KB
最終ジャッジ日時 2025-02-22 01:12:38
合計ジャッジ時間 2,692 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 23
権限があれば一括ダウンロードができます

ソースコード

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

import math
N = int(input())
sieve_limit = int(math.sqrt(N))
prime_factor = []
prime = []
sieve = list(range(2,sieve_limit+1))
j = 0
remainder = N
while sieve:
    factor = sieve[0]
    prime.append(factor)
    sieve = [i for i in sieve if i % factor != 0]
    while remainder % factor == 0:
        remainder //= factor
        prime_factor.append(factor)
    if remainder < factor:
        break
if remainder > 1:
    prime_factor.append(remainder)
totient = N
for factor in prime_factor:
    totient = (totient*(factor-1))//factor
prime_factor = []
remainder = totient
for factor in prime:
    exponent = 0
    while remainder % factor == 0:
        remainder //= factor
        exponent += 1
    if exponent > 0:
        prime_factor.append((factor,exponent))
    if remainder == 1:
        break
if remainder > 1:
    prime_factor.append((remainder,1))
K_candidate = [1]
for factor,exponent in prime_factor:
    K_candidate_new = set()
    for i in range(exponent+1):
        K_candidate_new = K_candidate_new | {j*factor**i for j in K_candidate}
    K_candidate = K_candidate_new
K_candidate_list = list(K_candidate)
K_candidate_list.sort()
for k in K_candidate_list:
    binary_k = list(map(int, bin(k)[2:]))
    lenk = len(binary_k)
    mod_list = [0] * (lenk)
    mod_list[0] = 10%N
    for i in range(lenk-1):
        mod_list[i+1] = mod_list[i]**2 %N
    r = 1
    for i,bit in enumerate(binary_k):
        if bit:
            r = r * mod_list[lenk-i-1] % N
    #print(k,r,mod_list,binary_k)
    if r == 1:
        print(k)
        break
if N == 1:
    print(1)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0