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:
def main():
    S = list(input())
    lenS = len(S)
    S = set(S)
    if len(S) == lenS:
        print('yes')
    else:
        print('no')
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

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();print('yes'if len(set(S))==len(S)else '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:
s = input()
memo = []
ans = 'yes'
for i in s:
    if i not in memo:
        memo.append(i)
    else:
        ans = 'no'
        break

print(ans)

Submission status: Accepted

Solution code:
#import numpy as np
#T= str(input())
#K = int(input())
#x1,y1,x2,y2= map(int,input().split())
#A = list(map(int,input().split()))
#B = list(map(int,input().split()))
S= str(input())
a=[]
for i in S:
    if i not in a:
        a.append(i)
    else:
        print('no')
        exit()
print('yes')

Submission status: Accepted

Solution code:
s = input()
s.split()
a = [0]*len(s)
j = 0

if(s[j] in s[j+1:]):
  print("no")
  exit()
  
for i in range(1,len(s)):
  if(s[i] not in s[:j]):
    if(s[i] not in s[i+1:]):
      #print(s[i],s[i:])
      continue
    else:
      #print(s[i],s[i+1:])
      print("no")
      exit()
  else:
    #print("no")
    exit()
  j = j + 1

print("yes")

Submission status: Accepted

Solution code:
words = input()
Flag = True

c_dict = {}

for word in words:
    if word in c_dict:
        Flag = False
        break
    c_dict[word] = 1

if Flag is True:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

sl = list(s)

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

Submission status: Accepted

Solution code:
S = list(input())

s = set(S)

L = len(S)

l = len(s)

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

else:
  print('no')

Submission status: Accepted

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

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

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

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

		if x==y:
			return

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

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

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

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

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

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

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

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

s = readChar()
d = defaultdict(int)

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

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

Submission status: Accepted

Solution code:
from collections import Counter

c = Counter(input())
if max(c.values()) == 1:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

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

Submission status: 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:
def insr():
    s = input()
    return(list(s[:len(s)]))


s = insr()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = [x for x in list(str(input()))]
new_s = set(s)

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

Submission status: Accepted

Solution code:
s = input()
d = {}
flag = True
for s_ in s:
    if s_ in d:
        flag = False
    else:
        d[s_] = 1
if flag:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC063-B
s = input()

s_s = set(s)

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

Submission status: Accepted

Solution code:
S = input()
found = True
for s in S:
    if S.count(s) > 1:
        found = False
        print("no")
        break
if found:
    print("yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

t = set(s)

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def solve(s):
    return len(s) == len(set(list(s)))

def main():
    s = input()
    if solve(s):
        print('yes')
    else:
        print('no')

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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=[_ for _ in input()]

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

Submission status: Accepted

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

Submission status: Accepted

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

neko = 0
nya = 0
nuko = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import numpy as np

S = list(map(str, input().rstrip()))

memo = defaultdict(int)

for s in S:
    memo[s] += 1

ans = np.array(list(memo.values()))

print("yes") if np.where(ans>1)[0].shape[0]==0 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 = 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:
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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

s = input()

used_dict = {}

for l in s:
    if l in used_dict:
        print('no')
        sys.exit()
    else:
        used_dict[l] = True

print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
s = list(input())

d = defaultdict(int)
for i in s:
    d[i] += 1

for i in d:
    if d[i] > 1:
        print("no")
        exit()

print("yes")

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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:
ss=input()
sset=set(ss)
ans="no"
if len(ss)==len(sset):
    ans='yes'

print(ans)

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

Submission status: Accepted

Solution code:
alpha = 'qwertyuiopasdfghjklzxcvbnm'
s = input()
ans = 'yes'

for i in s:
  if i in alpha:
    alpha = alpha.replace(i , '')
  else:
    ans = 'no'
    break

print(ans)

Submission status: Accepted

Solution code:
#print#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
from fractions import gcd
def resolve():
    S=input()
    st=set()
    for s in S:
        if s in st:print("no");return
        st.add(s)
    print("yes")
    
        
#%%submit!    
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


resolve()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S  = str(input())

cnt =0
flg = True

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**6)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
# endregion
S = list(rs())
print('yes' if len(S) == len(set(S)) else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
alpha = lambda c:chr(c+96)
List = []
for i in range(len(S)):
  tmp = S[i]
  List.append(tmp)
for k in range(1,27):
  if(List.count(alpha(k)) <= 1):
    pass
  else:
    print("no")
    exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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(['no', 'yes'][len(s) == len(set(s))])

Submission status: Accepted

Solution code:
lst=list(str(input()))
a=set()
for i in range(len(lst)):
  a.add(lst[i])
if len(lst)==len(a):
  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:
stng = input()
lets = {1}
ans = "yes"
for i in stng:
  if i in lets:
    ans = "no"
  else:
    lets.add(i)
print(ans)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
S = input()
if len(S) == len(set(S)):
	print("yes")
else:
	print("no")

Submission status: Accepted

Solution code:
S = input()
arr=[]
for i in S:
  arr.append(i)
if len(arr)-len(set(arr))==0:
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
def main():
    s = input()
    dic = {}
    for v in s:
        dic.setdefault(v, 0)
        dic[v] += 1
        if dic[v] == 2:
            print('no')
            exit()
    print('yes')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,sqrt
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
#s=input().rstrip()

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

Submission status: Accepted

Solution code:
s = list(input())

se = set()
for moji in s:
    se.add(moji)

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

Submission status: Accepted

Solution code:
S=list(input())

sset=set()
for s in S:
  sset.add(s)
  
if len(sset)==len(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 collections

s = input()

c = collections.Counter(s)
l = list(c.values())

cnt = 0
for i in range(len(l)):
    if l[i] == 1:
        cnt += 1
if cnt == len(l):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
s=input()
lis=[]
keep=0
for i in range(0,len(s)):
  if not s[i] in lis:
    lis.append(s[i])
  else:
    print("no")
    keep=1
    break
if keep==0:
  print("yes")

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = input()
g = set()
for x in S:
    g.add(x)
print('yes' if len(S) == len(g) else 'no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

buf1 = set()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))

def main():
    s = IS()
    if len(s) == len(set(s)): print('yes')
    else: print('no')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020/04/30
# AtCoder Beginner Contest 063 - B

# Input
s = input()

# Init
d = dict()

# Calc
for i in range(len(s)):
    if d.get(s[i]) == None:
        d[s[i]] = 1
    else:
        d[s[i]] = d[s[i]] + 1

ans = 'yes'
for key in d:
    if d[key] > 1:
        ans = 'no'
        break

# Output
print(ans)

Submission status: Accepted

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

def resolve():
    s=input()
    ans='yes'
    flag=False
    for i in range(len(s)-1):
        for j in range(i+1,len(s)):
            if s[i]==s[j]:
                ans='no'
                flag=True
                break
        if flag:
            break
    print(ans)
resolve()

Submission status: Accepted

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

def resolve():
    s=input()
    l=[]
    ans='yes'
    for i in s:
        l.append(i)
    l.sort()
    for i in range(len(l)-1):
        if l[i]==l[i+1]:
            ans='no'
            break
    print(ans)
resolve()

Submission status: Accepted

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

def resolve():
    def main():
        s=input()
        for i in range(len(s)):
            for j in range(i+1,len(s)):
                if s[i]==s[j]:
                    return 'no'
        return 'yes'
    print(main())
resolve()

Submission status: Accepted

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

def resolve():
    s=input()
    ans='yes'
    for i in range(len(s)):
        for j in range(i+1,len(s)):
            if s[i]==s[j]:
                ans='no'
                break
        else:
            continue
        break
    print(ans)
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Answer = set(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import numpy as np
import sys

input = sys.stdin.readline

S = input()

S = sorted(S[:-1])

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()
s = len(S)
sn = len(set(S))

if s == sn:
  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 collections
s = input()
c = collections.Counter(s)
p = c.most_common()
if len(s) == len(p):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
def resolve():
	s = input()
	d = {}
	ans = 'yes'
	for i in s:
		if d.get(i):
			ans = 'no'
			break
		d[i] = True
	print(ans)
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
w = str(input())
W = sorted(w)

for i in range(len(W)-1):
  if W[i] != W[i+1]:
    f = True
  else:
    f = False
    break
print('yes' if f 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:
S = list(input())
lenS = len(S)

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

Submission status: Accepted

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



if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
count = set()
for i in s:
    count.add(i)
print('yes' if len(count)==len(s) else 'no')

Submission status: Accepted

Solution code:
from collections import Counter
s = list(input())
ans = Counter(s)
flag = True
for i in ans.values():
    if i>1:
        flag = False
print('yes' if flag else 'no')

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
text=input()
te=list(text)
l={}
s=0
for i in text:
    s=0
    for j in te:
        if (i==j):
            s+=1
    l[i]=s
c=0
for i in text:
    if (l[i]>1):
        c+=1
        break
if (c==0):
    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:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
from sys import *

s = stdin.readline()
fre = [0] * 200
for ch in s:
	fre[ord(ch)] += 1
	if fre[ord(ch)] > 1:
		print("no")
		exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    s = input()
    if len(s) == len(set(s)):
        print("yes")
    else:
        print("no")
        
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 = input()
flg = 0
for i in range(len(s)):
  if s.count(s[i]) >= 2:
    flg = 1
if flg == 0:
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
import collections

s = list(input())
c = collections.Counter(s)

if c.most_common()[0][1] == 1:
    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()

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

print("yes")

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

L = []
for i in range(len(S)):
    L.append(S[i])

B = False
for i, v in enumerate(L):
    L.pop(i)
    if (v in L):
        B = True
        break
    else:
        L.insert(i, v)

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

Submission status: Accepted

Solution code:
s = list(input())
s.sort()
b = ""
ans = "yes"
for x in s:
    if b == x:
        ans = "no"
        break
    b = x
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
res = 0
for i in range(len(S)):
    for n in range(i+1,len(S)):
        if S[i]==S[n]:
            res=1
if res ==0:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    S = input()
    L = len(S)
    s = set(S)
    if L == len(s):
        ans = 'yes'
    else:
        ans = 'no'
    print(ans)

if __name__ == '__main__':
    main()