Problem:


Score : 200 points

Problem Statement

You are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.

Constraints

2 ≤ |S| ≤ 26, where |S| denotes the length of S.

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If all the characters in S are different, print yes (case-sensitive); otherwise, print no.

Sample Input 1

uncopyrightable

Sample Output 1

yes

Sample Input 2

different

Sample Output 2

no

Sample Input 3

no

Sample Output 3

yes



Sample input:
uncopyrightable


Sample output:
yes

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
print("yes" if len(set(a))==len(a) 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):
    print(YES if len(S) == len(set(S)) else NO)


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:
import sys
d={}
ss=input().strip()
for s in ss:
  if s in d:
    print("no")
    sys.exit()
  else:
    d[s]=1
print("yes")

Submission status: Accepted

Solution code:
a=input()
b=[str(c) for c in a]
b.sort()
c=len(b)
d=0
for i in range(c-1):
	if b[i]==b[i+1]:
		d=d+1
if d>0:
	print('no')
else:
	print('yes')

Submission status: Accepted

Solution code:
s=list(input())

for i in range(len(s)):
            for j in range(i+1,len(s)):
                        if s[i]!=s[j]:
                                    pass
                        else:
                                    #print('s[i]',s[i],'s[j]',s[j])
                                    print('no')
                                    exit()
print('yes')

Submission status: Accepted

Solution code:
#n = int(input())
s = list(input())
#a_L = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
S = input()

A =[]

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

A.sort()

a = "yes"

for i in range(1,len(A)):
  if A[i] == A[i-1]:
    a = "no"
    break
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = list(str(input()))

"""
tmp = [s[0]]
flag = True
for i in s:
    if i in tmp:
        flag = False
    else:
        tmp.append(i)

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

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=sorted(input())
f=0
for i in range(len(s)-1):
  if s[i]==s[i+1]:
    f=1
if f==0:
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
#b

s=input()

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

Submission status: Accepted

Solution code:
S=input()
a=[b for b in S]
list=[]
number=len(a)
for c in a:
    if c in list:
        print('no')
        break
    else:
        list.append(c)
if len(list)==len(a):
    print('yes')

Submission status: Accepted

Solution code:
s=list(input())

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

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    from collections import defaultdict
    dd = defaultdict(int)
    
    S=input()
    N=len(S)
    f=1
    for i in range(N):
        dd[S[i]]+=1
        if dd[S[i]]==2:
            f=0
            
    if f==1:
        print("yes")
    else:
        print("no")

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

l=[]
for i in range(len(s)):
  l.append(s[i])
           
x = set(l)
           
if len(x) == len(s):
  print("yes")
else:
  print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if len(s)!=len(set(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:
# coding: utf-8

s = input().rstrip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC063

s = list(input())

t = set(s)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
S = input()
S_dic = {}
flag = True
for i in range(len(S)):
    if S[i] in S_dic:
        flag = False
        break
    else:
        S_dic[S[i]] = 1
print("yes") if flag else print("no")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

IN=lambda : map(int, input().split())
mod=1000000007

#+++++

def main():
	s = input()
	ii = (len(s) == len(list(set(list(s)))))
	return 'yes' if ii else 'no'
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

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(list(S))) else print('no')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

s = set(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
for i, s in enumerate(S) :
    if S.count(s) != 1 :
        print("no")
        exit()
    if i == len(S) - 1 :
        print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

for i in s:
    if i in lst1:
        print("no")
        exit()
    else:
        lst1.append(i)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

ans = set(s)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
S = sorted(S, key=lambda x: x)
for i in range(1, len(S)):
  if S[i-1] == S[i]:
    print("no")
    exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
n = len(s)
x = dict()
for i in range(n):
    x[s[i]] = 1
count = 0
for idx in x:
    count += 1
if count == n:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S1 = list(input())
S2 = set(S1)

if len(S1) != len(S2):
    print('no')
else:
    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:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def differentcount(s):

    for i in range(len(s)):
        if s.count(s[i]) != 1:
            return "no"

    return "yes"

def main():
    s = str(input())
    print(differentcount(s))

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 = input()
ans = "yes"

for i in range(len(s)-1):
    for j in range((len(s)-1 -i)):
        if s[i] == s[i+(j+1)]:
            ans = "no"
            break

print(ans)

Submission status: Accepted

Solution code:
str = input()
list = []
for x in range(len(str)):
    list.append(str[x])
list.sort()
answer = "yes"
for id in range(len(str) - 1):
    if list[id] == list[id + 1]: answer = "no"
print(answer)

Submission status: Accepted

Solution code:
s=input()

flag=True

for ss in s:
    if s.count(ss) != 1:
        flag = False
        break

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

Submission status: Accepted

Solution code:
s = input()
d = {}
for c in s:
  if c not in d:
    d[c] = 1
  else:
    print('no')
    break
else:
  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 = list(input())
sort_s = sorted(s)
flag = 1
for i in range(len(s) - 1):
    if sort_s[i] == sort_s[i + 1]:
        print("no")
        flag = 0
        break
if flag == 1:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())


def is_ok(n):
    for idx in range(len(n)-1):
        for jdx in range(idx+1, len(n)):
            if n[idx] == n[jdx]:
                return True
    return False


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
len_s = len(s)
for i in range(len_s):
    for j in range(len_s-1):
        if i == j:
            continue
        if s[i] == s[j]:
            print("no")
            quit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
x={1}
for i in s:
  if i in x:
    print('no')
    exit()
  else:
    x.add(i)
print('yes')

Submission status: Accepted

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

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()
for i in range(len(s)):
    if s.count(s[i])>1:
        ans="no"
        break
    else:
        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:
#!/usr/bin/env python3
s = input()
visit = []
for i in range(len(s)):
    if s[i] in visit:
        print("no")
        exit()
    else:
        visit.append(s[i])
print("yes")

Submission status: Accepted

Solution code:
s = input()

flag = False
for i, s1 in enumerate(s):
    for j, s2 in enumerate(s):
        if not i == j:
            if s1 == s2:
                flag = True
if flag:
    print("no")
else:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
S=list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 30, Jan, 2020
"""

import sys

# import itertools
# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

S = readline().decode('utf8').rstrip()
se = set(S)

print('yes' if len(S) == len(se) else 'no')

Submission status: Accepted

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

for i in range(len(s)):
    s[i] = ord(s[i])

for i in range(len(s)):
    s[i] = s[i] - 97

arr = [0] * 26

for i in range(len(s)):
    arr[s[i]] += 1

flag = True
for i in range(len(arr)):
    if arr[i] >= 2:
        flag = False

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
n = len(S)
t = len(set(list(S)))
if n == t:
    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 = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S = [chr for chr in input()]
for i in range(len(S)):
    for j in range(len(S)):
        if i!=j and S[i] == S[j]:
            print('no')
            sys.exit(0)
print('yes')

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# 要復習
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=STR()
    ss=set(s)
    if len(s)==len(ss):
        print('yes')
    else:
        print('no')
if __name__ == '__main__':
    do()

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
from itertools import accumulate, permutations, combinations, product
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from fractions import gcd
#mod = 10 ** 9 + 7
#N = int(input())
#a = list(map(int,input().split()))
#a,b,c = map(int,input().split())
#ans = [0] * N

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

    if count > 1:
        flag = 1
        break

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

Submission status: Accepted

Solution code:
s_l = list(input())

print('yes') if len(s_l) == len(set(s_l)) else print('no')

Submission status: Accepted

Solution code:
s = input()

for i in range(len(s)-1):
  if s.count(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=list(input())
print("yes" if len(s)==len(set(s)) else "no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ans = "yes"

for i in s:
	if s.count(i) == 2:
		ans = "no"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
s = input()
c = collections.Counter(s)
for i in c.values():
    if 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:
sList = sorted(list(input()))
for i in range(len(sList)-1):
  if sList[i] == sList[i+1]:
    print("no")
    exit(0)

print("yes")

Submission status: Accepted

Solution code:
S = input()

ans = []
is_Yes = True
for s in S:
    if s in ans:
        is_Yes = False
        break
    ans.append(s)

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

Submission status: Accepted

Solution code:
s=input()

print("no" if len(s)-len(set(s)) else "yes")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
s=list(input().strip())
b={}
for a in s:
    b[a]=1
if len(b)==len(s):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:


import numpy as np
import fractions as fra

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

print("yes")

Submission status: Accepted

Solution code:
a=list(input())
b=len(a)

for i in range(b):
  for j in range(i+1,b):
    if a[i]!=a[j]:
      continue
    else:
      print("no")
      exit()
      
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
  elif i==len(s)-1:
    print('yes')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = list(input().rstrip())
from collections import Counter
c = Counter(S)
for i in c.values():
    if i != 1:
        print("no")
        sys.exit()
print("yes")

Submission status: Accepted

Solution code:
s = input()

c = []
for x in s:
   if (x not in c):
      c.append(x)

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

lis = list(s)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(str(input()))
s1 = list(set(s))

print('yes' if len(s)==len(s1) else 'no')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

duplicated = (len(s) != len(set(s)))

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

Submission status: Accepted

Solution code:
S = input()
len_S = len(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
T=[]

for i in range(len(S)):
    if S[i] in T:
        print("no")
        exit()
    else:
        T.append(S[i])
print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

S_set = set(S)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#H, W = map(int, input().split())
#N = int(input())
S = list(str(input()))

S.sort()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()

t = set(s)

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    ap=set()
    s=input()
    for c in s:
        if c in ap:
            print("no")
            exit()
        ap.add(c)
    print("yes")
main()

Submission status: Accepted

Solution code:
s = str(input())
S = []
for m in s:
    S.append(m)
set_S = set(S)
if len(s) == len(set_S):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
a=input()
b=set(a)
c=list(a)
print(["no","yes"][len(b)==len(c)])

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

s = sys.stdin.readline().rstrip()

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

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

Submission status: Accepted

Solution code:
s = list(input())

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

print('yes')

Submission status: Accepted

Solution code:
import math

n = input()
l = list()
s = set()
for i in n:
    l.append(i)
    s.add(i)
print("yes" if len(l) == len(s) else "no")