結果
問題 | No.2798 Multiple Chain |
ユーザー |
![]() |
提出日時 | 2024-06-28 22:04:46 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 70 ms / 2,000 ms |
コード長 | 2,046 bytes |
コンパイル時間 | 178 ms |
コンパイル使用メモリ | 82,364 KB |
実行使用メモリ | 64,908 KB |
最終ジャッジ日時 | 2024-06-28 22:04:57 |
合計ジャッジ時間 | 3,570 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 36 ms
52,480 KB |
testcase_01 | AC | 35 ms
52,992 KB |
testcase_02 | AC | 35 ms
53,120 KB |
testcase_03 | AC | 35 ms
52,736 KB |
testcase_04 | AC | 36 ms
52,480 KB |
testcase_05 | AC | 35 ms
52,608 KB |
testcase_06 | AC | 35 ms
52,736 KB |
testcase_07 | AC | 36 ms
52,736 KB |
testcase_08 | AC | 34 ms
52,864 KB |
testcase_09 | AC | 33 ms
52,864 KB |
testcase_10 | AC | 34 ms
52,352 KB |
testcase_11 | AC | 44 ms
52,608 KB |
testcase_12 | AC | 36 ms
52,864 KB |
testcase_13 | AC | 39 ms
52,608 KB |
testcase_14 | AC | 37 ms
52,992 KB |
testcase_15 | AC | 36 ms
52,992 KB |
testcase_16 | AC | 36 ms
52,992 KB |
testcase_17 | AC | 37 ms
52,992 KB |
testcase_18 | AC | 37 ms
52,488 KB |
testcase_19 | AC | 34 ms
52,948 KB |
testcase_20 | AC | 36 ms
52,864 KB |
testcase_21 | AC | 53 ms
52,480 KB |
testcase_22 | AC | 35 ms
52,608 KB |
testcase_23 | AC | 36 ms
52,992 KB |
testcase_24 | AC | 36 ms
52,480 KB |
testcase_25 | AC | 35 ms
52,864 KB |
testcase_26 | AC | 35 ms
52,992 KB |
testcase_27 | AC | 35 ms
52,480 KB |
testcase_28 | AC | 37 ms
53,248 KB |
testcase_29 | AC | 35 ms
52,864 KB |
testcase_30 | AC | 34 ms
52,864 KB |
testcase_31 | AC | 36 ms
52,992 KB |
testcase_32 | AC | 70 ms
64,908 KB |
testcase_33 | AC | 42 ms
60,544 KB |
testcase_34 | AC | 48 ms
64,768 KB |
testcase_35 | AC | 37 ms
52,336 KB |
testcase_36 | AC | 38 ms
53,504 KB |
testcase_37 | AC | 36 ms
52,992 KB |
testcase_38 | AC | 36 ms
52,736 KB |
testcase_39 | AC | 37 ms
53,120 KB |
testcase_40 | AC | 35 ms
52,608 KB |
testcase_41 | AC | 36 ms
52,864 KB |
testcase_42 | AC | 44 ms
52,864 KB |
testcase_43 | AC | 38 ms
52,608 KB |
testcase_44 | AC | 35 ms
52,864 KB |
testcase_45 | AC | 36 ms
52,352 KB |
testcase_46 | AC | 35 ms
52,736 KB |
testcase_47 | AC | 36 ms
52,352 KB |
testcase_48 | AC | 35 ms
52,864 KB |
testcase_49 | AC | 36 ms
52,352 KB |
testcase_50 | AC | 38 ms
52,608 KB |
testcase_51 | AC | 35 ms
52,352 KB |
testcase_52 | AC | 40 ms
60,160 KB |
testcase_53 | AC | 38 ms
53,248 KB |
ソースコード
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 N = int(input()) dps = {} U = 30 dp = [0]*U dp[0] = 1 dps[0] = dp for d in range(1, U): ndp = dp[:] for i in range(U): if i+d >= U: continue ndp[i+d] += ndp[i] dp = ndp dps[d] = dp F = primeFactor(N) Z = [0]*U for L in range(1, U): term = 1 dp = dps[L] for p, e in F.items(): term *= dp[e] Z[L] = term M = Z[:] for i in range(U-1, 0, -1): M[i] -= M[i-1] ans = sum(M) print(ans)