結果

問題 No.129 お年玉(2)
ユーザー Coki628
提出日時 2020-10-20 02:35:35
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 1,645 ms / 5,000 ms
コード長 1,087 bytes
コンパイル時間 146 ms
コンパイル使用メモリ 82,432 KB
実行使用メモリ 96,640 KB
最終ジャッジ日時 2024-07-21 08:14:14
合計ジャッジ時間 29,536 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 46
権限があれば一括ダウンロードができます

ソースコード

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

import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c for j in range(b)] for i in range(a)]
def list3d(a, b, c, d): return [[[d for k in range(c)] for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e for l in range(d)] for k in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10**9)
INF = 10**19
MOD = 10**9 + 7
EPS = 10**-10
N = INT()
M = INT()
MOD = 10**9
N //= 1000
rest = N % M
fr = [0] * (rest+1)
to = [0] * (rest+1)
fr[0] = 1
for i in range(M):
for j in range(rest+1):
if fr[j] == 0:
break
to[j] += fr[j]
to[j] %= MOD
if j+1 <= rest:
to[j+1] += fr[j]
to[j+1] %= MOD
fr = to[:]
to = [0] * (rest+1)
ans = fr[rest]
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0