結果
問題 | No.741 AscNumber(Easy) |
ユーザー | McGregorsh |
提出日時 | 2022-11-10 09:04:40 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,995 ms / 2,000 ms |
コード長 | 1,671 bytes |
コンパイル時間 | 528 ms |
コンパイル使用メモリ | 86,440 KB |
実行使用メモリ | 244,036 KB |
最終ジャッジ日時 | 2023-09-30 18:29:57 |
合計ジャッジ時間 | 38,793 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 240 ms
91,940 KB |
testcase_01 | AC | 237 ms
92,252 KB |
testcase_02 | AC | 238 ms
92,040 KB |
testcase_03 | AC | 240 ms
92,060 KB |
testcase_04 | AC | 236 ms
92,200 KB |
testcase_05 | AC | 239 ms
92,076 KB |
testcase_06 | AC | 239 ms
92,212 KB |
testcase_07 | AC | 239 ms
92,076 KB |
testcase_08 | AC | 239 ms
92,068 KB |
testcase_09 | AC | 241 ms
92,224 KB |
testcase_10 | AC | 326 ms
93,100 KB |
testcase_11 | AC | 240 ms
93,044 KB |
testcase_12 | AC | 242 ms
93,020 KB |
testcase_13 | AC | 245 ms
93,220 KB |
testcase_14 | AC | 243 ms
93,320 KB |
testcase_15 | AC | 240 ms
93,200 KB |
testcase_16 | AC | 242 ms
93,320 KB |
testcase_17 | AC | 242 ms
93,148 KB |
testcase_18 | AC | 244 ms
93,128 KB |
testcase_19 | AC | 244 ms
93,340 KB |
testcase_20 | AC | 244 ms
93,340 KB |
testcase_21 | AC | 244 ms
93,028 KB |
testcase_22 | AC | 244 ms
93,164 KB |
testcase_23 | AC | 242 ms
93,044 KB |
testcase_24 | AC | 245 ms
93,152 KB |
testcase_25 | AC | 244 ms
93,276 KB |
testcase_26 | AC | 244 ms
93,088 KB |
testcase_27 | AC | 242 ms
93,328 KB |
testcase_28 | AC | 245 ms
93,200 KB |
testcase_29 | AC | 241 ms
93,276 KB |
testcase_30 | AC | 247 ms
93,108 KB |
testcase_31 | AC | 245 ms
93,336 KB |
testcase_32 | AC | 244 ms
93,180 KB |
testcase_33 | AC | 249 ms
93,376 KB |
testcase_34 | AC | 245 ms
93,084 KB |
testcase_35 | AC | 1,934 ms
236,644 KB |
testcase_36 | AC | 991 ms
155,916 KB |
testcase_37 | AC | 1,107 ms
167,208 KB |
testcase_38 | AC | 1,094 ms
165,916 KB |
testcase_39 | AC | 957 ms
154,776 KB |
testcase_40 | AC | 1,203 ms
176,920 KB |
testcase_41 | AC | 1,769 ms
224,104 KB |
testcase_42 | AC | 1,057 ms
162,944 KB |
testcase_43 | AC | 836 ms
143,492 KB |
testcase_44 | AC | 1,424 ms
196,284 KB |
testcase_45 | AC | 1,538 ms
204,048 KB |
testcase_46 | AC | 1,827 ms
229,960 KB |
testcase_47 | AC | 520 ms
116,556 KB |
testcase_48 | AC | 1,826 ms
230,012 KB |
testcase_49 | AC | 1,570 ms
207,260 KB |
testcase_50 | AC | 428 ms
108,692 KB |
testcase_51 | AC | 852 ms
146,216 KB |
testcase_52 | AC | 1,981 ms
244,036 KB |
testcase_53 | AC | 1,989 ms
243,944 KB |
testcase_54 | AC | 1,995 ms
242,160 KB |
ソースコード
import sys, re from fractions import Fraction from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext, ROUND_HALF_UP def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 ###関数コピーしたか?### def main(): N = int(input()) dp = [[0] * 10 for i in range(N+1)] dp[0][0] = 1 for i in range(N): for j in range(10): for k in range(10): if j + k < 10: dp[i+1][j+k] += dp[i][j] dp[i+1][j+k] %= MOD print(sum(dp[-1]) % MOD) if __name__ == '__main__': main()