結果
問題 | No.1973 Divisor Sequence |
ユーザー | mkawa2 |
提出日時 | 2023-03-18 21:22:42 |
言語 | PyPy3 (7.3.15) |
結果 |
TLE
|
実行時間 | - |
コード長 | 1,891 bytes |
コンパイル時間 | 396 ms |
コンパイル使用メモリ | 82,096 KB |
実行使用メモリ | 464,256 KB |
最終ジャッジ日時 | 2024-09-18 13:35:31 |
合計ジャッジ時間 | 7,531 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 37 ms
60,112 KB |
testcase_01 | AC | 36 ms
52,932 KB |
testcase_02 | AC | 58 ms
70,060 KB |
testcase_03 | AC | 48 ms
62,660 KB |
testcase_04 | AC | 55 ms
69,392 KB |
testcase_05 | AC | 45 ms
59,252 KB |
testcase_06 | AC | 47 ms
63,068 KB |
testcase_07 | AC | 49 ms
62,360 KB |
testcase_08 | AC | 57 ms
63,232 KB |
testcase_09 | AC | 55 ms
68,524 KB |
testcase_10 | AC | 57 ms
66,620 KB |
testcase_11 | AC | 53 ms
69,052 KB |
testcase_12 | AC | 54 ms
62,852 KB |
testcase_13 | AC | 46 ms
62,844 KB |
testcase_14 | TLE | - |
testcase_15 | AC | 58 ms
68,308 KB |
testcase_16 | AC | 54 ms
68,524 KB |
testcase_17 | AC | 58 ms
66,816 KB |
testcase_18 | AC | 98 ms
76,356 KB |
testcase_19 | AC | 59 ms
64,768 KB |
testcase_20 | AC | 57 ms
67,584 KB |
testcase_21 | AC | 56 ms
62,592 KB |
testcase_22 | AC | 54 ms
68,608 KB |
testcase_23 | AC | 104 ms
76,544 KB |
testcase_24 | TLE | - |
ソースコード
import sys # sys.setrecursionlimit(200005) 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 # 行列累乗バージョン def factors(a): if a <= 0: return [0] dd0, dd1 = [], [] for d in range(1, round(a**0.5)+1): if a%d: continue dd0.append(d) dd1.append(a//d) if dd0[-1] == dd1[-1]: dd1.pop() return dd0+dd1[::-1] def dot(aa, bb): h = len(aa) w = len(bb[0]) res = [[0]*w for _ in range(h)] for j, col in enumerate(zip(*bb)): for i in range(h): v = 0 # for a, b in zip(row, col): v += a*b # res[i][j] = v for a, b in zip(aa[i], col): v += a*b%md v %= md res[i][j] = v return res def matpow(mat, e): n = len(mat) res = [[1 if i == j else 0 for j in range(n)] for i in range(n)] while e: if e & 1: res = dot(res, mat) mat = dot(mat, mat) e >>= 1 return res n, m = LI() ff = factors(m) fn = len(ff) mat = [[0]*fn for _ in range(fn)] for i in range(fn): for j in range(fn): if m//ff[i]%ff[j] == 0: mat[i][j] = 1 mat = matpow(mat, n-1) ans = 0 for row in mat: for a in row: ans += a ans %= md print(ans)