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:
# coding: utf-8
# Your code here!
import collections

S = input()
S_dic = collections.Counter(S)
S_srt = sorted(S_dic.items(), key=lambda x : -x[1])

if S_srt[0][1] == 1:
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
s = list(str(input()))
ans = list(set(s))
ans.sort()
s.sort()
if ans == s :
	print('yes')
else :
	print('no')

Submission status: Accepted

Solution code:
S = list(input())

for i in S:
    if S.count(i) != 1:
        print ('no')
        exit()
print ('yes')

Submission status: Accepted

Solution code:
import bisect
import os
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys
import string

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")


S = sys.stdin.readline().rstrip()
if len(S) == len(set(list(S))):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lis = list(input())
set_lis = set(lis)

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

Submission status: Accepted

Solution code:
S = input()
K =[]
for i in range(len(S)):
  if S[i] in K:
    print("no")
    break
  else:
    K.append(S[i])
  if i == len(S)-1:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())

ans=sorted(s)

#print(ans)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter
s = input()
m = Counter(s)
if len(m) == len(s):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())

s=sorted(s)

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

print("yes")

Submission status: Accepted

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

s = input()
for i in range(len(s)):
    if s[i] in s[:i]:
        print('no')
        sys.exit()
print('yes')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

s = input()

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

Submission status: Accepted

Solution code:
S=input()
s=set()
for i in S:
    if i in s:
        print("no")
        quit()
    s.add(i)
print("yes")

Submission status: Accepted

Solution code:
S = input()
countlist = []
for i in range(0, 26):
	countlist.append(0)
for i in range(0, len(S)):
	countlist[ord(S[i])-97] += 1
flag = True
for i in range(0, 26):
	if countlist[i] > 1:
		flag = False
		break
if flag: 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(i + 1, len(s)):
        if s[i] == s[j]:
            ans = "no"
print(ans)

Submission status: Accepted

Solution code:
s = list(input())
size = len(s)
count = 0 
ans = {}
for i in s:
    
    if i in ans.keys() :
        count += 1
    else : 
        ans[i] = 1
        pass
if count == 0 : 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()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
input_char = input()

length = len(input_char)

for i in range(length-1):
    remain_index = length*(-1)+i+1
    if input_char[i] in input_char[remain_index:]:
        print('no')
        break;

    if i+2==length:
        print('yes')

Submission status: Accepted

Solution code:
import collections
s = input()
alph = "abcdefghijklmnopqrstuvwxyz"
col = dict(collections.Counter(s))

flag = True
for i in range(26):
    if col.get(alph[i], 0) > 1:
        print("no")
        flag = False
        break
if flag:
    print("yes")

Submission status: Accepted

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

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:
# https://atcoder.jp/contests/abc063/tasks/abc063_b

import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import collections

s = input()
cou = collections.Counter(s)
most = cou.most_common(1)
#print('yes' if most[0][1] == 1 else 'no')
print('yneos'[most[0][1]!=1::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections


def main():
    S = input()
    c = collections.Counter(S)
    ans = "no"
    if set(c.values()) == set([1]):
        ans = "yes"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

def check(S):
  ans = "yes"
  for s in S:
    if S.count(s) >=2:
      ans = "no"
      break
  return ans

print(check(S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

s2 = list(set(s))

ans = "no"
if len(s) == len(s2):
  ans = "yes"

print(ans)

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:
a = input()
b = len(a)
c = len(set(a))

if b == c:
  print('yes')
else:
  print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
x = len(s)
tmp = set([])
for i in s:
    tmp.add(i)

if x == len(tmp):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
alp = "abcdefghijklmnopqrstuvwxyz"
S = input()
ans = [0]*26
for c in S:
    ans[alp.index(c)]+=1
if max(ans) == 1:
    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:
import collections

s = input()
s_list = []

for i in s:
    s_list.append(i)

c = collections.Counter(s_list)
most = c.most_common(1)
if most[0][1] == 1:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

import collections as col
cc = col.Counter(S)

flag = True
for k,v in cc.items():
  if (v == 2):
    flag = False
print ( "yes" if flag else "no" )

Submission status: Accepted

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

Submission status: Accepted

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

def solve():
    S = input()

    for i in range(len(S)):
        target = S[i]
        for j in range(i+1, len(S)):
            if target != S[j]:
                continue
            print("no")
            return
    print("yes")


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
flag = True
for i in range(len(s)):
    for j in reversed(range(len(s)-i-1)):
        if s[i] == s[j+i+1]:
            flag = False
if flag:
    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()
S_len = len(S)
S_set_len = len(set(S))
print('yes' if S_len == S_set_len else 'no')

Submission status: Accepted

Solution code:
s = input()
print('yes' if len(s) == len("".join(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=list(input())
a={}
ans='yes'
for i in s:
    a[i]=a.get(i,0)+1
    if a[i]>1:
        ans='no'
        break
print(ans)

Submission status: Accepted

Solution code:
s=list(input())
a=[0]*26
ans='yes'
for i in s:
    a[ord(i)-97]+=1
    if a[ord(i)-97]>1:
        ans='no'
        break
print(ans)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

k=list(s)
m=list(set(s))

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

Submission status: Accepted

Solution code:
from collections import Counter
s=list(str(input()))
c=Counter(s)
print("yneos"[len(c)!=len(s)::2])

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 = input()
c = set()
for s in S:
    if s in c:
        print("no")
        break
    c.add(s)
else:
    print("yes")

Submission status: Accepted

Solution code:
from collections import Counter

S = list(input())

c = Counter(S)

for i in c.most_common():
    if i[1] > 1:
        print("no")
        exit()

print("yes")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = str(input())
se = {S[i] for i in range(len(S))}
if len(se) == 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()
f=True
for a in s:
    if s.count(a)>1:
        f=False
        break
print('yes' if f else 'no')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()
di = {}
flag = True
for i in S:
  if(i in di):
    flag = False
    break
  else:
    di[i] = 1
if(flag):
  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:
#63
s = list(input())
s1 = list(set(s))
if len(s1) == len(s):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
#ABC063B
S = input()
all_dif = True
for i in range(len(S)):
    if i == len(S)-1:
        break
    for j in range(1,len(S)-i):
        if S[i] == S[i+j]:
            all_dif = False
if all_dif:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

mem = set()

ans = 'yes'

for i in s:
    if i in mem:
        ans = 'no'
        break
    else:
        mem.add(i)

print(ans)

Submission status: Accepted

Solution code:

def solve(s):
  for c in s:
    if s.count(c) > 1:
      return False
  return True


if __name__ == "__main__":
  s = str(input())
  if solve(s):
    print('yes')
  else:
    print('no')

Submission status: Accepted

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

for s in S:
    d.add(s)

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

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math

mod = 10**9+7



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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())
x=set(s)

if len(x)==len(s):
    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:
import sys
from collections import Counter

s_cnt = Counter(input())

for i in s_cnt.values():
    if i != 1:
        print('no')
        sys.exit()

print('yes')

Submission status: Accepted

Solution code:

def read_input():
    s = input()
    return s

def submit():
    s = read_input()
    char_occurs = {}

    for c in s:
        if c in char_occurs.keys():
            print('no')
            return
        else:
            char_occurs[c] = 1

    print('yes')

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
S = input()
l = [ i for i in S ]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

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

solve()

Submission status: Accepted

Solution code:
S = input()
check = [0] * 26

for i in S:
    j = ord(i) - ord('a')
    check[j] += 1

ans = 'yes'
for i in check:
    if i > 1:
        ans = 'no'
    
print(ans)

Submission status: Accepted

Solution code:
S = input()
check = []
flg = 0
for i in S:
    if i not in check:
        check.append(i)
    else:
        flg = 1
        break

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- ccoding utf-8 -*-
s=list(input())
x=set(s)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    S = list(_ for _ in input())
    ans = 'yes'
    for s in S:
        if ''.join(S).count(s)>1:
            ans = 'no'
            break
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
l=len(s)
arr=[0]*26
alpha=list('abcdefghijklmnopqrstuvwxyz')
for i in range(l):
  for j in range(26):
    if s[i]==alpha[j]:
      arr[j]+=1
for i in range(26):
  if arr[i]>1:
    print('no')
    break
  if i==25:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
count = [0] * 26

for c in s:
    count[ord(c)-97] += 1
for num in count:
    if num > 1:
        print("no")
        exit()
print("yes")

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
b=[0]*26
for c in a:
    b[ord(c)-97] += 1
for i in b:
    if i >= 2:
        print("no")
        exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

ans = "yes"
for i in range(len(S)):
	if S.count(S[i:i+1]) > 1:
		ans = "no"
		break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
T = []
for i in S:
    if (i in T):
        print("no")
        exit()
    T.append(i)
print("yes")

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 = str(raw_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(list(S)))::2])

Submission status: Accepted

Solution code:
S = input()

length = len(S)
set_length = len(set(S))

if length == set_length:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    S = input().strip()

    n = len(S)
    m = len(set(S))

    if n == m:
        return 'yes'
    else:
        return 'no'


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

Submission status: Accepted

Solution code:
S = list(input())

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

Submission status: Accepted

Solution code:
s = 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(list(S))):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

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

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:
# -*- coding: utf-8 -*-

s = list(input())

s.sort()

answer = True

for i in range(1,len(s)):
    if s[i] == s[i-1]:
        answer = False

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
"""
a,b = LI()
if a+b >= 10:
    print("error")
else:
    print(a+b)
"""
#B
s = S()
d = defaultdict(int)
for i in s:
    if d[i]:
        print("no")
        quit()
    d[i] = 1
print("yes")
#C
"""
n = I()
s = IR(n)
su = sum(s)
dp = [[0 for i in range(su+1)] for j in range(n)]
dp[0][s[0]] = 1
for i in range(n):
    dp[i][0] = 1
for i in range(1,n):
    for j in range(su+1)[::-1]:
        if s[i]+j <= su:
            dp[i][s[i]+j] = max(dp[i][s[i]+j],dp[i-1][j])
        dp[i][j] = max(dp[i][j],dp[i-1][j])
for i in range(su+1)[::-1]:
    if dp[n-1][i] == 1 and i%10 != 0:
        break
print(i)
"""

#D
"""
n,a,b = LI()
h = IR(n)
l = 0
r = math.ceil(max(h)/b)
while r-l > 1:
    m = (l+r)//2
    k = 0
    for i in range(n):
        k += max(0,math.ceil((h[i]-b*m)/(a-b)))
        if k > m:break
    if k > m:
        l = m
    else:
        r = m
print(r)
"""
#E

#F

#G

#H

#I

#J

#K

#L

#M

#N

#O

#P

#Q

#R

#S

#T

Submission status: Accepted

Solution code:
import collections

s=input()

S=collections.Counter(s)
ans='yes'
for v in S.values():
    if v!=1:
        ans='no'
        break
print(ans)

Submission status: Accepted

Solution code:
def varied(S: str)->bool:
    d = {}
    for c in S:
        if c in d:
            return False
        d[c] = True
    return True


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

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

l = ''
for i in S:
    if i not in l:
        l += i

print('yes' if S == l else 'no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,a=input(),[]
x,ans=len(s),"yes"
for i in range(x):a.append(s[i])
a.sort()
for i in range(x-1):
  if a[i]==a[i+1]:ans="no"
print(ans)

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()
SS = list(set(S))

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

Submission status: Accepted

Solution code:
import sys
S = input()
for i in range(len(S)):
  if S[i] in S[0:i] or S[i] in S[i+1:len(S)+1]:
    print("no")
    sys.exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input()
s = {c for c in i}
if len(i) == len(s):
  print("yes")
else:
  print("no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

count = []
for i in S:
    if i in count:
        print('no')
        exit()
    count.append(i)

print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

b = []
for x in s:
    if x in b:
        print("no")
        exit()
    b.append(x)

print("yes")