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: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
from collections import Counter
S = input()
Sd = Counter(S)

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

Submission status: Accepted

Solution code:
import sys

s = input()
for i in range(len(s)):
    for j in range(len(s)):
        if i != j and s[i]==s[j]:
            print("no")
            sys.exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
L = len(S)

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

Submission status: Accepted

Solution code:
import collections

S = input()

l = collections.Counter(S).values()
if(max(l)>1):
	print('no')
else:
	print('yes')

Submission status: Accepted

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: Accepted

Solution code:
s=input()
c='yes'
for i in range(len(s)):
    for j in range(i+1,len(s)):
        if s[i]==s[j]:
            c='no'

print(c)

Submission status: Accepted

Solution code:
S = input()
C = []
f = True
for s in S:
  if s not in C:
    C.append(s)
  else:
    f = False
print('yes' if f else 'no')

Submission status: Accepted

Solution code:
import collections
c = collections.Counter(input()[:])

if c.most_common()[0][1] == 1:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
from collections import Counter

s = list(input())
ans = True
for x in Counter(s).values():
    if x > 1:
        ans = False
print(["no", "yes"][ans])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

n = list(s)

sets = set(n)

if len(n) == len(sets):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    S = list(input().strip("\n"))
    if len(S) == len(set(S)): print("yes")
    else: print("no")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
S = input()
B = [False] * 26
for s in S:
    if B[ord(s) - ord('a')]:
        print('no')
        sys.exit()
    else:
        B[ord(s) - ord('a')] = True
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s = input()
print("yneos"[len(s) != len(set(i for i in s))::2])

Submission status: Accepted

Solution code:
s=input()
alp='abcdefghijklmnopqrstuvwxyz'
A=[0 for i in range(26)]
for ss in s:
    A[alp.index(ss)]+=1
print("yes" if all(a<=1 for a in A)==True else "no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

for i in range(len(s)):
    for j in range(len(s)):
        if s[i]==s[j] and i!=j:
            print("no")
            exit()

print("yes")

Submission status: Accepted

Solution code:
S = input()

for s in S:
  if S.count(s) != 1:
    print("no")
    exit()
    
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S = str(input())

from collections import Counter
for i in range(len(S)):
    if S.count(S[i]) > 1:
        print('no')
        sys.exit()
print('yes')

Submission status: Accepted

Solution code:
S = list(input())
if len([x for x in set(S) if S.count(x) > 1]) == 0:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
i = len(s)
s = list(set(s))
j = len(s)

if i != j:
    print('no')
else:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = {s[i] for i in range(len(s))}

ans = "yes" if len(s) == len(t) else "no"
print(ans)

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import collections
import fractions
import itertools

def solve():
    s = list(input())
    if len(s) == len(set(s)):
        print("yes")
    else:
        print("no")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
s=input()
n=len(s)
d=set()
for ss in s:
  d.add(ss)
if len(d)==n:
  print("yes")
else:
  print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input().strip()
C = {}
for i in range(len(S)):
    a = S[i]
    if a not in C:
        C[a] = 0
    C[a] += 1
if len(S)==len(C):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
S = str(input())
L = len(S)
ST = set(list(S))

if L == len(ST):
  print("yes")
else:
  print("no")

Submission status: Accepted

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

if len(s) == len(t):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
s = input()
t = set([c for c in s])

if len(s) == len(t):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

for i in range(n):
    for j in range(i+1, n):
        if s[i] == s[j]:
            print('no')
            exit()

print('yes')

Submission status: Accepted

Solution code:
s = input()
flg = 1

for i in range(len(s)):
    cou = s.count(s[i])
    if (cou > 1) :
        flg = 0
        break
if (flg) : print("yes")
else : print("no")

Submission status: Accepted

Solution code:
import sys
from collections import Counter
S = list(input())
C = Counter(S)
for k, v in C.items():
    if v != 1:
        print('no')
        sys.exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
s = input()

c = collections.Counter(s)

for ch in c:
    if c[ch] >= 2:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

Solution code:
s = input()

check = [0]*26

for i in range(len(s)):
    tmp = ord(s[i]) % 26
    if check[tmp] == 1:
        print('no')
        exit()
    check[tmp] = 1
else:
    print('yes')

Submission status: Accepted

Solution code:
S = input()
s_list = [s for s in S]
s_set = set(s_list)
if len(s_list)==len(s_set):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S=input()
F=True
T=set()

for s in S:
    F&=(s not in T)
    T.add(s)
    
if F:
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

S = list(str(input()))

S_num = len(set(S))

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

Submission status: Accepted

Solution code:
s = input()

def solve(x):
    l = []
    for c in x:
        if c in l:
            return False
        l.append(c)
    return True

if solve(s):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=list(input())
a,b=len(S),len(set(S))
if a==b:
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
# n, m, l = map(int, input().split())

# list_n = list(map(int, input().split()))

# n = input()
# list = [input() for i in range(N)

# list = [[i for i in range(N)] for _ in range(M)]

import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
char = [chr(ord('a') + i) for i in range(26)]
for c in char:
    if S.count(c) > 1:
        print('no')
        break
else:
    print('yes')

Submission status: Accepted

Solution code:
s=input()
d={}
for i in range(int(len(s))):
    if s[i] not in d:
        d[s[i]]=1
    else:
        print("no")
        exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
S = input()

words = []
for s in S:
    if s not in words:
        words.append(s)
    else:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

Solution code:
s = str(input())
apple = []
for i in s:
    apple.append(i)
print("yes" if len(apple) == len(set(apple)) else "no")

Submission status: Accepted

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: Accepted

Solution code:
import sys
S = str(input())
if len(S) < 2 or len(S) > 27:
    sys.exit()
if not S.islower():
    sys.exit()

result = 'yes'
for I in range(len(S)):
    if S.count(S[I]) > 1:
        result = 'no'
print(result)

Submission status: Accepted

Solution code:
testStr =[i for i in input()]
setList = set(testStr)
print("yes" if len(testStr) ==len(setList) else "no")

Submission status: Accepted

Solution code:
import collections 
s = input()
s_collection = collections.Counter(s)

flag = True
for value in s_collection.values():
  if value > 1:
    flag = False

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

S_s = set(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    S = input()
    c = set()
    l = 0
    for s in S:
        c.add(s)
        if l == len(c):
            print("no")
            return
        l += 1
    print("yes")


resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
n = len(s)
ans = "yes"
for i in range(n):
  if s.count(s[i]) != 1:
    ans = "no"
print(ans)

Submission status: Accepted

Solution code:
import copy
s = input()
ss = list(s)
sss = copy.copy(ss)
n = len(ss)
ans = "yes"

for i in range(n):
  sss = copy.copy(ss)
  sss.remove(sss[i])
  if ss[i] in sss:
    ans = "no"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(str(input()))
d = dict.fromkeys(s)
if len(s) == len(d):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
s = input()
ls = []
ans = 1

for i in range(len(s)):
    if s[i] not in ls:
        ls.append(s[i])
    else:
        ans = 0
        break

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

Submission status: Accepted

Solution code:
S=input();print(['no','yes'][len(set(S))==len(S)])

Submission status: Accepted

Solution code:
S = input()

lis_S = list(S)
set_S = set(S)

if len(lis_S) == len(set_S):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

l = []

for s in S:
    if s in l:
        print('no')
        exit()
    l.append(s)
print('yes')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
#

import sys
input=sys.stdin.readline

def main():
    ab="qwertyuiopasdfghjklzxcvbnm"
    S=input()
    y=1
    for a in ab:
        if S.count(a)>1:
            y=0
            break
    if y==1:
        print("yes")
    else:
        print("no")
    
if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(str, input()))
s2 = list(set(s))
if len(s) == len(s2):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
x=len(s)
t=set(s)
y=len(t)

if x==y:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
def resolve():
    s = input()

    ans = str()
    for char in s:
        if s.count(char) >1:
            ans = "no"
            break
        else:
            ans = "yes"
    print(ans)
resolve()

Submission status: Accepted

Solution code:
def countchar(s) : 
  countstr = [0] * 300
  for i in s : 
    if countstr[ord(i)] != 0 : 
      return False
    countstr[ord(i)] += 1
  return True


s = input()


if countchar(s) : 
  print('yes') 
else : 
  print('no')

Submission status: Accepted

Solution code:
from collections import Counter

S=list(input())
count=Counter(S)
for key,cnt in count.most_common():
    if cnt!=1:
        print("no")
        exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

s = input()

count = collections.Counter(s)

_max = 0
for i in count.values():
  if _max < i:
    _max = i
if _max >= 2:
  print("no")
else:
  print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    A = [False]*26
    for char in S:
        if A[ord(char) - ord("a")]:
            print("no")
            return
        else:
            A[ord(char) - ord("a")] = True
    print("yes")

main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict, deque
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline()[:-1]


def solve():
    s = input()
    w = set()
    for e in s:
        if e in w:
            print('no')
            return
        w.add(e)
    print("yes")

        
t = 1
# t = int(input())
for case in range(1,t+1):
    ans = solve()



"""

1 4
7
RRRR
1 1 0 1
----
4

1 4
47
RCRR
1 1 0 1
----
-1

2 2
10
RR
RR
1 7
4 1
----
4

2 2
10
RR
RR
7 4
7 4
----
-1

3 3
8
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


3 3
1
RCR
RRC
RRR
1 1 1
1 1 1
1 3 1


"""

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

for i in range(len(s)):
  if s.count(s[i]) > 1:
    print("no")
    exit()
    
print("yes")

Submission status: Accepted

Solution code:
def i():
	return str(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

s = list(i())
s.sort()

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

Submission status: Accepted

Solution code:
def i():
	return str(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

Submission status: Accepted

Solution code:
S = input()
def judge(S):
  memo = []
  for i in range(len(S)):
    if S[i] in memo:
      return False
    memo.append(S[i])
  return True

print("yes" if judge(S) else "no")

Submission status: Accepted

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

Submission status: Accepted

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


def read():
    S = input().strip()
    return S,


def solve(S):
    u = set(S)
    return "yes" if len(u) == len(S) else "no"


if __name__ == '__main__':
    inputs = read()
    print(solve(*inputs))

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

# In[7]:


S = input()


# In[8]:


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


# In[ ]:

Submission status: Accepted

Solution code:
s=input()
frag="yes"
for i in range(len(s)):
  n=s.count(s[i])
  if n >1:
    frag="no"
    break
    
print(frag)

Submission status: Accepted

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



if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
l = len(s)
m = set()
for i in range(l):
  m.add(s[i])
m = len(list(m))
if l == m:
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
import sys
arr_S = []
S = str(input())

for i in range(0,len(S)):
  arr_S.append(S[i])
for i in range(0,-1+len(S)):
  if sorted(arr_S)[i+1] == sorted(arr_S)[i]:
    print("no")
    sys.exit()
print("yes")

Submission status: Accepted

Solution code:
def main():
    S = input()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

if len(list(set(l))) == n:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
li=[]
result='yes'
for i in s:
    if i in li:
        result='no'
    li.append(i)
print(result)

Submission status: Accepted

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

flag = True
for i in range(len(l) - 1):
    if l[i] in l[i + 1:]:
        flag = False

if flag:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
S.sort()
flag = 0
for i in range(len(S)- 1):
  if(S[i] == S[i+ 1]):
    flag = 1
    break
if(flag == 1):
  print("no")
else:
  print("yes")

Submission status: Accepted

Solution code:
import sys
s=input()
alphabet=[chr(i) for i in range(97,97+26)]
for i in alphabet:
    if s.count(i)>=2:
        print("no")
        sys.exit()
print("yes")

Submission status: Accepted

Solution code:
S = input()

s = list(set(S))

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

Submission status: Accepted

Solution code:
S=list(str(input()))
T=set(S)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:


if __name__ == '__main__':
    s= input()
    len1 = len(s)
    len2 = len(set(s))

    if len1 == len2:
        print("yes")
    else:
        print("no")

Submission status: Accepted

Solution code:
S = list(input())
A = []
for s in S:
    if s in A:
        print('no')
        exit()
    A.append(s)
print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "yes"  # type: str
NO = "no"  # type: str


def solve(S: str):
    print(YES if len(set(S)) == len(S) else NO)
    return


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = list(input())
s2 = list(set(s))
s.sort()
s2.sort()

if s == s2:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S = input()
v = set()
for c in S:
    if c in v:
        print("no")
        break
    else:
        v.add(c)
else:
    print("yes")

Submission status: Accepted

Solution code:
s = input()
l = set(s)

if len(s) == len(l):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    n = len(s)
    print('yes') if len(list(set(list(s)))) == n else print('no')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()
S = set(c for c in s)
print("yes" if len(s) == len(S) else "no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=list(input())
f=0

for i in range(len(S)):
	if S.count(S[i]) == 1:
		f+=0
	else:
		f+=1
if f==0:
	print('yes')
else:
	print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()
h = set()
res = True
for c in s:
    if c in h:
        res = False
        break
    else:
        h.add(c)
print('yes' if res else 'no')