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:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    S = list(_ for _ in input())
    S.sort()
    S = ''.join(S)
    if S == 'abc':        
        print('Yes')
    else:
        print('No')
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

S = s()
S = ''.join(sorted(S))

if S == 'abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:

S = input()

a = 0
b = 0
c = 0
o = 0

for i in S:

    if i == "a":
        a += 1


    elif i == "b":
        b += 1


    elif i == "c":
        c += 1

    else:
        o += 1

if a == 1 and b == 1 and c == 1 and o == 0:
    print("Yes")
else:
    print ("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = set(str(input()))
if s == set("abc"):
    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 = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

s = input()
s = "".join(sorted(s))

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

Submission status: Accepted

Solution code:
list1=list(input())
if set(list1)=={"a","b","c"}:
  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:
a,b,c=input()
L=sorted([a,b,c])
if L[0]+L[1]+L[2]=='abc':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
S = list(input())

check = [0, 0, 0]
for i in range(3):
    if S[i] == 'a':
        check[0] = 1
    if S[i] == 'b':
        check[1] = 1
    if S[i] == 'c':
        check[2] = 1

if sum(check) == 3:
    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 not(S[0] == S[1]) and not(S[1] == S[2]) and not(S[0] == S[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def abc():
    S = input().rstrip()
    print('Yes' if set(S) == {'a', 'b', 'c'} else 'No')


abc()

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:
# -*- coding: utf-8 -*-

def solve():
    s = input()
    if 'a' in s and 'b' in s and 'c' in s:
        return 'Yes'
    return 'No'

print(solve())

Submission status: Accepted

Solution code:
a = input()

if 'a' in a and 'b' in a and 'c' in a:
    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:
S = str(input())
if 'a' in S and 'b' in S and 'c' in S :
        print('Yes')
else :
        print('No')

Submission status: Accepted

Solution code:
s = ''.join(sorted(list(input().rstrip())))
if 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 = input()
l = ['a','b','c']
for c in s:
  if c in l:
    l.remove(c)
print('Yes' if l ==[] else 'No')

Submission status: Accepted

Solution code:
S=input()
a=0
b=0
c=0
for s in S:
  if s=='a':
    a=1
  elif s=='b':
    b=1
  elif s=='c':
    c=1
if a==1 and b==1 and c==1:
  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()
x=s.count('a')
y=s.count('b')
z=s.count('c')
if x==1 and y==1 and z==1:
  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:
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:
s = input()
if s.count("a") == 1 and s.count("b") == 1:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in s:
    li.append(i)

if len(set(li)) < 3:
    print("No")

else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(S: str):
    print(YES if len(set(S)) == 3 else NO)


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = list(input())
S.sort()
a = ''.join(S)
if a == 'abc':
	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=input()
if a.find("a")>=0and a.find("b")>=0and a.find("c")>=0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
lst = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(S: str):
    s = list(S)
    s.sort()
    if ''.join(s) == 'abc':
        ret = YES
    else:
        ret = NO
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
S_list = [S[0], S[1], S[2]]
print("Yes" if (len(set(S_list)) == 3) else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)


###############################################################################


def main():
    s = input()

    ss = [c for c in s]
    ss.sort()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = list(input())
a.sort(reverse=False)

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

Submission status: Accepted

Solution code:
S = input()
list = []
d = ["a" , "b" , "c"]

for i in S:
    list.append(i)
list.sort()

if list == d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = list(set(list(input())))
n.sort()
if 'abc' == ''.join(n):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input().rstrip()
a,b,c = 0,0,0
for i in range(3):
  if S[i] == "a":
    a += 1
  elif S[i] == "b":
    b += 1
  else:
    c += 1
print("Yes" if a == 1 and b == 1 and c == 1 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

S = input()

dic = {'a': False, 'b':False, 'c':False}

for i in range(len(S)):
    if S[i] in dic.keys():
        dic[S[i]] = True

if False not in dic.values():
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
ans = 0
for c in s:
  if c == "a":
    ans |= 1
  elif c == "b":
    ans |= 2
  else:
    ans |= 4
if(ans == 7):
  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")

Submission status: Accepted

Solution code:

import bisect





def main():
    a = list(input())
    if a[0] != a[1] and a[1] != a[2] and a[0] != a[2]:
        print('Yes')
    else:
        print('No')







if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

m=sorted(s)
k=''.join(m)

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

Submission status: Accepted

Solution code:
S = input()
isA = 0
isB = 0
isC = 0
for i in S:
    if i == 'a':
        isA += 1
    if i == 'b':
        isB += 1
    if i == 'c':
        isC += 1
if isA == 1 and isB == 1 and isC == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


a = str(input())
b = ["abc", "acb", "bac", "bca", "cab", "cba"]
if a in b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

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


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

solve()

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:
s=input()
print('Yes') if (s.count('a') == 1 and s.count('b') == 1) else print('No')

Submission status: Accepted

Solution code:
s = str(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 S in ['abc','bac','acb','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 and\
    S.count('c') == 1:
    print('Yes')
else:
    print('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()
cnt = 0
for i in range(3):
    if s[i] == "a":
        cnt += 1
    elif s[i] == "b":
        cnt += 2
    elif s[i] == "c":
        cnt += 4

if cnt == 7:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
flag=[0,0,0]
n=False
for i in s:
	i=ord(i)-97
	if(flag[i]==1):
		n=True
	else:
		flag[i]=1

if n:
	print('No')
else:
	print('Yes')

Submission status: Accepted

Solution code:


def read_input():
    s = input()
    return s

def submit():
    s = read_input()
    s = [c for c in s]
    s.sort()
    s = ''.join(s)

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

if __name__ == '__main__':
    submit()

Submission status: Accepted

Solution code:
s = input()
if s.find("a")!=-1 and s.find("b")!=-1 and s.find("c")!=-1:
  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=sorted(list(input()))
print("Yes" if s==['a','b','c'] else "No")

Submission status: Accepted

Solution code:
s = input()
ans = 0

if s.count('a') == 1:
  ans += 1
if s.count('b') == 1:
  ans += 1
if s.count('c') == 1:
  ans += 1

if ans == 3:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = 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=list(input())
print("Yes") if ("a" in s) and ("b" in s) and ("c" in s) else print("No")

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 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 = str(input())
if  "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
	S = input()
	m = set()
	for c in S:
		m.add(c)
	if len(m) == 3:
		print("Yes")
	else:
		print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s=input()
xyz=[s[0],s[1],s[2]]
xyz.sort()
if xyz[0]=="a" and xyz[1]=="b" and xyz[2]=="c":
    print("Yes")
else:
    print("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:
s = input()
if s.count('a') == 1 and s.count('b') == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

s = list(input())

if len(set(s))==4:
    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:
s=list(input())
s.sort()
print("Yes" if s==['a','b','c'] else "No")

Submission status: Accepted

Solution code:
input_text = input()
x = set([input_text[0], input_text[1], input_text[2]])
if len(x) == 3:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S=input()
list=[S[0],S[1],S[2]]
if list[0]!=list[1]:
    if list[1]!=list[2]:
        if list[2]!=list[0]:
            if S=="abc" or S=="acb":
                print("Yes")
            elif S=="bac" or S=="bca":
                print("Yes")
            elif S=="cab" or S=="cba":
                print("Yes")
            else:
                print("No")
            exit()
print("No")

Submission status: Accepted

Solution code:
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


s = list(input())
s.sort()
if s == list('abc'):
    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:
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.count('a') == S.count('b') == S.count('c'):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
flag = True

for i in 'abc':
    if i not in S:
        flag = False

if flag:
    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:
s = raw_input()
if s[0] == s[1]:
    print"No"
elif s[0] == s[2]:
    print"No"
elif s[2] == s[1]:
    print"No"
else:
    print"Yes"

Submission status: Accepted

Solution code:
# ABC093A - abc of ABC
s = input()
if "a" in s and "b" in s and "c" in s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

s = input()

# ああ､これだと全部aのケースとかもYesになっちゃうからダメ｡
# if 'a' in s and 'a' in s and 'c' in s:
#     print('Yes')
# else:
#     print('No')


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

Submission status: Accepted

Solution code:
a=list(input())
print("Yes" if a[0]!=a[1] and a[0]!=a[2] and a[1]!=a[2] else "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.count('a') == 1 and S.count('b') == 1 and S.count('c') == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = list(input().strip())

b = all(i in S for i in 'abc')
print(b and 'Yes' or 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if len(set(input())) == 3:
	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')

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

sub = 'abc'
for  c in sub:
    if not c in S:
        print('No')
        quit()
print('Yes')

Submission status: Accepted

Solution code:
s = input()
ans = [0,0,0]
for i in range(3):
    if s[i:i+1] =="a":
        ans[0] += 1
    elif s[i:i+1] == "b":
        ans[1] += 1
    elif s[i:i+1] == "c":
        ans[2] += 1
if min(ans) == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = input()
if a[0]==a[1] or a[1]==a[2] or a[2]==a[0]:
  print("No")
else:
  print("Yes")

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(list(input())))

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

Submission status: Accepted

Solution code:
a = list(input())
if a[0] == a[1] or a[1] == a[2] or a[2] == a[0]:
    print("No")
else:
    print("Yes")

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.count('a') == S.count('b') == S.count('c') == 1 :
        print('Yes')
else :
        print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_text = input()
count_a = 0
count_b = 0
count_c = 0
for i in range(3):
    if input_text[i] == "a":
        count_a += 1
    elif input_text[i] == "b":
        count_b += 1
    else:
        count_c += 1

if count_a == 1 and count_b == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def MI(): return map(int, input().split())
def II(): return int(input())
def IS(): return input()
def LI(): return list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
s = input()

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

Submission status: Accepted

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import math


s = str(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()
c = 0
for i in 'abc':
  if s.count(i) == 1:
    c += 1
print('Yes' if c == 3 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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