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: Runtime Error

Solution code:
import sys
input=sys.stdin.readline
n,k=map(int,input().split())
a=list(map(int,input().split()))
ap,an=[],[]
zeronum=0
for i in range(n):
  if a[i]>0:
    ap.append(a[i])
  elif a[i]<0:
    an.append(-a[i])
  else:
    zeronum+=1
np,nn=len(ap),len(an)
def fminus(x):
  j=0
  cnt=0
  for i in range(np):
    cnt*=2
    while j<np and an[j]*ap[i]>=x:
      j+=1
      cnt+=1
  return cnt
def fplus(x,length,lis):
  r=length-1
  cnt=0
  for l in range(length):
    while lis[r]*lis[l]>x:
      if r==l:
        break
      r-=1
    if r==l:
      break
    elif lis[r]*lis[l]<=x:
      cnt+=r-l
  return cnt
if np*nn<k<=np*nn+zeronum*(zeronum-1)//2+zeronum*(np+nn):
  print(0)
else:
  an.sort(reverse=True)
  ap.sort(reverse=True)
  #print(ap)
  #print(an)
  if k<=np*nn:
    ng=10**18
    ok=0
    while ng-ok>1:
      mid=(ok+ng)//2
      if fminus(mid)>=k:
        ok=mid
      else:
        ng=mid
    print(-ok)
  else:
    an.sort()
    ap.sort()
    k-=np*nn+zeronum*(zeronum-1)//2+zeronum*(np+nn)
    #print(k)
    ok=10**18
    ng=0
    #print(ok,ng)
    while ok-ng>1:
      mid=(ok+ng)//2
      if fplus(mid,nn,an)+fplus(mid,np,ap)>=k:
        ok=mid
      else:
        ng=mid
    print(ok)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
# Useful data structures
from collections import Counter, defaultdict, deque, namedtuple

# Most useful math functions
from math import gcd

# For sys.std*, sys.argv etc...
import sys

# For cases when input tokens are spread unevenly over many lines.
# This provides methods for reading tokens of various types.
class BufferedTokenizer:
    pass

def read_ints():
    return [int(token) for token in input().split()]

def read_tokens():
    return input().split()

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

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
    n= int(input())
    lista=[]
    listanova=[]
    for x in input().split():
    	x= int(x)
    	if x %2 ==0:
    		lista.append(x)
    for x in lista:
    	if x %3==0 or x%5==0:
    		listanova.append(x)
     
    if len(lista)==len(listanova):
    	print('APPROVED')
    else:
    	print('DENIED')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
for i in range(n):
    if a[i] % 2 == 0:
        if a[i] % 3 == 0 or a[i] % 5 == 0:
            pass
        else:
            print("DENIED")
            exit()
print("APPROVED")

Submission status: Runtime Error

Solution code:
import collections
N=int(input())
l=[input() for i in range(N)]
c=collections.Counter(l)
c=c.most_common()
l2=[]
 
M=c.[0][1]
for i in range(N):
    if c.[i][1]==M:
        l2.append(c.[i][0])
    else:
        break
l2.sort()
for j in range(len(l2)):
    print(l2[j])

Submission status: Runtime Error

Solution code:
import collections
N=int(input())
l=[input() for i in range(N)]
c=collections.Counter(l)
c=c.most_common()
l2=[]

M=c.[0][1]
for i in range(N):
    if c.[i][1]==M:
        l2.append(c.[i][0])
    else:
        break
l2.sort()
for j in range(len(l2)):
    print(l2[j])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, C = (int(x) for x in input().split())
if A = B = c:
  print('No')
elif A = B:
  print('Yes')
elif B = C:
  print('Yes')
elif A = C:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
for case in range (int(input())):
    triple = input().split()
    for i in range (3):
        triple[i] = int(triple[i])
    triple.sort()
    if (triple [0] == triple [2]) :
        print('No')
    elif (triple[0] == triple [1] or triple[1] == triple [2]) :
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:
A,B,C=input().split
a,b,c=int(A),int(B),int(C)

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

Submission status: Runtime Error

Solution code:
import sys
import math
import numpy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
 
s = int(readline())
if s % 2 == 1:
    print(0)
else:
    s //= 2
    ans = 0
    while s:
        s //= 5
        ans += s
    print(ans)

Submission status: Runtime Error

Solution code:
import sys
import math
import numpy
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
 
p = int(readline())
if p % 2 == 1:
    print(0)
else:
    p //= 2
    ans = 0
    while p:
        p //= 5
        ans += p
    print(ans)

Submission status: Runtime Error

Solution code:
#include<stdio.h>
void main( )
{
int e,f,g;
scanf("%d%d%d", &e, &f, &g);
int count = 0;
if( e==f && f!=g)
count=1;
if( f==g && g!=f)
count=1;
if( g==e && e!=f)
count=1;

if(count==1)
{
 printf("Yes");
}
else
{
printf("No");
}
}

Submission status: Runtime Error

Solution code:
#include <stdio.h>

int main()
{
    int a,b,c;
    scanf("%d %d %d", &a, &b, &c);
    if((a==b && a != c) || (a==c && a != b) || (c==b && a != c))
    printf("Yes");
    else
    printf("No");

    return 0;
}

Submission status: Runtime Error

Solution code:
A,B,C=input.split()
a=int(A)
b=int(B)
c=int(C)
if a==b or b==c or a==c:
    if not(a==b and b==c):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Runtime Error

Solution code:
l=input()
a=int(l[0])
b=int(l[1])
c=int(l[2])
if a==b or b==c or a==c:
    if not(a==b and b==c):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
if a==b:
    if b==c: 
        print('NO')
    else:
        print('YES')
elif b==c:
    if a==c: 
        print('NO')
    else:
        print('YES')
elif a==c:
    if b==c:
        print('NO')
    else:
        print('YES')
else:
    print('NO')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
C = int(input())

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

Submission status: Runtime Error

Solution code:
def poor(a,b,c):
    if (a==b and a!=c) or (b==c and b!=a) or (a==c&&a!=b):
        print("Yes")
    else:
        print("No")
        
A,B,C = input().split()
a = A
b = B
c = C
d = poor(a,b,c)
print(d)

Submission status: Runtime Error

Solution code:
def stringconcant(S,T):
    a = S
    b = T
    c = a+b
    return c

S,T= input().split()
a = stringconcant(T,S)
print(a)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
c = int(input())

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

Submission status: Runtime Error

Solution code:

def findTriplet(arr, n): 

      

    # sort the array 

    arr.sort() 

   

    # for every element in arr 

    # check if a pair exist(in array) whose 

    # sum is equal to arr element 

    i = n - 1

    while(i >= 0): 

        j = 0

        k = i - 1

        while (j < k): 

            if (arr[i] == arr[j] + arr[k]): 

                 

                # pair found 

                print "numbers are ", arr[i], arr[j], arr[k] 

                return

            elif (arr[i] > arr[j] + arr[k]): 

                j += 1

            else: 

                k -= 1

        i -= 1

          

    # no such triplet is found in array 

    print "No such triplet exists"

   
# driver program 

arr = [ 5, 32, 1, 7, 10, 50, 19, 21, 2 ] 

n = len(arr) 
findTriplet(arr, n) 

  
# This code is contributed by Sachin Bisht

Submission status: Runtime Error

Solution code:
#
N=int(input())
S=[]
for i in range(N):
    S.append(input())
ans=[]

#
while len(S):
    if len(S)==1:
        x = [S.pop(-1), 1]
        ans.append(x)
        break
    x = [S.pop(-1), 1]
    for i in S[:]:
        if x[0] == i:
            S.remove(i)
            x[1]+=1
    ans.append(x)
ans.sort()
ans.sort(key=lambda x:x[1],reverse=True)

for i in range(len(ans)):
    t=ans[0][1]
    if ans[i][1]==t:
        print(ans[i][0])

Submission status: Runtime Error

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: Runtime Error

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

S=set(A,B,C)

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

Submission status: Runtime Error

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

S=set{A,B,C}

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = list(map(int, input().split()))
print(x)
x = sorted(x)
print(x)
if count(x[1]) == 2:
     print("Yes")
else:
     print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import collections
N = int(input())
 
dic = {}
for i in range(N):
  S = input()
  if S in dic:
    dic[S] += 1
  else:
    dic[S] = 1
maxval = max(dic.values())
 
keys = [k for k, v in dic.items() if  v == max(dic.values())]
[print(sorted(keys)[i]) for i in range(len(keys))]

Submission status: Runtime Error

Solution code:
a = list.map(int,input().split())
if sorted(a) != a:
  print('yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
arr=list(map(int,input().strip().split()))[:3]
if(arr[0]==arr[1] and arr[0]!=arr[2]):
  print("Yes")
elif(arr[1]==arr[2] and arr[1]!=arr[0]):
  print("Yes")
elif(arr1[0]==arr[2] and arr1[0]!=arr[1]):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
n = int(input())
s_list = [input() for i in range(n)]
s_set = set(s_list)
max = 0
max_elements = []
for i in s_set:
    c = s_list.count(i)
    if c > max:
        max = c
        max_elements = [i]
    if c == max and i not in max_elements:
        max_elements.append(i)

for i in sorted(max_elements):
    print(i)

Submission status: Runtime Error

Solution code:
n = int(input())
s_list = [input() for i in range(n)]
s_set = set(s)
max = 0
max_elements = []
for i in s_set:
    c = s_list.count(i)
    if c > max:
        max = c
        max_elements = [i]
    if c == max and i not in max_elements:
        max_elements.append(i)

for i in sorted(max_elements):
    print(i)

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(i) for i in input().split() if i % 2 == 0]
for i in a:
    if i % 3 != 0 and i % 5 != 0:
            print("DENIED")
            exit()
print("APPROVED")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

for i in a:
    if i % 2 ==0:
      if i %3 ==0 or i %5 ==0:
        continue
      else:
        print("DENIED")
        break
else:
  print("APPROVED")

Submission status: Runtime Error

Solution code:
A,B,C=[int(s) for s in input().split()]
if A==B=C:
    print("No")
elif A!=B!=C:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
lis = [input() for i in range(N)]

 
tmp_dic = {}
for s in lis:
    if s not in tmp_dic:
        tmp_dic[s] = 1
    else:
        tmp_dic[s] += 1
        
max_count = 0
for k,v in tmp_dic.items():
    max_count = max(v,max_count)
    
ans_lis = []
for k,v in tmp_dic.items():
    if v == max_count:
        ans_lis.append(k)
        
ans_lis.sort()
[print(f"{s}") for s in ans_lis]

Submission status: Runtime Error

Solution code:
from bisect import bisect_left

def binsearch(l, r, fn):
    while r - l > 1:
        m = (l + r) // 2
        if fn(m):
            l = m
        else:
            r = m
    return l

n, k = map(int, input().split())
A = sorted(list(map(int, input().split())))
p = bisect_left(A, 0)
an = A[:p]
ap = A[p:]

if k < p * (n - p):
    def helper(x):
        t = 0
        r = 0
        for p in ap:
            while t < len(an) and an[t] * p <= x:
                t += 1
            r += t
        return r < k
    l = binsearch(ap[-1] * an[0] - 1, 1, helper)
else:
    k -= p * (n - p)
    an.reverse()
    def helper(x):
        r = 0
        for a in [ap, an]:
            t = len(a) - 1
            for i, p in enumerate(a):
                if t <= i:
                    break
                while t > i and a[t] * p > x:
                    t -= 1
                r += t - i
            return r < k
        m = ap[-1]
        if an:
            m = max(m, -an[-1])
        l = binsearch(-1, m * m, helper)
print(l + 1)

Submission status: Runtime Error

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

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

print('Yes' if len(set(map(int, input().split())))==2 'No')

Submission status: Runtime Error

Solution code:
    # 入力の取得(空白を除く)
    s = list(input().split())

    # 処理
    isPoor = False
    if s[0] == s[1] and s[1] != s[2]:
        isPoor = True
    if s[1] == s[2] and s[2] != s[0]:
        isPoor = True
    if s[2] == s[0] and s[0] != s[1]:
        isPoor = True

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

Submission status: Runtime Error

Solution code:
# 初期入力
N = int(input())
word = [ input() for i in range(N) ]

# 単語をキーに数を数えて辞書
from collections import Counter
kazu_word = Counter(word)

#一番多い単語を抜き出す
kazu_word_a = max(kazu_word.values()) #　内包表記の中で毎回MAXを計算するより出したほうが１回で済む
kazu_word_max =[i for i,v in kazu_word.items() if v == kazu_word_a ]
kazu_word_max_sorted = sorted(kazu_word_max)
"""
print(kazu_word)
print(kazu_word_max)
"""
#print(*kazu_word_max_sorted,sep="\n")
print("\n".join(kazu_word_max_sorted)) #sortedをやめて sortにした

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
'''
    Auther: ghoshashis545 Ashis Ghosh
    College: jalpaiguri Govt Enggineerin College
    Date:24/03/2020
'''
from math import ceil,sqrt,log,gcd
def ii():return int(input())
def si():return input()
def mi():return map(int,input().split())
def li():return list(mi())
def main():
    
    # for _ in range(ii()):
    
    a=li()
    if(len(set(a))==2):
        print('Yes')
    else:
        print('No')
        
















    
    
if __name__ =="__main__":
    main()

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

else:
  print('No')

Submission status: Runtime Error

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

ans = all(a%3==0 or a%5==0 for a in A if a%2==0)
if ans:
    print("APPROVED")
else:
    print("DENIED")

Submission status: Runtime Error

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

ans = False
for a in n:
    if a % 2 == 0:
        if a % 3 == 0 or a % 5 == 0:
            ans = True
if ans:
    print("APPROVED")
else:
    print("DENIED")

Submission status: Runtime Error

Solution code:
list=[int(input()) for i in range(3)]
print("Yes" if len(set(list))=2 else "No")

Submission status: Runtime Error

Solution code:
list=[int(input()) for i in range(3)]
print(len(set(list)))

Submission status: Runtime Error

Solution code:
from collections import Counter

n = int(input())
s = [input() for _ in range(n)]
ans = []

charctor_count = Counter(s)
max_count = max(charctor_count.values())
for k, v in charctor_count.items():
  if v == max_count:
    ans.append( k)
print("\n".join(sorted(ans)))

Submission status: Runtime Error

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

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

print(answer)

Submission status: Runtime Error

Solution code:
x=input()
y=x.split()

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

Submission status: Runtime Error

Solution code:
x=input()
y=x.split()
if y[0] = y[1] :
    if y[0] = y[2]:
        print("No")
    else:
        print("Yes")
elif y[2] = y[1] :
        print("Yes")

Submission status: Runtime Error

Solution code:
x=input()
y=x.split("  ")
if y[0] = y[1] :
    if y[0] = y[2]:
        print("No")
    else:
        print("Yes")
elif y[2] = y[1] :
        print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
Af = list(map(int,input().split()))
A = list()
for i in range(N):
  if Af[i] % 2 == 0:
      A.append(Af[i])
      continue
  else:
      continue
for i in range(len(A)):
  if A[i] % 3 != 0 and A[i] % 5 != 0:
      print('DENIED')
      import sys
      sys.exit()
  if A[i] % 3 == 0 or A[i] % 5 == 0:
      continue 
print('APPROVED')

Submission status: Runtime Error

Solution code:
A = input()
if A[0] != A[2] == A[4] or A[2] != A[4] == A[0] or A[4] != A[0] == A[2]:
    input('Yes')
else:
    input('No')

Submission status: Runtime Error

Solution code:
A = input()
if A[0] != A[2] == A[4] or A[2] != A[4] == A[0] or A[0] != A[4] == A[2]:
    input('Yes')
else:
    input('No')

Submission status: Runtime Error

Solution code:
import numpy as np

from bisect import bisect

DEBUG = False


def bisect_f(f, lo, hi):
    if DEBUG:
        assert f(lo) and not f(hi)
    while hi - lo > 1:
        mid = (lo + hi) // 2
        if f(mid):
            lo = mid
        else:
            hi = mid
        if DEBUG:
            assert f(lo) and not f(hi)
    if DEBUG:
        assert hi - lo == 1
        assert f(lo) and not f(hi)
    return lo


N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
neg = []
zero = []
pos = []
for x in A:
    if x < 0:
        neg.append(x)
    elif x == 0:
        zero.append(x)
    else:
        assert x > 0
        pos.append(x)

revAbsNeg = [-x for x in reversed(neg)]  # Reverse neg and keep magnitude only
posSq = [x ** 2 for x in pos]
negSq = [x ** 2 for x in revAbsNeg]

pos = np.array(pos, dtype=np.int64)
revAbsNeg = np.array(revAbsNeg, dtype=np.int64)


def countDistinctPairsLessThan(arr, prod):
    # Given a sorted array find the number of pairs that are < prod
    # O(N * log(N)) where N = len(arr)

    N = arr.shape[0]
    assert arr.shape == (N,)
    count3 = np.sum(
        np.minimum(np.arange(N), np.searchsorted(arr, (prod - 1) // arr, side="right"))
    )

    if DEBUG:
        count = 0
        for i, x in enumerate(arr):
            count += bisect(arr, (prod - 1) // x, 0, i)

        count2 = 0
        for i in range(len(arr)):
            for j in range(i + 1, len(arr)):
                if arr[i] * arr[j] < prod:
                    count2 += 1

        print(count, count2, count3)
        assert count == count2 == count3
    return count3


def countPairsLessThanOrEqual(arr1, arr2, prod):
    # Given two sorted arrays containing *positive* numbers only,
    # find the number of pairs between the two arrays that are <= prod
    # O(N * log(M)) where N = len(arr1), M = len(arr2)
    if len(arr1) > len(arr2):
        arr1, arr2 = arr2, arr1

    count3 = np.sum(np.searchsorted(arr2, prod // arr1, side="right"))

    if DEBUG:
        count = 0
        for x in arr1:
            count += bisect(arr2, prod // x)
        count2 = 0
        for x in arr1:
            for y in arr2:
                if x * y <= prod:
                    count2 += 1
        assert count == count2 == count3
    return count3


def getIndex(prod):
    # Count number of pairs strictly less than prod
    count = 0
    if prod < 0:
        # All negatives except for the negatives with abs value less than or equal -prod
        count += len(pos) * len(neg)
        count -= countPairsLessThanOrEqual(pos, revAbsNeg, -prod)
    elif prod >= 0:
        # All negatives
        count += len(pos) * len(neg)
        if prod > 0:
            # All zeroes
            count += len(zero) * len(neg)
            count += (len(zero) * (len(zero) - 1)) // 2
            count += len(zero) * len(pos)
            # Positives with positives
            count += countDistinctPairsLessThan(pos, prod)
            # Negatives with negatives
            count += countDistinctPairsLessThan(revAbsNeg, prod)

    if DEBUG:
        count2 = 0
        for i in range(N):
            for j in range(i + 1, N):
                if A[i] * A[j] < prod:
                    count2 += 1
        assert count == count2
    return count


def solve(K):
    lo = -10 ** 18
    hi = 10 ** 18 + 1
    if DEBUG:
        assert getIndex(lo) <= K < getIndex(hi)
    prod = bisect_f(lambda prod: getIndex(prod) <= K, lo, hi)
    if DEBUG:
        assert getIndex(prod) <= K < getIndex(prod + 1)
    return prod


if DEBUG:
    for k in range((N * (N - 1)) // 2):
        print("k", k, solve(k))

print(solve(K - 1))  # K is 1-indexed

Submission status: Runtime Error

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

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

print("No")

Submission status: Runtime Error

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

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

print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
for i in range(a):
    if i%2==0:
        if i%3 !=0 or i%5 !=0:
            print('DENIED')
print('APPROVED')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
List= sorted(int,input().split())
if len(List)==2:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = list(map(int, input().split()))
if n[0] == n[1]:
    if n[0] == n[2]:
    print("Yes")
print("No")

Submission status: Runtime Error

Solution code:
n = list(map(int, input().split()))
if n[0] !== n[1]:
    print("Yes")
    exit(0)
if n[0] !== n[2]:
    print("Yes")
    exit(0)
print("No")

Submission status: Runtime Error

Solution code:
n = list(map(int, input().split()))
if n[0] !== n[1]:
    print("Yes")
    return
if n[0] !== n[2]:
    print("Yes")
    return
print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int, input().split()))
for a in A:
    if a%2 == 0 and ( a%3 != 0 and a%5 != 0 ):
        print('DENIED')
        exit()
print('APPROVED')

Submission status: Runtime Error

Solution code:
import sys
myset=set()
for n in range(3):
	myset[n-1].add(sys.argv[n])
if len(myset)==2:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

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

else :
    print("No")

Submission status: Runtime Error

Solution code:
#i桁めをそのまま払うかi+1桁めの額の紙幣で支払うかでDP
N = input()
digit = len(N)
l_N = [0] * digit
for i in range(1, digit + 1):
  l_N[i - 1] = int(N[-i])
dp = 0
for i in range(digit):
  dp += min(l_N[i], 10 - l_N[i] + 1)
  #print(dp)
print(dp)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input().split()))
ans="APPROVED"
for i in A:
    if i%2==0:
        if i%3!=0 and i%5!=0:
            ans="DENIED"
            break
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input().split()))
ans="APPROVED"
for i in A:
    if i%2==0:
        if i%3!=0 and i%5!=0:
            ans="DENIED"
           
            break
print(ans)

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
a,b,c = list(map(int,input().split()))
ret = "No"
if len(set(a,b,c))==2:
    ret = "Yes"
print(ret)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
x = 0
for j in range(0,n):
  if not (((a[j] % 2) == 0) and (((a[j] % 3) != 0) or (a[j] % 5 != 0))):
    x = 1
if x == 1:
  print('APPROVED')
else:
  print('DENIED')

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(i) for i in input().split()]
x = 0
for j in range(0,n):
  if not (((a[j] % 2) == 0) and (((a[j] % 3) != 0) and (a[j] % 5 != 0))):
    x = 1
if x == 1:
  print('APPROVED')
else:
  print('DENIED')

Submission status: Runtime Error

Solution code:
x, y, z = input.split()
a = "No"
if x != y:
	if y = z:
      a = "Yes"
      elif x = z:
        a = "Yes"
      else: a = "No"
if x = y:
  if y = z:
    a = "No"
    elif x = z:
      a = "No"
    else: a = "Yes"
print(a)