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:
# ABC063b
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

s = input()

dic = dict()

for i in s:
    if (dic.get(i) == None):
        dic[i] = 1
    else:
        print('no')
        exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input();

T=S

S=sorted(list(set(S)))
T=sorted(list(T))

if S==T:
    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()
print("yes" if sorted(s)==sorted("".join(list(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("yes" if list(sorted(set(s))) == list(sorted(s)) else "no")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict


s = input()
d = defaultdict(int)
valid = True
for i in range(len(s)):
    if d[s[i]] > 0:
        valid = False
        break
    d[s[i]] = 1
if valid:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    Sset = set(list(S))
    if len(Sset) == len(S):
        return "yes"
    else:
        return "no"

if __name__ == '__main__':
    print(main())

Submission status: Accepted

Solution code:
S = input().strip()
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()

for i in range(26):
    if S.count(chr(ord("a") + i)) >= 2:
        print("no")
        exit()

print("yes")

Submission status: Accepted

Solution code:
s = input()
d = set()
for c in s:
    d.add(c)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
S = input()

# solve
is_diffrent = True
for i in range(len(S)):
    for j in range(i + 1, len(S)):
        if S[i] == S[j]:
            is_diffrent = False

# output
print('yes' if is_diffrent else 'no')

Submission status: Accepted

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

import sys

input = sys.stdin.readline

def main():
    S = input()
    m = {}
    for c in list(S):
        if c in m:
            print('no')
            return
        m[c] = True
    print('yes')

main()

Submission status: Accepted

Solution code:
import collections
def solve():
        s = input()
        table = collections.Counter(s)
        for k in table:
                if table[k] > 1:
                        print("no")
                        return

        print("yes")
solve()

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(set(S)) == len(S) else "no")

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
  if len(s) == 1:
    break
  c = list(s).pop(0)
  s = s[1:]
  for k in range(len(s)):
    if c == s[k]:
      print("no")
      quit()
print("yes")

Submission status: Accepted

Solution code:
s=input()
l=list(s)
import collections
c=collections.Counter(l)
ll=c.most_common()
if len(s)==len(ll):
    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:
S = input()
res = []

for i in S:
    if i in res:
        print("no")
        exit()
    else:
        res.append(i)
print("yes")

Submission status: Accepted

Solution code:
s = input()
cou = 0
flag = True
for i in s:
    cou = 0
    for j in s:
        if i == j:
            cou += 1
            if cou > 1:
                flag = False
                break
print('yes' if flag else 'no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
S=input()
L=list(S)
N=len(L)
X=0
for i in range(N):
  for j in range(N):
    if L[i]==L[j]:
      if i!=j:
        X=X+1
if X==0:
  print("yes")
else:
  print("no")

Submission status: Accepted

Solution code:
import sys
strings = input()

for i in strings:
    if strings.count(i) > 1:
        print("no")
        sys.exit()
print("yes")

Submission status: Accepted

Solution code:
S = input()
cs = set(S)
if len(S) == len(cs):
  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:
S = input()
l = len(S)
ans = True
for i in range(l):
    for j in range(i + 1, l):
        if S[i] == S[j]:
            ans = False
if ans == True:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S = input()
ans = True
cnt = [0] * 26
for i in range(len(S)):
    cnt[ord(S[i]) - ord('a')] += 1
for i in range(26):
    if cnt[i] > 1:
        ans = False
if ans == True:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
s = list(input())
if max(collections.Counter(s).values()) == 1:
  print("yes")
else:
  print("no")

Submission status: Accepted

Solution code:
n=input()
a=set([])
for s in n:
  a.add(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

hist = [0]*27
for ch in S:
  index = ord(ch)-ord('a')
  hist[index] += 1

ans = True
for c in range(27):
  if 2<=hist[c]:
    ans = False
print('yes' if ans else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():

    S = input()

    print('yes') if len(S) == len(set([i for i in S])) else print('no')

if __name__== "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
t="yes"
for i in s:
    if s.count(i)>1:
        t="no"

print(t)

Submission status: Accepted

Solution code:
s=input()
sdic={}
flag=False
for i in range(len(s)):
  if(s[i] in sdic):
    flag=True
    break
  else:
    sdic[s[i]]=1
if(flag):
  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=input()
print(['yes','no'][len(set(s)) != len(s)])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

for i in range(len(S)):
    if S.count(S[i]) >= 2:
        print("no")
        exit()

print("yes")

Submission status: Accepted

Solution code:
S = list(input())

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:
S = input()

alpha = "abcdefghijklmnopqrstuvwxyz"
c = [0] * 26

for i in range(len(S)):
    for j in range(26):
        if S[i] == alpha[j]:
            c[j] += 1

if max(c) <= 1:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
s = list(input())
print("yes" if len(s) == len(collections.Counter(s).keys()) else "no")

Submission status: Accepted

Solution code:
S = input()
C = set()
for s in S:
    if s in C:
        print("no")
        break
    C.add(s)
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 = list(input())

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

Submission status: Accepted

Solution code:
s = input()
cnt = 0

for i in range(len(s)):
  if s.count(s[i]) == 1:
    cnt = cnt
  else :
    cnt = cnt +1

if cnt >= 1:
  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 = input()

d = {}
for i in range(len(s)):
    if s[i] in d:
        print('no')
        exit()
    d[s[i]] = True
print('yes')

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 = input()
N = len(S)
set_S = set(S)
if N == len(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:
s = list(input())
s_set = set(s)
if len(s)==len(s_set):
  print("yes")
else:
  print("no")

Submission status: Accepted

Solution code:
s = input()
print("yes" if len(s)==len(list(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("yes" if len(s) == len(set(s)) else "no")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("yes")  # type: str


def no():
    print("no")  # type: str


def solve(S: str):
    S = list(S)
    S.sort()
    for i in range(len(S)-1):
        if S[i] == S[i+1]:
            no()
            return
    yes()
    return


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 = str(input())
if len(s)==len(set(s)):
    ans = "yes"
else:
    ans = "no"
print(ans)

Submission status: Accepted

Solution code:
import collections
s = input()
c = collections.Counter(s)
if c.most_common()[0][1] == 1:
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
s=input()
print(["no","yes"][len(s)==len(set(s))])

Submission status: Accepted

Solution code:
S = input()
s = set()
for i in range(len(S)):
    s.add(S[i])
if len(s) == len(S):
    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:
import sys
input = sys.stdin.readline

S = input()
T = sorted(S)
for i in range(1, len(T)) :
    if T[i] == T[i-1] :
        print('no')
        break
else :
    print('yes')

Submission status: Accepted

Solution code:
s = input()
n = len(s)
pool = set()
for i in range(n):
  pool.add(s[i])
if len(pool) == n:
  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:
s = input()
if len(s) == len(set(s)):
  print('yes')
else :
  print('no')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

print(ans)

Submission status: Accepted

Solution code:
s = input()
for i in range(len(s)):
  if s.count(s[i]) >=2:
    print('no')
    exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
a=[]
for i in range(len(s)):
	if s[i] in a:
		print("no")
		exit()
	a.append(s[i])
print("yes")

Submission status: Accepted

Solution code:
s = input()
a = {}
for c in s:
  if c not in a:
    a[c] =1
  else :
    print('no')
    break
else:
  print('yes')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
import itertools
import random
 
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,variance,stdev
 
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    S = list(input())
    
    tmp = {}
    for i in S:
        if i in tmp:
            print("no")
            sys.exit()
        else:
            tmp[i] = 1
            
    print("yes")
        
if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S = input()
for i in range(len(S)):
    if S.count(S[i]) >= 2:
        print('no')
        sys.exit()

print('yes')

Submission status: Accepted

Solution code:
# ABC 63, b - varied
from collections import Counter

S = Counter(list(input())).most_common()
if all([value == 1 for key, value in S]):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
s = input()
ans = 'yes'
for char in s:
  if s.count(char) > 1:
    ans = 'no'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
for idx, char in enumerate(S):
  if idx == len(S)-1:
    break
  if char in S[idx+1:]:
    print('no')
    exit()
print('yes')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools

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

def solve(S: str):
    if len(set(S)) == len(S):
        print('yes')
    else:
        print('no')
    return


# Generated by 1.1.4 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 = list(input())
S_set = list(set(S))

ans = 1

for s in S_set:
    if S.count(s) > 1:
        ans = 0

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

Submission status: Accepted

Solution code:
s = list(input())
for i in range(len(s)):
    if s.count(s[i]) >= 2:
        print("no")
        exit()
print("yes")

Submission status: Accepted

Solution code:
st = input()
tmp = []
for s in st:
    tmp.append(s)
if len(tmp) == len(set(tmp)):
    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()
characters=[]
res=True
for i in s:
  characters.append(i)
characters.sort()
for k in range(len(characters)-1):
  if characters[k+1]==characters[k]:
    res=False
if res:
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
s = input()
letter = []
flag = True
for i in range(len(s)):
  if s[i] in letter:
    flag = False
    break
  else:
    letter.append(s[i])
if flag == True:
  print("yes")
else:
  print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
a = 0

for j in range(len(S)):
    for k in range(j + 1,len(S)):
        if S[j] == S[k]:
             print('no')
             a = 1
             break
    if(a == 1):
       break

if a == 0:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:


#%%


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, b = LI()
    if a + b >= 10:
        print("error")
    else:
        print(a + b)
    return

#B
def B():
    s = S()
    if len(s) == len(set(s)):
        print("yes")
    else:
        print("no")
    return

#C
def C():
    return

#D
def D():
    return


#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = {}
for i in range(len(a)):
    if a[i] not in b:
        b.setdefault(a[i], 1)
    else:
        b[a[i]] += 1
for i in b.values():
    if i > 1:
        print("no")
        exit()
print("yes")

Submission status: Accepted

Solution code:
s=list(map(str,input()))
print('yneos'[sorted(list(set(s)))!=sorted(s)::2])

Submission status: Accepted

Solution code:
s=input()
ss=set(s)
if len(s)==len(ss):
  print("yes")
else:
  print("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:
s = input()
flag = 0
for i in range(len(s)-1):
    for j in range(i+1,len(s)):
        if s[i] == s[j]:
            flag = 1
            break
    if flag == 1:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
s = input()

alist = [w for w in s]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:


def main():
    data = list(input())
    aaa  = set(data)

    if len(data) == len(aaa):
        print('yes')
    else:
        print('no')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter
s = input()
ans = len(Counter(s).most_common()) == len(s)
print("yes" if ans else "no")

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = ''
for i in s:
    if i not in t:
        t += i
    else:
        print('no')
        exit()
print('yes')

Submission status: Accepted

Solution code:
s = input()
t = ''
for i in s:
    if i not in t:
        t += i
    else:
        print('no')
        break
if t == s:
    print('yes')

Submission status: Accepted

Solution code:
s = input()
t = ''
for i in s:
    if i not in t:
        t += i
    else:
        print('no')
        t = ''
        break
if t != '':
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:

S = input()

dic = {}
ans = "yes"

for i in S:
    
    if i in dic:
        ans = "no"

    else:
        dic[i] = 1

print (ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
d = {}
for s in S:
    if s in d:
        print("no")
        exit()
    else:
        d[s] = True
print("yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ss = "".join(set(s))
print("yes") if len(s) == len(ss) 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:
# B
S = input()
S_lst = []
for i in range(len(S)):
    S_lst.append(S[i])
S_lst.sort()
flag = True
for i in range(len(S)-1):
    if S_lst[i] == S_lst[i+1]:
        flag = False
if flag:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
from collections import defaultdict

S = input()
D = defaultdict(int)
for s in S:
    D[s] += 1

for v in D.values():
    if v != 1:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

Solution code:
from sys import stdin
S = (stdin.readline().rstrip())
if len(S) == len(set(S)):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
s=input()
ans="yes"
for i in range(len(s)):
    for j in range(len(s)):
           if s[i]==s[j] and i!=j:
                ans="no"
                break
print(ans)

Submission status: Accepted

Solution code:
S = input()
D = {}
ans = "yes"
for s in S :
    if s not in D :
        D[s] = 1
    else :
        ans = "no"
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

S = list(input())

C = Counter(S).most_common()

flag = True
for i, j in C:
    if j != 1:
        flag = False

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

Submission status: Accepted

Solution code:
# coding: utf-8
import time
import re
import math
import fractions

def main():
    s=input()
    if len(s)==len(set(list(s))):
        print("yes")
    else:
        print("no")
start=time.time()
main()
#print("処理速度 {}sec".format(time.time()-start))
#"YNeos"[True::2]
#A=list(map(int,input().split()))
#A,B,C=map(int,input().split())
#n=int(input())
# global n,A,s,memo,mx,mn,L,B

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)

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

def solve(S: str):
    s = set(S)
    ret = YES
    if len(s) != len(S):
        ret = NO
    print(ret)
    return


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:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

S = s()
seen = set()

for c in S:
    if c in seen:
        print('no')
        import sys
        sys.exit()
    seen.add(c)

print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if len(s) != len(set(list(s))):
  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:
def abc():
    s = input().rstrip()
    print('yes' if len(s) == len(set(s)) else 'no')


abc()

Submission status: Accepted

Solution code:
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint
import bisect
import copy
import fractions
import itertools
import math
import queue
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers): return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers): return reduce(LCM, numbers)
def LCM(m, n): return (m * n // fractions.gcd(m, n))


s = IS()
for i in s:
    if s.count(i) >= 2:
        print('no')
        exit()
print('yes')