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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

S = input().strip()
for i in range(len(S)):
    for j in range(i+1, len(S)):
        if S[i] == S[j]:
            print('no')
            sys.exit(0)
print('yes')

Submission status: Accepted

Solution code:
s=list(input())
kind=[0]*26
ans="yes"
for i in range(len(s)):
    num=ord(s[i])-97
    if kind[num]==1:
        ans="no"
        break
    kind[num]=1
print(ans)

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
Sli = list(S)

ans=0

for i in Sli:
    if S.count(i) != 1:
        ans = ans+1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

ls_s = sorted(s)

for i in range(len(s) - 1):
    if ls_s[i] == ls_s[i+1]:
        print("no")
        break
    elif i == len(s) - 2:
        print("yes")

Submission status: Accepted

Solution code:
from collections import Counter
S = str(input())

counted_S = Counter(S)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections

a=[str(i) for i in input()]
c=collections.Counter(a)
if c.most_common()[0][1]>=2:
    print("no")
else:
    print("yes")

Submission status: Accepted

Solution code:
S = input()
n = int(len(S))
found = False

for i in range(n-1):
    count = 0
    for j in range(i+1, n):
        if S[j]==S[i]:
            count += 1



#    print(count)
    if count > 0:
        found = True



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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
s = input()

l = list(s)

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

Submission status: Accepted

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

for x in l:
    if l.count(x) > 1:
        print('no')
        sys.exit(0)

print('yes')

Submission status: Accepted

Solution code:
def judge(S):
    a = list(S)
    for i in range(len(a)):
        for j in range(len(a)):
            if a[i]==a[j] and i != j:
                print("no")
                return
    print("yes")
    return

S = input()
judge(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
C = Counter(input())
print('yes') if max(C.values()) == 1 else print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
n = []
for i in range(len(S)):
  for p in range(i+1,len(S)):
    if S[i] == S[p]:
      n.append(0)
  if i == len(S)-1:
    n.append(1)
for i in range(len(n)):
  if n[i] == 0:
    print('no')
    break
  if i == len(n)-1:
    print('yes')

Submission status: Accepted

Solution code:
##### 解けてない #####

import numpy as np

S=np.asarray(list(input()))

# もし全てユニークならば
if len(np.unique(S))==len(S):
    print("yes")
else: # ユニークでないならば
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
s = stdin.readline().rstrip()

li = []

for i in s:
    li.append(i)

li = list(set(li))

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

Submission status: Accepted

Solution code:
#Varied
S = input()
judge = 1
for i in range(len(S)):
    for j in range(len(S)):
        if i != j:
            if S[i] == S[j]:
                judge = 0
if judge == 0:
    print("no")
else:
    print("yes")

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    C = Counter(S)
    if C.most_common()[0][1]==1:
        print("yes")
    else:
        print("no")
if __name__ == '__main__':
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    s = input()

    main(s)

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

Submission status: Accepted

Solution code:
S = list(str(input()))
Z = set(S)
if len(S) == len(Z):
    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()
ss = sorted(s,key=lambda x:x[0])
sss = sorted(set(s),key=lambda x:x[0])
if "".join(ss) == "".join(sss):
	print ("yes")
else:
	print ("no")

Submission status: Accepted

Solution code:
l = [False]*26
ok = True

for i in input():
    if l[ord(i)-97]:
        ok = False
    
    l[ord(i)-97] = True

print('yes' if ok else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
dic = {}
ans = True
for i in S:
    if((i in dic) == False):
        dic[i] = 1
    else:
        ans = False
        break
if(ans):
    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()
ss=len(s)
l=len(set(s))
if ss==l:
  print('yes')
else:
  print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
l=len(a)
s=set(a)
d=len(s)
if l==d:
  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 = 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:
from collections import Counter
l = list(input())
c = Counter(l)
if max(c.values()) >= 2:
    print('no')
else:
    print('yes')

Submission status: Accepted

Solution code:
s=input()
l=[]
flag = "yes"
for c in s:
    if not c in l:
        l.append(c)
    else:
        flag = "no"
        break
print(flag)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(str(input()))
l = []
 
for i in range(len(S)):
  if not S[i] in l:
    l.append(S[i])
  else:
    print('no')
    break
  if i == len(S) - 1:
    print('yes')

Submission status: Accepted

Solution code:

def examB():
    St = S()
    d = ""
    ans = "yes"
    for s in St:
        if s in d:
            ans = "no"
        d += s
    print(ans)

import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examB()

Submission status: Accepted

Solution code:
s=list(input())
t=[]
ans='yes'
for i in range(len(s)):
    if i==0:
        t.append(s[i])
    else:
        for j in range(len(t)):
            if s[i]==t[j]:
                ans='no'
            if j==len(t)-1:
                t.append(s[i])
print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
S = list(input())[: -1]
d = [0] * 26
a = ord("a")
for i in range(len(S)):
  d[ord(S[i]) - a] += 1
  if d[ord(S[i]) - a] > 1:
    print("no")
    exit(0)
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()
for i in range(len(s)):
    for j in range(i+1,len(s)):
        if s[i]==s[j]:
            print("no")
            exit()
print("yes")

Submission status: Accepted

Solution code:
s=list(input());print("yes"if len(set(s))==len(s)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:
# ABC 063: B – Varied
s = input()
is_different = 'yes'

for c in s:
    if s.count(c) > 1:
        is_different = 'no'

print(is_different)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
mod = 10**9+7

s=input()
n=len(s)
ss={si for si in s}
if len(ss)==n:
    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:
mylist = list(input())
if len(set(mylist)) == len(mylist):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

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
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    S = inputs[0]
    counter = collections.Counter(list(S))
    max_n = counter.most_common(1)[0][1]
    if max_n >= 2:
        return 'no'
    return 'yes'


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    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:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
#n,k = map(int,input().split())
#x = list(map(int,input().split()))




#62
s = list(input())
jg = {}

for i in range(len(s)):
    if s[i] in jg:
        print("no")
        break
    else:
        jg[s[i]] = 1
    
    if i == len(s)-1:
        print("yes")

Submission status: Accepted

Solution code:
S = input()

for s in S:
    if S.count(s) >= 2:
        print('no')
        break
else:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
s=list(input())
dic = defaultdict(int)
for i in range(len(s)):
    dic[s[i]]+=1
    if dic[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:
import collections
table=collections.defaultdict(int)
s=input()
for x in s:
  table[x]+=1
  if table[x]>=2:
    print("no")
    exit(0)
print("yes")

Submission status: Accepted

Solution code:
s=set()
f=True
for c in input():
    if c in s:
        f=False
        break
    s.add(c)
print('yes' if f else 'no')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
ans = ''
for w in S:
    if S.find(w) != S.rfind(w):
        ans = 'no'
        break;
if ans == '':
    ans = 'yes'
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

S.sort()
flag = 0

i = 0
while i < len(S) -1:
    if S[i] == S[i +1]:
        flag = 1
    i += 1

if flag != 0:
    print("no")
else:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
s=input()
d="abcdefghijklmnopqrstuvwxyz"
for i in range(len(s)):
    if s[i] in d :d=d.replace(s[i],"")
    else:
        print("no")
        sys.exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
list_s = list(input())
count = collections.Counter(list_s)
if count.most_common()[0][1] <= 1:
  print("yes")
else:
  print("no")

Submission status: Accepted

Solution code:
# ABC063 B Varied
S = input()
D = set()

for s in S:
    D.add(s)

if len(D) == len(S):
    ans = 'yes'
else:
    ans = 'no'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()
b = True
for c in S:
  if S.count(c) > 1:
    b = False
    break

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

Submission status: Accepted

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

Submission status: Accepted

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

a=0

for s in range(len(S)-1):
  if S[s]==S[s+1]:
    a+=1
    break
  else:
    pass

if a!=0:
  print('no')
else:
  print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
d=Counter(input())
for k in d:
    if d[k]>1:
        print('no')
        exit()
print('yes')

Submission status: Accepted

Solution code:
s=input()

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    import collections
    input = sys.stdin.readline
    s = collections.Counter(list(str(input().rstrip('\n'))))
    for k, v in s.items():
        if v != 1:
            print("no")
            exit()
    print("yes")


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

ans = "yes"
used = []

for item in S:
  if item not in used:
    used.append(item)
  else:
    ans = "no"
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#2019/09/25
S = input()
print("yes" if len(S) == len(set(S)) else "no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputstr = input()
check = True
for i in range(len(inputstr)):
  if i == len(inputstr) - 1:
    break
  else:
    for j in range(i + 1, len(inputstr)):
      if inputstr[i] == inputstr[j]:
        check = False
        break
  if not check:
    break
if check:
  ans = "yes"
else:
  ans = "no"
print(ans)

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

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')


S=input()

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

Submission status: Accepted

Solution code:
# ARC 063 B

def resolve():
  s = input()
  d = {}
  for c in s:
    if c in d:
      print('no')
      return
    d[c] = True

  print('yes')
  return

if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
# B - Varied
S = str(input())

if len(set(S)) == len(S):
    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()
d = {}
for s in S:
  if s in d:
    print("no")
    exit()
  else:
    d[s] = 1
print("yes")

Submission status: Accepted

Solution code:
a = input()
if len(a)==len(set(a)):
    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().rstrip()
counter = collections.Counter()
for c in s:
    counter[c] += 1
if max(counter.values()) > 1:
    print('no')
else:
    print('yes')

Submission status: Accepted

Solution code:
S = input()
d = {}
for i in S:
    if i not in d:
        d[i] = 1
    else:
        d[i] += 1
print("yes" if max(d.values()) == 1 else "no")

Submission status: Accepted

Solution code:
S=list(input())
N=len(S)
S=list(set(S))

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

Submission status: Accepted

Solution code:
#coding:utf-8

s = list(input())
s_len = len(s)
check = list(set(s))
c_len = len(check)

if s_len == c_len:
  print('yes')
else:
  print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = cp = input()
cp = ''.join(set(cp))
if len(S) == len(cp):
    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 __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter
S = input()
counter = Counter(S)
for v in counter.values():
    if v != 1:
        print("no")
        exit()
print("yes")

Submission status: Accepted

Solution code:
S = input()
from collections import defaultdict
D = defaultdict(int)
flag = 0
for i in S:
    D[i] += 1
    if D[i] >= 2:
        flag = 1
if flag == 1:
    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:
n=list(input())
a=list('abcdefghijklmnopqrstuvwxyz')

b=[0]*26

for i in range(len(n)):
    for j in range(26):
        if n[i]==a[j]:
            b[j]+=1
f=0
for i in range(26):
    if b[i]>1:
        f=1
if f==0:
    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:
s = list(input())
print("yes") if len(s) == len(list(set(s))) else print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os

S = input()

for i in range(0,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(list(S))):
    print('no')
else:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    s = input().strip()

    dic = {}
    ok = True
    for c in s:
        if c in dic:
            ok = False
            break
        else:
            dic[c] = 1
    
    if ok:
        print("yes")
    else:
        print("no")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
s = input()

st = set(s)

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

Submission status: Accepted

Solution code:
import sys
import copy
import  math
from _bisect import *
from collections import *
from operator import itemgetter
from math import factorial
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

s = input()
c = Counter(s)
print('yes' if max(c.values()) < 2 else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1 = list(input())
s2 = set(s1)
if len(s1) == len(s2):
  print("yes")
elif len(s1) != len(s2):
  print("no")

Submission status: Accepted

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