結果
問題 | No.2016 Countdown Divisors |
ユーザー | McGregorsh |
提出日時 | 2022-07-22 22:02:47 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 471 ms / 2,000 ms |
コード長 | 1,528 bytes |
コンパイル時間 | 808 ms |
コンパイル使用メモリ | 86,868 KB |
実行使用メモリ | 94,168 KB |
最終ジャッジ日時 | 2023-09-17 10:05:21 |
合計ジャッジ時間 | 10,570 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 251 ms
92,160 KB |
testcase_01 | AC | 471 ms
94,020 KB |
testcase_02 | AC | 471 ms
93,820 KB |
testcase_03 | AC | 451 ms
93,616 KB |
testcase_04 | AC | 426 ms
93,796 KB |
testcase_05 | AC | 423 ms
94,000 KB |
testcase_06 | AC | 329 ms
94,140 KB |
testcase_07 | AC | 326 ms
94,132 KB |
testcase_08 | AC | 469 ms
93,532 KB |
testcase_09 | AC | 465 ms
94,076 KB |
testcase_10 | AC | 471 ms
93,980 KB |
testcase_11 | AC | 468 ms
93,620 KB |
testcase_12 | AC | 468 ms
93,816 KB |
testcase_13 | AC | 460 ms
94,168 KB |
testcase_14 | AC | 455 ms
93,836 KB |
testcase_15 | AC | 448 ms
93,804 KB |
testcase_16 | AC | 463 ms
93,980 KB |
testcase_17 | AC | 454 ms
93,792 KB |
testcase_18 | AC | 457 ms
94,088 KB |
testcase_19 | AC | 245 ms
92,352 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 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(): t = int(input()) one = [1, 3, 4, 5, 7, 8] for i in range(t): n = int(input()) if n not in one: print(2) else: print(1) if __name__ == '__main__': main()