結果
問題 | No.227 簡単ポーカー |
ユーザー | McGregorsh |
提出日時 | 2023-03-14 22:23:41 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 147 ms / 5,000 ms |
コード長 | 2,271 bytes |
コンパイル時間 | 152 ms |
コンパイル使用メモリ | 81,616 KB |
実行使用メモリ | 88,360 KB |
最終ジャッジ日時 | 2023-10-18 12:06:38 |
合計ジャッジ時間 | 3,006 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 147 ms
88,356 KB |
testcase_01 | AC | 142 ms
88,316 KB |
testcase_02 | AC | 143 ms
88,356 KB |
testcase_03 | AC | 144 ms
88,316 KB |
testcase_04 | AC | 142 ms
88,360 KB |
testcase_05 | AC | 143 ms
88,360 KB |
testcase_06 | AC | 145 ms
88,356 KB |
testcase_07 | AC | 143 ms
88,360 KB |
testcase_08 | AC | 142 ms
88,356 KB |
testcase_09 | AC | 142 ms
88,360 KB |
testcase_10 | AC | 142 ms
88,356 KB |
testcase_11 | AC | 147 ms
88,356 KB |
testcase_12 | AC | 146 ms
88,352 KB |
testcase_13 | AC | 145 ms
88,360 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 = i_list() count = defaultdict(int) for i in range(5): count[A[i]] += 1 nums = [] for key, value in count.items(): if value == 2 or value == 3: nums.append(value) nums.sort() if len(nums) <= 2: if len(nums) == 0: print('NO HAND') exit() if len(nums) == 1: if nums[0] == 2: print('ONE PAIR') exit() elif nums[0] == 3: print('THREE CARD') exit() else: print('NO HAND') exit() if len(nums) == 2: if nums[0] == 2 and nums[1] == 3: print('FULL HOUSE') exit() if nums[0] == 3 or nums[1] == 3: print('THREE CARD') exit() if nums[0] == 2 and nums[1] == 2: print('TWO PAIR') exit() if nums[0] == 2 or nums[1] == 2: print('ONE PAIR') exit() print('NO HAND') if __name__ == '__main__': main()