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, re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline 
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []

def main():
    s = s_input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

st = set()
for c in s:
    if c in st:
        print("no")
        exit()
    st.add(c)

print("yes")

Submission status: Accepted

Solution code:
# coding: utf-8

str = input()
count = 0
table = list(str)
for i in range(len(str) - 1):
    for j in range(i+1, len(str)):
        if table[i] == table[j]:
            count += 1
if count == 0:
    print("yes")
else:
    print("no")

Submission status: Accepted

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

for i in s:
    if (i not in word):
        word.append(i)
    else:
        print('no')
        exit()

print('yes')

Submission status: Accepted

Solution code:
s = [c for c in input()]

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

Submission status: Accepted

Solution code:
s=input()
t=True
for i in s:
    if s.count(i) != 1:
        t=False
print("yes" if t else "no")

Submission status: Accepted

Solution code:
S = input()
tmp = []
ans = "yes"

for i in range(len(S)):
  if (S[i] in tmp):
    ans = "no"
    break
  else:
    tmp.append(S[i])
print(ans)

Submission status: Accepted

Solution code:
LI = lambda: list(map(int, input().split()))

S = input()


def main():
    n = len(S)
    sn = len(set(S))
    ans = "yes" if sn == n else "no"
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()

visited = [False] * 26
flg = True
for i in range(len(s)):
    x = ord(s[i]) - 97
    if visited[x]:
        flg = False
        break
    visited[x] = True
print('yes') if flg else print('no')

Submission status: Accepted

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

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

print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())

for s in S:
  if S.count(s)>1:
    print('no')
    exit()
print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

l=[]
ans = "yes"

for i in S:
    if i in l:
        ans = "no"
        break
    else:
        l.append(i)

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter

s = list(input())

counter = Counter(s)

# print(counter)

for k, v in counter.items():
    if v > 1:
        print("no")
        exit()
print("yes")

Submission status: Accepted

Solution code:
from collections import Counter

s=input()

n=len(Counter(s))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding = SJIS

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

Submission status: Accepted

Solution code:
S=input()
chars = []
for c in S:
    chars.append(c)

ans = len(S) == len(set(chars))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = str(input())
cnt_flag = False

for s_find in s:
	if s.count(s_find)>1:
		cnt_flag = True

if cnt_flag:
	print("no")

else:
	print("yes")

Submission status: Accepted

Solution code:
S=list(input())
A=[]
for i in range(len(S)):
    for j in range(len(S)):
        if i<j and S[i]==S[j]:
            A.append('no')
            break
        else:
            A.append('yes')
if 'no' in A:
    print('no')
else:
    print('yes')

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

ss = list(input()[:-1])

ss.sort()

a = s(ss)

for i in range(len(a)):
    if a[i][1] >= 2:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

def main():
    S = input()

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


if __name__ == '__main__':
    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 = input()
N = set(S)
if len(S) == len(N):
  print("yes")
else:
  print("no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
Set = set()
for i in s:
    Set.add(i)
print("yes" if len(Set) == len(s) else "no")

Submission status: Accepted

Solution code:
S = input()
alpha = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z',]
ex = [0]*26
for i in range(len(S)) :
    index = alpha.index(S[i])
    ex[index] += 1
    if ex[index] != 1 :
        print('no')
        exit()

print('yes')

Submission status: Accepted

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

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:
from collections import Counter
S = input()
l = []
for i in range(len(S)):
    l.append(S[i])
c = Counter(l)
if len(c) == len(S):
    print("yes")
else:
    print("no")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
S = input()

s = ''
for i in range(len(S)):
    if S[i] in s:
        print('no')
        exit()
    else:
        s += S[i]
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:
#coding: utf-8
import sys
data = list(input())

for i in range(len(data)):
  for j in range(i+1, len(data)):
    if (data[i] == data[j]):
      print("no")
      sys.exit()
    else:
      continue
else:
  print("yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

for w in s:
  cnt = s.count(w)
  if cnt > 1:
    ans = 'no'
    break
  else:
    ans = 'yes'
    
print(ans)

Submission status: Accepted

Solution code:
S = list(input())

flag = 0
for i in S:
    if S.count(i)>1:
        flag = 1
        
if flag == 0:
    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:

def resolve():
    import sys
    input = sys.stdin.readline
    # row = [int(x) for x in input().rstrip().split(" ")]
    # n = int(input().rstrip())
    s = input().rstrip()
    chars = set()
    for c in s:
        if c in chars:
            print("no")
            return
        else:
            chars.add(c)

    print("yes")




if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
a = input()
b = []
c = int(len(str(a)))

for i in range(c):
  b.append(a[i])

d = collections.Counter(b)
e = d.most_common()[0][1]

if e != 1:
  print("no")
else:
  print("yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
chk = []
for i in range(len(s)):
    c = s[i]
    if c in chk:
        print("no")
        exit()
    else:
        chk.append(c)
print("yes")

Submission status: Accepted

Solution code:
def resolve():
    '''
    code here
    '''
    S = [item for item in input()]
    if len(S) == len(set(S)):
        print('yes')
    else:
        print('no')


if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
s = str(input())
dic = {}
for i in s:
    dic.setdefault(i,0)
    dic[i] += 1
if max(dic.values())>=2:
    print('no')
else:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

S_set = set(S)

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np
from functools import reduce

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

s = rr()
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:
s = input()
n = len(s)
ok = True
for i in range(n):
    cnt = s.count(s[i])
    if cnt > 1:
        ok = False

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

Submission status: Accepted

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

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()
n = [0]*26
for e in s:
  n[ord(e)-ord('a')]+=1
for i in n:
  if i>1:
    print("no")
    exit()
print("yes")

Submission status: Accepted

Solution code:
S = input()
s = [True] * 26
for i in range(len(S)):
    if s[ ord(S[i]) - 97 ]:
        s[ ord(S[i]) - 97 ] = False
    else:
        print('no')
        exit()
print('yes')

Submission status: Accepted

Solution code:
import sys
s = input()

p = { 'a': 0, 'b': 0, 'c': 0, 'd': 0, 'e': 0, 'f': 0, 'g': 0, 'h': 0, 'i': 0, 'j': 0, 'k': 0, 'l': 0, 'm': 0, 'n': 0, 'o': 0, 'p': 0, 'q': 0, 'r': 0, 's': 0, 't': 0, 'u': 0, 'v': 0, 'w': 0, 'x': 0, 'y': 0, 'z': 0,}

for e in s:
    p[e] += 1
    if p[e] == 2:
        print('no')
        sys.exit()

print('yes')

Submission status: Accepted

Solution code:
S=input()
l=[]
for i in S:
  if i in l:
    print("no")
    break
  else:
    l.append(i)
else:
  print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
flag = True

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


def main():
    s = input()
    d = set()
    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:
s=list(input())
s.sort()
for i in range(len(s)):
    if s[i]==s[i-1]:
        print("no")
        exit()
print("yes")

Submission status: Accepted

Solution code:
S = list(input())

SS = [0] * 26

lis = [chr(i) for i in range(97, 97 + 26)]

for S in S:
    ind = lis.index(S)
    if SS[ind] == 0:
        SS[ind] = 1
    else:
        print("no")
        break
else:
    print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]


ans = [0] * 26

s = input()

for i in range(len(s)):
    idx = ord(s[i]) - 0x61
    ans[idx] += 1
    if (ans[idx] > 1):
        print("no")
        exit()
print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import collections
Sls = list(input())
counter = collections.Counter(Sls)
ans = 'yes'
for i in counter.values():
    if i > 1:
        ans = 'no'
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
S = input()

mem = {}

for c in S:
    if c in mem.keys():
        print('no')
        exit()
    else:
        mem[c] = 1
print('yes')

Submission status: Accepted

Solution code:
str1 = input()
li = list(str1)
flag = False
for i in range(len(li)):
    a = i+1
    x = li[i]
    while a < len(li):
        if x == li[a]:
            flag = True
            break
        a += 1
    if flag:
        break
if flag:
    print('no')
else:
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
a = []
for i in range(len(S)):
  if S[i] in a:
    print("no")
    quit()
  else:
    a.append(S[i])
    
    
print("yes")

Submission status: Accepted

Solution code:
s=list(input())
n=len(s)
l=list("abcdefghijklmnopqrstuvwxyz")
f=0
for i in range(26):
    if s.count(l[i])>=2:
        f=1
print("yes" if f==0 else "no")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def varied(s):
	for i in range(1, len(s)):
		if s[i-1] in s[i:]:
			return "no"
	return "yes"

s = input()
print(varied(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

sdic = {}

for s in S:
    if s in sdic:
        print("no")
        exit()

    sdic[s] = 1

print("yes")

Submission status: Accepted

Solution code:
s=input()
res="yes"
for i in range(97,123):
    if s.count(chr(i))>1:
        res="no"
        break
print(res)

Submission status: Accepted

Solution code:
S = input()
len_S = len(S)

len_set_S = len(set(S))

if len_S == len_set_S:
    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:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
s = [S[0]]
ans = 'yes'

for i in S[1:]:
    if i in s:
        ans = 'no'
        break
    else:
        s.append(i)
print(ans)

Submission status: Accepted

Solution code:
s = list(input())
se = set(s)
if len(s) == len(se):
  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 collections
S=collections.Counter(x for x in input())

for k,v in S.items():
  if v!=1:
    print('no')
    break
else:
  print('yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')

S = input()

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

Submission status: Accepted

Solution code:
from collections import defaultdict 

N = input()
dic = defaultdict(int)
 
for s in N:
  dic[s] += 1
  
  if dic[s] > 1:
    print('no')
    exit()
 
print('yes')

Submission status: Accepted

Solution code:
a = input()
alp =[0 for i in range(0 , 29)]
for i in a:
	alp[ord(i)-ord('a')]+=1
for i in range(0 , 26):
	if alp[i]>1:
		print("no")
		exit()
print("yes")
exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    S = readline().strip()

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter
import sys

s=Counter(input())
for x in iter(s):
  if s[x]>1:
    print('no')
    sys.exit()
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:
S=list(input())
print('yes'if len(S)==len(set(S))else'no')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

print('yes')

Submission status: Accepted

Solution code:
S = input()

import collections

c = collections.Counter(list(S))

ans = "yes"
for i in c.values():
    if i == 1:
        pass
    else:
        ans = "no"
        break

print(ans)

Submission status: Accepted

Solution code:
S = input()
N = len(S)
a = []
for i in range(N):
    if S[i] in a:
        print('no')
        exit()
    else:
        a.append(S[i])
print('yes')

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
s = input()

cha = []

for i in range(len(s)):
    if s[i] in cha:
        print("no")
        exit()
    else:
        cha.append(s[i])

print("yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

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

Submission status: Accepted

Solution code:
import sys


k = 'abcdefghijklmnopqrstuvwxyz'
alp = {}

for i in k:
    alp[i] = 0


s = input()

for i in s:
    if alp[i] == 0:
        alp[i] = 1
    else:
        print('no')
        sys.exit()

print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
n = len(s)
rs = sorted(s)
cnt = 0
ans = 'no'
for i in range(0, n-1):
    if rs[i] != rs[i+1]:
        cnt += 1
        if cnt == n-1:
            ans = 'yes'
            print(ans)
            exit()
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=str(input())
ss=[S[0]]

for i in range(1,len(S)):
    if S[i] in ss:
        print('no')
        break
    else:
        ss.append(S[i])

if len(S)==len(ss):
    print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def actual(s):
    for i in range(len(s)):
        for j in range(i + 1, len(s)):
            if s[i] == s[j]:
                return 'no'
    
    return 'yes'

s = input()
print(actual(s))

Submission status: Accepted

Solution code:
def actual(s):
    if len(set(s)) == len(s):
        return 'yes'

    return 'no'

s = input()
print(actual(s))

Submission status: Accepted

Solution code:
s = input()
check = True
for c in s:
    if s.count(c) > 1:
        check = False
        break
print('yes' if check else 'no')

Submission status: Accepted

Solution code:
S = input()
al = [0] * 26
s = ""
for s in S:
    al[ord(s) - 97] += 1

for a in al:
    if a >= 2:
        s = "no"
        break
    else:
        s = "yes"

print(s)

Submission status: Accepted

Solution code:
MM = input()
M = list(MM)
count = 0
for i in M:
  if M.count(i) >1:
    count =1
if count == 0:
  print('yes')
else:
  print('no')

Submission status: Accepted

Solution code:
s=list(input())
dic={}
for i in s:
  if i in dic:
    print('no')
    exit()
  else:
    dic[i]=1
print('yes')

Submission status: Accepted

Solution code:
S = input()
a = []
for s in S:
  if s in a:
    print("no")
    exit()
  else:
    a.append(s)

print("yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
for s in S:
    if S.count(s) > 1:
        print('no')
        exit(0)
print('yes')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()

words = list(s)

check = True

for j in range(len(words)):
    for i in range(len(words) - (j + 1)):
        if words[j] == words[j + i + 1]:
            check = False
            
            break

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

Submission status: Accepted

Solution code:
#31
import sys
S = input()
l = len(S)

for i in range(l):
    cou = 0
    for j in range(l):
        if S[i] == S[j]:
            cou +=1
    if cou == 2:
        print("no")
        sys.exit()
print("yes")

Submission status: Accepted

Solution code:
S = input()
S_list = [s for s in S]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
C = []
for i in range(len(S)):
  if S[i] in C:
    print('no')
    break
  C.append(S[i])
else:
  print('yes')

Submission status: Accepted

Solution code:
from collections import Counter
S = Counter(input())
print("yes" if set(S.values()) == {1} 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:
s = input()
c = set(s)
print('no' if len(s)!=len(c) else 'yes')