結果
問題 | No.1529 Constant Lcm |
ユーザー | nephrologist |
提出日時 | 2021-06-06 14:11:58 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,460 ms / 3,000 ms |
コード長 | 2,977 bytes |
コンパイル時間 | 171 ms |
コンパイル使用メモリ | 81,748 KB |
実行使用メモリ | 118,076 KB |
最終ジャッジ日時 | 2024-05-02 08:20:41 |
合計ジャッジ時間 | 26,443 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 50 ms
54,528 KB |
testcase_01 | AC | 114 ms
76,896 KB |
testcase_02 | AC | 50 ms
54,016 KB |
testcase_03 | AC | 50 ms
54,016 KB |
testcase_04 | AC | 46 ms
54,528 KB |
testcase_05 | AC | 51 ms
54,528 KB |
testcase_06 | AC | 46 ms
54,528 KB |
testcase_07 | AC | 46 ms
54,144 KB |
testcase_08 | AC | 45 ms
54,784 KB |
testcase_09 | AC | 46 ms
54,528 KB |
testcase_10 | AC | 2,176 ms
114,304 KB |
testcase_11 | AC | 742 ms
89,088 KB |
testcase_12 | AC | 135 ms
77,388 KB |
testcase_13 | AC | 1,817 ms
108,976 KB |
testcase_14 | AC | 1,078 ms
95,920 KB |
testcase_15 | AC | 1,160 ms
97,280 KB |
testcase_16 | AC | 862 ms
91,392 KB |
testcase_17 | AC | 468 ms
83,804 KB |
testcase_18 | AC | 503 ms
85,232 KB |
testcase_19 | AC | 1,130 ms
96,640 KB |
testcase_20 | AC | 2,449 ms
117,504 KB |
testcase_21 | AC | 2,404 ms
117,848 KB |
testcase_22 | AC | 2,408 ms
117,436 KB |
testcase_23 | AC | 2,449 ms
117,376 KB |
testcase_24 | AC | 2,460 ms
118,076 KB |
testcase_25 | AC | 2,424 ms
117,924 KB |
ソースコード
from collections import Counter n = int(input()) mod = 998244353 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] 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 prime_list(n): d = [] is_prime = [0] * (n + 1) is_prime[2] = 1 len3 = len(is_prime[3::2]) is_prime[3::2] = [1] * (len3) for i in range(3, int(n ** 0.5) + 1, 2): if is_prime[i]: len_is = len(is_prime[i * i :: i + i]) is_prime[i * i :: i + i] = [0] * len_is for j in range(n + 1): if is_prime[j] == 1: d.append(j) return d, is_prime primes, _ = prime_list(n) jisho = {} for i in range(len(primes)): jisho[primes[i]] = i memo = [0] * (len(primes)) for i in range(1, min(n, n // 2 + 5)): if i == 0: continue # print("i", i) temp1 = primeFactor(i) temp2 = primeFactor(n - i) temp = Counter() temp.update(temp1) temp.update(temp2) for key, val in temp.items(): memo[jisho[key]] = max(memo[jisho[key]], val) ans = 1 for i in range(len(primes)): ans *= pow(primes[i], memo[i], mod) ans %= mod # print("i", i, ans) print(ans)