結果

問題 No.634 硬貨の枚数1
ユーザー McGregorshMcGregorsh
提出日時 2023-07-05 12:13:57
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 199 ms / 2,000 ms
コード長 1,620 bytes
コンパイル時間 254 ms
コンパイル使用メモリ 82,048 KB
実行使用メモリ 88,924 KB
最終ジャッジ日時 2024-07-19 06:29:33
合計ジャッジ時間 15,354 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 149 ms
88,720 KB
testcase_01 AC 144 ms
88,320 KB
testcase_02 AC 147 ms
88,712 KB
testcase_03 AC 149 ms
88,744 KB
testcase_04 AC 149 ms
88,576 KB
testcase_05 AC 145 ms
88,732 KB
testcase_06 AC 147 ms
88,448 KB
testcase_07 AC 149 ms
88,704 KB
testcase_08 AC 149 ms
88,704 KB
testcase_09 AC 147 ms
88,356 KB
testcase_10 AC 148 ms
88,924 KB
testcase_11 AC 149 ms
88,748 KB
testcase_12 AC 148 ms
88,832 KB
testcase_13 AC 146 ms
88,704 KB
testcase_14 AC 159 ms
88,832 KB
testcase_15 AC 193 ms
88,628 KB
testcase_16 AC 165 ms
88,704 KB
testcase_17 AC 166 ms
88,704 KB
testcase_18 AC 165 ms
88,756 KB
testcase_19 AC 155 ms
88,704 KB
testcase_20 AC 160 ms
88,704 KB
testcase_21 AC 190 ms
88,576 KB
testcase_22 AC 182 ms
88,844 KB
testcase_23 AC 161 ms
88,704 KB
testcase_24 AC 149 ms
88,704 KB
testcase_25 AC 153 ms
88,704 KB
testcase_26 AC 148 ms
88,704 KB
testcase_27 AC 146 ms
88,792 KB
testcase_28 AC 147 ms
88,704 KB
testcase_29 AC 154 ms
88,832 KB
testcase_30 AC 147 ms
88,796 KB
testcase_31 AC 148 ms
88,816 KB
testcase_32 AC 147 ms
88,680 KB
testcase_33 AC 148 ms
88,576 KB
testcase_34 AC 150 ms
88,448 KB
testcase_35 AC 161 ms
88,776 KB
testcase_36 AC 173 ms
88,776 KB
testcase_37 AC 165 ms
88,704 KB
testcase_38 AC 153 ms
88,704 KB
testcase_39 AC 182 ms
88,692 KB
testcase_40 AC 171 ms
88,576 KB
testcase_41 AC 168 ms
88,832 KB
testcase_42 AC 181 ms
88,448 KB
testcase_43 AC 162 ms
88,680 KB
testcase_44 AC 147 ms
88,704 KB
testcase_45 AC 146 ms
88,448 KB
testcase_46 AC 150 ms
88,576 KB
testcase_47 AC 169 ms
88,704 KB
testcase_48 AC 146 ms
88,320 KB
testcase_49 AC 148 ms
88,780 KB
testcase_50 AC 191 ms
88,832 KB
testcase_51 AC 153 ms
88,832 KB
testcase_52 AC 146 ms
88,704 KB
testcase_53 AC 150 ms
88,812 KB
testcase_54 AC 149 ms
88,612 KB
testcase_55 AC 191 ms
88,576 KB
testcase_56 AC 187 ms
88,832 KB
testcase_57 AC 189 ms
88,704 KB
testcase_58 AC 187 ms
88,824 KB
testcase_59 AC 191 ms
88,448 KB
testcase_60 AC 193 ms
88,792 KB
testcase_61 AC 192 ms
88,812 KB
testcase_62 AC 192 ms
88,704 KB
testcase_63 AC 194 ms
88,832 KB
testcase_64 AC 194 ms
88,832 KB
testcase_65 AC 196 ms
88,548 KB
testcase_66 AC 199 ms
88,704 KB
testcase_67 AC 194 ms
88,832 KB
testcase_68 AC 195 ms
88,856 KB
testcase_69 AC 192 ms
88,704 KB
testcase_70 AC 190 ms
88,576 KB
testcase_71 AC 189 ms
88,704 KB
testcase_72 AC 189 ms
88,576 KB
testcase_73 AC 192 ms
88,832 KB
testcase_74 AC 190 ms
88,704 KB
testcase_75 AC 188 ms
88,828 KB
testcase_76 AC 145 ms
88,828 KB
testcase_77 AC 146 ms
88,668 KB
権限があれば一括ダウンロードができます

ソースコード

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

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()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0