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=input()
from collections import Counter
c=Counter(s)
if c.most_common()[0][1]>1:
  print("no")
else:
  print("yes")

Submission status: Accepted

Solution code:
n = input()

m = list(n)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
m=set()
for c in s:
  if c in m:
    print("no")
    quit(0)
  m.add(c)
print("yes")

Submission status: Accepted

Solution code:
S = input()
for i in range(26):
    if S.count(chr(i+ord('a'))) >= 2:
        print("no")
        import sys
        sys.exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

o = set()
ans = True
for s in S:
    if s in o:
        ans = False
    o.add(s)

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

Submission status: Accepted

Solution code:
def main():
    S = input()
    saw = set()
    for c in S:
        if c in saw:
            print("no")
            return
        saw.add(c)
    print("yes")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = str(input())

if len(set(list(s))) == len(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()
ans=[]
judge=1
for i in s:
    if i not in ans:ans.append(i)
    else:judge=0
print("yes") if judge else print("no")

Submission status: Accepted

Solution code:
""" AtCoder """

S = input()

T = set(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
len1 = len(S)
S = set(S)
S = list(S)
len2 = len(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
S = list(input())
print(['no', 'yes'][len(S)==len(set(S))])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy

def j(q):
    if q==1: print("yes")
    else:print("no")
    exit(0)


def ct(x,y):
    if (x>y):print("")
    elif (x<y): print("")
    else: print("")

def ip():
    return int(input())


#n = ip()                              #入力整数1つ
#n,k= (int(i) for i in input().split())      #入力整数横2つ
#n,x,y = (int(i) for i in input().split())    #入力整数横3つ
#n,a,b,c= (int(i) for i in input().split())  #入力整数横4つ
#a = [int(i) for i in input().split()]        #入力整数配列
a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)

#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
b = set()
for i in range(len(a)):
    b.add(a[i])
if len(b) == len(a):
    j(1)
j(0)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    s = input()
    past = []
    for x in s:
        if x not in past:
            past.append(x)
        else:
            print('no')
            return
    print('yes')

main()

Submission status: Accepted

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

for i in s:
    x.append(i)

X = set(x)

if len(x) == len(X):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
s = input()
li_s = list(s) 
li_ss= list(set(s)) 
 
if len(li_s)==len(li_ss):
  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()
flag = True
for s in S:
    if S.count(s) > 1:
        flag = False
        break
if flag:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S = raw_input()

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

Submission status: Accepted

Solution code:
S = input()
for s in S:
  if(S.count(s) != 1):
    print('no')
    break
else:
  print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde	s=input()	s='abcde'
# abcde	s=list(input())	s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ)	a=int(input())	a=5
# 1 2	| x,y = map(int,input().split())|	x=1,y=2
# 1 2 3 4 5 ... n 　	li = input().split()	li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n 　	li = list(map(int,input().split()))	li=[1,2,3,4,5,...,n]
# FFFTFTTFF 　	li = input().split('T')	li=['FFF', 'F', '', 'FF']

# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]

import collections
import math
from functools import reduce

#### START
S=input()

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

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=list(input())
S.sort()
j="yes"
for i in range(1,len(S)):
  if S[i]==S[i-1]:
    j="no"
print(j)

Submission status: Accepted

Solution code:
S = [i for i in 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 print('no')

Submission status: Accepted

Solution code:
S = raw_input()

alpha = []

flag = 'yes'
for i in S:
    if i not in alpha:
        alpha.append(i)
    else:
        flag = 'no'

print flag

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def func():
    pass


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B 063
def zeros(n): return [0 for i in range(n)]

s = input()
a = zeros(256)
res = 'yes'
for c in s:
    a[ord(c)] += 1
    if a[ord(c)]>1: 
        res = 'no'
        break
print(res)

Submission status: Accepted

Solution code:
s = input()

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

print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
S = input()
C = Counter(S).most_common()

ans = "yes"
for _k,v in C:
    if v>1:
        ans = "no"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

from collections import Counter

cs = Counter(S)

if all(v <= 1 for v in cs.values()):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str_s = input()

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

Submission status: Accepted

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


abc063_b()

Submission status: Accepted

Solution code:
S = input()
dic = [_ for _ in S]
flag = True
for i in dic:
    if dic.count(i) > 1:
        flag = False
        break
if flag:
    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:
s = str(input())
s = sorted(s)
flag = "yes"
for i in range(len(s)-1):
    if s[i] == s[i+1]:
        print("no")
        flag = "no"
        break
if flag == "yes":
  print(flag)

Submission status: Accepted

Solution code:
s=input()
ans=1
for i in s:
  if s.count(i)!=1:
    ans=0
print(["no","yes"][ans])

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    s = str(input())
    check = set()

    for i in range(len(s)):
        check.add(s[i])

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()
s = [_s[i] for i in range(len(_s))]
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:
import collections

S = list(input())
c = collections.Counter(S)
if (c.most_common()[0][1] != 1) :
    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 = list(input())
print("yes" if len(S) == len(list(set(S))) else "no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

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

Submission status: Accepted

Solution code:
# coding: utf-8
S = input()
lst = [s for s in S]
st = set(lst)

print("yes" if len(lst)==len(st) else "no")

Submission status: Accepted

Solution code:
line=input()
alphabets=[0,]*26
flg=0
for i in range(len(line)):
    alphabets[ord(line[i])-97]+=1
for i in range(len(alphabets)):
    if alphabets[i]>1:
        flg=1
if flg==0:
    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:
from collections import Counter
s=Counter(input()).most_common()
for _,i in s:
  if i !=1:
    print('no')
    exit()
print('yes')

Submission status: Accepted

Solution code:
S = input()
chars = set()
while S:
    if S[0] in chars:
        print('no')
        exit()
    chars.add(S[0])
    S = S[1:]
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s_line = input()
s_file = {}
count = 0
for s in s_line:
    s_file[s] = 0
for s in s_line:
    s_file[s] += 1
    if s_file[s] > 1:
        print("no")
        break
    else:
        count += 1
if count == len(s_line):
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ans='yes'
for si in s:
    if s.count(si) != 1:
        ans='no'
        break
print(ans)

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()
t = set(s)
s = sorted(s)
t = sorted(t)

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

Submission status: Accepted

Solution code:
str_s = input()

for s in str_s:
    if str_s.count(s) > 1:
        print('no')
        exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input().rstrip())
S.sort()

c = S[0]
result = 'yes'
for i in range(1, len(S)):
    if c != S[i]:
        c = S[i]
    else:
        result = 'no'
        break


print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(input())
b = set(a)
if len(a) == len(b):
  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 = list(input())
ans = 'yes'
for i in range(len(S)):
	if S[i] in S[i+1:]:
		ans = 'no'
		break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
a = []
for i in range(0, len(s)):
    a.append(s[i])
seta = set(a)
if len(a)==len(seta):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S = input()
from collections import Counter
counter = Counter(S)
flag = 0
for i in range(len(counter)):
    if counter.most_common()[i][1] >= 2:
        flag = 1
        print("no")
        break
if flag == 0:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
al = 'abcdefghijklmnopqrstuvwxyz'
li = list(al)

for item in li:
        if s.count(item) != 0 and s.count(item) != 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()
a = [i for i in s]
s = sorted(a)
b = 1
for i in range(len(s)-1):
  if s[i] == s[i+1]:
    b = 0
print("yes") if b == 1 else print("no")

Submission status: Accepted

Solution code:
import collections
S = input()
str = list(S)
count = collections.Counter(str)
if len(count) == len(S):
  print("yes")
else:
  print("no")

Submission status: Accepted

Solution code:
## ABC 063
s = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
s=input()

a=set(list(s))

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

Submission status: Accepted

Solution code:
from sys import stdin


def main() -> int:
    dic = dict()
    s = next_str()
    ans = "yes"

    for v in s:
        if v in dic:
            ans = "no"
        dic[v] = True
    
    print(ans)
    return 0


def next_str() -> str:
    result = ""
    while True:
        tmp = stdin.read(1)
        if tmp.strip() != "":
            result += tmp
        elif tmp != '\r':
            break
    return result


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
a = ""
for i in s:
    if i not in a:
        a += i
print("yneos"[(a != s)::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

index=0
beforeC=""
while index < len(listS):
    if index ==0:
        beforeC=listS[index]
    else:
        if listS[index] == beforeC:
            print("no")
            break
        else:
            beforeC = listS[index]
    index+=1

if index== len(listS):
    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()

l = []

for i in range(len(s)):
    if s[i] in l:
        print("no")
        exit(0)

    else:
        l.append(s[i])


print("yes")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
l=len(S)
f=0
for x in range(l):
  for y in range(l):
    if x==y:
      continue
    else:
      if S[x]==S[y]:
        f=1
      else:
        continue
      
if f:
  print('no')
else:
  print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
a = set(s[0])
for i in range(1, len(s)):
    if s[i] in a:
        print("no")
        break
    a.add(s[i])
else:
    print("yes")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

from collections import Counter

s = lc()

cnt = Counter([])

for si in s:
    cnt[si] += 1
    

ans = True

for key, value in cnt.items():
    if value != 1:
        ans = False
        break
    
if ans:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

s = input()
dic = {}
for c in s:
    if c not in dic:
        dic[c] = True
    else:
        print('no')
        exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
c = list(input())

c.sort()
c = "".join(c)
for i in range(len(c)-1):
    if c[i+1]==c[i]:
        print("no")
        sys.exit()
print("yes")

Submission status: Accepted

Solution code:
S = list(input())
cnt = [0 for i in range(26)]
for i in S:
    cnt[ord(i) - 97] += 1
if max(cnt) == 1:
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
S=input()
s_set = set()
for s in S:
    s_set.add(s)
    
print("yes" if len(s_set) == len(S) else "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:
S = input()
A = []
ans = 'yes'
for s in S:
    if s in A:
        ans = 'no'
        break
    A.append(s)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
S=list(input())
cnt=Counter(S)
print('yes' if len(S)==len(cnt) else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

li = set()
for i in range(len(S)):
  li.add(S[i])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v


# Width First Search (+ Distance)
def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk


# Depth First Search (+Distance)
def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


class Combination:
    def __init__(self, n, mod):

        g1 = [1, 1]
        g2 = [1, 1]
        inverse = [0, 1]
        for i in range(2, n + 1):
            g1.append((g1[-1] * i) % mod)
            inverse.append((-inverse[mod % i] * (mod // i)) % mod)
            g2.append((g2[-1] * inverse[-1]) % mod)
        self.MOD = mod
        self.N = n
        self.g1 = g1
        self.g2 = g2
        self.inverse = inverse

    def __call__(self, n, r):
        if (r < 0 or r > n):
            return 0
        r = min(r, n - r)
        return self.g1[n] * self.g2[r] * self.g2[n - r] % self.MOD


# --------------------------------------------

dp = None


def main():
    S = input()

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


main()

Submission status: Accepted

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



if __name__ == '__main__':
    main11()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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