結果
問題 | No.2365 Present of good number |
ユーザー | shobonvip |
提出日時 | 2023-06-30 01:00:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 166 ms / 2,000 ms |
コード長 | 1,432 bytes |
コンパイル時間 | 1,763 ms |
コンパイル使用メモリ | 86,608 KB |
実行使用メモリ | 78,044 KB |
最終ジャッジ日時 | 2023-09-21 14:40:32 |
合計ジャッジ時間 | 8,422 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 76 ms
75,456 KB |
testcase_01 | AC | 73 ms
71,132 KB |
testcase_02 | AC | 166 ms
77,776 KB |
testcase_03 | AC | 150 ms
77,856 KB |
testcase_04 | AC | 93 ms
77,736 KB |
testcase_05 | AC | 160 ms
78,044 KB |
testcase_06 | AC | 132 ms
77,184 KB |
testcase_07 | AC | 133 ms
77,476 KB |
testcase_08 | AC | 122 ms
77,220 KB |
testcase_09 | AC | 118 ms
76,944 KB |
testcase_10 | AC | 152 ms
77,964 KB |
testcase_11 | AC | 103 ms
76,436 KB |
testcase_12 | AC | 135 ms
77,196 KB |
testcase_13 | AC | 149 ms
77,672 KB |
testcase_14 | AC | 141 ms
77,512 KB |
testcase_15 | AC | 116 ms
76,640 KB |
testcase_16 | AC | 75 ms
71,272 KB |
testcase_17 | AC | 75 ms
71,224 KB |
testcase_18 | AC | 73 ms
71,412 KB |
testcase_19 | AC | 72 ms
71,132 KB |
testcase_20 | AC | 73 ms
71,252 KB |
testcase_21 | AC | 90 ms
76,436 KB |
testcase_22 | AC | 105 ms
76,936 KB |
testcase_23 | AC | 126 ms
77,252 KB |
testcase_24 | AC | 89 ms
76,568 KB |
testcase_25 | AC | 115 ms
77,188 KB |
testcase_26 | AC | 94 ms
77,376 KB |
testcase_27 | AC | 91 ms
77,212 KB |
testcase_28 | AC | 93 ms
76,632 KB |
testcase_29 | AC | 102 ms
77,384 KB |
testcase_30 | AC | 95 ms
76,836 KB |
testcase_31 | AC | 79 ms
76,012 KB |
testcase_32 | AC | 78 ms
75,836 KB |
testcase_33 | AC | 73 ms
71,080 KB |
testcase_34 | AC | 77 ms
75,724 KB |
testcase_35 | AC | 72 ms
71,452 KB |
testcase_36 | AC | 96 ms
77,760 KB |
testcase_37 | AC | 98 ms
77,812 KB |
testcase_38 | AC | 94 ms
77,564 KB |
testcase_39 | AC | 95 ms
77,272 KB |
testcase_40 | AC | 100 ms
77,936 KB |
ソースコード
mod1 = 1000000007 mod2 = mod1 - 1 # 高々 log オーダー回のあと, 2^a * 3^b になる. # a, b を 10^9 + 6 で割った余りを保持すればよい. n, k = map(int,input().split()) mx = n + 5 p = [0] * (mx+1) dp = [0] * (mx+1) for i in range(2, mx+1): if p[i] == 0: for j in range(2*i, mx+1, i): p[j] = i dp[n] = 1 for i in range(mx,1,-1): if p[i] != 0 and dp[i] != 0: dp[i // p[i]] = (dp[i // p[i]] + dp[i]) % mod2 dp[p[i]] = (dp[p[i]] + dp[i]) % mod2 dp[i] = 0 for num in range(min(k, 70)): for i in range(mx-1,0,-1): dp[i+1] = dp[i] for i in range(mx,1,-1): if p[i] != 0 and dp[i] != 0: dp[i // p[i]] = (dp[i // p[i]] + dp[i]) % mod2 dp[p[i]] = (dp[p[i]] + dp[i]) % mod2 dp[i] = 0 k -= min(k, 70) if k >= 1: for i in range(0, mx+1): if i == 2 or i == 3: continue assert dp[i] == 0 mat = [[[0] * 2 for i in range(2)] for j in range(60)] mat[0][0][1] = 2 mat[0][1][0] = 1 ar = [dp[2], dp[3]] for num in range(59): for i in range(2): for j in range(2): for l in range(2): mat[num+1][i][j] += mat[num][i][l] * mat[num][l][j] mat[num+1][i][j] %= mod2 for num in range(60): if (k >> num & 1): nar = [0, 0] for i in range(2): for j in range(2): nar[i] += mat[num][i][j] * ar[j] nar[i] %= mod2 ar = nar dp[2] = ar[0] dp[3] = ar[1] ans = 1 for i in range(2, mx+1): if dp[i] != 0: ans *= pow(i, dp[i], mod1) ans %= mod1 print(ans)