結果
問題 | No.841 8/32 |
ユーザー | McGregorsh |
提出日時 | 2023-04-14 11:27:31 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 153 ms / 2,000 ms |
コード長 | 1,575 bytes |
コンパイル時間 | 220 ms |
コンパイル使用メモリ | 82,496 KB |
実行使用メモリ | 89,768 KB |
最終ジャッジ日時 | 2024-04-18 10:53:06 |
合計ジャッジ時間 | 4,487 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 138 ms
89,548 KB |
testcase_01 | AC | 141 ms
89,764 KB |
testcase_02 | AC | 143 ms
89,644 KB |
testcase_03 | AC | 139 ms
89,292 KB |
testcase_04 | AC | 138 ms
89,768 KB |
testcase_05 | AC | 138 ms
89,592 KB |
testcase_06 | AC | 137 ms
89,616 KB |
testcase_07 | AC | 139 ms
89,676 KB |
testcase_08 | AC | 138 ms
89,536 KB |
testcase_09 | AC | 140 ms
89,628 KB |
testcase_10 | AC | 138 ms
89,716 KB |
testcase_11 | AC | 142 ms
89,656 KB |
testcase_12 | AC | 142 ms
89,596 KB |
testcase_13 | AC | 138 ms
89,276 KB |
testcase_14 | AC | 142 ms
89,768 KB |
testcase_15 | AC | 153 ms
89,616 KB |
testcase_16 | AC | 138 ms
89,544 KB |
testcase_17 | AC | 140 ms
89,420 KB |
testcase_18 | AC | 138 ms
89,684 KB |
testcase_19 | AC | 136 ms
89,560 KB |
testcase_20 | AC | 135 ms
89,328 KB |
testcase_21 | AC | 137 ms
89,524 KB |
testcase_22 | AC | 136 ms
89,580 KB |
testcase_23 | AC | 136 ms
89,544 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 = s_map() if (A == 'Sat' or A == 'Sun') and B != 'Sat' and B != 'Sun': print('8/32') exit() ok = ['Sat', 'Sun'] if A in ok and B in ok: print('8/33') exit() print('8/31') if __name__ == '__main__': main()