結果
問題 | No.1450 nahco314's First Problem |
ユーザー | McGregorsh |
提出日時 | 2023-05-20 12:05:24 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 241 ms / 2,000 ms |
コード長 | 1,560 bytes |
コンパイル時間 | 270 ms |
コンパイル使用メモリ | 87,224 KB |
実行使用メモリ | 92,668 KB |
最終ジャッジ日時 | 2023-08-23 08:50:19 |
合計ジャッジ時間 | 13,313 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 241 ms
92,288 KB |
testcase_01 | AC | 236 ms
92,328 KB |
testcase_02 | AC | 232 ms
92,436 KB |
testcase_03 | AC | 235 ms
92,520 KB |
testcase_04 | AC | 235 ms
92,300 KB |
testcase_05 | AC | 235 ms
92,524 KB |
testcase_06 | AC | 237 ms
92,528 KB |
testcase_07 | AC | 235 ms
92,464 KB |
testcase_08 | AC | 235 ms
92,328 KB |
testcase_09 | AC | 233 ms
92,424 KB |
testcase_10 | AC | 238 ms
92,520 KB |
testcase_11 | AC | 237 ms
92,648 KB |
testcase_12 | AC | 235 ms
92,532 KB |
testcase_13 | AC | 235 ms
92,380 KB |
testcase_14 | AC | 237 ms
92,296 KB |
testcase_15 | AC | 240 ms
92,272 KB |
testcase_16 | AC | 239 ms
92,320 KB |
testcase_17 | AC | 238 ms
92,644 KB |
testcase_18 | AC | 235 ms
92,544 KB |
testcase_19 | AC | 238 ms
92,436 KB |
testcase_20 | AC | 238 ms
92,628 KB |
testcase_21 | AC | 235 ms
92,556 KB |
testcase_22 | AC | 237 ms
92,524 KB |
testcase_23 | AC | 235 ms
92,524 KB |
testcase_24 | AC | 236 ms
92,540 KB |
testcase_25 | AC | 233 ms
92,312 KB |
testcase_26 | AC | 232 ms
92,288 KB |
testcase_27 | AC | 234 ms
92,308 KB |
testcase_28 | AC | 238 ms
92,376 KB |
testcase_29 | AC | 238 ms
92,472 KB |
testcase_30 | AC | 233 ms
92,540 KB |
testcase_31 | AC | 234 ms
92,384 KB |
testcase_32 | AC | 238 ms
92,328 KB |
testcase_33 | AC | 236 ms
92,540 KB |
testcase_34 | AC | 232 ms
92,336 KB |
testcase_35 | AC | 232 ms
92,384 KB |
testcase_36 | AC | 233 ms
92,432 KB |
testcase_37 | AC | 236 ms
92,668 KB |
testcase_38 | AC | 235 ms
92,552 KB |
testcase_39 | AC | 235 ms
92,328 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(): X = int(input()) for i in range(1, 100): p = X ^ i if p > 2 * (10**18): continue b = format(p, 'b') if b.count('1') == i: print(p) exit() print(-1) if __name__ == '__main__': main()