結果
問題 | No.639 An Ordinary Sequence |
ユーザー | McGregorsh |
提出日時 | 2022-11-02 14:30:11 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 210 ms / 1,000 ms |
コード長 | 1,551 bytes |
コンパイル時間 | 311 ms |
コンパイル使用メモリ | 86,928 KB |
実行使用メモリ | 92,536 KB |
最終ジャッジ日時 | 2023-09-24 03:45:40 |
合計ジャッジ時間 | 5,910 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 210 ms
92,500 KB |
testcase_01 | AC | 209 ms
92,192 KB |
testcase_02 | AC | 209 ms
92,176 KB |
testcase_03 | AC | 210 ms
92,324 KB |
testcase_04 | AC | 201 ms
92,244 KB |
testcase_05 | AC | 199 ms
92,452 KB |
testcase_06 | AC | 206 ms
92,280 KB |
testcase_07 | AC | 197 ms
92,300 KB |
testcase_08 | AC | 200 ms
92,256 KB |
testcase_09 | AC | 198 ms
92,536 KB |
testcase_10 | AC | 204 ms
92,440 KB |
testcase_11 | AC | 202 ms
92,020 KB |
testcase_12 | AC | 203 ms
92,424 KB |
testcase_13 | AC | 208 ms
92,248 KB |
testcase_14 | AC | 201 ms
92,260 KB |
testcase_15 | AC | 207 ms
92,320 KB |
testcase_16 | AC | 205 ms
92,356 KB |
testcase_17 | AC | 205 ms
92,472 KB |
testcase_18 | AC | 203 ms
92,260 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, lru_cache 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()) @lru_cache(maxsize=256) def dfs(x): if x == 0: return 1 return dfs(x//3) + dfs(x//5) print(dfs(N)) if __name__ == '__main__': main()