Problem:


Score: 100 points

Problem Statement

A triple of numbers is said to be poor when two of those numbers are equal but the other number is different from those two numbers.

You will be given three integers A, B, and C. If this triple is poor, print Yes; otherwise, print No.

Constraints

A, B, and C are all integers between 1 and 9 (inclusive).

Input

Input is given from Standard Input in the following format:

A B C

Output

If the given triple is poor, print Yes; otherwise, print No.

Sample Input 1

5 7 5

Sample Output 1

Yes

A and C are equal, but B is different from those two numbers, so this triple is poor.

Sample Input 2

4 4 4

Sample Output 2

No

A, B, and C are all equal, so this triple is not poor.

Sample Input 3

4 9 6

Sample Output 3

No

Sample Input 4

3 3 4

Sample Output 4

Yes



Sample input:
5 7 5


Sample output:
Yes

Submission status: Accepted

Solution code:

def solution():
    a, b, c = [x for x in input().strip().split(" ")]
    if (a == b and b == c) or (a != b and a !=c and b != c):
        print("No")
    else:
        print("Yes")

def main():    
    # T = int(input().strip())
    for _ in range(1):
        solution()
    

main()

Submission status: Accepted

Solution code:
ABC = list(map(int, input().split()))
if len(set(ABC)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if ((A==B and B == C and C==A) or (A!=B and B != C and C!=A) ):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if (a==b and a!=c) or (b==c and a!=c) or (c==a and b!=c):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
L = list (map ( int , input().strip().split(" " ) ) ) ;
L.sort() ; 


b ="No" ;
if L[0] == L[1] and L[1] == L[2] :
	pass ; 
elif L[0] == L[1] or L[1] == L[2] :
	b ="Yes" ;
print ( b ) ;

Submission status: Accepted

Solution code:
p = list(map(int, input().split()))

if len(set(p)) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
nList = list(map(int,input().split()))

for i in nList:
  if nList.count(i) == 3:
    print("No")
    exit(0)
  elif nList.count(i) == 2:
    print("Yes")
    exit(0)

print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A == B and B == C:
  print('No')
elif A == B or A == C or B == C:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
d = {a, b, c}
if len(d) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


def MI(): return map(int, input().split())


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = {False: 'No', True: 'Yes'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    A, B, C = MI()
    m = {}
    m[A] = 0
    m[B] = 0
    m[C] = 0
    m[A] += 1
    m[B] += 1
    m[C] += 1

    if len(m.keys()) == 2:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b and b == c:
    print('No')
    exit(0)
if a == b or b == c or a == c:
    print('Yes')
    exit(0)
print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

if a == b and a != c:
  print("Yes")
elif a == c and a != b:
  print("Yes")
elif b == c and a != b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import math
import numpy as np
from fractions import gcd
import fractions
import statistics
import collections
from functools import reduce
import itertools
from collections import defaultdict
import bisect
from fractions import Fraction
 

A=list(map(int, input().split()))  


if (A.count(A[0]) ==2 or A.count(A[1]) ==2):
        print('Yes')
else:
        print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if (a == b or b == c or c == a) and not (a == b == c):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())

n=set([a,b,c])

if len(n)==2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A, B, C = input().split()

if A == B and C!=A:
    print("Yes")
elif B==C and A!=B:
    print("Yes")    
elif A==C and B!=A:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


def main():
    A, B, C = map(int, input().split())
    if (A==B and B==C) or (A!=B and B!=C and C!=A):
        print("No")
    else:
        print("Yes")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
item_set = set(map(int, input().split()))
if len(item_set) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
import math
import itertools

def main():
    a, b, c = map(int, sys.stdin.readline().split())

    if (a == b and a != c) or (a == c and a != b) or (b == c and a != b):
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
[a, b, c] = map(int, input().rstrip().split(' '))

if (a == b or a == c or b == c) and not (a == b and a == c and b == c):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))

L = set(l)

if len(L) == 1 or len(L) == 3:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
inputs = input().split(" ")
print("Yes" if (inputs[0] == inputs[1] or inputs[1] == inputs[2] or inputs[2] == inputs[0]) and (inputs[0] != inputs[1] or inputs[1] != inputs[2] or inputs[2] != inputs[0]) else "No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b and a != c:
    print('Yes')
elif a == c and a != b:
    print('Yes')
elif b == c and b != a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import numpy as np

a, b, c = map(int, input().split())

if (a == b or a == c or b == c) and not(a == b == c):
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(A: int, B: int, C: int):
    print(YES if (A == B or B == C or A == C) and not A == B == C else NO)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    solve(A, B, C)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:


#gcdは3.4.3だとfractionsにある
from fractions import gcd
import math

from math import factorial as f

from math import ceil,floor,sqrt


import bisect
import re
import heapq


from copy import deepcopy
import itertools

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))



def main():
    a,b,c = mi()
    flag = False
    if a == b:
        flag = True
    if b == c:
        if flag == True:
            print('No')
            exit()
        else:
            flag = True
    if a == c:
        if flag == True:
            print('No')
            exit()
        else:
            flag = True
    if flag:
        print("Yes")
    else:
        print("No")


main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(readline())
def LI(): return [int(x) for x in readline().split()]

def main():
    a,b,c = LI()
    if((a==b and a!=c) or (a==c and a!=b) or (b==c and a!=b)):
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


def main():
    a, b, c = map(int, input().split())
    print("Yes" if len({a, b, c}) == 2 else "No")


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))
A.sort()

if A[0] == A[1] == A[2]:
    print('No')
else:
    if A[0] == A[1] or A[1] == A[2]:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 無限 #####
# inf = float('inf')

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')

def main():
	A,B,C = inputMap()

	if A == B:
		if A != C:
			print("Yes")
			sys.exit()
	elif A == C:
		if A != B:
			print("Yes")
			sys.exit()
	elif B == C:
		if A != B:
			print("Yes")
			sys.exit()

	print("No")

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
import collections

num=list(map(int,input().split()))

c=collections.Counter(num)

if len(c) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#import numpy as np
from sys import stdin
from copy import deepcopy
from functools import reduce
from fractions import gcd
import math
import itertools
from collections import Counter
from itertools import chain  ##list(chain.from_iterable(l)) ##flatten
from heapq import heappush, heappop
import bisect

"""
N = int(input())
A, B = map(int,input().split())
A = list(map(int,input().split())) ## 横一列
A = [int(input()) for _ in range(N)] ## 縦一列
lst = [list(map(int,input().split())) for i in range(M)] ## 二次元
"""

A = list(map(int,input().split()))

A = sorted(A)

if A[0] == A[1] and A[1] != A[2]:
  print('Yes')
elif A[0] != A[1] and A[1] == A[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c = input().split()

if a==b and a != c:
    print("Yes")
elif a==c and a != b:
    print("Yes")
elif b == c and b != a:
    print("Yes") 
else:
    print("No")

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))

sa = set(a)
if len(sa)==2:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
def main():
    lst = set(list(map(int,input().split())))
    if len(lst) == 2:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b == c or a != b and b != c and a != c:
	print("No")
else:
	print("Yes")

Submission status: Accepted

Solution code:
ABC = [int(s) for s in input().split()]
setABC = set(ABC)
if len(setABC) == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
[A,B,C] = list(map(int,input().split()))
output = 0
if A==B:
    output += 1
if B==C:
    output += 1
if A==C:
    output += 1

if output == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
if (A == B and B != C) or (B==C and C != A) or (C == A and A != B):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c = input().split()
if a == b and a != c:
    print("Yes")
elif b == c and b != a:
    print("Yes")
elif c == a and c != b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A = list(map(int, input().split()))

A_dict = dict()
for i in range(len(A)):
    if A[i] in A_dict:
        A_dict[A[i]] += 1
    else:
        A_dict[A[i]] = 1
        
if len(A_dict) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if A == B:
    if A != C:
        print('Yes')
    else:
        print('No')
elif A == C:
    if A != B:
        print('Yes')
    else:
        print('No')
elif B == C:
    if B != A:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

if (a==b and a!=c) or (a==c and a!=b) or (c==b and a!=c):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())

if (a == b and a != c) or (a == c and a != b) or (b == c and a != b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
flag = False
if a==b  and b!=c:
    flag = True
elif a==c and a!=b:
    flag = True
elif b==c and a!=b:
    flag = True

if flag:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if ((a == b and b != c) or (a == c and b != c) or (b == c and a != b)):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
xs = [int(x) for x in input().split()]
xs.sort()
if xs[0] != xs[2] and (xs[0] == xs[1] or xs[1] == xs[2]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def resolve():
    a, b, c = sorted(map(int, input().split()))
    if a == b == c:
        print("No")
    elif a == b or b == c:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
print('YNeos'[len(set(map(int,input().split()))) != 2::2])

Submission status: Accepted

Solution code:
line = input().split(' ')
k = set(line)
if len(k) == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b and a != c:
    print("Yes")
elif a == c and a != b:
    print("Yes")
elif b == c and b != a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# python3
# -*- coding: utf-8 -*-
import sys
import math
#from math import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint

INF = float('inf')

ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
sys.setrecursionlimit(1000000000)


def lcm(a, b):
    return (a * b) // gcd(a, b)


# main
a,b,c = mis()

if len(set([a,b,c])) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())

if (A==B and A != C) or (B==C and B != A) or (C==A and C != B):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
'''
n = int(input())
n, m = map(int, input().split())
a = list(map(int, input().split()))
a = [int(input()) for i in range n]
p = [list(map(int, input().split()))]

a = input()
a, b = input().split()
a = [input() for i in range n]
'''

Numbers = list(map(int, input().split()))

ans = "No"

import collections
counter = collections.Counter(Numbers)

for i in counter.values():
    if i == 2:
        ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
abc = list(map(int, input().split()))

if len(set(abc)) == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A, B, C =  map(int,(input().split()))
s = set([A, B, C])
print('Yes') if len(s) == 2 else print('No')

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))

if a == b and b == c:
    print("No")
elif a == b:
    print("Yes")
elif b == c:
    print("Yes")
elif a == c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

a, b, c = list(map(int, input().split()))

if len(set([a, b, c])) == 1:
    ans = "No"
elif len(set([a, b, c])) == 2:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b == c:
	print("No")
	exit()

if a == b or a == c or b == c:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int,input().split())
if (A == B and B != C) or (A == C and C != B) or (B == C and C != A):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())

if A == B:
    if A != C:
        ans = 1
    else:
        ans = 0
elif B == C:
    if B != A:
        ans = 1
    else:
        ans = 0
elif A == C:
    if B!= C:
        ans = 1
    else:
        ans = 0
else:
    ans = 0
if ans == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S=input().split()
a=int(S[0])
b=int(S[1])
c=int(S[2])

if a==b and b!=c:
    print("Yes")
elif b==c and c!=a:
    print("Yes")
elif c==a and a!=b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
ans = 'Yes'
if a==b==c :
    ans ='No'
if a != b and b!= c and c!= a:
    ans ='No'
print(ans)

Submission status: Accepted

Solution code:
A, B, C = list(map(int, input().split()))

a = set([A, B, C])

if len(a) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
array = list(map(int, input().split()))
if len(set(array)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if (a == b and b != c) or (a == c and a != b) or (a != b and b == c):
  print('Yes')
else :
  print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b == c:
    res = "No"
elif a != b and b!=c and c!=a:
    res = "No"
else:
    res = "Yes"
print(res)

Submission status: Accepted

Solution code:
A = [int(i) for i in input().split()]
if len(set(A)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=[int(i) for i in input().split()]
a.sort()
print("Yes" if (a[0]==a[1] and a[1]!=a[2]) or (a[0]!=a[1] and a[1]==a[2]) else "No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
cnt = 0
if a == b:
  cnt += 1
if b == c:
  cnt+=1
if c ==a :
  cnt+=1

print('Yes' if cnt == 1 else 'No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
cnt=1
if a== b:
  cnt += 1
if a==c:
  cnt += 1
if b == c:
  cnt += 1
if cnt == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A,B,C=map(int, raw_input().split())

if A==B and B!=C:
    print "Yes"
elif A==C and C!=B:
    print "Yes"
elif B==C and C!=A:
    print "Yes"
else:
    print "No"

Submission status: Accepted

Solution code:
A,B,C=map(int, input().split())
if A==B and A!=C:
    print("Yes")
elif A==C and A!=B:
    print("Yes")
elif B==C and A!=B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

inp = list(map(lambda x:int(x),input().split()))

if len(set(inp)) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a==b and a!=c: print('Yes')
elif  a==c and a!=b: print('Yes')
elif  b==c and a!=b: print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
arr = [int(_) for _ in input().split()]

if len(set(arr)) == 2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
t=[int(i) for i in input().split()]
if(len(set(t))==2): print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
A, B, C = map(int, raw_input().split())

if A == B:
    if B == C:
        print "No"
    else:
        print "Yes"
if A != B:
    if B==C:
        print "Yes"
    elif A == C:
        print "Yes"
    else:
        print "No"

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b and a != c:
    print("Yes")
elif a == c and a != b:
    print("Yes")
elif b == c and b != a:
    print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
flag = False
if a == b:
  if a != c:
    flag = True
elif b == c:
  if a != b:
    flag = True
elif c == a:
  if a != b:
    flag = True
if flag:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a, b, c = list(map(int, input().split()))
if (a == b and a != c):
    print("Yes")
elif (b == c and b != a):
    print("Yes")
elif (a == c and a != b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=list(map(int, input().split()))
lis=set(a)
if len(lis) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = sorted(list(map(int, input().split())))
a,b,c = a[0],a[1],a[2]
if (a != b and b != c) or (a == b and b == c):
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
l.sort()
if l[0] == l[1] and l[1] != l[2]:
    print('Yes')
elif l[0] != l[1] and l[1] == l[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b and b == c:
    print('No')
elif a == b or a == c or b == c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A = map(int, input().split())
if len(list(set(A))) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())
if a == b and b!=c:
    print('Yes')
elif b == c and a!=c:
    print('Yes')    
elif c == a and b!=c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# N = int(input())
# N = map(int,input().split())
# N = list(map(int,input().split()))

a,b,c = map(int,input().split())

if a == b and a != c:
    print("Yes")
elif b==c and a!=c:
    print("Yes")

elif a==c and b!=c:
    print("Yes")

else:
    print("No")





# if :
#     print("YES")
# else:
#     print("NO")

# if :
#     print("Yes")
# else:
#     print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if a == b != c or b == c != a or c == a != b:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B, C = map(int, input().split())

if A == B and B != C:
    print("Yes")
elif A == C and B != C:
    print("Yes")
elif B == C and A != B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a = map(int, input().split())

if len(set(a)) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
count = 0
if A == B:
    count += 1
if B == C:
    count += 1
if A == C:
    count += 1
if count == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
flag = 0
if A==B and A!=C:
    flag=1
elif B==C and A!=B:
    flag=1
elif A==C and A!= B:
    flag=1

if flag==0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
kawaisou = set(map(int, input().split()))
if len(kawaisou) == 2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

if (a == b) & (a == c):
    print('No')
elif (a == b) | (a == c) | (c == b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#設定
import sys
input = sys.stdin.buffer.readline

#ライブラリインポート
from collections import defaultdict

con = 10 ** 9 + 7
#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	A, B, C = getlist()
	D = defaultdict(int)
	D[A] += 1
	D[B] += 1
	D[C] += 1
	if len(D) == 2:
		print("Yes")
	else:
		print("No")

	


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
if A == B or B == C or C == A:
    if not A == B == C:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
nums = list(map(int, input().split()))
s = set(nums)
if len(s)==2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())

flag=[0]*3

if A==B:
  flag[0]=1
if B==C:
  flag[1]=1
if C==A:
  flag[2]=1
if sum(flag)==1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

[A, B, C] = [int(i) for i in input().split()]

if A == B and B == C:
    print('No')
elif A == B:
    print('Yes')
elif A == C:
    print('Yes')
elif B == C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x,y,z = map(int,input().split())	
if (x == y and x != z) or (x == z and x != y) or (y == z and x != y):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C = map(int, input().split())

ret = "No"
if A == B and A != C:
  ret = "Yes"
elif A == C and A != B:
  ret = "Yes"
elif B == C and B != A:
  ret = "Yes"

print(ret)

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
A=[a,b,c]
if len(set(A))==2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C = input().split()
count = 0
if A == B:
  count += 1
if B == C:
  count += 1
if C == A:
  count += 1
if count == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
kawaisou = 0
if a == b and b != c:
    kawaisou = 1
elif b == c and c != a:
    kawaisou = 1
elif c == a and a != b:
    kawaisou = 1
    
if kawaisou == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

A, B, C = map(int, read().split())

if A == B & B != C:
    print("Yes")
elif B == C & C != A:
    print("Yes")
elif C == A & A != B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = list(map(int,input().split(" ")))
if (a == b and a != c) or (a == c and a != b) or (c == b and a != b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
flg = 0
if a == b and b == c:
    print("No")
elif a == b or b == c or a == c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())

if (a==b and a!=c) or (a==c and a!=b) or (b==c and a!=b):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys

A, B, C = map(int, sys.stdin.readline().split())

if A == B and A != C:
    print("Yes")
elif A == C and A != B:
    print("Yes")
elif B == C and A != B:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A,B,C=sorted(map(int,input().split()))

if A==B:
  if B!=C:
    print("Yes")
  else:
    print("No")
else:
  if B==C:
    print("Yes")
  else:
    print("No")

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
a.sort()
if (a[0] == a[1] and a[0] != a[2]) or (a[1] == a[2] and a[0] != a[2]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == b and a != c:
  print('Yes')
elif a == c and a != b:
  print('Yes')
elif b == c and a != b:
  print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
a, b,c =map(int,input().split())
if a==b==c or (a!=b and b!=c and c!=a):
    print('No')
else:
    print('Yes')