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:
A=[int(i) for i in input().split()]
A.sort()
a,b,c=A
if a==b and b!=c:
    print("Yes")
elif a!=b and b==c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

number_set = set(number)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
def s_in():
    return input()

def n_in():
    return int(input())

def l_in():
    return list(map(int, input().split()))

class Interval():
    def __init__(self, li):
        self.li = li
        self.n = len(li)
        self.sum_li = [li[0]]
        for i in range(1, self.n):
            self.sum_li.append(self.sum_li[i-1] + li[i])

    def sum(self, a, b=None):
        if b is None:
            return self.sum(0, a)

        res = self.sum_li[min(self.n-1, b-1)]
        if a > 0:
            res -= self.sum_li[a-1]
        return res

a, b, c = l_in()

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())
list=[A,B,C]
if len(set(list))==2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from functools import lru_cache
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(2000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s

#main
#n=int(input)
A,B,C=map(int,input().split())
#A=list(map(int,input().split()))
Yn(len(set([A,B,C]))==2)

Submission status: Accepted

Solution code:
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

a,b,c = inm()
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==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())

if a == b and a != 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(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
lst=[a,b,c]
if len(set(lst))==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(str,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:
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 = list(map(int, input().split()))
a = sorted(a)
if a[0] == a[1] and a[1] != a[2]:
    print('Yes')
    exit()
if a[0] != a[1] and a[1] == a[2]:
    print('Yes')
    exit()
print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

import sys
readline = sys.stdin.readline
read = sys.stdin.read

#n,*a = [int(i) for i in read().split()]
#a = [int(i) for i in readline().split()]
#n = int(input())


#n,*a = [int(i) for i in read().split()]
a = [int(i) for i in readline().split()]
#n = int(input())

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

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math

import itertools

#import bisect

import copy
from functools import lru_cache

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]



def main():
    a,b,c=map(int,input().split())
    ans="No"
    if a==b and b!=c:
        ans="Yes"
    elif a==c and a!=b:
        ans="Yes"
    elif b==c and a!=b:
        ans="Yes"
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

A = [int(x) for x in input().split()]

from collections import Counter

c = Counter(A)

for i in c.values():
    if i == 2:
        print("Yes")
        sys.exit()
print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

ABC.sort()

if ABC[0] == ABC[1] < ABC[2]:
    print('Yes')
elif ABC[0] < ABC[1] == ABC[2]:
    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:
li = set(input().split())
if len(li) == 2:
    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'
elif a == c and a != b:
  ans = 'Yes'
elif b == c and a != b:
  ans = 'Yes'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
ct = Counter(list(map(int, input().split())))
if ct.most_common(1)[0][1] == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in 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:
a,b,c = map(int,input().split())
l = list(set([a,b,c]))
if len(l) == 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:
import sys
input = sys.stdin.readline

def main():
    inp = input().split()
    if len(list(set(inp))) == 2:
        print('Yes')
    else:
        print('No')



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print("YNeos"[len(set(input().split()))!=2::2])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc155/tasks/abc155_a

a = [int(x) for x in input().split()]
print("Yes" if len(set(a)) == 2 else "No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C = [int(i) for i in 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, B, C = list(map(int, input().split()))

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

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

Submission status: Accepted

Solution code:
list1 = [int(i)for i in input().split()]
if len(set(list1))==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:
abclist=list(map(int,input().split()))
s=set()
for l in abclist:
  s.add(l)
  
if len(s)==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 B!=C) or (C==B 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 A == C and B != C:
    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:
  print("No")
elif a!=b and b!=c and a!=c:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
A, B, C = map(int, input().split())
c = 0
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 A != C:
  print('Yes')
  exit()

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

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

print('No')

Submission status: Accepted

Solution code:
ABC=list(map(int,input().split()))
setABC=set(ABC)
if len(setABC)==2:
    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:
print("Yes" if len(set(input().split()))==2 else "No")

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:
def main():
    abc = input().split(" ")
    if len(set(abc)) == 2:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

A,B,C = LI()

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:
def examA():
    N = LI()
    N.sort()
    if N[0]==N[1] and N[0]!=N[2]:
        print("Yes")
    elif N[1]==N[2] and N[0]!=N[2]:
        print("Yes")
    else:
        print("No")
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

def examE():
    ans = 0
    print(ans)
    return

def examF():
    ans = 0
    print(ans)
    return

import sys,copy,bisect,itertools,heapq,math,random
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

if __name__ == '__main__':
    examA()

"""

"""

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from fractions import gcd
#mod = 10 ** 9 + 7
#N = int(input())
#a = list(map(int,input().split()))
#a,b,c = map(int,input().split())
#ans = [0] * N
#math.ceilで切り上げ
#dp = [[0] * 4 for i in range(3)] #2次元配列初期化
#dp = [[[0] * 2 for i in range(3)] for j in range(5)]
#(ord('A'))でASCII出力 Aは65
import math
import string

def intinput():
    return int(input())

def listintinput():
    return list(map(int,input().split()))

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

A,B,C = splitintinput()
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=list(map(int,input().split()))
n=len(set(A))
print('Yes' if n==2 else'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 (a==c and a!=b):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
L = sorted(map(int, input().split()))
if L[0]==L[1] and L[1]!=L[2]:
  print("Yes")
elif L[1]==L[2] and L[0]!=L[1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if len({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:
    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:
nums = list(map(int, input().split(' ')))
if len(set(nums)) == 2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
nums = [int(str) for str in input().strip().split()]

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

Submission status: Accepted

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

import sys
from collections import Counter

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

li = LIST()

C = Counter(li)
if len(C) == 2:
    Yes()
else:
    No()

Submission status: Accepted

Solution code:
import itertools
import math
import sys
from collections import Counter

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(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:
#!/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 A!= B):
        print(YES)
    else:
        print(NO)
    return


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:
  print('No')
  exit(0)

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

Submission status: Accepted

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

set_ = set()
set_.add(a)
set_.add(b)
set_.add(c)
if len(set_) == 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:
a,b,c=map(int,input().split())
d=set([a,b,c])
if len(d)==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")
    exit()
if B == C and C != A:
    print("Yes")
    exit()
if C == A and A != B:
    print("Yes")
    exit()

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:
input = raw_input
nums = map(int, input().split(" "))
nums = set(nums)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import numpy as np
# import scipy as sp
# print(a,b,c,sep="") # 半角スペースなしで出力(abc)
# n=int(input())  #数値入力 「N」だけの入力のとき
# a,b=map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
# a=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
# a=[int(input()) for _ in range (n)]  #リスト入力  改行でa1 ... anのとき
# s=[list(map(str,list(input()))) for i in range(h)]  # 文字列の二次元配列入力
# s = [list(map(int, input().split())) for i in range(n)] # 数値の二次元配列入力
# a = b[:], a = [x[:] for x in b] # deepcopy
# chr(ord('a') + 1) # chrのインクリメント
# s.sort(key=lambda x: x[1], reverse=False) # 2番目の要素で昇順にソート（Trueなら降順）
#

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


def main():
    A, B, C = [int(x) for x in input().split()]
    if A == B and B != C:
        print("Yes")
        return
    if C == B and B != A:
        print("Yes")
        return
    if C == A and B != C:
        print("Yes")
        return
    print("No")




if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

a,b,c = get_all_int()

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

Submission status: Accepted

Solution code:
# ABC155 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(str, input().split())
nl = lambda: list(map(int, input().split()))
a,b,c=nm()
d=set()
d.add(a)
d.add(b)
d.add(c)
if len(d)==2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

A,B,C = LI()

if A==B and A!=C:
    print('Yes')
    exit()
if A==C and A!=B:
    print('Yes')
    exit()
if B==C and A!=B:
    print('Yes')
    exit()
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]) or (A[0] != A[1] and A[1] == A[2]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

a = list(map(int, input().split()))
a = np.unique(a)
if len(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:
N = map(int, input().split())
n_set= set(N)
if len(n_set) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

a = li()
b = list(set(a))
if len(b) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputs = [int(x) for x in input().split()]
if len(set(inputs)) == 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 C==B and A!=C:
    print("Yes")
elif A==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 and b != c and c != a:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

a.sort()
count = 0
for i in range(2):
    if a[i] == a[i+1]:
        count += 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# s = input()
# n = int(input())
a, b, c = map(int, input().split())
# p = list(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())

S = sorted([A,B,C])

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