結果
問題 | No.1674 Introduction to XOR |
ユーザー |
|
提出日時 | 2023-05-10 15:07:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 150 ms / 1,000 ms |
コード長 | 1,649 bytes |
コンパイル時間 | 316 ms |
コンパイル使用メモリ | 82,212 KB |
実行使用メモリ | 89,984 KB |
最終ジャッジ日時 | 2024-11-26 20:32:44 |
合計ジャッジ時間 | 5,093 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 149 ms
89,496 KB |
testcase_01 | AC | 145 ms
89,532 KB |
testcase_02 | AC | 144 ms
89,420 KB |
testcase_03 | AC | 146 ms
89,580 KB |
testcase_04 | AC | 147 ms
89,608 KB |
testcase_05 | AC | 149 ms
89,740 KB |
testcase_06 | AC | 145 ms
89,456 KB |
testcase_07 | AC | 147 ms
89,652 KB |
testcase_08 | AC | 147 ms
89,628 KB |
testcase_09 | AC | 145 ms
89,612 KB |
testcase_10 | AC | 146 ms
89,516 KB |
testcase_11 | AC | 147 ms
89,336 KB |
testcase_12 | AC | 145 ms
89,548 KB |
testcase_13 | AC | 144 ms
89,984 KB |
testcase_14 | AC | 145 ms
89,512 KB |
testcase_15 | AC | 147 ms
89,720 KB |
testcase_16 | AC | 146 ms
89,532 KB |
testcase_17 | AC | 147 ms
89,532 KB |
testcase_18 | AC | 146 ms
89,644 KB |
testcase_19 | AC | 148 ms
89,704 KB |
testcase_20 | AC | 150 ms
89,892 KB |
testcase_21 | AC | 146 ms
89,508 KB |
testcase_22 | AC | 147 ms
89,720 KB |
testcase_23 | AC | 146 ms
89,368 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()