結果
問題 | No.1529 Constant Lcm |
ユーザー | mkawa2 |
提出日時 | 2023-02-02 22:55:39 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 78 ms / 3,000 ms |
コード長 | 2,150 bytes |
コンパイル時間 | 164 ms |
コンパイル使用メモリ | 82,084 KB |
実行使用メモリ | 77,756 KB |
最終ジャッジ日時 | 2024-07-02 09:04:36 |
合計ジャッジ時間 | 2,854 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 44 ms
53,872 KB |
testcase_01 | AC | 45 ms
53,536 KB |
testcase_02 | AC | 40 ms
52,884 KB |
testcase_03 | AC | 40 ms
52,832 KB |
testcase_04 | AC | 40 ms
53,920 KB |
testcase_05 | AC | 40 ms
53,692 KB |
testcase_06 | AC | 40 ms
52,684 KB |
testcase_07 | AC | 40 ms
52,080 KB |
testcase_08 | AC | 39 ms
53,008 KB |
testcase_09 | AC | 39 ms
53,100 KB |
testcase_10 | AC | 76 ms
74,812 KB |
testcase_11 | AC | 60 ms
67,128 KB |
testcase_12 | AC | 50 ms
62,160 KB |
testcase_13 | AC | 72 ms
73,024 KB |
testcase_14 | AC | 64 ms
69,660 KB |
testcase_15 | AC | 65 ms
70,084 KB |
testcase_16 | AC | 62 ms
68,548 KB |
testcase_17 | AC | 56 ms
65,864 KB |
testcase_18 | AC | 57 ms
65,476 KB |
testcase_19 | AC | 63 ms
70,232 KB |
testcase_20 | AC | 76 ms
77,756 KB |
testcase_21 | AC | 75 ms
76,300 KB |
testcase_22 | AC | 78 ms
75,956 KB |
testcase_23 | AC | 78 ms
77,224 KB |
testcase_24 | AC | 76 ms
76,772 KB |
testcase_25 | AC | 77 ms
76,656 KB |
ソースコード
import sys # sys.setrecursionlimit(1000005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] inf = (1 << 63)-1 # inf = (1 << 31)-1 # md = 10**9+7 md = 998244353 class Sieve: def __init__(self, n): self.plist = [2] min_prime_factor = [2, 0]*(n//2+1) for x in range(3, n+1, 2): if min_prime_factor[x] == 0: min_prime_factor[x] = x self.plist.append(x) if x**2 > n: continue for y in range(x**2, n+1, 2*x): if min_prime_factor[y] == 0: min_prime_factor[y] = x self.min_prime_factor = min_prime_factor def isprime(self, x): return self.min_prime_factor[x] == x def pf(self, x): pp, ee = [], [] while x > 1: mpf = self.min_prime_factor[x] if pp and mpf == pp[-1]: ee[-1] += 1 else: pp.append(mpf) ee.append(1) x //= mpf return pp, ee # unsorted def factor(self, a): ff = [1] pp, ee = self.pf(a) for p, e in zip(pp, ee): ff, gg = [], ff w = p for _ in range(e): for f in gg: ff.append(f*w) w *= p ff += gg return ff n = II() sv = Sieve(n-1) ans = 1 for p in sv.plist: m = n a = 0 while m%p == 0 and m > p: a += 1 m //= p s = 1 b = 0 while s*p < m: s *= p b += 1 ans *= pow(p, 2*a+b, md) ans %= md print(ans)