結果
問題 | No.1250 汝は倍数なりや? |
ユーザー | McGregorsh |
提出日時 | 2023-05-09 12:37:17 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 203 ms / 1,000 ms |
コード長 | 1,536 bytes |
コンパイル時間 | 362 ms |
コンパイル使用メモリ | 81,840 KB |
実行使用メモリ | 120,576 KB |
最終ジャッジ日時 | 2024-05-04 12:46:59 |
合計ジャッジ時間 | 10,718 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 148 ms
89,280 KB |
testcase_01 | AC | 147 ms
88,960 KB |
testcase_02 | AC | 150 ms
89,216 KB |
testcase_03 | AC | 151 ms
89,472 KB |
testcase_04 | AC | 148 ms
89,216 KB |
testcase_05 | AC | 144 ms
89,344 KB |
testcase_06 | AC | 147 ms
89,344 KB |
testcase_07 | AC | 146 ms
89,368 KB |
testcase_08 | AC | 147 ms
89,216 KB |
testcase_09 | AC | 152 ms
89,344 KB |
testcase_10 | AC | 151 ms
89,216 KB |
testcase_11 | AC | 149 ms
89,472 KB |
testcase_12 | AC | 149 ms
88,960 KB |
testcase_13 | AC | 146 ms
89,568 KB |
testcase_14 | AC | 149 ms
89,344 KB |
testcase_15 | AC | 150 ms
89,320 KB |
testcase_16 | AC | 150 ms
88,916 KB |
testcase_17 | AC | 146 ms
89,216 KB |
testcase_18 | AC | 148 ms
88,896 KB |
testcase_19 | AC | 145 ms
89,376 KB |
testcase_20 | AC | 147 ms
89,580 KB |
testcase_21 | AC | 154 ms
89,340 KB |
testcase_22 | AC | 149 ms
89,216 KB |
testcase_23 | AC | 150 ms
89,296 KB |
testcase_24 | AC | 149 ms
89,344 KB |
testcase_25 | AC | 146 ms
89,216 KB |
testcase_26 | AC | 152 ms
89,472 KB |
testcase_27 | AC | 153 ms
89,280 KB |
testcase_28 | AC | 151 ms
89,344 KB |
testcase_29 | AC | 149 ms
88,960 KB |
testcase_30 | AC | 153 ms
88,960 KB |
testcase_31 | AC | 147 ms
89,344 KB |
testcase_32 | AC | 149 ms
89,344 KB |
testcase_33 | AC | 203 ms
120,576 KB |
testcase_34 | AC | 171 ms
103,296 KB |
testcase_35 | AC | 190 ms
113,792 KB |
testcase_36 | AC | 193 ms
116,992 KB |
testcase_37 | AC | 176 ms
103,296 KB |
testcase_38 | AC | 184 ms
105,600 KB |
testcase_39 | AC | 178 ms
103,424 KB |
testcase_40 | AC | 175 ms
103,440 KB |
testcase_41 | AC | 181 ms
108,340 KB |
testcase_42 | AC | 170 ms
98,176 KB |
testcase_43 | AC | 192 ms
116,736 KB |
testcase_44 | AC | 170 ms
98,524 KB |
testcase_45 | AC | 194 ms
117,276 KB |
testcase_46 | AC | 160 ms
94,848 KB |
testcase_47 | AC | 178 ms
105,344 KB |
testcase_48 | AC | 151 ms
89,288 KB |
testcase_49 | AC | 151 ms
89,216 KB |
testcase_50 | AC | 148 ms
89,216 KB |
testcase_51 | AC | 150 ms
89,344 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()