結果
問題 | No.634 硬貨の枚数1 |
ユーザー | McGregorsh |
提出日時 | 2023-07-05 12:13:57 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 298 ms / 2,000 ms |
コード長 | 1,620 bytes |
コンパイル時間 | 498 ms |
コンパイル使用メモリ | 87,048 KB |
実行使用メモリ | 90,952 KB |
最終ジャッジ日時 | 2023-09-26 11:54:59 |
合計ジャッジ時間 | 24,596 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 245 ms
90,424 KB |
testcase_01 | AC | 244 ms
89,968 KB |
testcase_02 | AC | 240 ms
90,556 KB |
testcase_03 | AC | 242 ms
90,512 KB |
testcase_04 | AC | 247 ms
90,620 KB |
testcase_05 | AC | 242 ms
90,496 KB |
testcase_06 | AC | 242 ms
90,512 KB |
testcase_07 | AC | 246 ms
90,488 KB |
testcase_08 | AC | 249 ms
90,660 KB |
testcase_09 | AC | 245 ms
90,520 KB |
testcase_10 | AC | 246 ms
90,612 KB |
testcase_11 | AC | 247 ms
90,760 KB |
testcase_12 | AC | 247 ms
90,704 KB |
testcase_13 | AC | 247 ms
90,756 KB |
testcase_14 | AC | 252 ms
90,600 KB |
testcase_15 | AC | 286 ms
90,520 KB |
testcase_16 | AC | 268 ms
90,600 KB |
testcase_17 | AC | 269 ms
90,524 KB |
testcase_18 | AC | 266 ms
90,504 KB |
testcase_19 | AC | 253 ms
90,520 KB |
testcase_20 | AC | 257 ms
90,664 KB |
testcase_21 | AC | 287 ms
90,704 KB |
testcase_22 | AC | 283 ms
90,504 KB |
testcase_23 | AC | 263 ms
90,496 KB |
testcase_24 | AC | 245 ms
90,712 KB |
testcase_25 | AC | 251 ms
90,504 KB |
testcase_26 | AC | 248 ms
90,548 KB |
testcase_27 | AC | 241 ms
90,500 KB |
testcase_28 | AC | 243 ms
90,504 KB |
testcase_29 | AC | 247 ms
90,740 KB |
testcase_30 | AC | 247 ms
90,644 KB |
testcase_31 | AC | 251 ms
90,804 KB |
testcase_32 | AC | 248 ms
90,540 KB |
testcase_33 | AC | 252 ms
90,624 KB |
testcase_34 | AC | 251 ms
90,560 KB |
testcase_35 | AC | 257 ms
90,868 KB |
testcase_36 | AC | 268 ms
90,764 KB |
testcase_37 | AC | 268 ms
90,540 KB |
testcase_38 | AC | 249 ms
90,676 KB |
testcase_39 | AC | 279 ms
90,556 KB |
testcase_40 | AC | 271 ms
90,712 KB |
testcase_41 | AC | 266 ms
90,556 KB |
testcase_42 | AC | 273 ms
90,452 KB |
testcase_43 | AC | 254 ms
90,704 KB |
testcase_44 | AC | 241 ms
90,408 KB |
testcase_45 | AC | 268 ms
90,848 KB |
testcase_46 | AC | 244 ms
90,668 KB |
testcase_47 | AC | 268 ms
90,660 KB |
testcase_48 | AC | 241 ms
89,988 KB |
testcase_49 | AC | 241 ms
90,644 KB |
testcase_50 | AC | 284 ms
90,616 KB |
testcase_51 | AC | 249 ms
90,528 KB |
testcase_52 | AC | 241 ms
90,872 KB |
testcase_53 | AC | 242 ms
90,664 KB |
testcase_54 | AC | 251 ms
90,552 KB |
testcase_55 | AC | 291 ms
90,932 KB |
testcase_56 | AC | 293 ms
90,440 KB |
testcase_57 | AC | 293 ms
90,952 KB |
testcase_58 | AC | 291 ms
90,612 KB |
testcase_59 | AC | 298 ms
90,676 KB |
testcase_60 | AC | 290 ms
90,664 KB |
testcase_61 | AC | 291 ms
90,680 KB |
testcase_62 | AC | 288 ms
90,812 KB |
testcase_63 | AC | 289 ms
90,620 KB |
testcase_64 | AC | 291 ms
90,716 KB |
testcase_65 | AC | 290 ms
90,712 KB |
testcase_66 | AC | 294 ms
90,860 KB |
testcase_67 | AC | 296 ms
90,776 KB |
testcase_68 | AC | 291 ms
90,548 KB |
testcase_69 | AC | 289 ms
90,500 KB |
testcase_70 | AC | 292 ms
90,504 KB |
testcase_71 | AC | 289 ms
90,616 KB |
testcase_72 | AC | 291 ms
90,484 KB |
testcase_73 | AC | 292 ms
90,536 KB |
testcase_74 | AC | 289 ms
90,712 KB |
testcase_75 | AC | 286 ms
90,776 KB |
testcase_76 | AC | 243 ms
90,672 KB |
testcase_77 | AC | 236 ms
90,592 KB |
ソースコード
import sys from sys import stdin from fractions import Fraction import math 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(stdin.readline()) def i_map(): return map(int, stdin.readline().split()) def i_list(): return list(i_map()) def s_input(): return stdin.readline()[:-1] def s_map(): return s_input().split() def s_list(): return list(s_map()) 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 alpa = 'abcdefghijklmnopqrstuvwxyz' ALPA = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' def main(): N = int(input()) if N == 1: print(1) exit() nums = [1] for i in range(2, 6000): p = nums[-1] + i nums.append(p) if p == N: print(1) exit() for i in nums: for j in nums: c = i + j if c == N: print(2) exit() if c > N: break print(3) if __name__ == '__main__': main()