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

result = "APPRPVED"
for num in nums:
    if(num % 2 == 0) and (num % 3 != 0) or (num % 5 != 0):
        result = "DENIED"
        break

print(result)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input().sprit()
if s[0]==s[1] and s[0]!=s[2] print("Yes")
elif s[0]==s[2] and s[0]!=s[1] print("Yes")
elif s[2]==s[1] and s[0]!=s[2] print("Yes")
else print("No")

Submission status: Runtime Error

Solution code:
from collections import Counter
a=list(map(int,input().split()))
dic=Counter(a)
for i in dic.values():
	if i==2:
		print("Yes")
        exit()
print("No")

Submission status: Runtime Error

Solution code:
from collections import Counter
a=list(map(int,input().split()))
dic=Counter(a)
for i in dic.values():
	if i==2:
		print("Yes")
    	exit()
print("No")

Submission status: Runtime Error

Solution code:
from collections import Counter
a=list(map(int,input().split()))
dic=Counter(a)
for i in dic.values():
	if i==2:
      print("Yes")
	  exit()
print("No")

Submission status: Runtime Error

Solution code:
from collections import Counter
a=list(map(int,input().split()))
dic=Counter(a)
for i in dic.values():
	if i==2:
	    print("Yes")
        exit()
print("No")

Submission status: Runtime Error

Solution code:
from collections import Counter
a=list(map(int,input().split()))
dic=Counter(a)
for i in dic.values()
	if i==2:
	    print("Yes")
      	exit()
print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
anser = 'APPROVED'
A_list = list(map(int, input().split()))
for A in A_list:
    if A % 2 == 1:
        continue
    if A % 3 == 0:
        continue
    if A % 5 == 0:
        continue
    anser = 'DENIED'
    break
print(anser)

Submission status: Runtime Error

Solution code:
if A == B == C:
  print("No")
elif A == B or B == C or C == A:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

print("Yes" if len(set({a,b,c})) == 2 else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys 
read = sys.stdin.buffer.read 
readline = sys.stdin.buffer.readline 
readlines = sys.stdin.buffer.readlines 
import numpy as np 
MOD = 10 ** 9 + 7 
MOD2 = 998244353

A,B,C = map(int, read().split())
print 'No' if A == B == C else 'Yes'

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

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

result = 'APPROVED'


        
for i in range(0,N):
  if a[i] %2 == 0:
     if (a[i] %3 != 0) and (a[i] %5 != 0):
        result ='DENIED'

        break
        
        
print (result)

Submission status: Runtime Error

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

for i in a:
    if i % 2 == 0 and not (i % 3 == 0 or i % 5 == 0):
        print('DENIED')
		
print('APPROVED')

Submission status: Runtime Error

Solution code:
import bisect
#import numpy as np
N,K=[int(_) for _ in input().split()]
if N==4:
    raise
#A = np.array([int(_) for _ in input().split()],dtype=int)
#A.sort()
A=sorted([int(_) for _ in input().split()])

#target以下の積がK個以上ある最小のtarget

def check(target):
    cnt=0
    for i, a in enumerate(A):
        if a < 0:
            il = bisect.bisect_left(A,  target / a)
            #il = np.searchsorted(A,target/a,side='left')
            #ilからiまで、ただしilがiを超えたら0
            d = max(i - il, 0)
        elif a > 0:
            ir = bisect.bisect_right(A, target / a)
            #ir = np.searchsorted(A,target/a,side='right')
            #0からirまで、ただしirがiを超えたらi
            d = min(ir, i)
        else:
            d = i if target >= 0 else 0
        #print(target,a,d)
        cnt+=d
    return cnt>=K

lb = -10**18-1
rb = 10 ** 18 + 1
# Min x for check(x) == True
while rb - lb > 1:
    mid = (rb + lb) // 2
    if check(mid):
        rb = mid
    else:
        lb = mid
print(rb)

Submission status: Runtime Error

Solution code:
from bisect import bisect_left, bisect_right

N, K = map(int, input().split())
As = sorted(map(int, input().split()))
        
l = - (10 ** 18 + 10)
r = 10 ** 18 + 10
while True
    mid = (l + r) // 2
    count = 0
    for i, A in enumerate(As):
        if A > 0:
            count += bisect_right(As, mid//A, lo = i+1) - (i+1)
        elif A < 0:
            count += N - bisect_left(As, -((-mid)//A), lo = i+1)
        else:
            if mid >= 0:
                count += N - i - 1
    if count < K:
        l = mid
    else:
        r = mid
    if r - l == 1:
        break

print(r)

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

template <class T>
void printArray(vector<T> arr) {
	for (T a: arr) cout << a << " ";
	cout << '\n';
}

void printVerdict(bool verdict) {
	cout << (verdict ? "Yes": "No") << '\n';
}

void printDecimal(double d) {printf("%.9f\n", d);}

int main() {
	std::ios_base::sync_with_stdio(false);
	cin.tie(0);
	set<int> s;
	int a,b,c; cin >> a >> b >> c;
	s.insert(a);
	s.insert(b);
	s.insert(c);
	bool verdict = false;
	if (size(s) == 2) verdict = true;
	printVerdict(verdict);
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().strip().split()))[:n]
flag = True
for num in a:
    if num % 2 == 0:
        if num % 3 != 0 and num % 5 != 0:
            flag = False
if  flag==True:
    print("APRROVED")
else :
    print("DENIED")

Submission status: Runtime Error

Solution code:
from sys import stdin
def read():
    return stdin.readline().strip()

dict={}
output=[]

iteration=int(read())

max_val=-1

for _ in range(iteration):
    item=read()
    
    if dict.get(item) is None:
        dict[item]=0 
    dict[item]+=1 
    max_val = max(dict[item],max_val)
#max_val=max(dict.values())
for k,v in dict:
    
    if(max_val==v):
        output.append(max_key)
    
    
output.sort()
print('\n'.join(output))

Submission status: Runtime Error

Solution code:
N = int(input())
S_list = []
for _ in range(N):
    S_list.append(input())

S_dict = {}
for s in S_list:
    S_dict[s]=0
for s in S_list:
    S_dict[s]+=1

max_kv = max(S_dict.values())

max_k_list = [kv[0] for kv in S_dict.items() if kv[1] == max_kv]
max_k_list.sort()
for k in max_k_list:
    print(k)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
flg = True
for num in a:
    if num % 2 == 0:
        if num % 3 != 0 and num % 5 != 0:
            flg = False
print("APPROVED" if flg is True else "DENIED")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
flg = True
for num in a:
    if num % 2 == 0:
        if num % 3 != 0 and num % 5 != 0:
            flg = False
print("APPROVED" if flg is True else "DENIED")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int,input().split()))
tmp = [int(x) for x in A if x%2 == 0]
 
cnt = 0
for i in tmp:
    if i % 3 == 0 or i % 5 == 0:
        cnt += 1
 
if cnt == len(tmp):
    print('APPROVED')
else:
    print('DENIED')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
A,B,C = map(int, readline().split())
if (A == B and B != C) or (B == C and C != A)  (A == C and C != B):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
A = [0] * 10

B = list(map(int, input().split()))
for i in range(len(B)):
    A[B[i]] += 1

for i in range(len(A)):
    if A[i] == 2:
        print('Yes')
        break
else 
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = "No"

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

Submission status: Runtime Error

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

set = {}

set.add(a)
set.add(b)
set.add(c)

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
  import sys
  input = sys.stdin.readline
  import bisect

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

  A_m = [abs(int(x)) for x in A if x < 0]
  A_m.sort()
  N_m = len(A_m)

  A_p = [int(x) for x in A if x > 0]
  A_p.sort()
  N_p = len(A_p)

  M = N_m * N_p
  P = (1 / 2) * (N_m) * (N_m - 1) + (1 / 2) * (N_p) * (N_p - 1)
  Z = (1 / 2) * N * (N - 1) - (M + P)

  if M < K <= M + Z:
      print(0)
      sys.exit()

  def cnt_M(x):
      cnt = 0
      for i in A_m:
          cnt += bisect.bisect_right(A_p, x // i)
      return cnt >= (M - K + 1)

  if K <= M:
      left = -1 - 10**18
      right = 1 + 10**18 
      while right - left > 1:
          mid = (left + right) // 2
          if cnt_M(mid):
              right = mid
          else:
              left = mid
      print(-right)
      sys.exit()
  K -= (M + Z)
  def cnt_P(x):
      cnt = 0
      ng = 0
      for i in A_m:
          cnt += bisect.bisect_right(A_m, x // i)
          if i ** 2 <= x:
              ng += 1
      for j in A_p:
          cnt += bisect.bisect_right(A_p, x // j)
          if j ** 2 <= x:
              ng += 1
      return (cnt - ng) // 2 >= K

  left = -1 - 10**18
  right = 1 + 10**18
  while right - left > 1:
      mid = (left + right) // 2
      if cnt_P(mid):
         right = mid
      else:
          left = mid

  print(right)
main()

Submission status: Runtime Error

Solution code:
import collections
N=int(input())
S = [str(input()) for _ in range(N)]
c = collections.Counter(S)
most = []
most_num=c.most_common()[0][1]
for i in c.most_common():
    if i[1]==most_num:
        most.append(i[0])
most.sort()
for i in most:
    print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from statistics import mean, median #median(list)で中央値

def input(): return sys.stdin.readline()[:-1]
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    #N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列


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

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


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
n=int(input())

dic={}
for i in range(n):
    s=input()
    if s not in dic:
        dic[s]=1
    else:
        dic[s]+=1

keys=sorted([k for k,v in dic.items() if v==max(dic.values()) ])
for i in keys:
    print(i)

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
k=list(map(int,input().split())))
from collections import Counter
l=Counter(k)
if len(l)==2:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = str(input())
n = len(s)
dp = [[0]*2 for _ in range(n+1)]
dp[0][1] = 1
for i in range(n):
    p = int(s[i])
    dp[i+1][0] = min(dp[i][1]+10-p,dp[i][0]+p)
    dp[i+1][1] = min(dp[i][1]+10-p-1,dp[i][0]+p+1)
print(dp[-1][0])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = list(input().split())
print("Yes" if len(set(A)) == 2 and (A[0].count(A) == 1 or A[0].count(A) == 2) else "No")

Submission status: Runtime Error

Solution code:
A = list(input().split())
print("Yes" if len(set(A)) == 2 and A[0].count(A) == 1 or A[0].count(A) == 2 else"No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
Data = list(map(int,input().split()))
ans = True
for data in Data:
    if data % 2 == 0:
        if data % 3 == 0 or data % 5 == 0:
            pass
        else:
            ans = False
            break
if ans:
    print('APPROVED')
else:
    print('DENIED')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
list_n = list(map(int, input().split()))
flag = 0
for i in range(N):
  if list_n[i] % 2 == 0:
    if (list_n[i] % 3 != 0) and (list_n[i] % 5 != 0):
      print('DENIED')
      flag = 1
      break
    else:
      continue
if flag == 0:
  print('APPROVED')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
l = [input() for _ in range(N)]
m = set(l)
d = dict()

for name in m:
  d[name] = l.count(name)
  
max_in_d = max(d_values())
max_kv_list = sorted([kv[0] for kv in d.items() if kv[1] == max_in_d])
for name in max_kv_list:
  print(name)

Submission status: Runtime Error

Solution code:
a, b, c = list(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()))

flag = 0

for i in range(N):
    if A[i] % 2 == 0:
        if A[i] % 3 == 0 or A[i] % 5 == 0:
            pass
        else:
            flag = 1
            break
        
if flag = 0:
    print("APPROVED")
else:
    print("DENIED")

Submission status: Runtime Error

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

flag = 0

for i in range(N):
    if A[i] % 2 == 0:
        if A[i] % 3 == 0 or A[i] % 5 == 0:
            pass
        else:
            flag = 1
            break
        
if flag = 0:
    print("PASS")
else:
    print("DENIED")

Submission status: Runtime Error

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

flag = 0

for i in range(N):
    if A[i] % 2 == 0:
        if A[i] % 3 == 0 or A[i] % 5 == 0:
            pass
        else:
            flag = 1
            break
        
 if flag = 0:
    print("PASS")
 else:
    print("DENIED")

Submission status: Runtime Error

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

flag = 0

for i in range(N):
    if A[i] % 2 == 0:
        if A[i] % 3 == 0 or if A[i] % 5 == 0:
            pass
        else:
            flag = 1
            break
        
if flag = 0:
    print("PASS")
else:
    print("DENIED")

Submission status: Runtime Error

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
from collections import Counter
def resolve():
    n=int(input())
    l=[input() for i in range(n)]
    l.sort()
    c=Counter(l)
    maxl=[]
    syutugenmax=max(c.values())
    for name,kazu in c.items():
        if kazu==syutugenmax:
            maxl.append(name)
    maxl.sort()
    for i in maxl:
        print(i)
resolve()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

ABC = set(input())

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

Submission status: Runtime Error

Solution code:

A, B, C = set(input().split())

print("Yes" len(A, B, C)==2 else "No")

Submission status: Runtime Error

Solution code:

A, B, C = set(input().split())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,C=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: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
st = input().split(" ")
s = st[0]
t = st[1]

ab = input().split(" ")
a =int(ab[0])
b =int(ab[1])

u = input()
if u == s:
    print(a-1,b)
if u == t:
    print(a,b-1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

else:
    print("Yes")

Submission status: Runtime Error

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

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:

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


for i in range(n):

    if a[i]%2==0:
        b.append(a[i])

    else:pass


for k in range(len(b)):

    if b[k]%3==0 or b[k]%5==0:

        c.append(b[k])

if len(b)==len(c):

    print("APPROVED")

else:
    print("DENIED")

Submission status: Runtime Error

Solution code:
on= input()

on = on.split()
 
if (on[0] != on[1] and on[0] != on[2] and on[1] != on[2]):
    print("No")
elif (on[0] == on[1] and on[0] == on[2] and on[1] == on[2]):
    print("No")

else:
  print("Yes")
  //print(on[0],on[1],on[2]

Submission status: Runtime Error

Solution code:
int 1,2,3 = input():

if 1 != 2{
  if 1 != 3{
    print("No")
  }
}
else{
  print("Yes")
}

Submission status: Runtime Error

Solution code:
N = input()
A = list(map(str, input().split()))
B=[]
C=[]
l=[]
m=[]
i=0
for a in range(int(N)):
    if int(A[a])%2==0:
       B.append(A[a])
       i=i+1
for a in range(int(i)):
    if not int(B[a])%3==0 or int(B[a])%5==0:
       C=1
    else:
       C=0
if C==1:
   print("DENIED")
else:
   print("APPROVED")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c=mpp(int,input().split())
l=[a,b,c]
sorted(l)
if len(l)==2:
  print('Yes')
elif:
  print('No')

Submission status: Runtime Error

Solution code:
n =int(input())
s = [input() for i in range(n)]
z = list(set(s))
ans = []
x = 0
for i in z:
    sc = s.count(i)
    if sc > x:
        ans = [i]
        x = sc
    elif sc == x:
        ans.append(i)
for i in sorted(ans):
    print(i)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define P pair<int,int>

const ll INF = pow(10, 9) + 7;

int main() {
  int A,B,C;
  cin >> A >> B >> C;
  if(A==B && A!=C){
    cout <<"Yes";
    return 0;
  }
   if(A==C && A!=B){
    cout <<"Yes";
    return 0;
  }
   if(C==B && A!=C){
    cout <<"Yes";
    return 0;
  }
  cout << "No";
}

Submission status: Runtime Error

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

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A=input()
B=input()
C=input()
if A==B and B==C and A==C:
    print('No')
elif A!=B and B!=C and A!=C:
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
C=int(input())
if A==B and B==C and A==C:
    print('No')
elif A!=B and B!=C and A!=C:
    print('No')
else:
    print('Yes')

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def poor(a,b,c):
  if a = b or b = c or c = a:
    return print(YES)
  elif a = b = c:
    return print(NO)
  else:
    return print(NO)

Submission status: Runtime Error

Solution code:
a, b, c = input()
if a == b:
    if a == c:
        print('No')
    else:
        print('Yes')
else:
    if a == c:
        print('Yes')
    else:
        if b == c:
            print('Yes')
        else:
            print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

import math
from fractions import gcd

def mp():
	return map(int,str(raw_input()).split())

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

Submission status: Runtime Error

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

result="APPROVED"
for a in range(As):
  if a%2==0 and a%3!=0 and a&5!=0:
    result="DENIED"
print(result)

Submission status: Runtime Error

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