結果

問題 No.1581 Multiple Sequence
ユーザー FromBooska
提出日時 2023-10-11 12:55:29
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 556 ms / 2,000 ms
コード長 1,291 bytes
コンパイル時間 264 ms
コンパイル使用メモリ 82,156 KB
実行使用メモリ 76,896 KB
最終ジャッジ日時 2024-09-13 11:42:35
合計ジャッジ時間 8,394 ms
ジャッジサーバーID
(参考情報)
judge3 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 21
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# 1dp
# dp[i] i1
# dp[1] = 1 for [1]
# dp[2] = 2 for [1, 1] and [2]
# dp[3] = 3 for [1, 1, 1], [1, 2], and [3]
# dp[4] = 5 for [1, 1, 1, 1], [1, 1, 2], [1, 3], [2, 2] and [4]
# dp[5] = 6 for [1, 1, 1, 1, 1], [1, 1, 1, 2], [1, 1, 3], [1, 2, 2], [1, 4], [5]
#
# 1ij
# jjj112i//j-1
# dp[i//j-1]
def divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
M = int(input())
mod = 10**9+7
dp = [0]*(max(10, M)+1)
dp[0] = 1 # i1
dp[1] = 1
dp[2] = 2
dp[3] = 3
dp[4] = 5
dp[5] = 6
for i in range(6, M+1):
divs = divisors(i)
for j in divs:
dp[i] += dp[i//j-1]
dp[i] %= mod
#print(dp)
ans = dp[M]
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0