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:
def varied(S: str)->bool:
    d = {}
    for c in S:
        if c in S:
            return False
        d[c] = True
    return True


if __name__ == "__main__":
    S = input()
    yes = varied(S)
    print('yes' if yes else 'no')

Submission status: Wrong Answer

Solution code:
# 063 B
import collections
S = input()
if len(S) ==len(collections.Counter(S)):
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
l_s = list(s)
c = 0
for i in range(len(s)):
	if l_s.count(s[i]) != 1:
		c += 1
		print('No')
		break        
        
if c == 0:
	print('Yes')

Submission status: Wrong Answer

Solution code:
S=input()
k=len(S)
c=0
for i in range(k):
    for j in range(k-i):
        if S[i]!=S[i+j]:
            c+=1
print(c)
if c==k*(k-1)/2:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
S= input()
k=len(S)
c=0
for i in range(k):
    for j in range(k-i):
        if S[i]!=S[i+j]:
            c+=1
print(c)
if c==k*(k-1)/2:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
##方針・setとlistのlenが一致するか見る
S=input().split()
W=set(S)
if len(S)==len(W):
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
s = list(input())
s.sort()
flag = True
for i in range(len(s) - 1):
    if s[i] == [i + 1]:
        flag = False

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

Submission status: Wrong Answer

Solution code:
l=list(input())
l.sort()
if l[0]==l[len(l)-1]:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

print("yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
r = ""
for i in s:
  if i in r:
    print("no")
  elif i not in r:
    r += i
print("yes")

Submission status: Wrong Answer

Solution code:
s = input()

if len(set(s)) < len(s):
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
if s == s.lower():
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
S = list(input())
S.sort()
N = len(S)
judge = "yes"
for i in range(N - 1):
	if S[i] == S[i + 1]:
		judge = "yes"
		break

print(judge)

Submission status: Wrong Answer

Solution code:
S = input()
print(["No", "Yes"][len(set(S)) == len(S)])

Submission status: Wrong Answer

Solution code:
S = input()
a = []
for i in range (len(S)):
    a.append(S[i])
print(["No", "Yes"][len(set(a)) == len(S)])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()

l = []

ans = 'Yes'

for s in S:
    if s not in l:
        l.append(s)
    else:
        ans = 'No'
        break

print(ans)

Submission status: Wrong Answer

Solution code:
S = list(input())
flag=0
for i, j in zip(sorted(S), sorted(list(set(S)))):
    if i==j:
        pass
    else:
        print("no")
        flag +=1
        break
if flag==0:
    print("yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list((input()))
count = 0

for i in range(len(s)):
    for j in range(len(s)):
        print("{},{}".format(i, j))
        if (i != j) and (s[i] == s[j]):
            count += 1

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

Submission status: Wrong Answer

Solution code:
s = list((input()))
count = 0

for i in range(len(s)):
    for j in range(len(s)):
        print("{},{}".format(i,j))
        if (i != j)and(s[i] == s[j]):
            count += 1

if count == 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
S = input().strip()
s = Counter(S)
for k,v in s.items():
  if v>=2:
    print('no')
else:
  print('yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()

list = []

for i in range(len(s)):
	list.append(s[i])
	
for j in range(len(s)):
	if s.count(list[j]) >= 2:
		print('no')
		break
	else:
		print('yes')
		break

Submission status: Wrong Answer

Solution code:
s = input()

list = []

for i in range(len(s)):
	list.append(s[i])
	
for j in range(len(s)):
	if s.count(list[j]) == 2:
		print('no')
		break
	else:
		print('yes')
		break

Submission status: Wrong Answer

Solution code:
S = raw_input()
lis = list(S)
for i in lis:
	mat = []
	if i in mat:
		print "no"
		break
	mat.append(i)
else:
	print "yes"

Submission status: Wrong Answer

Solution code:
S = raw_input()
lis = list(S)
for i in lis:
	mat = []
	if i in S:
		print "no"
		break
	mat.append(i)
else:
	print "yes"

Submission status: Wrong Answer

Solution code:
s = input()
c = 0

#check for constraints
if 2<=len(s) and len(s) <= 26:
    s2 = ''.join(sorted(s))
    for i in s2:
        if c > len(s):
            quit()
        if s2[c] == s2[c+1]:
            print("no")  # string is not unique
            quit()
        elif s2[c] != s2[c+1]:
            continue
print("yes") # string is unique

Submission status: Wrong Answer

Solution code:

print('Input a string: ')
s = input()
c = 0

#check for constraints
if 2<=len(s) and len(s) <= 26:
    s2 = ''.join(sorted(s))
 #   print(s2)

    for i in s2:
        if c > len(s):
            quit()
        if s2[c] == s2[c+1]:
            print('no')  # string is not unique
            quit()
        elif s2[c] != s2[c+1]:
            continue
print('yes') # string is unique

Submission status: Wrong Answer

Solution code:
s = raw_input()

arr = []

temp = ord(s[0])
arr.append(temp)

for i in range(1, len(s)):
    temp = ord(s[i])
    if temp in arr:
        print "no"
    else:
        temp = ord(s[i])
        arr.append(temp)
    if i == len(s) - 1:
        print "yes"

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input();print('no'*len(a)==len(set(a))or'yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
for i in range(len(S)):

    temp = i + 1

    for f in range(len(S) - temp):
        if S[i] == S[temp]:
            print('no')
            exit()
print('yes')

Submission status: Wrong Answer

Solution code:
S = input()
for i in range(len(S)):

    temp = i + 1

    for f in range(len(S) - temp):
        if S[i] == S[temp]:
            print('no')
            exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=input("")
c=""
b={}.fromkeys(a).keys()
for i in b:
    c+=str(i)
if a==c:
    print("yes")
else:print("no")

Submission status: Wrong Answer

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

S = input()
list(S)
boolean = True
for i in range(len(S)):
    for j in range(i+1, len(S)):
        if i == j:
            boolean = False

[print('no') if boolean == True else print('yes')]

Submission status: Wrong Answer

Solution code:
S=list(input())
S.sort()
print (S)
nd=0
i=0
while nd==0 and i<len(S)-1:
    if S[i]==S[i+1]:
         nd=1
    i+=1
if nd==1:
    print ("no")
else:
    print ("yes")

Submission status: Wrong Answer

Solution code:
A=input()
B=[]
for i in range(len(A)):
    B.append(A[i])
    B.sort()
flg=0
for i in range(len(A)-1):
    if B[i]==B[i+1]:
        flg=+1
if flg>0:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=list(input())
sorted(S)
nd=0
i=0
while nd==0 and i<len(S)-1:
    if S[i]==S[i+1]:
         nd=1
    i+=1
if nd==1:
    print ("no")
else:
    print ("yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input()
dif = 0

for i in range(len(a) - 1) :
  if (a[0 + i] == a[1 + i]) :
    dif = 1
  
if dif :
  print ('no')
else :
  print ('yes')

Submission status: Wrong Answer

Solution code:
S = list(map(str, raw_input().split())[0])

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(input())

lis = []

uq = True

for e in s:
    if e in lis:
        print("no")
        uq = False

    lis.append(e)
if uq:
    print("yes")

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function
import sys


def main():
    d = set()
    s = sys.stdin.readline().strip()
    for c in s:
        if c in d:
            print("no")
            return
        d.add(c)
        print(d)
    print("yes")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
string = input()
print('yes') if len(string) == len(set(string)) 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 = len(S)

cnt=[0]*26
al = [chr(ord('a') + i) for i in range(26)]
for i in range(N):
    for j in range(26):
        if S[i] == al[j]:
            cnt[j]+=1
# print(cnt)

out='yes'
for i in range(26):
    if cnt[i]>=2:
        out='no'

print(out)

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())
ans = "yes"
for i in range(len(S)):
    ch = S[i]
    S[i] = "-1"
    if ch in S:
        ans = "no"
        break
print(ans)

Submission status: Accepted

Solution code:
from collections import Counter

string = Counter(input())

for _ in string.values():
    if _ > 1:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

Solution code:
s = input()
l = list(set(s))
if len(s) == len(l):
    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:
def answer(s: str) -> str:
    return 'yes' if len(s) == len(set(s)) else 'no'


def main():
    s = input()
    print(answer(s))


if __name__ == '__main__':
    main()

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 = []
for i in s:
    if i in l:
        print('no')
        exit()
    else:
        l.append(i)
print('yes')

Submission status: Accepted

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

if len(s) == len(set(s)):
    print('yes')
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:
import collections
s = input()
c = collections.Counter(s)

if all(x == 1 for x in c.values()):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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



if __name__ == '__main__':
    main()

Submission status: Accepted

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
s = sorted(s)
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: 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)) :
  for j in range(i+1,len(S)) :
    if S[i]==S[j] :
      print("no")
      exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

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


def solve(S: str):
    s = set()
    for i in S:
        if i in s:
            print(NO)
            return
        s.add(i)
    print(YES)
    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:
l = list(input())
s = set(l)
if len(s) == len(l):
	print("yes")
else:
	print("no")

Submission status: Accepted

Solution code:
s = input()

lst1 = []
for i in range(len(s)):
   lst1.append(s[i])
lst1.sort()

lst2 = list(set(lst1))
lst2.sort()

if lst1 == lst2:
   print('yes')
else:
   print('no')

Submission status: Accepted

Solution code:
S = str(input())
data1 = []
for i in range(len(S)):
    data1.append(S[i])
data2 = list(set(data1))

if len(data1) == len(data2):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
bool = True
for i in range(len(s) - 1):
    for j in range(i + 1,len(s)):
        if s[i] == s[j]:
            bool = False
if bool:
    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 = list(input())

for i in s:
    if s.count(i) > 1:
        print('no')
        break
else:
    print('yes')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()
x = 0
for i in s:
  c = 0
  for j in s:
    if i == j:
      c += 1
  if c != 1:
    print("no")
    break
  else:
    x += 1
    if x == len(s):
      print("yes")
      break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 31
S = str(input())

list = []
ans = 'yes'
for s in S:
    for past in list:
        if s == past: 
            ans = 'no'
            break
    if ans == 'no': break
    list.append(s)

print(ans)

Submission status: Accepted

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: 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 = set(S)
if(len(S)==len(s)):
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
# B - Varied
def main():
    s = input()

    s_s = set(s)

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


if __name__ ==  "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
l = []
for i in range(len(s)):
    if not s[i] in l:
        l.append(s[i])
    else :
        print('no')
        exit()
print('yes')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import itertools
import numpy as np

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

print("yes")

Submission status: Accepted

Solution code:
S=input()
for c in S:
    if S.count(c)>1:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
dic = {}

ans = True
for i in range(len(S)):
    if S[i] in dic:
        ans=False
        break
    else:
        dic[S[i]]=0

print("yes" if ans else "no")

Submission status: Accepted

Solution code:
s = list(input())
while s:
    c = s.pop()
    if c in s:
        print('no')
        exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
L = []
for i in s:
  if i in L:
    print('no')
    exit()
  else:
    L.append(i)
print('yes')

Submission status: Accepted

Solution code:
S = input()
A = [0 for i in range(26)]
f = 0
for i in range(len(S)):
  a = ord(S[i]) - 97
  if A[a] != 0:
    print("no")
    f = 1
    break
  else:
    A[a] = 1
if f == 0:
  print("yes")

Submission status: Accepted

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

d=set(c)

if len(d)<len(c):
    print("no")
else:
    print("yes")

Submission status: Accepted

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

Solution code:
#n = int(input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
s = list(input())
if len(s) == len(set(s)):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys
s = input()
n = len(s)
dic = defaultdict(int)

for i in range(n):
    dic[s[i]] += 1
    if dic[s[i]]==2:
        print("no")
        sys.exit()

print('yes')

Submission status: Accepted

Solution code:
a=input()
b=[]
c=0
for i in range(len(a)):
  b.append(a[i])
b.sort()
for i in range(len(a)-1):
  if b[i]==b[i+1]:
    c=c+1
if c==0:
  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:
def main():
    s = list(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def main():
    s = input()
    answer = 'yes'

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

s = input().strip()
a = set()
for i in s:
    if i in a:
        print('no')
        sys.exit()
    a.add(i)
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

s = input().strip()

from collections import Counter
c = Counter(s)
if set(list(c.values())) == {1}:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
# B - Varied
S = input()
s = set()
ans = 'yes'
for i in range(len(S)):
    if S[i] in s:
        ans = 'no'
        break
    s.add(S[i])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

def duplicate(seq):
    seen = []
    unique = [x for x in seq if x not in seen and not seen.append(x)]
    return len(seq) != len(unique)

if duplicate(S):
    print('no')
else:
    print('yes')

Submission status: Accepted

Solution code:
a=[0]*26
S=input()
i=0
while True:
    if i==len(S):
        print("yes")
        break
    b=ord(S[i])-97
    if a[b]==1:
        print("no")
        break
    else:
        a[b]=1
        i+=1

Submission status: Accepted

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

Submission status: Accepted

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)):
    for j in range(26):
        if s[i] == alphabet[j]:
            aa[j] += 1
            if aa[j] >= 2:
                ans = "no"
                break
print(ans)

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
data = set()
for s in S:
  if s not in data:
    data.add(s)
  else:
    print("no")
    exit()
print("yes")

Submission status: Accepted

Solution code:
s = input()
a = ""
for i in s:
    if a.find(i) == -1:
        a += i
    else:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

Solution code:
# 「ABC-154-C」の類題
S = input()
 
n1 = len(S)
n2 = len(set(S))
 
if n1 == n2: print('yes')
else: print('no')

Submission status: Accepted

Solution code:
S = input()

n1 = len(S)
n2 = len(set(S))

if n1 == n2: 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:
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()

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

Submission status: Accepted

Solution code:
S = input()
T = sorted(S)
U = set(T)
U = sorted(U)
if T == U:
  print('yes')
else:
  print('no')

Submission status: Accepted

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

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:
from typing import List


S = list(input())  # type: List[str]
if len(S) == len(set(S)):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
# ABC063
from collections import Counter

S = input()
count = Counter(S)

for cnt in count.values():
    if cnt != 1:
        print('no')
        exit()
else:
    print('yes')

Submission status: Accepted

Solution code:
s = input()
dic = {}
flag = True
for i in range(len(s)):
    if s[i] not in dic.keys():
        dic[s[i]] = 1
    else:
        flag = False
if flag:
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
s = str(input())
chars = set()
ans = 'yes'
for c in s:
    if c in chars:
        ans = 'no'
        break
    chars.add(c)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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