Submission #61146283

Source Code Expand

from collections import defaultdict, deque
import bisect
import math
from heapq import *
import itertools
import sys
sys.setrecursionlimit(10**8)

*c, = map(int, input().split())
s = set()
for x in c:
    s.add(x)
if len(s) == 2:
    print('Yes')
else:
    print('No')

Submission Info

Submission Time
Task A - Full House 2
User flourpoke
Language Python (PyPy 3.10-v7.3.12)
Score 100
Code Size 268 Byte
Status AC
Exec Time 73 ms
Memory 77000 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 5
AC × 25
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt
All sample_01.txt, sample_02.txt, sample_03.txt, sample_04.txt, sample_05.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt
Case Name Status Exec Time Memory
sample_01.txt AC 72 ms 76688 KiB
sample_02.txt AC 72 ms 76560 KiB
sample_03.txt AC 73 ms 76716 KiB
sample_04.txt AC 73 ms 76712 KiB
sample_05.txt AC 72 ms 76684 KiB
test_01.txt AC 73 ms 76696 KiB
test_02.txt AC 72 ms 76936 KiB
test_03.txt AC 72 ms 76656 KiB
test_04.txt AC 71 ms 76572 KiB
test_05.txt AC 72 ms 77000 KiB
test_06.txt AC 72 ms 76944 KiB
test_07.txt AC 72 ms 76896 KiB
test_08.txt AC 72 ms 76940 KiB
test_09.txt AC 73 ms 76972 KiB
test_10.txt AC 71 ms 76900 KiB
test_11.txt AC 72 ms 76632 KiB
test_12.txt AC 73 ms 76852 KiB
test_13.txt AC 72 ms 76976 KiB
test_14.txt AC 72 ms 76740 KiB
test_15.txt AC 72 ms 76584 KiB
test_16.txt AC 72 ms 76768 KiB
test_17.txt AC 72 ms 76656 KiB
test_18.txt AC 72 ms 76944 KiB
test_19.txt AC 72 ms 76680 KiB
test_20.txt AC 71 ms 76624 KiB