結果
問題 | No.842 初詣 |
ユーザー | McGregorsh |
提出日時 | 2023-04-13 13:51:02 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 177 ms / 2,000 ms |
コード長 | 1,769 bytes |
コンパイル時間 | 202 ms |
コンパイル使用メモリ | 82,176 KB |
実行使用メモリ | 90,240 KB |
最終ジャッジ日時 | 2024-04-17 17:41:59 |
合計ジャッジ時間 | 4,907 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 158 ms
89,444 KB |
testcase_01 | AC | 167 ms
89,472 KB |
testcase_02 | AC | 162 ms
89,472 KB |
testcase_03 | AC | 173 ms
90,112 KB |
testcase_04 | AC | 166 ms
90,016 KB |
testcase_05 | AC | 175 ms
90,112 KB |
testcase_06 | AC | 161 ms
89,876 KB |
testcase_07 | AC | 176 ms
90,240 KB |
testcase_08 | AC | 164 ms
89,868 KB |
testcase_09 | AC | 175 ms
90,112 KB |
testcase_10 | AC | 169 ms
89,856 KB |
testcase_11 | AC | 163 ms
89,472 KB |
testcase_12 | AC | 167 ms
89,936 KB |
testcase_13 | AC | 177 ms
90,112 KB |
testcase_14 | AC | 168 ms
90,136 KB |
testcase_15 | AC | 173 ms
89,856 KB |
testcase_16 | AC | 165 ms
89,856 KB |
testcase_17 | AC | 171 ms
89,984 KB |
testcase_18 | AC | 166 ms
89,856 KB |
testcase_19 | AC | 175 ms
90,240 KB |
testcase_20 | AC | 163 ms
90,212 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(): A, B, C, D, E, F, G = i_map() for i in range(A+1): for j in range(B+1): for k in range(C+1): for l in range(D+1): for m in range(E+1): for n in range(F+1): cost = i * 500 + j * 100 + k * 50 + l * 10 + m * 5 + n if cost == G: print('YES') exit() print('NO') if __name__ == '__main__': main()