結果
問題 | No.780 オフ会 |
ユーザー | McGregorsh |
提出日時 | 2023-04-10 11:49:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 138 ms / 2,000 ms |
コード長 | 1,475 bytes |
コンパイル時間 | 193 ms |
コンパイル使用メモリ | 82,356 KB |
実行使用メモリ | 89,732 KB |
最終ジャッジ日時 | 2024-04-15 18:04:32 |
合計ジャッジ時間 | 4,143 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 137 ms
89,000 KB |
testcase_01 | AC | 135 ms
89,024 KB |
testcase_02 | AC | 136 ms
89,380 KB |
testcase_03 | AC | 136 ms
89,400 KB |
testcase_04 | AC | 138 ms
89,668 KB |
testcase_05 | AC | 135 ms
89,500 KB |
testcase_06 | AC | 137 ms
89,592 KB |
testcase_07 | AC | 136 ms
89,180 KB |
testcase_08 | AC | 137 ms
89,604 KB |
testcase_09 | AC | 138 ms
89,136 KB |
testcase_10 | AC | 138 ms
89,240 KB |
testcase_11 | AC | 138 ms
89,148 KB |
testcase_12 | AC | 134 ms
89,324 KB |
testcase_13 | AC | 136 ms
89,724 KB |
testcase_14 | AC | 131 ms
89,424 KB |
testcase_15 | AC | 136 ms
89,436 KB |
testcase_16 | AC | 136 ms
89,732 KB |
testcase_17 | AC | 136 ms
89,420 KB |
testcase_18 | AC | 138 ms
89,512 KB |
testcase_19 | AC | 138 ms
89,396 KB |
testcase_20 | AC | 136 ms
89,592 KB |
testcase_21 | AC | 135 ms
89,248 KB |
testcase_22 | AC | 135 ms
89,396 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() if A < B: print('YES') print(B - A - 1) else: print('NO') print(A - B + 1) if __name__ == '__main__': main()