結果
問題 | No.2789 hako111223’s Master Thesis |
ユーザー |
![]() |
提出日時 | 2024-06-21 21:26:53 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 43 ms / 2,000 ms |
コード長 | 1,698 bytes |
コンパイル時間 | 128 ms |
コンパイル使用メモリ | 82,256 KB |
実行使用メモリ | 56,332 KB |
最終ジャッジ日時 | 2024-06-21 21:26:55 |
合計ジャッジ時間 | 1,564 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 15 |
ソースコード
import sysfrom collections import defaultdict, deque, Counterfrom heapq import heapify, heappush, heappop, mergefrom bisect import bisect_right, bisect_leftleft_binser = lower_bound = bisect_left ; right_binser = upper_bound = bisect_rightfrom itertools import permutations, combinations, accumulate# from math import lcm,gcd# from math import comb, perm# from functools import lru_cache# from types import GeneratorTypeMOD = 10**9 + 7_MOD = 998244353YES = "YES"NO = "NO"ALICE = "Alice"BOB = "Bob"def FLOOR_DIV(a, b) :return a // bdef CEIL_DIV(a, b) :return (a // b) + (not(not(a % b)))def get() :return map(int, sys.stdin.readline().split())def getone() :return int(sys.stdin.readline().strip())def getstr() :return sys.stdin.readline().split()def getonestr() :return sys.stdin.readline().strip()def getarr() :return list(map(int, sys.stdin.readline().split()))def _3d_ARRAY_SPAWN(i, j, k) :return [[[0 for _k in range(k)] for _j in range(j)] for _i in range(i)]def _2d_ARRAY_SPAWN(i, j) :return [[0 for _j in range(j)] for _i in range(i)]""""never doubt that u can't do this, cause it's an insult to ur determination"by @deepakgoswami0552 10/03/2024"""def solve() :...# Solution here!a,b,c,d = get()diff = (31 - a) + bassert c > dif diff < d :return 3if diff < c :return 2return 1""""""testcase = ""# testcase = "multiple" # Multiple tcif testcase == "multiple" :for i in range(int(input())) :print(solve())# solve()...else :print(solve())# solve()...