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

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

for A in range(n):
    if A%3==0 or A%5==0:
        print("APPROVED")
    else:
        print("DENIED")

Submission status: Runtime Error

Solution code:
n = int(input())

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

for A in range(n):
    if A == A//3 or A == A//5:
        print("APPROVED")
    else:
        print("DENIED")

Submission status: Runtime Error

Solution code:
n = int(input())

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

for A in range(n):
    if A == A/3 or A == A/5:
        print("APPROVED")
    else:
        print("DENIED")

Submission status: Runtime Error

Solution code:
import numpy as np
N,K = map(int,input().split())
a = np.array(input().split(),np.int64)
a = np.sort(a)
zero = a[a==0]
pos = a[a>0]
neg = a[a<0]

def f(x):
    count = 0
    c = x // pos
    count += np.searchsorted(a, c, side='right').sum()
    count += N*len(zero) if x >= 0 else 0
    c = -(-x // neg)
    count += (N - np.searchsorted(a, c, side='left')).sum()
    count -= a[a*a <= x].size
    count //= 2
    return count

right = 10**18
left = -10**18
while right-left>1:
    mid = (right + left)//2
    if f(mid)<K:
        left = mid
    else:
        right = mid
        
print(int(right))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if(a==b and a!=c) or (a==c and a!=b) or (c==b and a!=c)
    print("yes")
else:
    print("no")

Submission status: Runtime Error

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

if L[0] == L[1] == L[2]:
    print("no")
else:
    print("yes")

Submission status: Runtime Error

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

if L[0]==L[1]==L[2]:
    print("no")
else:
    print("yes")

Submission status: Runtime Error

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

if A==B==C:
    print("no")
else:
    print("yes")

Submission status: Runtime Error

Solution code:
input()
a = [int(x) for x in input().split()]
    
for i in a:
  B = i%2
  if B==0:
    if i%3 == i%5 and i>=6:
      print("APPROVED")
    else:
      print("DENIED")
  else:
    print("DENIED")

Submission status: Runtime Error

Solution code:
N = int(input())
b = []
for i in range(N):
  a = int(input())
  b.append(a)
    
for i in b:
  B = i%2
  if B==0:
    if i%3 == i%5:
      print("APPROVED")
    else:
      print("DENIED")
  else:
    print("DENIED")

Submission status: Runtime Error

Solution code:
N = int(input()) #1行目のNを取得する
A = [int(input()) for i in range(N)] #複数行の数値の入力を取得
    
for i in A:
  B = i%2
  if B==0:
    if i%3 == i%5:
      print("APPROVED")
    else:
      print("DENIED")
  else:
    print("DENIED")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

t = 0
for i in range(3):
  if A[i]==A[(i+1)%3] and A[i] != A[(i+2)%3]:
    print("Yes")
    t = 1
    
if t != 1:
  print(No)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if(A==B!=C or A==C!=B or B==C!=A):
 print('Y')
else:
 print('N')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from collections import Counter
N = int(input())
S = [input() for i in range(N)]
c = Counter(S)
ans = c.most_common()
ans = [i[0] for i in ans if i[1] == ans[0][1]]
for i in sorted(ans):
    print(i)

Submission status: Runtime Error

Solution code:
a, b, c = 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 == C:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

d = {}
for _ in range(N):
    S = input()
    if S in d:
        d[S] += 1
    else:
        d[S] = 1

m = max(d.values())
for s in sorted(k for k in d if d[k] == m):
    print(s)

Submission status: Runtime Error

Solution code:
x,y,z = map(int, input().split())

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

Submission status: Runtime Error

Solution code:
x,y,z = map(int, input().split())

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

Submission status: Runtime Error

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

if (a==b && a!=c) || (a==c&&a!=b) ||(b==c&&b!=a):
    print('yes')
else:
    print('no')

Submission status: Runtime Error

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

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

product_array = []

for i in range(n):
    for j in range(n - (i + 1)):
        product_array.append(array[i] * array[i + j + 1])

product_array.sort()

print(product_array[k - 1])

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
#include <string>
#include <math.h>
#include <stdio.h>
#include <iomanip>
#include <limits>
#include <list>
#include <string>
#include <queue>
#include <deque>
#include <tuple>
#include <map>
#include <sstream>
using namespace std;
#define MOD (long long int)(1e9+7)
#define ll long long int
#define rep(i,n) for(int i=0; i<(int)(n); i++)
#define reps(i,n) for(int i=1; i<=(int)(n); i++)
#define REP(i,n) for(int i=n-1; i>=0; i--)
#define REPS(i,n) for(int i=n; i>0; i--)
#define FOR(i,a,b) for(int i=a; i<(int)(b); i++)
#define ALL(x) (x).begin(),(x).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define SORT(c) sort(ALL(x))
#define CLR(a) memset((a), 0 ,sizeof(a))
#define PB push_back
#define MP make_pair
#define SP << " " <<
const int INF = 1001001001;
const ll LINF = 100100100100100100;
const double EPS = 1e-10;
const long double PI  = acos(-1.0L);
typedef pair<int,int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
#define chmax(a,b) a = (((a)<(b))?(b):(a))
#define chmin(a,b) a = (((a)>(b))?(b):(a))




__attribute__((constructor))
void initial(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cout << fixed << setprecision(15);
}


// GCD,LCMを求める関数
ll gcd(ll a,ll b){
	if(a%b==0) return(b);
	else return(gcd(b,a%b));
}
ll lcm(ll a, ll b){
	return a*b/gcd(a,b);
}

ll mpow(ll a, ll b){
  if(b==0) return 1;
  else if(b%2==0){ll memo = mpow(a,b/2); return memo*memo%MOD;}
  else return mpow(a,b-1) * a % MOD;
}

// 素数かどうかの判定
bool IsPrime(int num){
    if(num<2) return false;
    else if(num==2) return true;
    else if(num%2==0) return false; // 偶数はあらかじめ除く
    double sqrtNum = sqrt(num);
    for(int i=3; i<=sqrtNum; i+=2){
        if(num%i==0)　return false;
    }
    return true;
}

signed main(){
  VI a(3); rep(i,3) cin>>a[i]; sort(ALL(a));
	if((a[0]==a[1]&&a[1]!=a[2])||(a[0]!=a[1]&&a[1]==a[2])) return cout<<"Yes"<<endl,0;
	cout << "No" << endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
d=input()
a=list(map(int,input().split()))
rt=0
for i in a:
  if i % 2 == 1:
    pass
  else:
    if i%3==0 or i%5==0:
      rt=1
    else:
      rt=0
      print("DENIED")
      break
if rt==1:
  print("APPROVED")

Submission status: Runtime Error

Solution code:
d=input()
a=list(map(int,input().split()))
rt=0
print(a)
for i in a:
  if i % 2 == 1:
    pass
  else:
    if i%3==0 or i%5==0:
      rt=1
    else:
      rt=0
      print("DENIED")
      break
if rt==1:
  print("APPROVED")

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:
    peint("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:

list = input()

poor = "No"
for x in range(len(list)-1):
  for y in range(n+1, len(list)):
    if list[y] == list[x]:
      poor = "Yes"

print(poor)

Submission status: Runtime Error

Solution code:
def A-Poor(list):
  poor = "No"
  for x in range(len(list)-1):
    for y in range(n+1, len(list)):
      if list[y] == list[x]:
        poor = "Yes"
  return poor

Submission status: Runtime Error

Solution code:
#coding: utf-8
import numpy as np

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

Submission status: 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:
import sys

line = sys.argv[1]
digits = line.split(' ')
nums = [int(s) for s in digits]

res = 'No'
if num[0] == num[1]:
  if num[0] != num[2]:
    res = 'Yes'
    
if num[1] == num[2]:
  if num[1] != num[0]:
    res = 'Yes'
    
if num[2] == num[0]:
  if num[2] != num[1]:
    res = 'Yes'
return res

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = [x for x in list(input())]
ans = "No"
for i in range(3):
  tmp = [int(x)/int(s[i]) == 1 for x in s]
  is_poor = 0
  for j in tmp:
    is_poor += j
  if is_poor == 2:
    ans = "Yes"
    pass
print(ans)

Submission status: Runtime Error

Solution code:
s = [x for x in list(input())]
ans = "No"
for i in range(3):
  tmp = [int(x)/s[i] == 1 for x in s]
  is_poor = 0
  for j in tmp:
    is_poor += j
  if is_poor == 2:
    ans = "Yes"
    pass
print(ans)

Submission status: Runtime Error

Solution code:
s = [int(x) for x in list(input())]
ans = "No"
for i in range(3):
  tmp = [x/s[i] == 1 for x in s]
  is_poor = 0
  for j in tmp:
    is_poor += j
  if is_poor == 2:
    ans = "Yes"
    pass
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())

a=list(map(int,input().split()))
b=0
for i in range(len(a)-1):
    if a[i]//2==0:
        if a[i]//3==0 or a[i]//5==0:
            b=b+1
    else:
        b=b+1

if b==n:
    print("APPROVED")
else:
    print("DENIED")

Submission status: Runtime Error

Solution code:
n = int(input())
s = [input() for i in range(n)]

l = [s.count(i) for i in s]
d = {i:j for i,j in zip(s, l)}
m = max(l)

d = {i:j for i, j in zip(s, l)}
ans = [i for i in d if d[i] == m]
sorted(ans)

for i in ans:
    print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import collections

n = int(input())
s = [input() for i in range(n)]
c = collections.Counter(s)
m = c.most_common()

maxn = m[0][1]
ans = []
for i in range(len(m)-1):
    if m[i][1] == maxn:
        ans.append(m[i][0])
    else:
        break
for i in sorted(ans):
    print(i)

Submission status: Runtime Error

Solution code:
import collections

n = int(input())
s = [input() for i in range(n)]
c = collections.Counter(s)
m = c.most_common()

maxn = m[0][1]
ans = []
for i in range(n):
    if m[i][1] == maxn:
        ans.append(m[i][0])
    else:
        break
for i in sorted(ans):
    print(i)

Submission status: Runtime Error

Solution code:
a=int(input().split(" "))
a1,a2,a3=int(a[0]),int(a[1]),int(a[2])
ans="No"
if a1!=a2 and (a1==a3 or a2==a3):
  ans="Yes"
if a1!=a3 and (a1==a2 or a2==a3):
  ans="Yes"
if a2!=a3 and (a1==a2 or a1==a3):
  ans="Yes"
  
print(ans)

Submission status: Runtime Error

Solution code:
a=int(input().split(" "))
a1,a2,a3=int(a[0]),(a[1]),int(a[2])
ans="No"
if a1!=a2 and (a1==a3 or a2==a3):
  ans="Yes"
if a1!=a3 and (a1==a2 or a2==a3):
  ans="Yes"
if a2!=a3 and (a1==a2 or a1==a3):
  ans="Yes"
  
print(ans)

Submission status: Runtime Error

Solution code:
a=int(input().split(" "))
a1,a2,a3=int(a[0]),(a[1]),int(a[2])
ans="No"
if a1!=a2 and (a1==a3 or a2==a3):
  ans="Yes"
if a1!=a3 and (a1==a2 or a2==a3):
  ans="Yes"
if a2!=a3 and (a1==a2 or a1==a3):
  ans="Yes"

Submission status: Runtime Error

Solution code:
a, b, c= map(int, .input().split())
kawaiso = 0 
if a==b and a!=c:
    kawaiso = 1
 
 else if  b==c and b!=a :
    kawaiso = 1
 
 else if c==a and c!=b :
    kawaiso = 1

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = map(int, raw_input().split())
if (a[0] == a[1]) and (a[0] != a[2]):
  print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
list=[]
for i in range 3:
  list.append(int(input()))
if list[0]==list[1]:
  if list[1]==list[2]:
    print("No")
  else:
    printf("Yes")
    
else:
  if list[0]==list[2] or list[1]==list[2]:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
w = 0
ans = 0
for s in reversed('0'+input()):
    n = int(s)
    if n < 6:
        ans += n + w
        w = 0
    else:
        w = 1

print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
s=[input() for i in range 3]

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

Submission status: Runtime Error

Solution code:
# print('input >>')
N = input()
N = reversed(N)
ans = 0
nxt = False
for n in N:
    i_n = int(n)
    if i_n % 10 >= 6:
        ans += 10 - i_n % 10
        nxt = True
    else:
        ans += i_n % 10
        nxt = False
    # print(N, ans)
 
# print('-----output-----')
print(ans)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
if a == b:
    if a != c:
    print("Yes")
elif b == c:
    if b != a:
    print("Yes")
elif a == 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 != c:
    print("Yes")
elif a == c != b:
    print("Yes")
elif b == c != a:
    print("Yes")
else:
    print("No")
#解法その２
li = list(map(int,input().split()))
li2 = set(li)#liの中の被っている要素を排除する（例：3 2 2 > 3 2）
if len(li2) == 2:#かぶり要素を排除したときのリスト内部の個数が２になっている
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
li = list(map(int,input.split()))
li2 = set(li2)#liの中の被っている要素を排除する（例：3 2 2 > 3 2）
if len(li2) == 2:#かぶり要素を排除したときのリスト内部の個数が２になっている
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())

s = []
t = []

for i in range(n):
    s.append(input())

s.sort()

for j in range(n):
    t.append(s.count(s[j]))

u = max(t)

st = 0

for k in range(n):
    if s.count(s[k]) == u and st != s[k]:
        print (s[k])
        st = s[k]

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
L={}
c=0
for i in range (n):
    s=input()
    if s in L:
        L[s]+=1
    else:
        L.update({s:1})
        c+=1
M=list(L.values())
C=list(L.keys())
b=max(M)
F=[]
for i in range(c):
    if M[i]==b:
        F+=[C[i]]
F.sort()
for i in F:
    print(i)

Submission status: Runtime Error

Solution code:
hoge = input().split()
 
aaa = 0  
if hoge[0] == hoge[1]:
  aaa += 1
if hoge[0] == hoge[2]:
  aaa += 1
if hoge[1] == hoge[2]:
  aaa += 1    

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
d=int(input())
print(a+b+c+d)

Submission status: Runtime Error

Solution code:
n=int(input())
o=int(input())
p=int(input())
if n==o and o==p and n==p:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
n=int(input())
o=int(input())
p=int(input())
if n==o and o==p and n==p:
    print("NO")
else:
    print("YES")

Submission status: Runtime Error

Solution code:
a = raw_input()
n, k = a.split()
n = int(n)
k = int(k)
b = raw_input()
data = [int(one) for one in b.split()]
res = []
for i in range(len(data) - 1):
  for j in range(i+1, len(data)):
    res.append(data[i]*data[j])
res = sorted(res)
print(res[k-1])

Submission status: Runtime Error

Solution code:
n = input()
d = dict()
for i in range(n):
  w = raw_input()
  if w in d:
    d[w] += 1
  else:
    d[w] = 1
di = d.items()
def com(a,b):
  if a[1] > b[1]:
    return True
  elif a[1] == b[1]:
    return a[0]>b[0]
  else:
    return False
di = sorted(di, cmp=com)
print(di[0][0])
if len(di) > 1:
  print(di[1][0])

Submission status: Runtime Error

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

if A==B && B==C && A==C:
    print("No")

elif A!=B && B!=C && A!=C:
    print("No")

else :
    print("Yes")

Submission status: Runtime Error

Solution code:
def PoorOrNot(number_list):
  number_dict = {}
  for num in number_list:
    if num not in number_dict:
      number_dict[num] = 1
  if len(number_dict) == 2:
    return "Yes"
  else:
    return "No"
  
number_list = list[map(int, input().split())]
print (PoorOrNot(number_list))

Submission status: Runtime Error

Solution code:
def PoorOrNot(number_list):
  number_dict = {}
  for num in number_list:
    if num not in number_dict:
      number_dict[num] = 1
  if len(number_dict) == 2:
    return "Yes"
  else:
    return "No"
  
number_list = list[map(int, input().split())]
print (PooeOrNot(number_list))

Submission status: Runtime Error

Solution code:
def PoorOrnot(number_list):
  number_dict = {}
  for num in number_list:
    if num not in number_dict:
      number_dict[num] = 1
  if len(number_dict) == 2:
    return "Yes"
  else:
    return "No"
  
number_list = list[map(int, input().split())]
print (PooeOrNot(number_list))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
#import numpy as np
n = int(input())
input = sys.stdin.readline
#a = np.array(list(map(int, input().split())))
a = list(map(int, input().split()))
for i in a:
    if i % 2 == 0:
        if i % 3 != 0 and i % 5 != 0:
            print('DENIED')
            exit()
print('APPROVED')

Submission status: Runtime Error

Solution code:
N = int(input())
L = list(map(int, input().split()))
c = 0
for i in range(N):
  if L[i] % 2 == 0:
    if L[i] % 3 == 0:
      c += 1
    elif L[i] % 5 == 0:
      c += 1
    else:
      c = 0
      break
  else:
    c += 1

if c == N:
  print("APPROVED")  
else:
  print ("DENIED")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
count_dict = {}
for _ in range(n):
    e = input()
    if e in count_dict.keys():
        count_dict[e] += 1
    else:
        count_dict[e] = 0

max_list = [e[0] for e in count_dict.items() if e[1] == max(count_dict.values())]
max_list.sort()
for i in max_list:
    print(i)

Submission status: Runtime Error

Solution code:
n = int(input())
dic = {}
m = 0
for i in range(n):
  s = input()
  if s in dic:
    dic[s] += 1
    m = max(m, dic[s])
  else:
    dic[s] = 1
    m = max(m, dic[s])
ans = []
for s in dic:
  if dic[s] == m:
    ans.append(s)
print('\n'.join(ans.sort()))

Submission status: Runtime Error

Solution code:
print("YNeos"[len(set(map(int,open(0))))!=2::2])

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
int A,B,C

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
n=int(input())
lst=list(map(int,input().split()))

for i in range(0,n):
    if lst[i]%2==0:
        if lst[i]%3==0 or lst[i]%5==0:
            x=1
            
        else: x=0
if x==1:print("APPROVED")
else: print("DENIED")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = input()
a = input()
mylist = list(map(int, a.split(" ")))
for i in range(N+1):
  if mylist[i] % 2 == 0:
    if mylist[i] % 3 != 0 and mylist[i] % 5 != 0:
      print("DENIED")
    else:
      return
  print("APPROVED")

Submission status: Runtime Error

Solution code:
n=int(input())
s=[input() for _ in range(n)]
ans={}
for i in range(len(s)):
    if(s[i] not in ans):
        ans[s[i]] = 1
    else:
        ans[s[i]] += 1
ans=sorted(ans.items(), key = lambda x:x[1], reverse = True)
anss=[]
anss.append(ans[0][0])
for j in range(1,len(ans)):
    if(ans[j][1] == ans[0][1]):
        anss.append(ans[j][0])
    else:
        break
for t in sorted(anss):
    print(t)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
myinput_H = input()
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
 
if (A == B & B != C):
  print(Yes)
elif (A == C & B != C):
  print(Yes)
elif (B == C & A != B):
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
myinput_H = input()
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]

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

Submission status: Runtime Error

Solution code:
myinput_H = input()
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
def check(a,b,c):
  if (a == b & b != c) or (a == c & b != c) or (b == c & b != a):
    print(Yes)
  else:
    print(No)

check(A,B,C)

Submission status: Runtime Error

Solution code:
mylist = list(map(int, myinput_H.split(" ")))
A = mylist[0]
B = mylist[1]
C = mylist[2]
def check(a,b,c):
  if (a == b & b != c) or (a == c & b != c) or (b == c & b != a):
    print(Yes)
  else:
    print(No)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = [*map(int, input().split())]
l.sort()
if l[0] == l[1] and l[0] != l[2]:
    print("YES")
elif l[0] == l[2] and l[0] != l[1]:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

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

S_set=set(S)

c_max=0
ans=[]
for i in S_set:
    c= S.count(i)
    if c > c_max:
        c_max = c
        ans=[]
        ans.append(i)
    elif c == c_max:
        ans.append(i)

ans=sorted(ans)
for j in ans:
    print(j)

Submission status: Runtime Error

Solution code:
import sys

def main():

    sys.stdin = open('input155a.txt')

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

    answer = 'Yes' if check(a, b, c) else 'No'
    print(answer)

def check(a, b, c):

    for _ in range(3):
        a, b, c = b, c, a
        if a == b and b != c:
            return True

    return False


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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