Problem:


Score : 100 points

Problem Statement

You are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.

Constraints

|S|=3

S consists of a, b and c.

Input

Input is given from Standard Input in the following format:

S

Output

If S can be obtained by permuting abc, print Yes; otherwise, print No.

Sample Input 1

bac

Sample Output 1

Yes

Swapping the first and second characters in bac results in abc.

Sample Input 2

bab

Sample Output 2

No

Sample Input 3

abc

Sample Output 3

Yes

Sample Input 4

aaa

Sample Output 4

No



Sample input:
bac


Sample output:
Yes

Submission status: Accepted

Solution code:
n = input()

lst = []
for i in range(3):
  lst.append(n[i])
  
lst.sort()

if lst == ["a", "b", "c"]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=''.join(sorted(input()))
if s=='abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = ''.join(sorted(input()))
if s == 'abc':
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

S = input()

if "a" in S and "b" in S and "c" in S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=list(input())
s.sort()
s="".join(s)

if s=="abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=input()
print("Yes"if len(set(s))==3 else "No")

Submission status: Accepted

Solution code:
s = input()

if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

if len(set(list(s))) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()

if s[0] != s[1] and s[0]!=s[2] and s[1]!=s[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

def resolve():
    if set(input())=={'a','b','c'}:
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

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

def resolve():
    s=input()
    if s in ['abc','acb','bca','bac','cab','cba']:
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

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

def resolve():
    s=input()
    if s.count('a')==s.count('b')==s.count('c')==1:
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

Solution code:
a=sorted(list(input()))
if a==["a","b","c"]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
if sorted(input()) == ['a', 'b', 'c']:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = input()
if len(set(s)) == 3: print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
print(['No', 'Yes'][0 if len(set(input())) < 3 else 1])

Submission status: Accepted

Solution code:
s = input()
s = sorted(s)
if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop

import collections

s = list(input())
s.sort()
ans = ""
for i in range(len(s)):
    ans += s[i]
if ans == "abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = set(list(input()))
print('Yes' if len(s) == 3 else 'No')

Submission status: Accepted

Solution code:
s = input()
x = s.count('a')
y = s.count('b')
z = s.count('c')

if x == y == z:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s=str(input())
a=len(s)
s=set(s)
if a==len(s):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S=input()
if ("a" in S) and ("b" in S) and ("c" in S):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S=input()
if len(set(S))==3:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = list(input())
s.sort()
l=['a','b','c']
print('YNeos'[s!=l::2])

Submission status: Accepted

Solution code:
s = list(input())
ans = 'Yes'
for i in ['a', 'b', 'c']:
    if i in s:
        continue
    ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
def main():
    s = input()
    cond = ''.join(sorted(s)) == 'abc'
    print('Yes' if cond else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = list(input())
if sorted(S) == sorted(["a","b","c"]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from heapq import heapify, heappop, heappush
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = list(input())
c = Counter(S)
if c["a"] > 0 and c["b"] > 0 and c["c"] > 0:
    if c["a"] == c["b"] == c["c"]:
        print("Yes")
        exit()
print("No")

Submission status: Accepted

Solution code:
s = set(input())
if len(s) == 3:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
if len(list(set((sorted(S))))) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_tuple(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, read().split())))
    return ret


def read_col(H):
    '''
    H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return tuple(map(list, zip(*ret)))


def read_matrix(H):
    '''
    H is number of rows
    '''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, read().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right

# https://atcoder.jp/contests/abc093/tasks/abc093_a
S = input()
if len(set(S)) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#copy

s = input()
print("Yes" if "a" in s and "b" in s and "c" in s else "No")

Submission status: Accepted

Solution code:
s = list(input())
s.sort()
print('Yes'if s[0] == 'a' and s[1] == 'b' and s[2] == 'c' else 'No')

Submission status: Accepted

Solution code:
S=input()
print("Yes" if len(set(S))==3 else "No")

Submission status: Accepted

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

base=["a","b","c"]

if S==base:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N=input()
L=list(N)
L.sort()
if L[0]=='a' and L[1]=='b' and L[2]=='c':
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

  if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
    print('Yes')
  else:
    print('No')
  return

if __name__ == "__main__":
  resolve()

Submission status: Accepted

Solution code:
S = list(input())

if ('a' in S) and ('b' in S) and ('c' in S):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
print('YNeos'[''.join(sorted(input()))!='abc'::2])

Submission status: Accepted

Solution code:
s=sorted(list(input()))
if s==["a","b","c"]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=input()
a=list(s)
a.sort()
ss=""
for aa in a:
  ss+=aa
if ss=="abc":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=input()
aflag=0
bflag=0
cflag=0
for i in range(3):
  if s[i]=='a':
    aflag+=1
  if s[i]=='b':
    bflag+=1
  if s[i]=='c':
    cflag+=1
if aflag==1 and bflag==1 and cflag==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = set(input())
if S == {"a", "b", "c"}:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = list(input())
print("Yes" if len(set(s))==3 else "No")

Submission status: Accepted

Solution code:
S = "".join(sorted(list(input().strip())))
if S=="abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = set(list(input()))
if len(S) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = list(input())
s.sort()
print("Yes" if s == list("abc") else "No")

Submission status: Accepted

Solution code:
def main():
    S = input()
    if "".join(sorted(S)) == "abc":
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    print("Yes" if "".join(sorted(list(input()))) == "abc" else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    S=ST()
    if(len(Counter(S))==3):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = list(input())
if len(set(S))==3:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s= input()
k = sorted(s)
S = ''
for i in k:
  S += i
if S == 'abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
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, groupby
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
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()
print("Yes" if len(set(S))==3 else "No")

Submission status: Accepted

Solution code:
s=input()
print("Yes" if len(set(s))==3 else "No")

Submission status: Accepted

Solution code:
S = list(input())

if len(set(S)) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
a = 0
b = 0
c = 0
for i in range(len(s)):
    if s[i] == 'a':
        a += 1
    elif s[i] == 'b':
        b += 1
    elif s[i] == 'c':
        c += 1
if a == 1 and b == 1 and c == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# AtCoder
S = input()
if ''.join(sorted(S)) == 'abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
print('Yes' if 'a' in s and 'b' in s and 'c' in s else 'No')

Submission status: Accepted

Solution code:
s=str(input())
list=["a","b","c"]
S=[s[0],s[1],s[2]]
S.sort()
if S==list:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
if len(set(input())) == 3:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
if s[0] == s[1] or s[1] == s[2] or s[2] == s[0]:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

def main():
    s = ns()
    
    if set(s) == set(['a', 'b', 'c']):
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
    s = input()
    if len(set(s)) == 3:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print('Yes' if len(set(list(input())))==3 else 'No')

Submission status: Accepted

Solution code:
S=list(str(input()))
print('Yes' if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[0] else 'No')

Submission status: Accepted

Solution code:
s = sorted(input())
if s[0]=="a" and s[1]=="b" and s[2]=="c":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a=input()
b=list(a)
x=0
lis={"a":1,"b":5,"c":10}
for i in b:
    x=lis[i]+x
if x==16:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = set(input())
print(['No', 'Yes'][set('abc')==s])

Submission status: Accepted

Solution code:
S = input()
print("Yes" if len(set(S)) == 3 else "No")

Submission status: Accepted

Solution code:
s = input()
ca, cb, cc = 0, 0, 0
for i in range(3):
    if s[i] == 'a':
        ca += 1
    elif s[i] == 'b':
        cb += 1
    else:
        cc += 1

if ca == 1 and cb == 1 and cc == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    S = input()
    if len(set(S)) == 3:
        print("Yes")
    else:
        print("No")
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = input()
if len(set(S)) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S=input()
ans = ["abc","acb","bac","bca","cab","cba"]
if S in ans:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input()
ans = 'Yes'
if S[0] == S[1]:
    ans = 'No'
if S[0] == S[2]:
    ans = 'No'
if S[1] == S[2]:
    ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
S = list(input())
S.sort()
if S == ['a', 'b', 'c']:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
t = sorted(s)
if t[0] == 'a' and t[1] == 'b' and t[2] == 'c':
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s =input()
print("Yes" if ("a" in s) and ("b" in s) and ("c" in s) else "No")

Submission status: Accepted

Solution code:
S = input()
if S in ["abc", "acb", "bac", "bca", "cab", "cba"]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input()

if S.count("a") == 1 and S.count("b") == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
arr=str(input())
a = len([1 for x in arr if x=='a'])
b = len([1 for x in arr if x=='b'])
c = len([1 for x in arr if x=='c'])
if a==1 and b==1 and c==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s=input()
if "a" in s and "b" in s and "c" in s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = input()
print('Yes' if len(set(s)) == 3 else 'No')

Submission status: Accepted

Solution code:
s = input()

print("Yes" if len(set(s))==3 else "No")

Submission status: Accepted

Solution code:
a=input()
if len(set(a))==3:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S=list(input())
S2 = set(S)
abc = {"a","b","c"}
if S2 == abc:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()
if s.count("a") == 1 and s.count("b") == 1 and s.count("c") ==1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
N = sorted(list(input()))

if N == ["a","b","c"]:
  print("Yes")
  
else:
  print("No")

Submission status: Accepted

Solution code:
s = input()
if s[0] != s[1] and s[1] != s[2] and s[2] != s[0]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=list(input())

if s.count("a") == 1 and s.count("b") == 1 and s.count("c") == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=list(input())
b=list("abc")
a.sort()
if a==b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))

def main():
    s = IS()
    if 'a' in s and 'b' in s and 'c' in s: print('Yes')
    else: print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
if s[0] != s[1] and s[1] != s[2] and s[2] != s[0]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S=input()
if "a" in S and "b" in S and "c" in S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = input()
a = s.count('a')
b = s.count('b')
if a == b == 1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = str(input())
a = s.count('a')
b = s.count('b')
if a == b ==  1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = str(input())
a = s.count('a')
b = s.count('b')
c = s.count('c')
if a == b == c == 1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s=input()
print('Yes' if len(set(s))==3 else 'No')

Submission status: Accepted

Solution code:
N=input()
A=len(set(N))
print("Yes" if A ==3 else "No")

Submission status: Accepted

Solution code:

url = "https://atcoder.jp//contests/abc093/tasks/abc093_a"

def main():
    t = input()
    alp = ['a', 'b', 'c']
    for a in alp:
        if a in t:
            pass
        else:
            print('No')
            exit()
    print('Yes')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
print('Yes' if s.count('a')==s.count('b')==s.count('c')==1 else 'No')

Submission status: Accepted

Solution code:
s = input()

s = set(s)

if len(s) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
l = []
for i in range(len(s)):
    l.append(s[i])
print('Yes' if 'abc'==''.join(sorted(l)) else 'No')

Submission status: Accepted

Solution code:
def resolve():
    S = input()
    print("Yes" if S.count("a") == 1 and S.count("b") == 1 and S.count("c") == 1 else "No")

if '__main__' == __name__:
    resolve()

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 = iss()
    print('Yes' if len(set(s)) == 3 else 'No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
print("Yes" if s.count("a")==s.count("b")==s.count("c")==1 else "No")

Submission status: Accepted

Solution code:
S=input()
if sorted(S)==["a","b","c"]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=input()
x=0
y=0
z=0
for i in range(len(s)):
    if s[i]=="a":
        x+=1
    elif s[i]=="b":
        y+=1
    else:
        z+=1

if x==y==z:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
if 'a' in S and'b' in S and 'c' in S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=list(input())
if 'a' in(s) and 'b' in(s) and 'c' in(s):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = str(input())

if "a" in S and "b" in S and "c" in S and len(S) == 3:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input()

for i in "abc":
    if S.count(i) != 1:
        print('No')
        exit()
        
print('Yes')

Submission status: Accepted

Solution code:
S = input()
S = [s for s in S]
if len(set(S))==3:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
n = list(input())
if n.count('a')==1 and n.count('b')==1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = input()
 
if "a" in S and "b" in S and "c" in S:
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
S = input()
if (S[0] != S[1]) and (S[1] != S[2]) and (S[0] != S[2]):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
t = set(s)
if len(t) == 3:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
moji=list(input())
moji.sort()
a="".join(moji)

if a=="abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()

if S.count("a") == 1 and S.count("b") == 1 and S.count("c"):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

if s.count('a') and s.count('b') and s.count('c'):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = list(input())
S = ''.join(sorted(S))
print('Yes' if S == 'abc' else 'No')

Submission status: Accepted

Solution code:
S = input()

if "a" in S and "b" in S and "c" in S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = input()
print('Yes') if s.count('a') and s.count('b') and s.count('c') else print('No')

Submission status: Accepted

Solution code:
s = list(input())

if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
list = ['a','b','c']
if S[0] in list:
    list.remove(S[0])
    if S[1] in list:
        list.remove(S[1])
        if S[2] in list:
            print('Yes')
        else:
            print('No')
    else:
        print('No')
else:
    print('No')

Submission status: Accepted

Solution code:
s=input()
print('Yes' if len(set(s))==3 else 'No')

Submission status: Accepted

Solution code:
s = input()
ss = "".join(sorted(s))
if ss == "abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()

if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[0]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
if sorted(input())==['a', 'b', 'c']:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:

s = input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

if s=="abc" or s=="acb" or s=="bac" or s== "bca" or s=="cba" or s=="cab":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = input()
s_list = list(s)
s_list.sort()
s = "".join(s_list)
print("Yes" if s == "abc" else "No")

Submission status: Accepted

Solution code:
s = input()
a = list(s)
if len(a) == 3 and a.count("a") == 1 and a.count("b") == 1 and a.count("c") == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = set(input())
if set('abc') == S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
L = [s[0], s[1], s[2]]
L.sort()
S = "".join(L)
print("Yes") if S == "abc" else print("No")

Submission status: Accepted

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

    if 'a' in S and 'b' in S and 'c' in S:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S=input()
string="a","b","c"
if (S[0] != S[1]) and (S[1] != S[2]) and (S[0] != S[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s=set(input())
print(["No","Yes"][len(s)==3])

Submission status: Accepted

Solution code:
a=set(input())
print("Yes" if len(a)==3 else "No")

Submission status: Accepted

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

if ''.join(s) == "abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
abc = sorted(list(input()))
if "".join(abc)=="abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import itertools
def main():
  s = input()
  ans = False
  if s.count('a') == 1 and s.count('b') == 1 and s.count('c') == 1:
    ans = True
  print("Yes" if ans else "No")
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
s = str(input())

if (s =='abc' or s == 'acb' or s == 'bac' or s == 'bca' or s == 'cab' or s == 'cba'):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
n = input()
count = 0
if "a" in n and "b" in n and "c" in n:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = list(input())
print("Yes" if "a" in s and "b" in s and "c" in s else "No")

Submission status: Accepted

Solution code:
S = input()
if S == "abc" or S == "acb" or S == "bac" or S == "bca" or S == "cab" or S == "cba": print("Yes")
else: print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
S = input()
# print(S)
if 'a' in S and 'b' in S and 'c' in S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = set(input())
if len(s) == 3:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
s = str(input())
s = sorted(s)
s = ''.join(s)
if s == 'abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys

s = sys.stdin.readline().rstrip()
s = ''.join(sorted(s))

def main():
    ans = 'Yes' if s == 'abc' else 'No'
    print(ans)

if __name__ ==  '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC 093: A – abc of ABC
s = input()
print('Yes' if s.count('a') == 1 and s.count('b') == 1 and s.count('c') == 1 else 'No')

Submission status: Accepted

Solution code:
s = input()
s = sorted(s)
s = "".join(s)

if s == "abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
ans = len(set(input()))
if ans == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
l = []
m = ["a", "b", "c"]
ans = "Yes"

for i in range(3):
    l.append(s[i])

l = sorted(l)

for i in range(3):
    if l[i] != m[i]:
        ans = "No"

print(ans)

Submission status: Accepted

Solution code:
S = input()

if (S[0]== "a" or S[1] == "a" or S[2] == "a") and (S[0]== "b" or S[1] == "b" or S[2] == "b") and (S[0] == "c" or S[1] == "c" or S[2] == "c") :
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = input()
    b = []
    for i in a:
        b.append(i)

    aset = set(b)

    if len(aset) ==3:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
if ''.join(sorted(input())) == 'abc':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import math

a=input()
a=sorted(a)
print("Yes" if a==["a","b","c"] else "No")

Submission status: Accepted

Solution code:
s= input()
if len(set(s))==3:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
S=input()
line=set(S)
if len(line)==3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
print('Yes' if ('a' in S) == True and ('b' in S) == True and ('c' in S) == True else 'No')

Submission status: Accepted

Solution code:
S=str(input())
if S[0]!=S[1] and S[1]!=S[2] and S[2]!=S[0]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input()

if ( S[0]!=S[1]) and ( S[1]!=S[2]) and ( S[2]!=S[0]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
S = input()
if all(S.count(c) for c in "abc"):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
print('YNeos'[len(set(list(input())))!=3::2])

Submission status: Accepted

Solution code:
S = input()
if S=='abc' or S=='acb' or S=='bac' or S=='bca' or S=='cab' or S=='cba':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s = input()
if ''.join(sorted(s)) == 'abc':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = list(input())
S.sort()
a = "".join(S)
print("Yes" if a == "abc" else "No")

Submission status: Accepted

Solution code:
import sys

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 'a' in S and 'b' in S and 'c' in S else 'No')

Submission status: Accepted

Solution code:
x=input()
x=list(x)
x.sort()
if x[0]=='a' and x[1]=='b' and x[2]=='c':
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
s=list(input())
s.sort()
if s==["a","b","c"]:
        print("Yes")
else:
        print("No")

Submission status: Accepted

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

if s == ['a', 'b', 'c']:
  print('Yes')
else:
  print('No')