結果
問題 | No.683 Two Operations No.3 |
ユーザー | McGregorsh |
提出日時 | 2022-11-09 15:18:56 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,727 bytes |
コンパイル時間 | 293 ms |
コンパイル使用メモリ | 82,228 KB |
実行使用メモリ | 89,792 KB |
最終ジャッジ日時 | 2024-07-22 21:18:15 |
合計ジャッジ時間 | 3,500 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 148 ms
89,440 KB |
testcase_02 | AC | 146 ms
89,424 KB |
testcase_03 | AC | 143 ms
89,644 KB |
testcase_04 | AC | 142 ms
89,652 KB |
testcase_05 | AC | 142 ms
89,692 KB |
testcase_06 | AC | 143 ms
89,608 KB |
testcase_07 | WA | - |
testcase_08 | AC | 141 ms
89,392 KB |
testcase_09 | AC | 143 ms
89,628 KB |
testcase_10 | AC | 144 ms
89,556 KB |
testcase_11 | WA | - |
testcase_12 | AC | 142 ms
89,676 KB |
testcase_13 | AC | 144 ms
89,792 KB |
testcase_14 | WA | - |
testcase_15 | AC | 143 ms
89,628 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(): 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 //= 1 B -= 1 else: if A >= B: A //= 2 else: B //= 2 print('Yes') if __name__ == '__main__': main()