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,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 = 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) 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 == 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) or (B==C and B!=A) or (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 A!=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:
abc = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
def main():
    a = [int(i) for i in input().split()]

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if len(list(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:
    print("No")
    exit(0)
elif a == b or b == c or c == a:
    print("Yes")
    exit(0)
else:
    print("No")
    exit(0)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M, L = map(int, input().split())
if ((N == M and M != L) or (N != M and M == L) or (N == L and N != M)):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a = map(int, input().split(' '))
x = set(a)
if len(x) == 2:
    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:
#coding:utf-8
num = list(map(int, input().split()))

num_list = set(num)

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
import time
# import itertools

mod = int(1e9+7)
INF = 1<<29

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

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c = map(int, raw_input().strip().split())
a, b, c = sorted([a, b, c])

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

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

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:
a, b, c = map(int, input().split())
l = [a, b, c]
a = set(l)
if len(a) == 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:
def main():
    *a, = map(int, input().split())
    st = set(a)
    print('Yes' if len(st) == 2 else 'No')


if __name__ == '__main__':
    main()

# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a_list = input().split()
if len(set(a_list)) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""


a,b,c = m()

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

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

Submission status: Accepted

Solution code:
import sys

t = sys.stdin.read()
a, b, c = map(int, t.split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

s=set(map(int,input().split()))
if len(s)==2:
  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()

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

S = set(ABC)

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

Submission status: Accepted

Solution code:
l=map(int,open(0).read().split())
print("Yes" if len(set(l))==2 else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A = list( map( int, input().split()))
    A.sort()
    if A[0] == A[1] and A[1] != A[2]:
        print("Yes")
        return
    if A[1] == A[2] and A[1] != A[0]:
        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:
    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:
ABC = list(map(int, input().split()))
if len(ABC) - 1 == len(set(ABC)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

st = set(nums)

l = len(st)

if l == 2:
    ans = "Yes"
else:
    ans = "No"

print(ans)

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==C:
        print(NO)
        return
    print(YES if A==B or B==C or A==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:
a,b,c=map(int,input().split())

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

Submission status: Accepted

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

if len(se) == 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())
A = [a, b, c]

if A.count(a) == 2 or A.count(b) == 2 or A.count(c) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(A: int, B: int, C: int):
    if len(set([A, B, C])) == 2:
        yes()
    else:
        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:
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter
from math import factorial
from bisect import bisect_left # bisect_left(list, value)
#from fractions import gcd

sys.setrecursionlimit(10**7)
A, B, C = map(int, input().split())

s = set()
s.add(A)
s.add(B)
s.add(C)

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

Submission status: Accepted

Solution code:
a = [int(i) for i in input().split()]
b = dict()
for i in a:
    b[i] = 1
if len(b) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
import math
import bisect


def main():
    A = list(map(int, input().split()))
    A.sort()
    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')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
A=[A,B,C]
A=set(A)
print("Yes" if len(A)==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:
input1 = list(input().split())

input2 = set(input1)

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

Submission status: Accepted

Solution code:
a = map(int, input().split())
set_num = set(a)
if(len(set_num) == 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:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input()) # n=1
def inpm(): return map(int,input().split()) # x=1,y=2
def inpl(): return list(map(int, input().split())) # a=[1,2,3,4,5,...,n]
def inpls(): return list(input().split())  # a=['1','2','3',...,'n']
def inplm(n): return list(int(input()) for _ in range(n)) # x=[] 複数行
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return sorted([list(map(int, input().split())) for _ in range(n)]) # [[1,1,1,1],[2,2,2,2],[3,3,3,3]] 
def graph():
    n=inp()
    g=[[] for _ in range(n)]
    for i in range(n):
        a = inp()
        a -= 1
        g[i].append(a)
        g[a].append(i)
    return n,g

def main():
    a,b,c = inpm()
    if a==b and b!=c:
        print('Yes')
    elif a==c and b!=c:
        print('Yes')
    elif c==b and b!=a:
        print('Yes')
    else:
        print('No')
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
a = intl()
a = list(set(a))
if len(a) == 2:
    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,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:
a = list(map(int, input().split()))

print("Yes" if len(set(a)) == 2 else "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=[int(i) for i in input().split()]
A=set(A)
if len(A)==2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:


a,b,c=(int(i) for i in input().split())

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
li = [int(zz) for zz in input().split()]
if len(set(li)) == 2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

t = list(set(ABC))
if len(t) == 2:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B, C):
    return 'Yes' if len(set([A, B, C])) == 2 else 'No'


def main():
    A, B, C = read_int_n()
    print(slv(A, B, C))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)

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

def solve(A: int, B: int, C: int):
    a = sorted([A, B, C])
    if a[0] == a[1] and a[1] != a[2] or a[1] == a[2] and a[1] != a[0]:
        ret = YES
    else:
        ret = NO
    print(ret)
    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:
def main():
    A, B, C = map(int, input().split())

    ans = "No"
    if len(set((A, B, C))) == 2:
        ans = "Yes"

    print(ans)


main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
print("Yes" if len(set([int(a) for a in input().split()])) == 2 else "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:
import sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
mod = 10 ** 9 + 7
 
#整数input
def ii(): return int(sys.stdin.readline().rstrip()) #int(input())
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) #list(map(int,input().split()))
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]
#文字列input
def ss(): return sys.stdin.readline().rstrip() #input()
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) #list(input().split())
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]

#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？
#本当に貪欲法か？ DP法では？？

arr=limii()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC155a


def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**6)
    # 再帰関数を使わない限りPypyで出すこと
    import collections

    if len(collections.Counter(list(map(int, input().split()))).most_common()) == 2:
        print('Yes')
        exit(0)
    print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if A == B != C:
    print("Yes")
elif A != B == C:
    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:
def num():
    return int(input())
def nums():
    return list(map(int,input().split()))

A,B,C = nums()
s = set()
s.add(A)
s.add(B)
s.add(C)
if len(s) == 2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys
import copy

sys.setrecursionlimit(10**9)
mod = 10**7+9
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
def poor(a, b, c):
    return a == b and b != c
if poor(a, b, c) or poor(b, c, a) or poor(c, a, b):
    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:
a  = [list(map(int, s.split())) for s in open(0)][0]

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ls = list(input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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:
l = [int(x) for x in input().split()]

l.sort()

if l[0] == l[2]:
    print("No")
elif l[0] == l[1] or l[1] == l[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
MOD = 10**9+7
 
def input():
    return sys.stdin.readline()[:-1]
 
def main():
    l = list(map(int, input().split()))
    if len(set(l)) == 2:
        print("Yes")
    else:
        print('No')
 
 
if __name__ == "__main__":
    main()

Submission status: Accepted

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

if len(K)==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:
a,b,c = map(int,input().split())

A = list([a,b,c])

B = set(A)

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

Submission status: Accepted

Solution code:
a = len(set(list(map(int,input().split()))))
if a == 2:
  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:

def main():
    from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #n = int(stdin.readline()[:-1])   
    #r = stdin.readline()[:-1]
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]
    #n = int(r)
    #a = r.split()
    #a,b,c = r.split()
    #a = list(map(int, r.split()))
    #a,b,c,d = map(int, r.split())
    #a = list(map(int, r.split()))
    #a = [int(s[i]) for i in range(1, n+1)]
    #a = [list(map(int, r.split())) for i in range(1,n+1)]
    #a = [list(map(int, input().split())) for i in range(1,n+1)]
    #res = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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