結果
問題 | No.1250 汝は倍数なりや? |
ユーザー | McGregorsh |
提出日時 | 2023-05-09 12:37:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 289 ms / 1,000 ms |
コード長 | 1,536 bytes |
コンパイル時間 | 454 ms |
コンパイル使用メモリ | 86,976 KB |
実行使用メモリ | 119,956 KB |
最終ジャッジ日時 | 2023-08-17 05:51:47 |
合計ジャッジ時間 | 15,788 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 239 ms
92,380 KB |
testcase_01 | AC | 237 ms
92,524 KB |
testcase_02 | AC | 240 ms
92,572 KB |
testcase_03 | AC | 243 ms
92,280 KB |
testcase_04 | AC | 240 ms
92,544 KB |
testcase_05 | AC | 243 ms
92,548 KB |
testcase_06 | AC | 243 ms
92,376 KB |
testcase_07 | AC | 241 ms
92,588 KB |
testcase_08 | AC | 242 ms
92,588 KB |
testcase_09 | AC | 241 ms
92,324 KB |
testcase_10 | AC | 244 ms
92,540 KB |
testcase_11 | AC | 236 ms
92,544 KB |
testcase_12 | AC | 242 ms
92,540 KB |
testcase_13 | AC | 241 ms
92,388 KB |
testcase_14 | AC | 240 ms
92,288 KB |
testcase_15 | AC | 243 ms
92,472 KB |
testcase_16 | AC | 240 ms
92,512 KB |
testcase_17 | AC | 240 ms
92,488 KB |
testcase_18 | AC | 244 ms
92,304 KB |
testcase_19 | AC | 243 ms
92,372 KB |
testcase_20 | AC | 240 ms
92,392 KB |
testcase_21 | AC | 240 ms
92,484 KB |
testcase_22 | AC | 238 ms
92,588 KB |
testcase_23 | AC | 241 ms
92,256 KB |
testcase_24 | AC | 238 ms
92,432 KB |
testcase_25 | AC | 239 ms
92,384 KB |
testcase_26 | AC | 238 ms
92,528 KB |
testcase_27 | AC | 241 ms
92,260 KB |
testcase_28 | AC | 235 ms
92,424 KB |
testcase_29 | AC | 240 ms
92,480 KB |
testcase_30 | AC | 245 ms
92,388 KB |
testcase_31 | AC | 245 ms
92,260 KB |
testcase_32 | AC | 241 ms
92,572 KB |
testcase_33 | AC | 289 ms
119,956 KB |
testcase_34 | AC | 270 ms
107,728 KB |
testcase_35 | AC | 281 ms
114,336 KB |
testcase_36 | AC | 279 ms
115,620 KB |
testcase_37 | AC | 265 ms
107,792 KB |
testcase_38 | AC | 268 ms
110,156 KB |
testcase_39 | AC | 258 ms
107,508 KB |
testcase_40 | AC | 257 ms
107,912 KB |
testcase_41 | AC | 268 ms
112,616 KB |
testcase_42 | AC | 256 ms
102,836 KB |
testcase_43 | AC | 282 ms
115,256 KB |
testcase_44 | AC | 253 ms
102,884 KB |
testcase_45 | AC | 281 ms
115,364 KB |
testcase_46 | AC | 251 ms
99,356 KB |
testcase_47 | AC | 263 ms
109,960 KB |
testcase_48 | AC | 241 ms
92,300 KB |
testcase_49 | AC | 238 ms
92,436 KB |
testcase_50 | AC | 239 ms
92,300 KB |
testcase_51 | AC | 243 ms
92,540 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(): N, H = i_map() A = i_list() now = A[0] for i in range(1, N): now *= A[i] now %= H if now == 0 or now == H: print('YES') else: print('NO') if __name__ == '__main__': main()