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:
abc= sorted(list(map(lambda x: int(x),input().split())))

if (abc[0] == abc[1] and abc[1] != abc[2]) or (abc[0] != abc[1] and abc[1] == abc[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 A!=B or A==C and A!=B:
    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):
    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')
    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:
a,b,c = map(int,input().split())
if (a == b and a != c) or (a == c and a != b) or (a != b and b == c):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
import numpy as np
import collections
from collections import deque
import queue
import copy

# 最大公約数
def gcd(m,n):
  x = max(m,n)
  y = min(m,n)
  if x%y == 0:
    return y
  else:
    while x%y != 0:
      z = x%y
      x = y
      y = z
    else:
      return z

# 幅優先探索(BFS)でスタート座標(x, y)からの最大距離返す
def bfs(SS, x, y, H, W):#入力(座標系(迷路), x, y, xの端, yの端)
  x_next = [0, 0, -1, 1]
  y_next = [1, -1, 0, 0]
  tempx = x
  tempy = y
  mlength = 0
  q = deque()
  xytuple = (x, y, 0)
  q.append(xytuple)


  while q:
    xytuple = q.popleft()
    SS[xytuple[0]][xytuple[1]] = "x" #探索した場所は探索できないようにする
    for i in range(4): #このforで上下左右を調べてる
      tempx = xytuple[0] + x_next[i]
      tempy = xytuple[1] + y_next[i]
      #print(tempx, tempy, xytuple[2])
      #print(S)
      if(0 <= tempx and tempx < H and 0 <= tempy and tempy < W and SS[tempx][tempy] == "."):
        temptuple = (tempx, tempy, xytuple[2]+1)
        SS[temptuple[0]][temptuple[1]] = "x" #探索した場所は探索できないようにする
        mlength = max(mlength, xytuple[2] +1)
        q.append(temptuple)
      #print(q)
  return mlength

def brick(a,n,m,N):#ABC 148
  #n番目以降にmがあるか調べる
  if not m in a[n:]:
    print(N-(m-1))
  else:
    #b = copy.deepcopy(a)
    brick(a,a[n:].index(m),m+1,N)

#X = str(input()).split()
#a = [int(x) for x in input().split()]

ABC = str(input()).split()
A = int(ABC[0])
B = int(ABC[1])
C = int(ABC[2])
ans = "No"

if(A==B):
    if not(A==C):
        ans = "Yes"
elif(A==C):
    ans = "Yes"
elif(B==C):
    ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
import sys

def main():
    tmp = input().replace('\n','').split()
    if int(tmp[0]) == int(tmp[1]) and int(tmp[0]) != int(tmp[2]) or int(tmp[1]) == int(tmp[2]) and int(tmp[0]) != int(tmp[1]) or int(tmp[0]) == int(tmp[2]) and int(tmp[1]) != int(tmp[2]):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

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

main()

Submission status: Accepted

Solution code:
a,b,c=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:
import sys
from collections import deque

a,b,c=[int(x) for x in 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 and b == c and c == a:
    print('No')
elif a != b and b != c and c != a:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import itertools
import sys
import math
import numpy as np
from collections import deque
from itertools import combinations
from functools import lru_cache
sys.setrecursionlimit(10**9)

def main():
    X = sorted(list(map(int,input().split())))

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


if __name__ == "__main__":
  main()

Submission status: Accepted

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

flag1 = 1 if a==b and a!=c else 0
flag2 = 1 if a==c and a!=b else 0
flag3 = 1 if b==c and a!=b else 0

ans = 'Yes' if flag1==1 or flag2==1 or flag3==1 else 'No'
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# def lcm(x, y):
#     return (x * y) // fragments.gcd(x, y)
#
#
# a, b = map(int, input().split())
#
# print(lcm(a, b))
a, b, c = map(str, input().split())
# a, b = map(str, input().split())
# u = input()

if (a == b) and (a == c) 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())

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, b, c = map(int, input().split())
ans="No"
if a==b:
  if a!=c:
    ans = "Yes"
if b==c:
  if a!=c:
    ans = "Yes"
if a==c:
  if b!=c:
    ans = "Yes"
# 出力
print(ans)

Submission status: Accepted

Solution code:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A, B, C = lr()
l = set([A, B, C])
print('Yes' if len(l) == 2 else 'No')

Submission status: Accepted

Solution code:
abc=list(map(int,input().split()))
s=set(abc)
if len(s)==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 a != b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split())
l = [A,B,C]
if len(set(l)) == 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("No")
elif (A != B)and(B != C)and(A != C):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
usrInput = input().split()
kawaisou = False


for n in range(3):
    if usrInput.count(usrInput[n]) == 2:
        kawaisou = True

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = map(int, raw_input().split())
s.sort()

if ((s[0] == s[1] and s[1] != s[2]) or
    (s[1] == s[2] and s[0] != s[1])):
    print "Yes"
else:
    print "No"

Submission status: Accepted

Solution code:
def main():
    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")


if __name__=='__main__':
    main()

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 = list(map(int, input().split()))

A.sort()
if A[0]+A[1]+A[2] != A[1]*3 and (A[0] == A[1] or A[1] == A[2]):
    print("Yes\n")
else:
    print("No\n")

Submission status: Accepted

Solution code:
from collections import Counter
a = Counter(map(int,input().split()))
if 2 in a.values():
    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 and A!=C and B!=C:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
res = not (A == B and B == C and C == A)  and (A == B or B == C or C == A)
if(res):
    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 = [int(x) for x 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()]

d = {}
for num in A:
    d[num] = 0

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

Submission status: Accepted

Solution code:
from collections import deque
from itertools import chain, combinations
import json
import numpy as np


def main():
    # N = int(input())
    A = [int(a) for a in input().split()]

    A = sorted(A)

    if A[0] == A[1] and A[0] == A[2]:
        print("No")
        return

    if A[0] != A[1] and A[0] != A[2] and A[1] != A[2]:
        print("No")
        return
    print("Yes")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a == 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 b != c) or (b == c and a!= c) or (c == a and b!=a):
    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[1] == a[2]:
    print("No")
elif a[0] == a[1] or a[1] == a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#python3

def main():
    a,b,c = map(int, input().split())
    s = set([a, b, c])
    if len(s) == 2:
        print('Yes')
    else:
        print('No')
main()

Submission status: Accepted

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

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

Submission status: Accepted

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

if len(abc_set) == 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 b == c:
    print('Yes')
elif a == c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = input().split()
print("Yes" if len(set(n))==2 else "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 b==c:
    if c != a:
        print("Yes")
    else :
        print("No")
elif c==a :
    if a != b:
        print("Yes")
    else:
        print("No")
else :
    print("No")



# h = sorted(h,reverse = True)
# print(sum(h[k:]))zz

# s,t= map(str, input().split())
# a,b= map(int, input().split())
# u = input()
# print("x"*len(u))

# if(u == s):
#     print(a-1,b)
# else:
#     print(a,b-1)

Submission status: Accepted

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

from fractions import gcd
from math import ceil,floor
import collections

# n=int(input())
# A,B,C,D=map(int, input().split())
# string = input()
# list = list(map(int, input().split()))


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

ans = "No"


if A==B and A!=C:
    ans = "Yes"
if A==C and A!=B:
    ans = "Yes"
if B==C and A!=B:
    ans = "Yes"

print(ans)

Submission status: Accepted

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

if A == B and C != A:
    print('Yes')
elif C == B and C != A:
    print('Yes')
elif C == A and C != B:
    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!=B:
  print('Yes')
elif A==C and A!=B:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


def main():
    A,B,C = map(int,input().split())

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

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



main()

Submission status: Accepted

Solution code:

#S,T = input().split()
A,B,C= map(int,input().split())
#U = input()

#print(A,B,C)
##print(T)
#print(A)
#print(U)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if (a == b and (b != c or a != c)) or (a == c and (c != b or a != b)) or (c == b and (c != a or b != a)):
    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 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 and b==c: print('No')
elif a==b or b==c or c==a: print('Yes')
else: print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np 

abc_list = [int(i) for i in input().split()]
abc_list = np.array(abc_list)


if np.unique(abc_list).shape[0] == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

count = 0
ans = "No"

for i in range(3):
    for o in range(i + 1, 3):
        if kawaiso[i] == kawaiso[o]:
            count += 1

if count == 1:
    ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Feb 16 20:59:15 2020

@author: H_Hoshigi
"""

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 = 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==c:
    print('No')
elif a == b or b == c or c == a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!python3.4
# -*- coding: utf-8 -*-
# abc155/abc155_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    ABC = set(i2nn())
    print('Yes' if len(ABC) == 2 else 'No')
    return

main()

Submission status: Accepted

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

if a==b and b!=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())

ans='No'

if A==B and A!=C: ans='Yes'
if A==C and A!=B: ans='Yes'
if B==C and B!=A: ans='Yes'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split(' ')]

le = len(set(l))

if le == 2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A,B,C = map(int,input().split(" "))
if A == B and A != C and B!=C:
    print("Yes")
elif  A== C and A != B and B!=C:
    print("Yes")
elif  B== C and A != B and A!=C:
    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:
    print('Yes')
elif B == C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

n = 0
n += a == b
n += a == c
n += c == b

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

Submission status: Accepted

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

cnt = 0

if a == b:
    cnt += 1

if c == b:
    cnt += 1
if a == c:
    cnt += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys #sys.stdin.readline()
import heapq #heap
from collections import defaultdict
fastinp = lambda: sys.stdin.readline().split(' ')
inp = lambda: input().split(' ')
ml = lambda x, y=int: list(map(y, x))
debug = lambda *args: print(*args, sep=' | ')
a, b, c = ml(inp())
if a == b and a != c:
    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:
list = list(map(int, input().split()))
set = set(list)

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

Submission status: Accepted

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

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:
    print("Yes" if A != C else "No")
    exit(0)
else:
    if A == C or B == C:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

ans = 'Yes'

a = [A, B, C]

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

Submission status: Accepted

Solution code:
a=map(int,input().split())
A=list(a)
B=0
if A[0]==A[1]:
 B+=1
if A[1]==A[2]:
 B+=1
if A[0]==A[2]:
 B+=1
if B==1:
 print("Yes")
else:
 print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    a,b,c = sorted([x for x in 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")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L = list(map(int, input().strip().split()))
L.sort()
cnt=0
for i in range(2):
    if L[i+1]!=L[i]:
        cnt+=1
    
if cnt==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
input_line = [i for i in input().split(" ")]
if len(set(input_line)) == 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 and B != C and A != C:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
list = list(map(int, input().split()))
list.sort
if list.count(list[0]) == 2 or list.count(list[2]) == 2: print("Yes")
else: print("No")

Submission status: Accepted

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

if len(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("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())
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=list(map(int, input().split()))

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

Submission status: Accepted

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

if len(set(l)) == 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 (A == C and A !=B) or (B == C and B != A):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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())

if A==B and A!=C:
    print("Yes")
elif A==C and A!=B:
    print("Yes")
elif B==C and B!=A:
    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) or (a!=b and b!=c and c!=a) :
    print("No")
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

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 (c==b and a!=b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = (int(x) for x in input().split())
co = 0
if a==b:
	if a!=c:
		co=1
elif a==c:
	if a!=b:
		co=1
elif b==c:
	if a!=b:
		co=1
if co==1:
	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 a==c and a!=b:
    print('Yes')
elif b==c and b!=a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
input_l = input()
a = int(input_l[0])
b = int(input_l[2])
c = int(input_l[-1])

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

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

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

Submission status: Accepted

Solution code:
a,b,c = [i for i in input().split()]
if (a == b and b != c) or (b == c and c != a) or (c == a and b != a):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c = [int(i) for i in input().split()]
kawaiso = False

if a == b:
    if b == c:
        kawaiso = False
    else:
        kawaiso = True
else:
    if a == c or b == c:
        kawaiso = True
    else:
        kawaiso = False

if kawaiso:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
res_list=list(map(int,input().split()))
res_set = set(res_list)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

x=a-b
y=b-c
z=c-a

if (x==0 and y !=0 and z !=0) or (x!=0 and y ==0 and z !=0) or (x !=0 and y !=0 and z ==0):
    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 a == c:
    count += 1
if b == c:
    count += 1

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

Submission status: Accepted

Solution code:
import math

ABC = input().split()
A = int(ABC[0])
B = int(ABC[1]) 
C = int(ABC[2])

count = 0

if A == B:
  count += 1
if A == C:
  count += 1
if B == C:
  count += 1
  
if count == 1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
s=set(map(int,input().split()))
if len(s)==2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = input()
b = eval(a.replace(" ","^"))
print((a.count(str(b))==1)*"Yes" or "No")

Submission status: Accepted

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

if A==B and B!=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())

if (a == b and a != c) or (a == c and a != b)or (b == c and b != 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 != B and A == C:
    print('Yes')

elif B == C and A != C:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
x = list(map(int,input().split(" ")))
a = x[0]
b = x[1]
c = x[2]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

if a == b and b == c:
    print('No')
elif a == b or b == c or 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 )or (a == c and a != b) or (b == c and b != a):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
P = set([a,b,c])
if len(P) == 2:
  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):
    if (A==B and A!=C) or (A==C and A!=B) or (B==C and B!=A):
        print ("Yes")
    else:
        print ("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:
A = list(map(int, input().split()))

ans = 'No'
for i in range(9):
    if A.count(i) == 2:
        ans = 'Yes'
        break

print(ans)

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:

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

Submission status: Accepted

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

def ans():
    if A == B and B==C:
        return "No"
    elif A == B:
        return "Yes"
    elif C == B:
        return "Yes"
    elif C == A:
        return "Yes"
    else:
        return "No"

print(ans())

Submission status: Accepted

Solution code:
[A, B, C] = 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:
def main():
    A = set(map(int, input().split()))

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


if __name__ == "__main__":
    main()