結果
問題 | No.683 Two Operations No.3 |
ユーザー | McGregorsh |
提出日時 | 2022-11-09 15:24:45 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,765 bytes |
コンパイル時間 | 292 ms |
コンパイル使用メモリ | 87,320 KB |
実行使用メモリ | 92,608 KB |
最終ジャッジ日時 | 2023-09-30 03:24:41 |
合計ジャッジ時間 | 6,253 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 265 ms
92,408 KB |
testcase_01 | AC | 261 ms
92,392 KB |
testcase_02 | AC | 264 ms
92,608 KB |
testcase_03 | AC | 262 ms
92,280 KB |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | AC | 263 ms
92,404 KB |
testcase_07 | AC | 261 ms
92,432 KB |
testcase_08 | AC | 267 ms
92,488 KB |
testcase_09 | WA | - |
testcase_10 | AC | 262 ms
92,400 KB |
testcase_11 | AC | 264 ms
92,596 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 263 ms
92,364 KB |
testcase_15 | WA | - |
ソースコード
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(): A, B = i_map() while A != 0 and B != 0: if A % 2 == 1 and B % 2 == 1: print('No') exit() if A % 2 == 1: A -= 1 B //= 2 elif B % 2 == 1: A //= 2 B -= 1 else: if A >= B: A //= 2 B -= 1 else: B //= 2 A -= 1 print('Yes') if __name__ == '__main__': main()