結果
問題 | No.1450 nahco314's First Problem |
ユーザー | McGregorsh |
提出日時 | 2022-07-19 08:33:54 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,580 bytes |
コンパイル時間 | 417 ms |
コンパイル使用メモリ | 82,536 KB |
実行使用メモリ | 90,272 KB |
最終ジャッジ日時 | 2024-04-26 02:11:47 |
合計ジャッジ時間 | 9,688 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 142 ms
89,308 KB |
testcase_01 | AC | 141 ms
89,728 KB |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | AC | 147 ms
89,364 KB |
testcase_05 | AC | 146 ms
89,588 KB |
testcase_06 | AC | 141 ms
89,508 KB |
testcase_07 | AC | 142 ms
89,632 KB |
testcase_08 | AC | 143 ms
89,676 KB |
testcase_09 | AC | 143 ms
89,636 KB |
testcase_10 | AC | 146 ms
90,040 KB |
testcase_11 | AC | 142 ms
89,676 KB |
testcase_12 | AC | 141 ms
89,428 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 139 ms
89,280 KB |
testcase_16 | AC | 142 ms
89,576 KB |
testcase_17 | AC | 143 ms
89,752 KB |
testcase_18 | AC | 140 ms
89,560 KB |
testcase_19 | AC | 142 ms
89,676 KB |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | AC | 138 ms
89,688 KB |
testcase_23 | AC | 145 ms
89,360 KB |
testcase_24 | AC | 142 ms
89,736 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | AC | 139 ms
89,676 KB |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 141 ms
89,856 KB |
testcase_32 | WA | - |
testcase_33 | AC | 145 ms
89,308 KB |
testcase_34 | AC | 142 ms
89,756 KB |
testcase_35 | AC | 142 ms
89,772 KB |
testcase_36 | AC | 140 ms
89,540 KB |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | AC | 143 ms
89,696 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(): x = int(input()) point = max(x - 100, 0) for i in range(point, point+100): num = format(i, 'b') score = num.count('1') if i ^ score == x: print(i) exit() print(-1) if __name__ == '__main__': main()