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:
# https://atcoder.jp/contests/abc063/tasks/abc063_b
s = input()
t = set(s)
if len(s) == len(t):
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S = list(input())
flag = [0]*26
for c in S:
    if(flag[ord(c)-ord('a')] == 0):
        flag[ord(c)-ord('a')] = 1
    else:
        print("no")
        exit()
print("yes")

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()
ans='yes'
for i in range(len(s)):
  if s.count(s[i])!=1:
    ans='no'
    break
print(ans)

Submission status: Accepted

Solution code:
l=[x for x in input()]
nl=list(set(l))
if len(l)==len(nl):
    print ('yes')
else:
    print ('no')

Submission status: Accepted

Solution code:
# =map(int,input().split())
s=input()
ans=''
for i in range(len(s)):
    if s[i] not in ans:
        ans+=s[i]
if len(ans)==len(s):
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
n = len(s)

l = set(s)
m = len(l)

if n == m:
  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:
def main():
    S = input()
    S_set = set(S)
    if len(S) == len(S_set):
        print('yes')
    else:
        print('no')


if __name__ == '__main__':
    main()

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:
s=input()
sset=set(s)

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

Submission status: Accepted

Solution code:
s = input()

new_s = set(s)

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

Submission status: Accepted

Solution code:
import collections

S = input()
c = collections.Counter(S)
keys = c.keys()
print("yes") if len(keys) == len(S) else print("no")

Submission status: Accepted

Solution code:
A=[0]*26
S=input().rstrip()
for i in range(len(S)):
  A[ord(S[i])-ord("a")]+=1
flg=True
for i in range(26):
  if A[i]>=2:
    flg=False
    break
if flg: print("yes")
else: print("no")

Submission status: Accepted

Solution code:
S = input()

if len(S) == len(set([s for s in S])):
  print('yes')
else:
  print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
n = len(s)
ans = False
for i in range(n):
  for j in range(i+1, n):
    if s[i] == s[j]:
      ans = True
print("no" if ans else "yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
count=0
for member in s:
    count=0
    for member2 in s:
        if member2==member:
            count+=1
    if count>=2:
        print("no")
        break
if count==1:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
cnt = 0
for i in range(len(S)):
    for j in range(len(S)):
        if i == j : pass
        elif S[i] == S[j]: cnt += 1
        else: pass
        if cnt != 0: break
    if cnt != 0 :break
if cnt == 0:
  print("yes")
else:
  print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import string
al = string.ascii_lowercase

S = input()
ans = "yes"
for a in al:
  if S.count(a) > 1:
    ans = "no"
print(ans)

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

Submission status: Accepted

Solution code:
icase=0
if icase==0:
    import sys
    s=list(input())
    s.sort()
    for i in range(len(s)-1):
        if s[i+1]==s[i]:
            print("no")
            sys.exit()
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S = input()

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

print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ans = 'yes'
for i in s:
  if s.count(i)>1:
    ans = 'no'
    break

print(ans)

Submission status: Accepted

Solution code:
S = sorted(input())
# print('S', S)
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()
c = set(s)
print('yes' if len(s) == len(c) else 'no')

Submission status: Accepted

Solution code:
S = input()
cnt = 0
for i in range(len(S)):
    for j in range(len(S)):
        if i == j : pass
        elif S[i] == S[j]: cnt += 1
        else: pass
        if cnt != 0: break
    if cnt != 0 :break
    
print("yes" if cnt == 0 else "no")

Submission status: Accepted

Solution code:
# from math import factorial,sqrt,ceil,gcd
# from itertools import permutations as permus
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)

# import numpy as np
# from scipy.sparse.csgraph import shortest_path, dijkstra, floyd_warshall, bellman_ford, johnson
# from scipy.sparse import csr_matrix

# strlist = "abcdefghijklmnopqrstuvwxyz"
S = input()

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

print(ans)
# print(*ans)   # unpackして出力。間にスペースが入る
# for row in board:
#     print(*row,sep="")    #unpackして間にスペース入れずに出力する
# print("{:.10f}".format(ans))
# print("{:0=10d}".format(ans))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

dic_S = {}
for n,s in enumerate(S):
    dic_S[s] = n

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

Submission status: Accepted

Solution code:

s = list(input())
l = 0

t = s.copy()
t = set(t)
t = list(t)
l = len(t)

if len(s) == l:
    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()
a = set(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
S = input()
d = defaultdict(int)
for i in range(len(S)):
  d[S[i]] += 1
for val in d.values():
  if val != 1:
    print("no")
    exit()
print("yes")

Submission status: Accepted

Solution code:
import sys
s = input()

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

Submission status: Accepted

Solution code:
import collections

S = list(input())
kind = list(collections.Counter(S).values())

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

Submission status: Accepted

Solution code:

def myAnswer(S:list)-> str:
   return "yes" if(len(S) == len(set(S))) else "no"

def modelAnswer():
   tmp=1
def main():
   S = list(input())
   print(myAnswer(S))


if __name__ == '__main__':
   main()

Submission status: Accepted

Solution code:
# ABC 063: B – Varied
s = input()
print('yes' if len(s) == len(set(s)) else 'no')

Submission status: Accepted

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

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

Submission status: Accepted

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

dicts = Counter(s)

flag = True
for k, v in dicts.items():
    if v != 1:
        flag = False
        break

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

Submission status: Accepted

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

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

Submission status: Accepted

Solution code:
S = input()

used = set([s for s in S])
if (len(S) - len(used) == 0):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
s = input()
cnt = {}
for x in s:
    if x not in cnt:cnt[x] = 1
    else:cnt[x] +=1
ok = True
for key in cnt:
    if cnt[key] > 1:
        ok = False
        break
if ok:print('yes')
else:print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
words = set()
ans = 'yes'
for c in s:
    if c in words:
        ans = 'no'
        break
    words.add(c)
print(ans)

Submission status: Accepted

Solution code:
#ABC063.B
S = input()
cnt = 0
for i in S:
    if S.count(i) != 1:
        cnt +=1
if cnt == 0:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(300000)

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')


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

Submission status: Accepted

Solution code:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
dicts = {i: False for i in range(ord('a'), ord('z') + 1)}

for i in s:
    if dicts[ord(i)]:
        print('no')
        exit()

    dicts[ord(i)] = True
print('yes')

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()
import collections
c = collections.Counter(s)

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

Submission status: Accepted

Solution code:
s = input()
ans = 'yes'
while len(s)>1:
    if s[0] in s[1:]:
        ans = 'no'
        break
    else:
        s = s[1:]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
used = set()
S = input()
for s in S:
    if s in used:
        ans = 'no'
        break
    used.add(s)
else:
    ans = 'yes'
print(ans)

Submission status: Accepted

Solution code:
S = input()

word = 'qwertyuiopasdfghjklzxcvbnm'

for i in range(len(word)):
    if S.count(word[i]) > 1:
        print('no')
        exit()
        
print('yes')

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=str(input())
ch=list()
for c in 'abcdefghijklmnopqrstuvwxyz':
    ch.append(c)

for c in s:
    if c not in ch:
        print('no')
        exit()
    else:
        del ch[ch.index(c)]

print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
r = 'yes'
for t in s:
	if s.count(t) > 1:
		r = 'no'
		break
print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
  r_ = n / m
  if (r_ - (n // m)) > 0:
    return (n//m) + 1
  else:
    return (n//m)"""

# Written by NoKnowledgeGG @YlePhan

#import math
#mod = 10**9+7



def main():
  s = input()
  dic = {}
  i = 0
  while i != len(s):
    if not s[i] in dic.keys():
      dic[s[i]] = 1
    else:
      print('no')
      exit()
    i +=1
  print('yes')
  
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import itertools#これは色々使える組み込み関数みたいなやつ
import fractions
import copy
import bisect
#import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
#w=input()
from operator import itemgetter
from sys import stdin
#input = sys.stdin.readline#こっちの方が入力が早いが使える時に使っていこう
from operator import mul
from functools import reduce
from collections import Counter


N=3
M=3
i=0
j=0
k=0
n=3
r=1
a=[0]*5
b=[]
s=input()
a=[i for i in s]
#print(a)
count = Counter(a)
#print(count)
for i in range(len(a)):
    k=a.count(a[i])
    if k >1:
        print('no')
        sys.exit()
print("yes")
#n=int(input())
#r=int(input())
#print(M)
#A=int(input())
#B=int(input())
#print(N)
"1行1つの整数を入力を取得し、整数と取得する"


#number_list=list(map(int, input().split(" ")))#数字の時
#print(number_list)
"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
#メモ
for i in number_list:#こっちの方がrage使うより早いらしい
    print(number_list[i-1])#

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''
#array=[input().split()for i in range(N)]
#print(type(array[0][0]))
#print(array)
"正方行列にstr型の値を入力"
'''

#brray=[list(map(int, input().split(" ")))for i in range(N)]
#print(type(brray[0][0]))
#print(brray)
'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"
#以下に別解を記載
#N, M = [int(i) for i in input().split()]
'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''




#s=input()
#a=[int(i) for i in s]
#print(a[0])
#print([a])
#単数値．桁ごとに分割したい．入力と出力は以下の通り
#イメージとして1桁ごとにリストに値を入れているかんじ

'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()#str style 何個でもいけることが多い
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''


#a= stdin.readline().rstrip()
#print(a.upper())
"aという変数に入っているものを大文字にして出力"


#a,b=map(int, input().split())  #int style 複数数値入力　「A B」みたいなスペース空いた入力のとき

#なんかうまく入力されるけど
#a=[[int(i) for i in 1.strip()]for 1 in sys.stdin]
#a = [[int(c) for c in l.strip()] for l in sys.stdin]]
#print(a)
#複数行の数値を入力して正方行列を作成


##############################################################################################
##############################################################################################
#under this line explains example calculation


#nCr combination
'''
def cmb(n,r):
    #When n < r , this function isn't valid
    r= min(n-r,r)
    #print(n,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    #flochart mul(n,n-1)=x
    #next     mul(x,n-2)........(n-r+1,n-r)
    #mul read a,b and returns a*b

    under = reduce(mul, range(1, r+1))
    #print(over, under)
    #reduce is applied mul(1,2)=2
    #next   mul(2,3)=6
    #next   mul(6,4)=4.........last(r!,r+1)=r+1!

    return over // under
    #// is integer divide
    #calc example 5C2
    #over=5*4*3
    #under=3*2*1
a = cmb(n, r)
#print(a)
'''

'''
#集計
#example
#a=[2,2,2,3,4,3,1,2,1,3,1,2,1,2,2,1,2,1]
#a=Counter(a)
for i in a.most_common(n):print(i)
#most_common()メソッドは、出現回数が多い要素順にCounterオブジェクトを並び替えます。
#引数にint型の数字nを設定した場合は、出現回数が高い上位ｎ個の要素を返します。
#何も設定しなければ、コンテナ型にあるすべての要素を出現回数の順番に並び替えたタプル型オブジェクトを返します。
#out put
#(2, 8)
 #(1, 6)
#(3, 3)
#(4, 1)
'''


#二部探索(binary search)
#A = [1, 2, 3, 3, 3, 4, 4, 6, 6, 6, 6]
#print(A)
#index = bisect.bisect_left(A, 5) # 7 最も左(前)の挿入箇所が返ってきている
#A.insert(index, 5)
#print(index)
#print(A)
'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''





########################################################################
########################################################################
#b2=a[:]  #1次元のときはコピーはこれで良い
#print(b2)

#a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
#b3=copy.deepcopy(a)  #2次元配列はこうコピーする
#print(b3)

Submission status: Accepted

Solution code:
S = input()
a = set()
ans = 'yes'
for i in S:
    if i in a:
        ans = 'no'
        break
    else:
        a.add(i)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=input()
print("yes" if len(S)-len(set(S))==0 else "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:
import collections

s=input()

s=list(s)

c = collections.Counter(s)

score_sorted = sorted(c.items(), key=lambda x:-x[1])

if score_sorted[0][1] ==1:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
S = list(input())
f = set()
ans = "yes"
for s in S:
    if (s in f):
        ans = "no"
        break
    f.add(s)

print(ans)

Submission status: Accepted

Solution code:
import collections
s = input()

cnt = collections.Counter()

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

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

Submission status: Accepted

Solution code:
from sys import exit
S  = input()
found = ""
for i in S:
  if i in found:
    print("no")
    exit()
  else: found += i
print("yes")

Submission status: Accepted

Solution code:
s = list(input())
s.sort()
t = s[0]
c = 1
for i in range(1, len(s)):
    if s[i] == t:
        c = 0
    t = s[i]
print("yes" if c == 1 else "no")

Submission status: Accepted

Solution code:
import math

a=input()
print("yes" if len(a)-len(set(a))==0 else "no")

Submission status: Accepted

Solution code:
import sys

S = input()
l = [0]*26
alfa = [chr(i) for i in range(97, 97+26)]
for i in range(len(S)):
    index = alfa.index(S[i])
    l[index] += 1
    if l[index] == 2:
        print("no")
        sys.exit()
print("yes")

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
import collections
c=collections.Counter(input())
for i,m in c.items():
    if m>=2:
        print("no")
        exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = list(input())

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

Submission status: Accepted

Solution code:
S = input()
cnt = 0
for i in S:
    if S.count(i) != 1:
        cnt +=1
if cnt == 0:
    print('yes')
else:
    print('no')

Submission status: Accepted

Solution code:
s = input()

bl = len(s)
cl = len(set(s))

print('yes' if bl == cl else 'no')

Submission status: Accepted

Solution code:
#ABC063.B
S = input()
cnt = 0
for i in S:
    if S.count(i) != 1:
        cnt +=1
if cnt == 0:
    print('yes')
else:
    print('no')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

letter_dict = {}

for l in S:
    letter_dict.setdefault(l, 0)
    letter_dict[l] += 1

if max(letter_dict.values()) == 1:
    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:
# Author: cr4zjh0bp
# Created: Sun Mar 22 23:25:40 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

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

Submission status: Accepted

Solution code:
# Author: cr4zjh0bp
# Created: Sun Mar 22 23:25:40 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

from collections import Counter

s = ns()
c = Counter(s)
print("yes" if len(s) == len(c) else "no")

Submission status: Accepted

Solution code:
s = input()
def has_duplicates(seq):
    return len(seq) != len(set(seq))

if (has_duplicates(s)) == True:
    print("no")
else:
    print("yes")

Submission status: Accepted

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

for i in range(len(s)):
    st = s.pop(0)
    if st in s:
        ans = "no"
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from __future__ import print_function

import sys

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd
# fractions.gcd() を用いること
# math.log2()はatcoderでは対応していない．留意せよ．

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return


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


def coprimize(p, q):
    common = fractions.gcd(p, q)
    return (p // common, q // common)


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def main():
    S = input().strip()
    C=Counter()

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

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

Submission status: Accepted

Solution code:
# B
s = input()
l = [chr(i) for i in range(97, 97+26)]

bool = True
for i in range(len(l)):
    ans = s.count(l[i])
    if ans <= 1:
        continue
    else:
        bool = False
        break
        
if bool:
    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()
s1=set(s)
if len(s1)==len(s):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
import sys
import math
# import decimal
# import queue
# import bisect
# import heapq # priolity-queue
# import time
# import itertools
# import collections # queue
# from operator import itemgetter
# from fractions import Fraction

mod = int(1e9+7)
INF = 1<<29
lINF = 1<<35

def main():
    s = list(input())
    s.sort()
    for i in range(len(s)-1):
        if s[i]==s[i+1]:
            print("no")
            return
    print("yes")
    return

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()
flag = "yes"
for i in s:
  if s.count(i) != 1:
    flag = "no"
print(flag)

Submission status: Accepted

Solution code:
#abc063 b
s=input()
ans=[]
for c in s:
    if c not in ans:
        ans.append(c)
if len(s)==len(ans):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product

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

resolve()