結果
問題 | No.1674 Introduction to XOR |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 15:07:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 269 ms / 1,000 ms |
コード長 | 1,649 bytes |
コンパイル時間 | 545 ms |
コンパイル使用メモリ | 87,296 KB |
実行使用メモリ | 92,800 KB |
最終ジャッジ日時 | 2023-08-17 20:21:49 |
合計ジャッジ時間 | 8,448 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 252 ms
92,144 KB |
testcase_01 | AC | 248 ms
92,392 KB |
testcase_02 | AC | 254 ms
92,416 KB |
testcase_03 | AC | 251 ms
92,216 KB |
testcase_04 | AC | 252 ms
92,308 KB |
testcase_05 | AC | 253 ms
92,268 KB |
testcase_06 | AC | 255 ms
92,436 KB |
testcase_07 | AC | 252 ms
92,376 KB |
testcase_08 | AC | 253 ms
92,424 KB |
testcase_09 | AC | 252 ms
92,436 KB |
testcase_10 | AC | 249 ms
92,224 KB |
testcase_11 | AC | 251 ms
92,400 KB |
testcase_12 | AC | 257 ms
92,308 KB |
testcase_13 | AC | 258 ms
92,228 KB |
testcase_14 | AC | 255 ms
92,768 KB |
testcase_15 | AC | 255 ms
92,800 KB |
testcase_16 | AC | 257 ms
92,136 KB |
testcase_17 | AC | 269 ms
92,612 KB |
testcase_18 | AC | 259 ms
92,724 KB |
testcase_19 | AC | 258 ms
92,612 KB |
testcase_20 | AC | 258 ms
92,604 KB |
testcase_21 | AC | 259 ms
92,288 KB |
testcase_22 | AC | 261 ms
92,616 KB |
testcase_23 | AC | 262 ms
92,688 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 = int(input()) A = i_list() count = [0] * 70 for i in range(N): p = format(A[i], 'b').zfill(70)[::-1] for j in range(len(p)): if p[j] == '0': count[j] += 1 for i in range(70): if count[i] == N: print(2 ** i) exit() if __name__ == '__main__': main()