#697734 (Python3) No.1674 Introduction to XOR

• 問題: No.1674 Introduction to XOR
• ユーザー: ansain
• 提出日時: 2021-09-10 21:27:58
• 言語: Python3 (3.12.2 + numpy 1.26.4 + scipy 1.12.0)
• 結果: AC
• 実行時間: 21 ms / 1,000 ms
• コード長: 1,353 bytes
• コンパイル時間: 211 ms
• コンパイル使用メモリ: 10,884 KB
• 実行使用メモリ: 8,876 KB
• 最終ジャッジ日時: 2023-09-02 15:55:13
• 合計ジャッジ時間: 2,018 ms
• ジャッジサーバーID （参考情報）: judge11 / judge15

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	20 ms; 8,736 KB
testcase_01	AC	20 ms; 8,876 KB
testcase_02	AC	20 ms; 8,816 KB
testcase_03	AC	20 ms; 8,760 KB
testcase_04	AC	20 ms; 8,804 KB
testcase_05	AC	21 ms; 8,752 KB
testcase_06	AC	20 ms; 8,704 KB
testcase_07	AC	20 ms; 8,704 KB
testcase_08	AC	20 ms; 8,844 KB
testcase_09	AC	20 ms; 8,660 KB
testcase_10	AC	20 ms; 8,704 KB
testcase_11	AC	20 ms; 8,852 KB
testcase_12	AC	21 ms; 8,704 KB
testcase_13	AC	20 ms; 8,844 KB
testcase_14	AC	21 ms; 8,752 KB
testcase_15	AC	20 ms; 8,732 KB
testcase_16	AC	20 ms; 8,764 KB
testcase_17	AC	20 ms; 8,736 KB
testcase_18	AC	20 ms; 8,664 KB
testcase_19	AC	20 ms; 8,844 KB
testcase_20	AC	20 ms; 8,732 KB
testcase_21	AC	20 ms; 8,756 KB
testcase_22	AC	20 ms; 8,764 KB
testcase_23	AC	20 ms; 8,708 KB

ソースコード

import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
from math import sqrt, gcd, factorial
#from math import isqrt, prod, comb  #python3.8用(notpypy)
#from bisect import bisect_left, bisect_right
from functools import lru_cache, reduce
#from heapq import heappush, heappop, heapify, heappushpop, heapreplace
#import numpy as np
#import networkx as nx
#from networkx.utils import UnionFind
#from numba import njit, b1, i1, i4, i8, f8
#numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
#from scipy.sparse import csr_matrix
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, NegativeCycleError, maximum_bipartite_matching, maximum_flow, minimum_spanning_tree
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す
def yn(hantei, yes='Yes', no='No'): print(yes if hantei else no)


def main():
    mod = 10**9+7
    mod2 = 998244353
    n=int(input())
    A=list(map(int, input().split()))
    AA=reduce(operator.or_,A)
    for i in range(100):
        if AA!=operator.or_(AA,2**i):
            print(2**i)
            return



if __name__ == '__main__':
    main()