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:
import sys

S = input()

saw = []

for i in S:
    if i in saw:
        print('no')
        sys.exit()
    else:
        saw.append(i)

print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t = list(input())
l = len(t)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = input()
flag = False
dict = {}
for b in a:
  if b in dict:
    flag = True
    break
  dict[b] = 1

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

Submission status: Accepted

Solution code:
s = raw_input()
r = set()
r.update(s)

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

Submission status: Accepted

Solution code:

S = input()

s = set([e for e in S])

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

Submission status: Accepted

Solution code:
from collections import Counter
arg = input()

counter = Counter(arg)
if(max(counter.values()) > 1):
    print("no")
else:
    print("yes")

Submission status: Accepted

Solution code:
S=list(input())

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

Submission status: Accepted

Solution code:
a = list(input())

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

Submission status: Accepted

Solution code:
s = list(input())
a , b = len(s) , len(set(s))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N=input()

s=list(N)
#a=[input() for i in range(N)]

m=set(N)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input('')

string = 'abcdefghijklmnopqrstuvwxyz'
x = 0

for moji in string:
	if S.count(moji) >= 2:
		x = 1

print("no" if x == 1 else "yes")

Submission status: Accepted

Solution code:
S = input('')
string = 'abcdefghijklmnopqrstuvwxyz'
x = 0

for moji in string:
	if S.count(moji) >= 2:
		x = 1	

print("no" if x == 1 else "yes")

Submission status: Accepted

Solution code:
from collections import Counter
import sys

# sys.stdin = open("b1.in")

s = input()
n = len(s)

res = 'yes'
for i in range(0, n):
    for j in range(i + 1, n):
        if s[i] == s[j]:
            res = 'no'

print(res)

c = Counter(s)
res = 'yes'
for l, value in c.items():
    if value > 1:
        res = 'no'

Submission status: Accepted

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

#-------
# Initialize
S = list(input())

#-------
# Do
S_uniq = list(set(S))

#-------
# Output
if len(S) == len(S_uniq):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

def main():
    s = raw_input()

    for i, c in enumerate(list(s)):
        # loop前から、検索は後ろからなので
        # インデックスが異なる場合、複数アルファベットが存在
        if s.rfind(c)!=i:
            print 'no'
            return 0
            
    print 'yes'

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/bin/usr/python

in_str = input()
flag = True

for i in range(0, len(in_str)):
  for j in range(i+1, len(in_str)):
    if in_str[i] == in_str[j]:
      print("no")
      flag = False
      break
  if flag == False:
    break

if flag == True:
  print("yes")

Submission status: Accepted

Solution code:
import sys

s = list(input())

check_array = [0 for i in range(26)]

for i in range(len(s)):
    judge = s[i]
    
    for j in range(len(s)):
        if judge == check_array[j]:
            print("no")
            sys.exit()
    
    check_array[i] = judge

print("yes")

Submission status: Accepted

Solution code:
def is_duplicated():
	S = list(input())
	S_n = list(set(S))
	if len(S) != len(S_n):
		print('no')
		return
	print('yes')

is_duplicated()

Submission status: Accepted

Solution code:
S=list(input())

S_uni = list(set(S))

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !

import sys
input_line2 = sys.stdin.readline()

flag = 0
for i in range(len(input_line2)):
    for j in range(len(input_line2)):
        if i != j:
            if input_line2[i] == input_line2[j]:
                flag = 1
                break;

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

Submission status: Accepted

Solution code:
str = input()
dict = {}
flag = False
for c in str:
    if c in dict:
        flag = True
    dict[c] = 1
if flag:
    print('no')
else:
    print('yes')

Submission status: Accepted

Solution code:
import re; print('no' if re.match(r'.*(.).*\1.*', input()) else 'yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, collections

s = input()

a = 1

cnt = collections.Counter(s)

for i,j in cnt.items():
	if j != 1:
		a = 0
		break

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

input_lines=raw_input()
length=len(input_lines)
result = True

for i in xrange(length):
    for j in range(i+1,length):
        if input_lines[i]==input_lines[j]:
            result = False
            break
    if result == False:
        break


if result:
    print "yes"
else:
    print "no"

Submission status: Accepted

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

Submission status: Accepted

Solution code:
words = input()
answer = "yes"
for word in words:
    if words.count(word) > 1:
        answer = "no"
        break
print(answer)

Submission status: Accepted

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

for i in s:
    if i not in arr:
        arr.append(i)
    elif i in arr:
        print("no")
        break

if len(arr) == len(s):
    print("yes")

Submission status: Accepted

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

for i in range(len(S)):
    if S.count(S[i]) >= 2:
        print('no')
        sys.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:
L = list(raw_input())
print "yes" if len(L) == len(set(L)) else "no"

Submission status: Accepted

Solution code:

S = str(raw_input())

string = list(S)

n = 0
for char in string:
    if S.count(char) >= 2:
        print("no")
        break
    else:
        n += 1
        if n == len(S):
            print("yes")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    S = input()

    result = "yes"
    # for each character in S
    for c in S:
        # there is a same character in S
        if S.count(c) > 1:
            result = "no"
            break

    print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()
l = len(s)
dif = True
for i in range(l):
    for j in range(i+1,l):
        if s[i] == s[j]:
            dif = False
            break
    if not dif:
        break
if dif:
    print 'yes'
else:
    print 'no'

Submission status: Accepted

Solution code:
a=input();print(['no','yes'][len(a)==len(set(a))])

Submission status: Accepted

Solution code:
S = input()

s_set = set(S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def B():
    from numpy import zeros
    s = input()
    r = zeros((26,), dtype='int32')
    ord_a = ord('a')
    for c in s:
        r[ord(c)-ord_a] += 1
    for i in r:
        if i > 1:
            print('no')
            exit()
    print('yes')

B()

Submission status: Accepted

Solution code:
s = input()
Chars = [l for l in s]
Depre = set(Chars)

if len(Chars) == len(Depre):
	print('yes')
else:
	print('no')

Submission status: Accepted

Solution code:
S=input()
tmp=[S[i] for i in range(len(S))]

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

Submission status: Accepted

Solution code:
s=input();print('no'*(len(set(s))<len(s))or'yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()
l = list(s)

ans = "yes"

l.sort()

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

print ans

Submission status: Accepted

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

S = input()

S_list = [ S[i] for i in range(len(S)) ]

S_uniq = list(set(S_list))

if len(S_uniq) == len(S_list):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

def main():
    s = S()
    d = collections.defaultdict(int)
    for c in s:
        d[c] += 1

    if max(d.values()) == 1:
        return 'yes'
    return 'no'


print(main())

Submission status: Accepted

Solution code:
def solve():
    s=input()
    num = [0 for i in range(26)]
    for i in range(len(s)):
        num[ord(s[i])-ord('a')]+=1;
    for i in range(26):
        if num[i]>1:
            print("no")
            return
    print("yes")
if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input("")
c=""
b={}.fromkeys(a).keys()
for i in b:
    c+=str(i)
if len(a)==len(c):
    print("yes")
else:print("no")

Submission status: Accepted

Solution code:
S = input()
S=list(S)
flag = 0

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC063B

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def solve():
    s = input()
    ss = set(s)

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
S = list(input())
S.sort()
if ''.join(S) == ''.join(sorted(list(set(S)))):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

S = input()
list(S)
boolean = True
for i in range(len(S)):
    for j in range(i+1, len(S)):
        if S[i] == S[j]:
            boolean = False

[print('no') if boolean == False else print('yes')]

Submission status: Accepted

Solution code:
s=list(input())

res='yes'

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

Submission status: Accepted

Solution code:
from sys import stdin
a = stdin.readline().strip()
ans = 'yes'
if len(a)!=len(set(a)):
 ans = 'no'
print ans

Submission status: Accepted

Solution code:
from collections import defaultdict

S = str(input())
sentence_dict = defaultdict(int)

for alpha in S:
    sentence_dict[alpha] += 1

count = 0
for i in sentence_dict.values():
    if i == 1:
        count += 1
        if count == len(sentence_dict):
            print("yes")
    else:
        print("no")
        break

Submission status: Accepted

Solution code:
S=list(input())
S.sort()
nd=0
i=0
while nd==0 and i<len(S)-1:
    if S[i]==S[i+1]:
         nd=1
    i+=1
if nd==1:
    print ("no")
else:
    print ("yes")

Submission status: Accepted

Solution code:
A=input()
B=[]
for i in range(len(A)):
    B.append(A[i])
    B.sort()
flg=0
for i in range(len(A)-1):
    if B[i]==B[i+1]:
        flg=+1
if flg>0:
    print("no")
else:
    print("yes")

Submission status: Accepted

Solution code:
s = input()
if len(s) <= 1:
   print("yes")
else:
   for i in range(len(s)):
      if s[i] in list(s[:i]):
         print("no")
         break
   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:
String = input()
# String= "different"
num = len(set(String))
l = len(String)
if (l == num):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

S = input()

S_list = []

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

S_uniq = list(set(S_list))

if len(S_uniq) == len(S_list):
    print("yes")
else:
    print("no")

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = (str(input())).count
if ((s('a')>1)or(s('b')>1)or(s('c')>1)or(s('d')>1)or(s('e')>1)or(s('f')>1)
    or(s('g')>1)or(s('h')>1)or(s('i')>1)or(s('j')>1)or(s('k')>1)or(s('l')>1)
    or(s('m')>1)or(s('n')>1)or(s('o')>1)or(s('p')>1)or(s('q')>1)or(s('r')>1)
    or(s('s')>1)or(s('t')>1)or(s('u')>1)or(s('v')>1)or(s('w')>1)or(s('x')>1)
    or(s('y')>1)or(s('z')>1)):
    print('no')
else:
    print('yes')

Submission status: Accepted

Solution code:
s = input()
len_s = len(s)
duplication = False

for i in range(len_s - 1):
    for j in range(i, len_s-1):
        if s[i] == s[j+1]:
            print("no")
            duplication = True
            break
    if duplication:
        break
if not duplication:
    print("yes")

Submission status: Accepted

Solution code:
s = raw_input()
f = True
for i in xrange(len(s)-1):
    if s[i] in s[i+1:]:
        f = False
if f:
    print "yes"
else:
    print "no"

Submission status: Accepted

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

if L.count('a') >= 2:
	print('no')
	quit()
if L.count('b') >= 2:
	print('no')
	quit()
if L.count('c') >= 2:
	print('no')
	quit()
if L.count('d') >= 2:
	print('no')
	quit()
if L.count('e') >= 2:
	print('no')
	quit()
if L.count('f') >= 2:
	print('no')
	quit()
if L.count('g') >= 2:
	print('no')
	quit()
if L.count('h') >= 2:
	print('no')
	quit()
if L.count('i') >= 2:
	print('no')
	quit()
if L.count('j') >= 2:
	print('no')
	quit()
if L.count('k') >= 2:
	print('no')
	quit()
if L.count('l') >= 2:
	print('no')
	quit()
if L.count('m') >= 2:
	print('no')
	quit()
if L.count('n') >= 2:
	print('no')
	quit()
if L.count('o') >= 2:
	print('no')
	quit()
if L.count('p') >= 2:
	print('no')
	quit()
if L.count('q') >= 2:
	print('no')
	quit()
if L.count('r') >= 2:
	print('no')
	quit()
if L.count('s') >= 2:
	print('no')
	quit()
if L.count('t') >= 2:
	print('no')
	quit()
if L.count('u') >= 2:
	print('no')
	quit()
if L.count('v') >= 2:
	print('no')
	quit()
if L.count('w') >= 2:
	print('no')
	quit()
if L.count('x') >= 2:
	print('no')
	quit()
if L.count('y') >= 2:
	print('no')
	quit()
if L.count('z') >= 2:
	print('no')
	quit()
print('yes')

Submission status: Accepted

Solution code:
#python

def is_unique_chars(s):
    if isinstance(s, str):
        s = s.decode('utf-8')
    return len(set(list(s))) == len(s)

S = raw_input()

if is_unique_chars(S)==True:
	print "yes"
else:
	print "no"

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())
name="yes"
for i in range(len(s)):    
    for j in range(len(s)):
        if i!=j:
            if s[i]==s[j]:
                name="no"
        elif i==j:
            pass
            
print(name)

Submission status: Accepted

Solution code:
s=input()

jud=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0]
for i in range(len(s)):
    for j in range(26):

#        print(s[i]+ " "+str(j+ord("a")))
        if ord(s[i])==j+ord('a'):
            jud[j]+=1

a=False


#print(jud)

for i in range(26):
    if jud[i]>=2:
        a=(jud[i]>=2)
        print("no")
        break

if a==False:
    print("yes")

Submission status: Accepted

Solution code:
#coding: utf-8


def judge(str):
    for i, x in enumerate(str):
        for j, v in enumerate(str):
            if (i != j) and x == v:
                return 'no'
    return 'yes'

str = input()

if len(str) < 1 or len(str) > 27:
    print ('error')

print (judge(str))

Submission status: Accepted

Solution code:
s = input()
d =dict()

for c in s:
    if not c in d:
        d[c] = 1
    else:
        d[c] += 1

message = ""
for v in d.values():
    if v >=2:
        message = "no"
        break

if message == "no":
    print(message)
else:
    print("yes")

Submission status: Accepted

Solution code:
a = input()
dif = 0

for i in range(len(a) - 1) :
  for j in range(len(a)) :
    if i + j + 1 == len(a) :
      break
    if (a[i] == a[i + j + 1]) :
      dif = 1
  
if dif :
  print ('no')
else :
  print ('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    S = str(input())
    return (S,)


def solve(S):
    count = collections.Counter([char for char in S])
    for c in count.values():
        if c >= 2:
            ans = "no"
            break
    else:
        ans = "yes"
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = raw_input()

ans = "yes"

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

print ans

Submission status: Accepted

Solution code:
S = input()

j = 0
for s in S:
    if S.count(s) >= 2:
        j += 1

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

Submission status: Accepted

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



line =raw_input()# 文字列の入力

Slist = list(line)


k = set(Slist)

if len(Slist) == len(k) and 2<= len(Slist) <=26:
    print 'yes'
else:
    print 'no'

Submission status: Accepted

Solution code:
arr = [0 for x in range(125)]
S = input()
for s in S:
   if arr[ord(s)] == 1:
      print("no")
      break
   else:
      arr[ord(s)] = 1
else:
   print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=raw_input()
b=len(a)
c=0
for i in range(b):
    for j in range(i+1,b):
        if a[i]==a[j]:
            c+=1
if c==0:
    print "yes"
else:
    print "no"

Submission status: Accepted

Solution code:
#a,b = map(int, input().split())
s = input()

d = dict()
a=[]
flag=0

for s_ in s:
    if s_ not in d.keys():
        d[s_]=0
    else:
        flag=1
        break
if flag==1:
    print("no")
else:
    print("yes")

Submission status: Accepted

Solution code:
S = input()

for i in range(26):
    s = chr(ord("a")+i)
    if S.count(s)>1:
        print("no")
        exit()

print("yes")

Submission status: Accepted

Solution code:
# coding: utf-8
from collections import Counter

s = raw_input()
c = Counter(s)

for i in c.values():
    if i > 1:
        print "no"
        exit()

print "yes"

Submission status: Accepted

Solution code:
s = input()

flag = 0

for i in range(len(s)):
    for j in range(i+1, len(s)):
        if s[i] == s[j]:
            flag = 1

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

Submission status: Accepted

Solution code:
s = input()
s1=[]
for i in range(len(s)):
  s1.append(s[i])
s2 = set(s1)
if len(s2) == len(s1):
  print("yes")
else:
  print("no")

Submission status: Accepted

Solution code:
#coding:utf-8

input_line1 = raw_input()
flag = 0

for i in range(0,len(input_line1)):
	for j in range(i+1,len(input_line1)):
		if input_line1[i] == input_line1[j]:
			flag = 1

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

Submission status: Accepted

Solution code:
chara = input()
for i in range(len(chara)):
    if chara.count(chara[i]) >= 2:
        print("no")
        break
    if i == len(chara)-1:
        print("yes")

Submission status: Accepted

Solution code:
s=input()
same=False
for i in range(len(s)):
    if s.find(s[i],i+1)!=-1:
        same=True

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

Submission status: Accepted

Solution code:
z =list(input())
a=[0]*300
def f():
    for c in z:
        a[ord(c)]+=1
        if a[ord(c)]>1:
            print("no")
            return 0
    print("yes")

f()

Submission status: Accepted

Solution code:
S = list(map(str, raw_input().split())[0])
S.sort()

flag = True
for i in range(len(S) - 1):
    if S[i] == S[i + 1]:
        flag = False
        break

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:
S = input()

i = 0
while(i < len(S)):
	j = i+1
	while(j < len(S)):
		if(S[i] == S[j]):
			print("no")
			exit(0)
		j += 1
	i += 1
print("yes")

Submission status: Accepted

Solution code:
import copy

s = raw_input()
s=list(s)

ans="yes"

for i in range(len(s)):
    t=copy.deepcopy(s)
    t[i]="hoge"
    if s[i] in t:
        ans = "no"
    #print(s)

print(ans)

Submission status: Accepted

Solution code:
import sys

s = input()

checked = []

for c in s:
    if c in checked:
        print("no")
        sys.exit()
    else:
        checked.append(c)
print("yes")

Submission status: Accepted

Solution code:
import collections

S = raw_input()
c = collections.Counter(S)
print 'yes' if c.most_common(1)[0][1] == 1 else 'no'

Submission status: Accepted

Solution code:
S = list(input())
S.sort()
double = 0
for i in range(len(S) - 1):
	if S[i] == S[i + 1]:
		double = 1

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

Submission status: Accepted

Solution code:
S = input()
k = 0
for i in range(len(S)-1):
 for j in range(i + 1, len(S)):
  if S[i] == S[j]:
   k = 1
   break

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

Submission status: Accepted

Solution code:
n = str(input())

for i in n:
    count=0
    for j in n:
        if(i==j):count+=1
        if count==2:
            print("no")
            quit()
print("yes")

Submission status: Accepted

Solution code:
import collections

S = list(input())
#print (S)
a = collections.Counter(S).most_common()
#print (a)
if a[0][1]==1:
    print ('yes')
else:
    print ('no')

Submission status: Accepted

Solution code:
string = list(input())
cnt = 0
for i in string:
    if string.count(i) >= 2:
        cnt += 1
if cnt == 0:
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
ab = input()
s= []
for i in ab:
    if i in s:
        an = 0
        break
    else:
        s.append(i)
        an = 1
        

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
S=list(s)
counter=[]
for i in range(len(S)):
    if S[i] not in counter:
        counter.append(S[i])

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

Submission status: Accepted

Solution code:
a = raw_input()

a = sorted(a)

for i in range(0, len(a) - 1):
    if a[i] == a[i + 1]:
        print 'no'
        exit()
print 'yes'

Submission status: Accepted

Solution code:
str = raw_input()
count = [0 for i in range(26)]

for c in str:
  i = ord(c) - ord('a')
  count[i] += 1
  if count[i] > 1:
    print 'no'
    break
else:
  print 'yes'

Submission status: Accepted

Solution code:
S = input()

checker = {}
for i in range(0, len(S)):
    if S[i] in checker:
        print("no")
        quit()
    else:
        checker[S[i]] = 1

print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    S = input()

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

    print(ans)

main()

Submission status: Accepted

Solution code:
S = raw_input()
count = {}
flag = 0
for i in range(len(S)):
    if S[i] in count:
        flag = 1
    else:
        count[S[i]] = 1
if flag == 0:
    print 'yes'
else:
    print 'no'

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

lis = []

uq = True

for e in s:
    if e in lis:
        print("no")
        uq = False
        break

    lis.append(e)
if uq:
    print("yes")

Submission status: Accepted

Solution code:
s = input()
s_list = list(s)
s_set = set(s_list)

s_list.count(s_set)
flag = 0
for S in s_set:
    if( s.count(S) != 1):
        flag = 1
        break

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

Submission status: Accepted

Solution code:
s = raw_input()
a = ord('a')
def check(s):
    for i in xrange(26):
        if s.count(chr(a+i)) >1:
            print "no"
            return 0
    print "yes"
    return 0
check(s)

Submission status: Accepted

Solution code:
S = list(input())
no_dup = set(S)
# print(S)
# print(no_dup)
# print(len(no_dup))

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

Submission status: Accepted

Solution code:
import sys
S=str(input())
S_list=list(S)
S_list.sort()
l=len(S_list)

for i in range(l-1):
  if S_list[i]==S_list[i+1]:
    print("no")
    sys.exit()
print("yes")

Submission status: Accepted

Solution code:
import sys

def main():
    l = sys.stdin.readline()
    dic = {}

    for ch in l:
        if ch in dic:
            print("no")
            return 0
        else:
            dic[ch] = 1

    print("yes")
    return 0

if __name__ == '__main__':
    sys.exit(main())

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function
import sys


def main():
    d = set()
    s = sys.stdin.readline().strip()
    for c in s:
        if c in d:
            print("no")
            return
        d.add(c)
    print("yes")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

import sys
import os

s = input().strip()
L = len(s)

S = set(list(s))

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

Submission status: Accepted

Solution code:
from sys import stdin

s = stdin.readline().strip()

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

Submission status: Accepted

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

b()

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
s = input()
st = False
used = [False for i in range(26)]
for i in s:
    if used[ord(i) - 97]:
        print('no')
        st = True
        break
    else:
        used[ord(i) - 97] = True
if not st:
    print('yes')

Submission status: Accepted

Solution code:
a = raw_input()
d = []
ok = True

for i in a:
	if i in d:
		ok = False
		break
	else:
		d.append(i)

if ok:
	print "yes"
else:
	print "no"

Submission status: Accepted

Solution code:
def judge(lst):
	tmp = lst[0]
	for i in range(1, len(lst)):
		if tmp == lst[i]:
			return 'no'
		tmp = lst[i]
	return 'yes'

s = raw_input()
slist = []
for i in range(0, len(s)):
	slist.append(s[i])
slist.sort()

print judge(slist)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = raw_input()

def a():
    for i in "abcdefghijklmnopqrstuvwxyz":
        if s.count(i) >= 2:
            return False
    return True

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

Submission status: Accepted

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

s = raw_input()

sset = set(s)

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

Submission status: Accepted

Solution code:
S = input()

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