結果
問題 | No.1957 Xor Min |
ユーザー | McGregorsh |
提出日時 | 2022-07-28 23:48:49 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,556 bytes |
コンパイル時間 | 299 ms |
コンパイル使用メモリ | 86,828 KB |
実行使用メモリ | 92,416 KB |
最終ジャッジ日時 | 2023-09-25 18:11:52 |
合計ジャッジ時間 | 8,962 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 231 ms
92,400 KB |
testcase_01 | AC | 232 ms
92,344 KB |
testcase_02 | AC | 235 ms
92,116 KB |
testcase_03 | AC | 229 ms
92,368 KB |
testcase_04 | AC | 227 ms
92,380 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | AC | 232 ms
92,416 KB |
testcase_10 | AC | 232 ms
92,364 KB |
testcase_11 | AC | 230 ms
92,404 KB |
testcase_12 | AC | 229 ms
92,344 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 234 ms
92,108 KB |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | AC | 230 ms
92,360 KB |
testcase_20 | AC | 226 ms
92,352 KB |
testcase_21 | AC | 232 ms
92,344 KB |
testcase_22 | AC | 231 ms
92,340 KB |
testcase_23 | AC | 229 ms
92,088 KB |
testcase_24 | AC | 231 ms
92,412 KB |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | AC | 228 ms
92,320 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(): a, b = i_map() score = min(a, b) base = format(score, 'b') gree = len(base) num = base.count('1') if num != gree: gree -= 1 cost = '1' * gree print(int(cost, 2)) if __name__ == '__main__': main()