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

Solution (Python):
S = input()

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

print("yes")

Solution (Python):

from collections import Counter

s = raw_input()
c = Counter(s)

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

print "yes"

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):


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'

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

Solution (Python):
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')

Solution (Python):
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()

Solution (Python):
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")

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

Solution (Python):
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")

Solution (Python):
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(ans)

Solution (Python):
import sys

s = input()

checked = []

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

Solution (Python):
import collections

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

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
s = input()

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

Solution (Python):
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")

Solution (Python):
import collections

S = list(input())

a = collections.Counter(S).most_common()

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

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

Solution (Python):
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')

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

Solution (Python):
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')

Solution (Python):
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'

Solution (Python):
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'

Solution (Python):
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")

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

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

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

    print(ans)

main()

Solution (Python):
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'

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

Solution (Python):
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")

Solution (Python):
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")

Solution (Python):
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)

Solution (Python):
S = list(input())
no_dup = set(S)




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

Solution (Python):
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")

Solution (Python):
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())

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

Solution (Python):


import sys
import os

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

S = set(list(s))

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

Solution (Python):
from sys import stdin

s = stdin.readline().strip()

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

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

b()

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

Solution (Python):
S = input()

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

Solution (Python):
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')

Solution (Python):
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"

Solution (Python):
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)

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

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

Solution (Python):
s = raw_input()

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

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

Solution (Python):


s = raw_input()

sset = set(s)

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

Solution (Python):
S = input()

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

Solution (Python):
def main():
    
    a = raw_input().strip()
    print 'yes' if len(set(a)) == len(a) else 'no'

main()

Solution (Python):
s = input()

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