Problem:


Score : 300 points

Problem Statement

Given is a sequence of integers A_1, A_2, ..., A_N.
If its elements are pairwise distinct, print YES; otherwise, print NO.

Constraints

2 ≤ N ≤ 200000

1 ≤ A_i ≤ 10^9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 ... A_N

Output

If the elements of the sequence are pairwise distinct, print YES; otherwise, print NO.

Sample Input 1

5
2 6 1 4 5

Sample Output 1

YES

The elements are pairwise distinct.

Sample Input 2

6
4 1 3 1 6 2

Sample Output 2

NO

The second and fourth elements are identical.

Sample Input 3

2
10000000 10000000

Sample Output 3

NO



Sample input:
5
2 6 1 4 5


Sample output:
YES

Submission status: Runtime Error

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

Submission status: Runtime Error

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

table = {}
answer = 'Yes'
for i in range(0, len(A) + 1):
# for(let i = 0; i < A.length; i++):
    Ai = A[i]
    count = table.get(Ai) + 1 if table.get(Ai) else 1
    table[Ai] = count

    if table.get(Ai) >= 2:
        answer = 'No'
        break

print(answer)

Submission status: Runtime Error

Solution code:
from collections import Counter
input()
lst=list(map(int,input().split()))
dic=dict(Counter(lst))
x=max(lst(dic.values()))-1
if x:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
n = int(input())
A = [int(x) for x in input().split()]
print('YES' if len(A) = len(set(A)) else 'NO')

Submission status: Runtime Error

Solution code:
n = int(input())
if n = len(set(input().split())):
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
import sys

n=int(input())

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

c=[0]*(max(a)+1)

for i in range(len(a)):
  c[a[i]]+=1

  if c[a[i]]>1:
    print("NO")
    sys.exit()

print("YES")

Submission status: Runtime Error

Solution code:
import sys

n=int(input())

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

c=[0]*max(a)

for i in range(len(a)):
  c[a[i]]+=1

  if c[a[i]]>1:
    print("NO")
    sys.exit()

print("YES")

Submission status: Runtime Error

Solution code:
N = int(input()
n = input().split(" ")
sama = False
if N == len(n):
    i = 0
    for angka in n:
        i += 1
        if angka in n[i:]:
            print("NO")
            sama = True
            break
    if not sama:
        print("YES")
else:
    print("invalid")

Submission status: Runtime Error

Solution code:
from collections import Counter
n = int(input())
a = list(map(int.input().split()))
c = Counter(a)

if c.most_common()[0][1] == 1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys
N = input()
numlist = list(map(int, input().split()))

for i in range(N):
  if numlist[0] == numlist[i]:
    print('No')
    sys.exit()

print('Yes')

Submission status: Runtime Error

Solution code:
import collection

n = int(input())
a = list(map(int, input().split()))
c = collections.Counter(a)

if c.most_common()[0][1] == 1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = set(a)
if len(a) == len(b):
  print('YES')
else:
  print('NO')v

Submission status: Runtime Error

Solution code:
from collections import Counter
import sys
n = int(input())
l = sys.stdin.read().split()
c = counter(l)
m = max(c.values())

if(m==1):
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
from collections import Counter
import sys
n = int(input())
l = sys.stdin.read().split()
c = counter(l)
m = max(c.value())

if(m==1):
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
n = int(input())
flag = 1
l = []
for i in range(n):
    a = int(input())
    if a in l:
        flag = 0
        break
    else:
        l.append(a)
if(flag==1):
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

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

for i in range(len(a)):
    if a[i] == a[i-1]
    print("NO")
else:
    print("YES")

Submission status: Runtime Error

Solution code:
input();a=list(map(int,input().split()));print("YNEOS"[len(A)>len(set(A))::2])

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = [0] * (max(a)+1)
for i in range(n):
  ans[a[i]] += 1
ans.sort(reverse = True)
if ans[0] < 2:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
n = int(input())
abc = list(map(int, input().split()))
ans = 'YES'
abc = sorted(abc)
for i in range(n):
  if abc[i] = abc[i+1]
  ans ='NO'

print(ans)

Submission status: Runtime Error

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

if len(set(a)) == N:
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

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

if len(seq) != len(set(seq)):
    print('NO')
else:
    print('YES')

Submission status: Runtime Error

Solution code:
n = int(input())
a = set(input().split())

print('YES' if len(s) == n else 'NO')

Submission status: Runtime Error

Solution code:
import collections
N = int(input())
A = input().split(' ')

c = max(collections.Counter(A).values())
if c = = 1:
	print('YES')
else:
	print('NO')

Submission status: Runtime Error

Solution code:
import sys

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

for i in range(0, N, 1):
	if A[i] == A[i + 1]:
		print("NO")
		sys.exit(0)

print("YES")

Submission status: Runtime Error

Solution code:
n = int(input())
ls = list(map(int, input().split()))
for i in range(0,n-1):
    for u in range(0, n-1):
        if ls(i) == ls(u):
            print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
p = list(map(int,input().split()))
max = 0
for i in range(N-K+1):
    s = 0
    for j in range(i,i+K):
        s += p[j]
    if s > max:
        max = s
print((max+K)/2)

Submission status: Runtime Error

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

if len(A) > len(set(A)):
	print("No")
else:
	print("Yes")

Submission status: Runtime Error

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

l = [0]*200001

for num in nums:
    l[num] += 1

if max(l) == 1:
    print('YES')

else:
    print('NO')

Submission status: Runtime Error

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

l = [0]*200001

for num in nums:
    l[num] += 1

if max(nums) == 1:
    print('YES')

else:
    print('NO')

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
print("YES" if len(set(A)) = N, else "NO")

Submission status: Runtime Error

Solution code:
n = int(input())
a = kist(map(int,input().split()))
a.sorted
i for i in range(n):
  if a[i-1] == a[i] or a[i] == a[i+1]:
print('No')
  else:
print('Yes')

Submission status: Runtime Error

Solution code:
from collections import Counter

n = int(input())
c = Counter(map(int, input().split()))

print("YES" if c.most_common(1)[1] <= 1 else "NO")

Submission status: Runtime Error

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

if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
import sys
A = list(map(int, input().split()))
n = int(input())

if len(A) == len(set(A)):
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
N = int(input())
flug = False
a = input().split()
A = [A.append(a[i]) fo i in range(N)]

for i in A:
    C = A.count(i)
    if C > 1:
        flug = True

if flug == True:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

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

b = len(set(a))
if len(a)== len(b):
	print('YES')
else:
	print('NO')

Submission status: Runtime Error

Solution code:
a=int(input())
b=list(input().split())
c=sorted(b)
for i in range (a):
	if c[i]==c[i+1]:
		print("No")
		break
	else:print("Yes")

Submission status: Runtime Error

Solution code:
n=int(input())
l=list(map(int,input().split()))
f=1
for i in range(n-1):
	if l[i]==l[i+1]:
        f=0
        break
if f:
	print("YES")
else:
	print("NO")

Submission status: Runtime Error

Solution code:
n=int(input())
l=list(map(int,input().split()))
f=1
for i in range(n-1):
	if l[i]==l[i+1]:
      f=0
      break
if f:
	print("YES")
else:
	print("NO")

Submission status: Runtime Error

Solution code:
n = int(input())
A = [int(input()) for _ in range(n)]
A_set = set(A)
if len(A_set) == n:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
import numpy as np

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

res = np.zeros(N)
for i in range(N):
  res[i] = (A==A[i]).sum()

if (res>1).sum() > 0:
  ans = 'NO'
else:
  ans = 'YES'
  
print(str(ans))

Submission status: Runtime Error

Solution code:
N = int(input())
l = []
for i in range(N):
    A = int(input())
    if A in l:
        print("NO")
        exit()
    l.append(i)
print("YES")

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
a=list(map(int,input().split()))
b=[]
for i in range(len(a)):
    b.append((a[i]+1)/2)
for i in range(len(a)-k+1):
    sum=0
    for j in range(i,i+k):
        sum+=b[j]
    if max<=sum:
        max=sum
print(max)

Submission status: Runtime Error

Solution code:
N = int(input())
*l = map(int, input().split())
print("YES" if len(l)==len(set(l)) else "NO")

Submission status: Runtime Error

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

int main()
{
  int n;
  bool ans = 1;
  cin >> n;
  vector<int> vec(n);
  for (int i = 0; i < n; i++)
    cin >> vec[i];
  sort(vec.begin(), vec.end());

  for (int i = 0; i < n - 1; i++)
  {
    if (vec[i] == vec[i + 1])
    {
      ans = 0;
      break;
    }
  }
  if (ans)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
}

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = None
for i in a:
  if a.find(i) != -1:
    ans = 'NO'
    break
else:
  ans = 'YES'
print(ans)

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
s="NO"
for i in range(n):
    for j in range(i+1,n):
        if a[i]==s[j]:
            s="YES"
            break
print(s)

Submission status: Runtime Error

Solution code:
n = int(input())
a = [int(k) for k in input().split()]
b=0
for j in range(n):
    for k in range(n):
        if a[j]==a[k] and j!=k:
        b+=1
        break
    break
if b==0:
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

Solution code:
n=int(input())
a=[int() for i in input().split()]
b=0
for j in range(n):
  for k in range(n):
    if a[j]==a[k] and j!=k:
      b+=1
　　break
if b==0:
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

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

b = set(a)

if len(a) == len(b):
  print(YES)
else:
  print(NO)

Submission status: Runtime Error

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

b = set(a)

if len(a) == len(b):
  print(YES)
else:
  print(NO)

Submission status: Runtime Error

Solution code:
n = input()
s = set(input().split())
if len(s) == n:
  print(YES)
else:
  print(NO)

Submission status: Runtime Error

Solution code:
n = input()
s = input().split()
if len(set(s)) == n:
  print(YES)
else:
  print(NO)

Submission status: Runtime Error

Solution code:
n=int(input())
a=sorted(list(map(int,input().split())))
ans='YES'
for i in range(n):
  if a[i]==a[i+1]:
    ans='NO'
  if ans=='NO':
    break
print(ans)

Submission status: Runtime Error

Solution code:
n=input()
a=list(map(int,input().split()))
print("YES" if len(set(a))==len(a) else "NO"

Submission status: Runtime Error

Solution code:
t=input().split()
m=t.pop
n=int(m)
if len(set(t))==n:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
t=input().split()
n=int(t.pop(0))
if len(set(n))==n:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
t=input().split()
n=int(t.pop(0))
t.sort()
p=0
for i in range(n-1):
    if t[i]==t[i+1]:
        p+=1
        
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Runtime Error

Solution code:
n = int(input())
A = [int(e) for e in input().split()]

if length(set(A)) == length(A):
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
n=map(int,input())
lst=len(set(map(int,input(split))))
if n==lst:
    print("YES")
else:  print("NO")

Submission status: Runtime Error

Solution code:
t=list(input())
import math
n=int(math.ceil((len(t)+1)/2))
p=0
for i in range(1,n):
    for j in range(1,i):
        if t[2*i]==t[2*j]:
            p+=1
if p>0:
    print("NO")
else:
    print("YES")

Submission status: Runtime Error

Solution code:
import sys
l= sys.stdin.readline()
count = int(l.strip())
l = sys.stdin.readline()
nums = list(map(int, l.split()))
check = dict()
for n in nums:
  if n in check:
    print("YES")
   	break
  else:
    check[n] = True
print("YES")

Submission status: Runtime Error

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

a_set = set(a_slit)
if len(a_list) == len(set):
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

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

duplicate_list = [x for x in set(An) if An.count(x) > 1]

if duplicate_list:
    print('NO')
else:
    print('YES'

Submission status: Runtime Error

Solution code:
N = int(input())
A = set(list(map(Int, input().split())))
if len(A) == N:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
A.sort()
for i in nrange(N-1):
  if A[i] == A[i+1]:
    print("NO")
    break
else:
  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] in A[i+1:]:
    print('NN)
else:
  print('YES')

Submission status: Runtime Error

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

A.sort()
# print(A)
for i in range(N // 2 + 1):
    # print(A[i])
    # print(A[i+1])
    
    if A[i] == A[i+1]:
        print("NO")
        exit()
    elif A[-1-i] == A[-2-i]:
        print("NO")
        exit()

print("YES")

Submission status: Runtime Error

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

A.sort()
print(A)
for i in range(N // 2 + 1):
    # print(A[i])
    # print(A[i+1])
    
    if A[i] == A[i+1]:
        print("NO")
        exit()
    elif A[-1-i] == A[-2-i]:
        print("NO")
        exit()

print("YES")

Submission status: Runtime Error

Solution code:
N=int(input())
a=[int(input() ) for i in range(N)]
for i in range(N-1):
  if a[i]==a[i+1]:
    print("NO")
    exit(0)
print("YES")

Submission status: Runtime Error

Solution code:
import collecttions
l=list(map(int,input().split()))
for i in l:
  if l.count(i)!=1:
    print("NO")
    exit(0)
print("YES")

Submission status: Runtime Error

Solution code:
n=input()
arr=list(map(int,input().split()))
arr=sorted(arr)
for i in range(n-1):
  if arr[i]==arr[i+1]:
    print('NO')
    break
else:
  print('YES')

Submission status: Runtime Error

Solution code:
N = input()
inp = input()
listA = inp.split(' ')
count = 0
for moji in lintA:
  youso = listA.count(moji)
  if youso == 1:
    count += 1
  else:
    print('NO')
    break
if count == len(listA):
  print('YES')

Submission status: Runtime Error

Solution code:
N = input()
inp = input()
listA = inp.split(' ')
out = YES
for k in listA:
  count = 0
  for j in listA:
    if k == j:
      count += 1
      if count >= 2:
        out = NO
        break
print(out)

Submission status: Runtime Error

Solution code:
N=[]
A=input()
A = int(A)
N=len(A)
N = input().split()
if len(N)==len(set(N)):
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

Solution code:
a = input()
b = input().split()
c = 0
for i in b:
    for l in b:
        if i == l:
            c += 1
if c > a:
    print("NO")
else:
    print("YES")

Submission status: Runtime Error

Solution code:
n=int(input())
arr=set(map(int,input().split())
print("YES" if n==len(arr) else "NO")

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input(),split()))
print("YES" if len(list(set(A)))==len(A) else "NO")

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input(),split()))
print("YES" if len(set(A))==len(A) else "NO")

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(int,input(),split())
print("YES" if len(list(set(A)))==len(A) else "NO")

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(int,input(),split())
print("YES" if len(set(A))==len(A) else "NO")

Submission status: Runtime Error

Solution code:
N = int(input())
A = [int(x) for x in input().split()]
mySet = set()
for i in A:
  if i in mySet:
    print('NO')
    exit()
    else:
      mySet.add(i)
print('YES')

Submission status: Runtime Error

Solution code:
# 整数列の長さを入力してください
input()

# 整数の入力と内包表記でのリスト化
num_1 = input()
list_1 = [int(i) for i in num_1]

list_2 = []
same_list = []
for i in list_1:
    for j in list_1:
        if i == j:
            list_2.append(j)
            if len(list_2) > 1:
                print("YES")
                break
    else:
        list_2 = []
        same_list.append(i)
        continue

    break
if len(same_list) == len(list_1):
    print("NO")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0
b = a.reverse()

for i in range(n-1):
    if b[-1] - b[-2] == 0:
        print("NO")
        x = 1
        break
    b.pop()
 
if x == 0:
    print("YES")

Submission status: Runtime Error

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

for i in range(N-1):
    for j in range(N-i):
        if A[i] == A[i+j+1]:
            print("NO")
            exit()

print("YES")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0

a.reverse()
for i in range(n):
    if a[0] - a[1] == 0:
        print("NO")
        x = 1
        break
    a.pop(0)

if x == 0:
    print("YES")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0

a.reverse()
for i in range(n):
    if a[-1] - a[-2] == 0:
        print("NO")
        x = 1
        break
    a.pop()

if x == 0:
    print("YES")

Submission status: Runtime Error

Solution code:
import numpy as np
n = int(input())
a = list(int(x) for x in input().split())

x = 0
for i in range(n):
  b= a[0]
    if (b in np.delete(a, 0)) is True:
        print("NO")
        x = 1
        break

if x == 0:
    print("YES")

Submission status: Runtime Error

Solution code:
n = int(input())
la = list(map(int, input().split())
d = {}
ret = 'NO'
for a in la:
    if a in d:
        ret = 'YSE'
        break
    d[a] = ''
print(ret)

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0
for i in range(n):
    if a[1] in a is True:
        print("NO")
        x = 1
        break
    a.pop(0)

if x == 0:
    print("YES")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(int(x) for x in input().split())
x = 0
for i in range(n):
    if a[i] in a is True:
        print("NO")
        x = 1
        break
    a.pop(0)

if x == 0:
    print("YES")

Submission status: Runtime Error

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

for i in range(N - 1):
    if A[i] == A[i + 1]:
        print('No')
        break
    else:
        if i == N - 2:
            print('Yes')
        continue

Submission status: Runtime Error

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

for i in range(N - 1):
    if A[i] == A[i + 1]:
        print('No')
        break
    else:
        if i == N - 1:
            print('Yes')
        continue

Submission status: Runtime Error

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

for i in range(n - 1):
    for j in range(n - i - 1):
        if List[i] == List[i + j + 1]:
            ans = 'NO'

print(ans)ß

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
x=0
a.sort()
for i in range(n-1):
  if a[i]==a[i+1]:
    x+=1
if x=0:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
n=int(input())
a=list(map(int,input().split()))
x=0
a.sort()
for i in range(n-1):
  if a[i]=a[i+1]:
    x+=1
if x=0:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(it,input().split()))
A.sort()
for i in range(N-1):
  if A[i]==A[i+1]:
    print('NO')
    break
else:
  print('YES')

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(it,input().split()))
A.sort()
for i in range(N-1):
  if A[i]=A[i+1]:
    print('NO')
    break
else:
  print('YES')

Submission status: Runtime Error

Solution code:
input_length = int(input())
length = len(list(set([int(i) for i in input.split(' ')]))) 

if length == input_length:
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

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

if len(a_list) == len(a_set):
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

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

if len(a_list) == len(a_set):
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
n = int(input())
b = int(x) for x in input().split()
a = list(b)
x = 0
for i in range(n):
    if a.count(a[i]) >= 2:
        print("No")
        x = 1
        break

if x == 0:
    print("Yes")

Submission status: Runtime Error

Solution code:
n = int(input())
b = int(x) for x in input().split()
a = list(b)
x = 0
for i in range(n):
    if a.count(a[i]) > 1:
        print("No")
        x = 1
        break

if x == 0:
    print("Yes")

Submission status: Runtime Error

Solution code:
n =int(input())
a=(int(x) for x in input().split())
x = 0
for i in range(n):
    for j in range(n - i - 1):
        if a[i] == a[i + j + 1]:
            print("Yes")
            x = 1
            break

if x == 0:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
m = int(input())

x = 0
a = str(m)
for i in range(n):
    if a.find(a[i]) != i:
        print("Yes")
        break
    x += 1

if x == n:
    print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
m=int(input())

a=str(m)
for i in range(n):
  for j in range(n-i):
  	if a[i] ==a[i+j]:
      print("Yes")
      break
	print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
m=int(input())
if (str(n) in str(m)) is True:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
n=int(input())
m=int(input())
if (str(n) in str(m)) == True:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N, K = input().split()
P = input().split()
max_sum = 0
for i in range(int(N)-int(K) + 1):
  sum = 0
  for k in range(i, i + int(K)):
    print(k)
    p = int(P[k])
    sum += (p / 2) + 0.5
    if max_sum < sum:
      max_sum = sum
print(float(max_sum))

Submission status: Runtime Error

Solution code:
num = input()
list = list(map(int,input().split()))
flg  = False
for i in list:
  if list.count(i) >= 2:
	flg = True
	break
print("NO") if flg else print("YES")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
ans = 'YES'
for i in range(n):
    for j in range(j, n-i):
        if a[i] == a[j]:
            ans = 'NO'
            break

print(ans)

Submission status: Runtime Error

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

A.sort()
flag = False
for count in range(0,len(A-1)):
    if A[count] == A[count+1]:
        flag = True
        break

if flag == False:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

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

A.sort()

count = 0
for i in range(N):
    if A[i] == A[i+1]:
        count += 1
        break

if count == 0:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
N=input()
A=(input()).split()
A.sort()

for i in range(N-1):
  if A[i]==A[i+1]:
    print('NO')
  if i==N-2:
    print('YES')

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
s=0
for i in range(N-1):
  for j in range(i+1,N):
    if all(A[i]!=A[j]):
      print("YES")
    else:
      print("NO")

Submission status: Runtime Error

Solution code:
N=int(input())
A=list(map(int,input().split()))
s=0
for i in range(N-1):
  for j in range(i+1,N):
if all(A[i]!=A[j]):
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
N=int(input())
L = [int(x) for x in input().split()]

LS=sorted(L)

for i in range(N-1):
    if LS[i]==LS[i+1]:
        print('YES')
        break
    if i==N-2
    print('NO')

Submission status: Runtime Error

Solution code:
import hashlib
import math

class BloomFilter:

    def __init__(self, num_item, false_positive):
        assert 0 <= false_positive <= 1
        # Optimal number of bit array size and hash function
        # https://en.wikipedia.org/wiki/Bloom_filter#Optimal_number_of_hash_functions
        log2 = math.log(2)
        logp = math.log(false_positive)
        size = - num_item * logp / (log2 * log2)
        num_hash = size / num_item * log2

        self.size = int(math.ceil(size))
        self.num_hash = int(math.ceil(num_hash))

        self.array = self.BitArray(self.size)
        self.hash_functions = [self.HashFunction(i, self.size)
                               for i in range(self.num_hash)]

    def add(self, item):
        for hash_func in self.hash_functions:
            i = hash_func(item)
            self.array[i] = True

    def __contains__(self, item):
        return self.contains(item)

    def contains(self, item):
        for hash_func in self.hash_functions:
            i = hash_func(item)
            if self.array[i] is False:
                return False
        return True

    class BitArray:

        def __init__(self, length):
            # Allocate an object per a bit for simplicity
            self.array = [False for _ in range(length)]

        def __getitem__(self, index):
            return self.get(index)

        def get(self, index):
            return self.array[index]

        def __setitem__(self, index, bit):
            return self.set(index, bit)

        def set(self, index, bit):
            if bit > 0 or bit is True:
                self.array[index] = True
            else:
                self.array[index] = False

    class HashFunction:

        def __init__(self, seed, maximum):
            self.seed = seed.to_bytes(
                seed.bit_length() // 8 + 1, byteorder='big')
            self.maximum = maximum

        def __call__(self, byte_buffer):
            return self.call(byte_buffer)

        def call(self, byte_buffer):
            # MD5 is enough because I don't want to oneway hash function
            b = hashlib.md5(byte_buffer + self.seed).digest()
            i = int.from_bytes(b, byteorder='big', signed=False)
            return i % self.maximum

N = int(input())
L = list(map(int,input().split()))
bf = BloomFilter(num_item=5 * 10 ** 5, false_positive=0.01)

for i in L:
    if i in bf:
        print("NO")
        quit()
    bf.add(i)
print("YES")

Submission status: Runtime Error

Solution code:
import hashlib
import math

class BloomFilter:

    def __init__(self, num_item, false_positive):
        assert 0 <= false_positive <= 1
        # Optimal number of bit array size and hash function
        # https://en.wikipedia.org/wiki/Bloom_filter#Optimal_number_of_hash_functions
        log2 = math.log(2)
        logp = math.log(false_positive)
        size = - num_item * logp / (log2 * log2)
        num_hash = size / num_item * log2

        self.size = int(math.ceil(size))
        self.num_hash = int(math.ceil(num_hash))

        self.array = self.BitArray(self.size)
        self.hash_functions = [self.HashFunction(i, self.size)
                               for i in range(self.num_hash)]

    def add(self, item):
        for hash_func in self.hash_functions:
            i = hash_func(item)
            self.array[i] = True

    def __contains__(self, item):
        return self.contains(item)

    def contains(self, item):
        for hash_func in self.hash_functions:
            i = hash_func(item)
            if self.array[i] is False:
                return False
        return True

    class BitArray:

        def __init__(self, length):
            # Allocate an object per a bit for simplicity
            self.array = [False for _ in range(length)]

        def __getitem__(self, index):
            return self.get(index)

        def get(self, index):
            return self.array[index]

        def __setitem__(self, index, bit):
            return self.set(index, bit)

        def set(self, index, bit):
            if bit > 0 or bit is True:
                self.array[index] = True
            else:
                self.array[index] = False

    class HashFunction:

        def __init__(self, seed, maximum):
            self.seed = seed.to_bytes(
                seed.bit_length() // 8 + 1, byteorder='big')
            self.maximum = maximum

        def __call__(self, byte_buffer):
            return self.call(byte_buffer)

        def call(self, byte_buffer):
            # MD5 is enough because I don't want to oneway hash function
            b = hashlib.md5(byte_buffer + self.seed).digest()
            i = int.from_bytes(b, byteorder='big', signed=False)
            return i % self.maximum

N = int(input())
L = list(map(int,input().split()))
bf = BloomFilter(num_item=5 * 10 ** 5, false_positive=0.01)

for i in L:
    if i in bf:
        print("NO")
        quit()
    bf.add(I)
print("YES")

Submission status: Runtime Error

Solution code:
n=int(input())
dicta={}
i=0
while i!=n:
    x=int(input())
    if x in dicta.keys():
        dicta[x] += 1
    else:
        dicta[x] = 1 
    i=i+1 
b=True
for keys in dicta.keys():
    if dicta[keys]>1:
        b=False
        break
print(dicta)
if b:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
  
if len(set(A)) == len(N):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
if __name__ == "__main__":
    N = int(input())
    A = list(map(int, input().split()))
  
f len(set(A)) == len(A):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
n=int(input())
l= input().split()
leng=len(l)
flag="NO"

for i in range(leng):
  print(i)
  for ii in range(i+1, leng):
    print(l[i],l[ii])
    if l[i] == l[ii]:
      flag="NO"
      return 0
    else:
      flag = "YES"

print(flag)

Submission status: Runtime Error

Solution code:
n=int(input())
dicta={}
i=0
while i!=n:
    x=int(input())
    if x in dicta.keys():
        dicta[x] += 1
    else:
        dicta[x] = 1 
    i=i+1 
b=True
for keys in dicta.keys():
    if dicta[keys]>1:
        b=False
        break
#print(dicta)
if b:
    print("YES")
else:
    print("NO")