Problem:


Score : 200 points

Problem Statement

You are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.

Constraints

2 ≤ |S| ≤ 26, where |S| denotes the length of S.

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If all the characters in S are different, print yes (case-sensitive); otherwise, print no.

Sample Input 1

uncopyrightable

Sample Output 1

yes

Sample Input 2

different

Sample Output 2

no

Sample Input 3

no

Sample Output 3

yes



Sample input:
uncopyrightable


Sample output:
yes

Submission status: Wrong Answer

Solution code:
s = input()
l = []
for i in s:
    if i in l:
        print('No')
        exit()
    else:
        l.append(i)
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
letters = []
ans = 'no'
for i in s:
  if i in letters:
    ans = 'yes'
    break
  else:
    letters.append(i)
print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    s = input()
    ans = 'no'
    if len(set(s)) == len(s):
        ans = 'yes'
    print(ans)

Submission status: Wrong Answer

Solution code:
s = input()
dif = True
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        dif = False
print("yes" if dif else "no")

Submission status: Wrong Answer

Solution code:
s = input()
print('Yes') if len(set(list(s))) == len(s) else print('No')

Submission status: Wrong Answer

Solution code:
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline

def main():
    s = input().rstrip()
    string_dict={}

    for i in s:
        if i not in string_dict:
            d = {i:1}
            string_dict.update(d) 
        else:
            print("No")
            exit()
    print("Yes")

if __name__=="__main__":
    main()

Submission status: Wrong Answer

Solution code:
# import math
# import statistics
a=input()
#b,c=int(input()),int(input())
c=[]
for i in a:
   c.append(i)
#e1,e2,e3,e4 = map(int,input().split())
#f = list(map(int,input().split()))
#g = [input() for _ in range(a)]
count=0
for i in range(len(c)-1):
    if c[i]==c[i+1]:
        count+=1

if count>0:
    print("no")
else:
    print("yes")

Submission status: Wrong Answer

Solution code:
data=list(input())
c=0
for i in range(0,len(data)-1):
    for j in range(i+1,len(data)):
        if data[i]==data[j]:
            c=c+1
if c==0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a = list(input())
count = 0
for i in range(0, len(a)):
    if a[i] == a[i - 1]:
        count += 1

if count > 0:
    print("no")
elif count == 0:
    print("yes")

Submission status: Wrong Answer

Solution code:
s = input()
print('yes' if list(s) == set(list(s)) else 'no')

Submission status: Wrong Answer

Solution code:
s = input()
print('yes' if list(s) == set(s) else 'no')

Submission status: Wrong Answer

Solution code:
u = input()
for i in range(len(u)):
  for j in range(i,len(u)):
    if u[i]==u[j]:
      print("no")
      exit()
print("yes")

Submission status: Wrong Answer

Solution code:
u = input()
for i in range(len(u)):
  for j in range(len(u)-i):
    if u[i]==u[j]:
      print("no")
      exit()
print("yes")

Submission status: Wrong Answer

Solution code:
s = input()
alphabet = ["a", "b", "c", "d", "e", "f", "g", "h", "i", "j", "k", "l", "m", "n", "o", "p", "q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]
aa = [0]*26
ans = "yes"
for i in range(len(s)-1):
    for j in range(26):
        if s[i] == alphabet[j]:
            aa[j] += 1
            if aa[j] >= 2:
                ans = "no"
                break
print(ans)

Submission status: Wrong Answer

Solution code:
s=str(input())
t=[]
t.append(s[0])
for i in range(1,len(s)-1):
  if s[i] in t:
    print("no")
    exit()
  t.append(s[i])

print("yes")

Submission status: Wrong Answer

Solution code:
s = input()
word = []

for i in s:
    if (i not in word):
        word.append(i)
    else:
        print('no')

print('yes')

Submission status: Wrong Answer

Solution code:
s=input()
w=set()
for i in range(len(s)):
    w.add(s[i])
if len(s)==len(w):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a=input()
count=0
for i in range(len(a)):
  if a[i] in a:
    count=count+1
if count==0:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
S = input()
S_s = set(S)
print(S_s)

if len(S)==len(S_s):
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
S = input()
S_s = set(S)

if len(S)==len(S_s):
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
S=input()
chars = []
for c in S:
    chars.append(c)

ans = len(S) == len(set(chars))

if ans:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())
if len(s) == len(set(s)):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
s = list(input())
t = list(set(s))

print("Yes") if len(s) == len(t) else print("No")

Submission status: Wrong Answer

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


def main():
    s = input()
    d = set()
    for c in s:
        if c in d:
            print("no")
            return
    print("yes")

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
S = input().strip()
print("Yes" if len(S) == len(set(list(S))) else "No")

Submission status: Wrong Answer

Solution code:
s=list(str(input()))

print('Yes' if len(list(set(s)))==len(s) else 'No')

Submission status: Wrong Answer

Solution code:
s=list(str(input()))
len(s)
print('Yes' if len(list(set(s)))==len(s) else 'No')

Submission status: Wrong Answer

Solution code:
a= input().strip()
b=set(a)
if len(a)==len(b):
    print("yes")
else:
    print("no")
print(len(a),len(b))

Submission status: Wrong Answer

Solution code:
S = input()

import collections

c = collections.Counter(list(S))

ans = "yes"
for i in c.values():
    print(i)
    if i == 1:
        pass
    else:
        ans = "no"
        break

print(ans)

Submission status: Wrong Answer

Solution code:
S = input()
N = len(S)
a = []
for i in range(N):
    if S[i] in a:
        print('No')
        exit()
    else:
        a.append(S[i])
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
list = []

for i in s:
  list.append(i)
  for j in list:
    if j in s:
      print('no')
      break

print('yes')

Submission status: Wrong Answer

Solution code:
s=input()
print("Yes" if len(s)==len(set(s)) else "No")

Submission status: Wrong Answer

Solution code:
s = input()
check = True
for c in s:
    if s.count(c) > 1:
        check = False
        break
print('Yes' if check else 'No')

Submission status: Wrong Answer

Solution code:
s = input()
flag = 1
for i in range(len(s)-1) :
    for j in range(i+1,len(s)) :
        if s[i] == s[j] :
            flag = 0

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

Submission status: Wrong Answer

Solution code:
def hantei(s):
    return len(s) == len(set(s))

def main():
    s = input()
    s = list(s)

    if hantei(s) == True:
        print('yes') 
    else:
        print('No')
        
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s=input()
S=[s[i] for i in range(len(s))]
c=1
for i in range(len(S)-1):
  if S[i] in S[i+1:]:
    c=0
    break
if c==1:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
S = input().split()
ans =set(S)

a = len(S)
b = len(ans)

if a == b:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
s = input()
for i in s:
    if s.count(i) != 1:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()
for i in s:
    if s.count(i) != 1:
        print('No')
        exit
print('Yes')

Submission status: Wrong Answer

Solution code:
S = input()

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

Submission status: Wrong Answer

Solution code:
s=list(input())
li=[]
non=False
for c in s:
  if c in li:
    non=True
    break
    
if non:
  print("yes")
  
else:
  print("no")

Submission status: Wrong Answer

Solution code:
s = list(input())
a = len(s)
b = len(set(s))
print('Yes') if a == b else print('No')

Submission status: Wrong Answer

Solution code:
S=input()
print("Yes" if len(S)==len(set(S)) else "No")

Submission status: Wrong Answer

Solution code:
S = input()

a = []
result = "Yes"
for s in S:
    if s in a:
        result = "No"
        break
    a.append(s)

print(result)

Submission status: Wrong Answer

Solution code:
s = input()
for i in range(len(s) - 1):
    if s[i] == s[i+1]:
        print('no')
        exit()
print('yes')

Submission status: Wrong Answer

Solution code:
l = list(map(str, input()))

if len([x for x in set(l) if l.count(x) > 1]) > 0:
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
prev = '-'
for c in list(input()):
    if c == prev:
        print('no')
        quit()
    else:
        prev = c
else:
    print('yes')

Submission status: Wrong Answer

Solution code:
S = list(input())

s = set(S)

L = len(S)

l = len(s)

if L == l:
  print('Yes')

else:
  print('No')

Submission status: Wrong Answer

Solution code:
import math
from collections import deque
from collections import defaultdict

#自作関数群
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):#階乗
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):#コンビネーション
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def combmod(n,r,mod):
	return (fact(n)/fact(n-r)*pow(fact(r),mod-2,mod))%mod
def printQueue(q):
	r=copyQueue(q)
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)
class UnionFind():
	def __init__(self, n):
		self.n = n
		self.parents = [-1]*n

	def find(self, x): # root
		if self.parents[x]<0:
			return x
		else:
			self.parents[x] = self.find(self.parents[x])
			return self.parents[x]

	def union(self,x,y):
		x = self.find(x)
		y = self.find(y)

		if x==y:
			return

		if self.parents[x]>self.parents[y]:
			x,y = y,x

		self.parents[x]+=self.parents[y]
		self.parents[y]=x

	def size(self,x):
		return -1*self.parents[self.find(x)]

	def same(self,x,y):
		return self.find(x)==self.find(y)

	def members(self,x): # much time
		root = self.find(x)
		return [i for i in range(self.n) if self.find(i)==root]

	def roots(self):
		return [i for i,x in enumerate(self.parents) if x<0]

	def group_count(self):
		return len(self.roots())

	def all_group_members(self):
		return {r: self.members(r) for r in self.roots()} # 1~n
def bitArr(n):#ビット全探索
	x = 1
	zero = "0"*n
	ans = []
	ans.append([0]*n)
	for i in range(2**n-1):
		ans.append(list(map(lambda x:int(x),list((zero+bin(x)[2:])[-1*n:]))))
		x+=1
	return ans;
def arrsSum(a1,a2):
	for i in range(len(a1)):
		a1[i]+=a2[i]
	return a1
def maxValue(a,b,v):
	v2 = v
	for i in range(v2,-1,-1):
		for j in range(v2//a+1): #j:aの個数
			k = i-a*j
			if k%b==0:
				return i
	return -1
def copyQueue(q):
	nq = queue.Queue()
	n = q.qsize()
	for i in range(n):
		x = q.get()
		q.put(x)
		nq.put(x)
	return nq

s = readChar()
d = defaultdict(int)

for i in s:
	d[s]+=1

for i in d.values():
	if i!=1:
		print("no")
		exit()
print("yes")

Submission status: Wrong Answer

Solution code:
S = input()
len_orig = len(S)
s = set()

for i in range(len(S)):
  s.add(S[i])
if len(s)==len_orig:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
a=[]
for i in range(n):
    a.append(s[i])

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

Submission status: Wrong Answer

Solution code:
S = list(input())

print("Yes" if len(S) == len(set(S)) else "no")

Submission status: Wrong Answer

Solution code:
s=str(input())
s=list(s)
for i in range(0,len(s)):
  temp=s.count(s[i])
  if temp!=1:
    print("no")
else:
  print("yes")

Submission status: Wrong Answer

Solution code:
import math
def py():
    print("Yes")
def pn():
    print("No")
def iin():
    x = int(input())
    return x

neko = 0
nya = 0
nuko = 0

s = input()
for a in range(len(s)-1):
    for b in range(a+1,len(s)):
        if s[a] == s[b]:
            neko = 1
if neko:
    pn()
else:
    py()

Submission status: Wrong Answer

Solution code:
import math
import sys
def py():
    print("Yes")
def pn():
    print("No")
def iin():
    x = int(input())
    return x

neko = 1000
nya = 0
nuko = 0

s = input()
for a in range(len(s)-1):
    for b in range(a+1,len(s)):
        if s[a] == s[b]:
            pn()
            sys.exit()
py()

Submission status: Wrong Answer

Solution code:
# coding: utf-8
S = input()
for i in range(len(S)-1):
    if S[i] == S[i+1]:
        print('no')
        exit()
else:
    print('yes')

Submission status: Wrong Answer

Solution code:
S  = str(input())

cnt =0
flg = True

for i in range(len(S)-1):
    
    if S[i] in S[cnt+1]:
        flg =False
    
    cnt+=1
    
if flg ==True:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
flg=False
for i in range(n-1):
    if(s[i] == s[i+1]):
        flg=True
        break

if flg:
    print("no")
else:
    print("yes")

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
flg=False
for i in range(n-1):
    if(s[i] == s[i+1]):
        flg=True
        break

if flg:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)
flg=True
for i in range(n-1):
    if(s[i] == s[i+1]):
        print("no")
        flg=False
        break

if flg:
    print("yes")

Submission status: Wrong Answer

Solution code:
S=list(input())

sset=set()
for s in S:
  sset.add(s)
  
if len(sset)==26:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
s=input()
print("YNeos"[len(s)!=len(set(s))::2])

Submission status: Wrong Answer

Solution code:
S=input()
L=set(S)
print('Yes' if len(S)==len(L) else "No")

Submission status: Wrong Answer

Solution code:
S = input()
M = len(S)
N = set(S)
O = list(N)
P = len(O)
if M == P:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = input()
end = []
for i in s:
    if (end.count(i)==0):
        end.append(i)
    else:
        print("no")
        exit()
print("Yes")

Submission status: Wrong Answer

Solution code:
w = str(input())
for i in range(len(w)):
  for j in range(len(w)):
    if i != j:
      if w[i] == w[j]:
        f = True
        break
      else:
        f = False
    else:
      f = False
print('no' if f else 'yes')

Submission status: Wrong Answer

Solution code:
w = str(input())
for i in range(len(w)):
  for j in range(len(w)):
    if i != j:
      w[i] == w[j]
      f = True
      break
    else:
      f = False
print('no' if f else 'yes')

Submission status: Wrong Answer

Solution code:
S = list(input())
print('Yes' if len(S)==len(set(S)) else 'No')

Submission status: Wrong Answer

Solution code:
s=str(input())
x=0
for i in range(len(s)):
  if s.count(s[i])==0:
    x+=1
if x==len(s):
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
S=str(input())
no = False
for i in range(len(S)):
  for k in range(i+1,len(S)):
    if S[i] == S[k]:
      no == True
      break
if no:
  print('no')
else:
  print('yes')

Submission status: Wrong Answer

Solution code:
s = input()
n = len(s)

l = set(s)
m = len(l)

if n == m:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s = input()
for i in range(len(s)):
    if s[i] in s[i+1:]:
        print('No')
        break
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
N=input()
if N==set(N):
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
N=input()
if len(N)==len(set(N)):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import string
al = string.ascii_lowercase

S = input()
ans = "Yes"
for a in al:
  if S.count(a) > 1:
    ans = "No"
print(ans)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
S = input()
d = defaultdict(int)
for i in range(len(S)):
  d[S[i]] += 1
if max(d) == 1:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

s = input()
l = set(s)
if len(s) == l:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
import sys
s=input()
for i in range(len(s)+1):
    for j in range(len(s)+1):
        if s[i]==s[j]:
            print('no')
            sys.exit()
print('yes')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


S = input()
print('Yes' if len(set(list(S))) == len(S) else 'No')

Submission status: Wrong Answer

Solution code:
S = input()

word = ['qwertyuiopasdfghjklzxcvbnm']

for i in range(len(word)):
    if S.count(word[i]) > 1:
        print('no')
        exit()
        
print('yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
if len(s)!=set(s):
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
s = input()
if len(s)==set(s):
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
l = list(input())
strlen = l.__len__()
"no" if strlen - list(set(l)).__len__() else "yes"

Submission status: Wrong Answer

Solution code:
import math
l = list(input())
strlen = l.__len__()
"yes" if strlen == list(set(l)).__len__() else "no"

Submission status: Wrong Answer

Solution code:
l = list(input())
strlen = l.__len__()
"yes" if strlen == list(set(l)).__len__() else "no"

Submission status: Wrong Answer

Solution code:
a=input()
b=[str(c) for c in a]
b.sort()
c=len(b)
d=0
for i in range(c-1):
	if b[i]==b[i+1]:
		d=d+1
if d>0:
	print('No')
else:
	print('Yes')

Submission status: Wrong Answer

Solution code:
s=list(input())

for i in range(len(s)):
            for j in range(i+1,len(s)):
                        if s[i]!=s[j]:
                                    pass
                        else:
                                    #print('s[i]',s[i],'s[j]',s[j])
                                    print('No')
                                    exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s=list(input())

for i in range(len(s)):
            for j in range(i+1,len(s)):
                        if s[i]!=s[j]:
                                    pass
                        else:
                                    print('s[i]',s[i],'s[j]',s[j])
                                    print('No')
                                    exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s = input()

l=[]
for i in range(len(s)):
  l.append(s[i])
           
x = set(l)
           
if len(x) == len(s):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
S=input()
if len(S)==len(set(S)):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

if len(s)==len(set(s)):
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
S = list(input())

s = set(S)

if len(s) == len(S):
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s=input()
for x in s:
    if s.count(x)==1:
        print("yes")
        break
else:
    print("no")

Submission status: Wrong Answer

Solution code:
s = input()
print('yneos'[len(s)>len(set(s))])

Submission status: Wrong Answer

Solution code:
S = input()
print('yes' if len(S) != len(set(S)) else 'no')

Submission status: Wrong Answer

Solution code:
s = input()
t = set(s)
print("yes" if len(s) == set(t) else "no")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
S=list(input())
if len(S)==len(set(S)):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
S = [chr for chr in input()]
for moji in S:
    S.remove(moji)
    if moji in S:
        print('no')
        sys.exit(0)
print('yes')

Submission status: Wrong Answer

Solution code:
s = input()
for i in range(len(s)):
    if s.count(s[i]) != 1:
        print('No')
        exit()
print('Yes')

Submission status: Wrong Answer

Solution code:
s_l = list(input())

print('Yes') if len(s_l) == len(set(s_l)) else print('No')

Submission status: Wrong Answer

Solution code:
s = input()

for i in range(len(s)-1):
  if s[i]==s[i+1]:
    print("no")
    exit()
print("yes")

Submission status: Wrong Answer

Solution code:
S = list(input())
sum = len(S)
S.sort()
suma = 1
for i in range(sum-1) :
    if S[i] != S[i+1] :
        suma +=1
if sum == suma :
    print("yes")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
S = input()

if len(S) != len(set(S)):
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
print('yes' if len(set(input())) != 26 else 'no')

Submission status: Wrong Answer

Solution code:
print('yes' if len(set(input())) == 26 else 'no')

Submission status: Wrong Answer

Solution code:
#
#
s = input()
slist = list(s)
#print(slist)
sset = set(slist)
#print(sset)
result = "no"

if len(slist) == len(sset):
  result = "yse"

print(result)

Submission status: Wrong Answer

Solution code:
S = input()
count = len(S)
a = 0
for i in range(count):
    if S[i] in S[i+1:]:
        print(S[i+1:])
        a = a+1
    else:
        pass
if a>0:
    print("no")
else:
    print("yes")

Submission status: Wrong Answer

Solution code:
S = input()
count = len(S)
a = 0
for i in range(count):
    if S[i] in S[i+1:]:
        a = a+1
    else:
        pass
if a>1:
    print("no")
else:
    print("yes")

Submission status: Wrong Answer

Solution code:
s=input()

l=list(set(s))
if len(s)==len(l):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = list(str(input()))
for i in range(len(s)-1):
    for j in range(i,len(s)):
        if s[i] == s[j]:
            print('no')
            exit(0)
print('yes')

Submission status: Wrong Answer

Solution code:
s = str(input())
S = []
for m in s:
    S.append(m)
set_S = set(S)
if len(s) == len(set_S):
    ans = 'yes'
else:
    ans = 'no'

Submission status: Wrong Answer

Solution code:
s = str(input())

set_s = set(s)
if len(s) == len(set_s):
    ans = 'yes'
else:
    ans = 'no'

Submission status: Wrong Answer

Solution code:
w=input()
if list(w)==list(set(w)):
  print('yes')
else:print('no')

Submission status: Wrong Answer

Solution code:
S = input()

Slis = list(S)

Slis.sort

SLEN = len(Slis)


ans = 0

for i in range(SLEN):
    if i == (SLEN-1):
        break
    elif Slis[i] == Slis[i+1]:
        ans = ans + 1

if ans == 0:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
S = input()
if len(S) != len(set(S)):
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
def judge(S):
    a = list(S)
    for i in range(len(a)):
        for j in range(len(a)):
            if a[i]==a[j]:
                print("no")
                return
    print("yes")
    return

S = input()
judge(S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
for i in range(len(S)):
  if i == len(S)-1:
    print('yes')
    break
  for p in range(i+1,len(S)):
    if S[i] == S[p]:
      print('no')
      break

Submission status: Wrong Answer

Solution code:
s = input()
for i in s:
    if s.count(i) >= 2:
        print('no')
    else:
        print('yes')

Submission status: Wrong Answer

Solution code:
s = input()
for i in s:
    if s.count(i) >= 2:
        print("no")
    else:
        print("yes")

Submission status: Wrong Answer

Solution code:
from collections import Counter
l = list(input())
c = Counter(l)
if max(c.values()) >= 2:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
S = list(str(input()))
l = []

for i in range(len(S)):
  if not S[i] in l:
    l.append(S)
  else:
    print('no')
  if i == len(S) - 1:
    print('yes')

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)):
    for j in range(i+1,len(s)-1):
        if s[i]==s[j]:
            print("no")
            exit()
print("yes")

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)):
    for j in range(i+1,len(s)-1):
        if s[i]==s[j+1]:
            print("no")
            exit()
print("yes")

Submission status: Wrong Answer

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




#62
s = list(input().split())
jg = {}

for i in range(len(s)):
    if s[i] in jg:
        print("no")
        break
    else:
        jg[s[i]] = 1
    
    if i == len(s):
        print("yes")

Submission status: Wrong Answer

Solution code:
if len(set(list(input().strip())))==26:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
s = str(input())
for i in s:
  if i in s:
    print("yes")
    exit()
print("no")

Submission status: Wrong Answer

Solution code:
#2019/09/25
S = input()
print("yes" if list(S).sort() == list(set(S)).sort() else "no")

Submission status: Wrong Answer

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')


S=input()

if len(S)==set(S):
	print("yes")
else:
	print("no")

Submission status: Wrong Answer

Solution code:
# B - Varied
S = str(input())

if set(S) == len(S):
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
s = list(input().split())
s.sort()
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    print('no')
  else: print('yes')

Submission status: Wrong Answer

Solution code:
s = input()
print("Yes" if list(sorted(set(s))) == list(sorted(s)) else "No")

Submission status: Wrong Answer

Solution code:
s = input()
s_set = set(s)
f = True
for i in s_set:
  if s.count(i) >= 2:
      f = False
      break
if f:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from collections import Counter
lst = list(input())
c = sorted(Counter(lst).values(), reverse=True)
if c[0]==0: print("yes")
else: print("no")

Submission status: Wrong Answer

Solution code:
s = list(input())
print('yes' if len(s)==len(set(s)) else 'n')

Submission status: Wrong Answer

Solution code:
s=input()

print('Yes' if len(s)==len(set(s)) else 'No')

Submission status: Wrong Answer

Solution code:
s = input()
if [x for x in s] == set([x for x in s]):
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
s = input()
ns = sorted(s)
ans = 'yes'
for i in range(len(s)-1):
  if s[i] == s[i+1]:
    ans = 'no'
print(ans)

Submission status: Wrong Answer

Solution code:
s = input()

ans = "Yes"
for i in range(len(s)):
    if s.count(s[i])>1:
        ans = "No"

print(ans)

Submission status: Wrong Answer

Solution code:
s=list(input())
if len(set(s))==len(list(s)):
  print('Yes')
  
else:print('No')

Submission status: Wrong Answer

Solution code:
st = input()
tmp = []
for s in st:
    tmp.append(s)
if tmp == set(tmp):
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
S=input();print("YES" if len(S)==len(set(S)) else "NO")

Submission status: Wrong Answer

Solution code:
s = input()
ss = "".join(set(s))
print("Yes") if len(s) == len(ss) else print("No")

Submission status: Wrong Answer

Solution code:
s = [str(i) for i in input()]
s.sort()
x = s[0]
cnt = 0
for i in range(1,len(s)):
    if x == s[i]:
        cnt = 1
        break

if cnt == 0:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
S = input()
S = list(S)
l = set(S)

if S == l:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
s = list(input())
size = len(s)
count = 0 
ans = {}
for i in s:
    
    if i in ans.keys() :
        count += 1
    else : 
        ans[i] = 1
        pass
if count == 0 : print("YES")
else: print("NO")

Submission status: Wrong Answer

Solution code:
s = list(input())
n = set(s)
ans = 'yes'
for nn in n:
    if s.count(nn):
        ans = 'no'
        break
print(ans)

Submission status: Wrong Answer

Solution code:
s=input()
for i in range(len(s)):
  if s.count(s[i])!=1:
    print('no')
else:
  print('yes')

Submission status: Wrong Answer

Solution code:
# -*- coding:utf-8 -*-

def solve():
    S = input()

    for i in range(len(S)):
        target = S[i]
        for j in range(i+1, len(S)):
            if target != S[j]:
                continue
            print("no")
    print("yes")


if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

s = input().rstrip()
print("yes" if len(set(s)) == s else "no")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

s = input().rstrip()
print("yes" if set(s) == s else "no")

Submission status: Wrong Answer

Solution code:
s=list(input());"yneos"[len(s)>len(set(s))::2]

Submission status: Wrong Answer

Solution code:
from collections import Counter

S = list(input())

c = Counter(S)

for i in c.most_common():
    if i[1] > 1:
        print("no")

print("yes")

Submission status: Wrong Answer

Solution code:
S = input()
d = set()

for s in S:
    d.add(s)

if len(S) == d:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
s = sorted(list(input()))
for c in s:
    before = c
    if before == c:
        print("yes")
        exit()
print('no')

Submission status: Wrong Answer

Solution code:
s=input()
S=[]
for i in range(len(s)):
  S.append(s[i])
print("yes" if len(set(S))==len(s) else "No")

Submission status: Wrong Answer

Solution code:
s=input()
S=[]
for i in range(len(s)):
  S.append(s[i])
print("yes" if len(S)==len(s) else "No")

Submission status: Wrong Answer

Solution code:
s=input()
if list(s)==list(set(list(s))):
  print('yes')
else:
  print('no')

Submission status: Wrong Answer

Solution code:
S = list(input())
T = []
for i in S:
    if (i in T):
        print("no")
        exit()
    T.append(i)
    S.remove(i)
print("yes")

Submission status: Wrong Answer

Solution code:
S=input();print('YNeos'[len(S)!=len(set(list(S)))::2])

Submission status: Wrong Answer

Solution code:
import  collections
dic=collections.Counter(list(input()))
if max((dic.values()))==1:
	print('yes')
else:print('No')

Submission status: Wrong Answer

Solution code:
s = list(input())
t = set(s)
print(s)
print(t)
if len(s) == len(t):
	print('yes')
else:
	print('no')