結果
問題 | No.2798 Multiple Chain |
ユーザー |
|
提出日時 | 2024-06-28 21:38:00 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 65 ms / 2,000 ms |
コード長 | 2,496 bytes |
コンパイル時間 | 185 ms |
コンパイル使用メモリ | 82,560 KB |
実行使用メモリ | 67,584 KB |
最終ジャッジ日時 | 2024-06-28 21:38:05 |
合計ジャッジ時間 | 4,496 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 48 ms
55,552 KB |
testcase_01 | AC | 50 ms
55,552 KB |
testcase_02 | AC | 50 ms
55,424 KB |
testcase_03 | AC | 48 ms
55,552 KB |
testcase_04 | AC | 49 ms
55,680 KB |
testcase_05 | AC | 54 ms
61,696 KB |
testcase_06 | AC | 49 ms
55,680 KB |
testcase_07 | AC | 49 ms
55,552 KB |
testcase_08 | AC | 51 ms
55,424 KB |
testcase_09 | AC | 49 ms
55,552 KB |
testcase_10 | AC | 48 ms
56,064 KB |
testcase_11 | AC | 50 ms
55,808 KB |
testcase_12 | AC | 49 ms
55,680 KB |
testcase_13 | AC | 54 ms
62,080 KB |
testcase_14 | AC | 55 ms
62,336 KB |
testcase_15 | AC | 49 ms
55,808 KB |
testcase_16 | AC | 49 ms
55,680 KB |
testcase_17 | AC | 48 ms
55,808 KB |
testcase_18 | AC | 49 ms
55,552 KB |
testcase_19 | AC | 48 ms
55,424 KB |
testcase_20 | AC | 48 ms
55,424 KB |
testcase_21 | AC | 48 ms
55,296 KB |
testcase_22 | AC | 49 ms
55,936 KB |
testcase_23 | AC | 49 ms
55,424 KB |
testcase_24 | AC | 48 ms
55,424 KB |
testcase_25 | AC | 51 ms
55,552 KB |
testcase_26 | AC | 50 ms
55,936 KB |
testcase_27 | AC | 48 ms
55,424 KB |
testcase_28 | AC | 48 ms
56,064 KB |
testcase_29 | AC | 49 ms
55,552 KB |
testcase_30 | AC | 47 ms
55,936 KB |
testcase_31 | AC | 48 ms
55,680 KB |
testcase_32 | AC | 65 ms
67,584 KB |
testcase_33 | AC | 60 ms
64,256 KB |
testcase_34 | AC | 62 ms
66,816 KB |
testcase_35 | AC | 47 ms
55,424 KB |
testcase_36 | AC | 52 ms
56,320 KB |
testcase_37 | AC | 48 ms
55,936 KB |
testcase_38 | AC | 48 ms
55,936 KB |
testcase_39 | AC | 47 ms
56,064 KB |
testcase_40 | AC | 48 ms
55,936 KB |
testcase_41 | AC | 49 ms
55,552 KB |
testcase_42 | AC | 47 ms
55,808 KB |
testcase_43 | AC | 47 ms
55,680 KB |
testcase_44 | AC | 51 ms
55,680 KB |
testcase_45 | AC | 48 ms
55,552 KB |
testcase_46 | AC | 47 ms
55,552 KB |
testcase_47 | AC | 48 ms
55,552 KB |
testcase_48 | AC | 46 ms
55,808 KB |
testcase_49 | AC | 46 ms
55,808 KB |
testcase_50 | AC | 49 ms
55,936 KB |
testcase_51 | AC | 49 ms
55,808 KB |
testcase_52 | AC | 56 ms
62,976 KB |
testcase_53 | AC | 48 ms
55,424 KB |
ソースコード
import sys,random from collections import deque input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) def isPrimeMR(n): if n==1: return 0 d = n - 1 d = d // (d & -d) L = [2, 3, 5, 7, 11, 13, 17] if n in L: return 1 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): from math import gcd 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 sub_solve(S): """ 総和がSの単調列の数え上げ """ dp = [0] * (S+1) dp[0] = 1 for val in range(1,S+1): ndp = [0] * (S+1) for pre_S in range(S+1): for k in range((S-pre_S)//val+1): ndp[pre_S+k*val] += dp[pre_S] dp = ndp return dp[S] def solve(N): pf = primeFactor(N) res = 1 for p in pf: res *= sub_solve(pf[p]) return res N = int(input()) print(solve(N))