結果
問題 | No.1569 Nixoracci's Number |
ユーザー | McGregorsh |
提出日時 | 2022-07-21 09:19:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 261 ms / 2,000 ms |
コード長 | 1,521 bytes |
コンパイル時間 | 695 ms |
コンパイル使用メモリ | 86,772 KB |
実行使用メモリ | 92,420 KB |
最終ジャッジ日時 | 2023-09-15 12:09:19 |
合計ジャッジ時間 | 8,690 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 252 ms
92,148 KB |
testcase_01 | AC | 245 ms
92,216 KB |
testcase_02 | AC | 248 ms
92,168 KB |
testcase_03 | AC | 246 ms
92,128 KB |
testcase_04 | AC | 244 ms
92,208 KB |
testcase_05 | AC | 242 ms
92,216 KB |
testcase_06 | AC | 242 ms
92,208 KB |
testcase_07 | AC | 243 ms
92,168 KB |
testcase_08 | AC | 245 ms
92,420 KB |
testcase_09 | AC | 242 ms
92,332 KB |
testcase_10 | AC | 252 ms
92,200 KB |
testcase_11 | AC | 242 ms
92,156 KB |
testcase_12 | AC | 247 ms
91,916 KB |
testcase_13 | AC | 245 ms
92,112 KB |
testcase_14 | AC | 245 ms
92,196 KB |
testcase_15 | AC | 245 ms
92,164 KB |
testcase_16 | AC | 244 ms
92,296 KB |
testcase_17 | AC | 246 ms
92,144 KB |
testcase_18 | AC | 247 ms
92,184 KB |
testcase_19 | AC | 261 ms
92,012 KB |
testcase_20 | AC | 246 ms
92,288 KB |
testcase_21 | AC | 245 ms
92,080 KB |
testcase_22 | AC | 241 ms
91,988 KB |
testcase_23 | AC | 248 ms
92,100 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 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, k = i_map() A = i_list() cou = 0 for i in range(n): cou ^= A[i] A.append(cou) point = k % (n+1) print(A[point-1]) if __name__ == '__main__': main()