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:
a = list(input())
a.sort()
#sortメソッドを使って、順番に並べる。
# たとえbcaでもcbaでもabcの順にしてくれる
if a[0] == 'a' and a[1] == 'b' and a[2] == 'c':
    print("Yes")
else:
    print("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()
ABC = (list(S))
ABC.sort()
# print(ABC)

if ABC == ["a","b","c"]:
    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:
print("Yes" if sorted(input()) == ["a","b","c"] else "No")

Submission status: Accepted

Solution code:
S = list(input())
S = set(S)
if len(S) == 3:
    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 = list(input())
S.sort()

if S == ['a', 'b', '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:
print(["No","Yes"]["".join(sorted(input()))=="abc"])

Submission status: Accepted

Solution code:
s = input()
s = ''.join(sorted(s))
if s == 'abc':
    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:
abc=input()
if abc.count('a')==1 and abc.count('b')==1 and abc.count('c')==1:
  print('Yes')
else:
  print('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:
if ''.join(sorted(input()))=="abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S = input()
S1 =len(set(S))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

S=input()

s = [st for st in S]
if len(np.unique(s)) == 3:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# A - abc of ABC
# https://atcoder.jp/contests/abc093/tasks/abc093_a

s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('Yes' if sorted(input()) == list('abc') 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()
if "".join(sorted(list(s))) == "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:
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:
# 093a

def atc_093a(input_value):
    try:
        input_value.index("a")
        input_value.index("b")
        input_value.index("c")
        return "Yes"
    except ValueError:
        return "No"

input_value = input()
print(atc_093a(input_value))

Submission status: Accepted

Solution code:
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 = str(input())
abc = S[0],S[1],S[2]
if "a" in abc and "b" in abc and "c" in abc:
    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:
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 = input()
if "a" in S and "b" in S and "c" in S:
    print( "Yes" )
else:
    print( "No" )

Submission status: Accepted

Solution code:
list01 = list(input())
list02 = list(set(list01))
if len(list02) == 3:
    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()
if len(set(n))==3:
  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 = str(input())

if S[0] != S[1] and S[0] != S[2] and S[1] != S[2]:
    result = 'Yes'
else:
    result = 'No'

print(result)

Submission status: Accepted

Solution code:
# A - abc of ABC

# 標準入力S
S = input()
abc_list = ["a", "b", "c"]

for i in S:
    if i in abc_list:
        abc_list.remove(i)

if len(abc_list) == 0:
    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:
# a,b,cからなる三文字のsを入力
s = input()
# 並べ替えたらabcになるならYes
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 = list(input())

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = str(input())

# S を abc を並び替えて作ることができるなら Yes を、そうでないなら No を出力せよ。

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

Submission status: Accepted

Solution code:
a,b,c=input()

if a!=b and b!=c and c!=a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
S=str(input())
S_list=sorted(S)
if S_list[0]+S_list[1]+S_list[2]=="abc":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# 文字列を取得死並び替え
S = str(input())

# 文字列の検査結果を出力
get_list = sorted(S)
abc_list = ["a","b","c"]
if get_list == abc_list:
    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:
import sys
sys.setrecursionlimit(10**9)

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
class Counter:
    def __init__(self):
        self.dict = {}

    def add(self,x):
        if x in self.dict: self.dict[x] += 1
        else: self.dict[x] = 1

    def decrement(self,x):
        self.dict[x] -= 1
        if self.dict[x] <= 0:
            del self.dict[x]

    def get_dict(self):
        return self.dict

def main():
    S=input()
    counter = Counter()
    for s in S:
        counter.add(s)

    d = counter.get_dict()
    for s in ['a','b','c']:
        if not s in d  or d[s] != 1:
            print("No")
            exit()
        
    print("Yes")






if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = str(input())

if S[0] != S[1] and S[0] != S[2] and S[1] != S[2]:
    result = 'Yes'
else:
    result = 'No'

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = list(input())
    s.sort()
    s = "".join(s)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S = str(input())
abc = [S[0], S[1], S[2]]
if "a" in abc and "b" in abc and "c" in 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:
S = input()
if set(S) == {'a', 'b', 'c'}:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
a_list = list(S)
a_ct = 0
b_ct = 0
c_ct = 0

for i in range(0,3):
    if a_list[i] == 'a':
        a_ct = a_ct + 1

for i in range(0,3):
    if a_list[i] == 'b':
        b_ct = b_ct + 1

for i in range(0,3):
    if a_list[i] == 'c':
        c_ct = c_ct + 1

if a_ct == 1 and b_ct == 1 and c_ct == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
A = sorted(S)
hantei = "".join(A)
#print(hantei)
                 
if hantei == "abc" :
    result = "Yes"
else:
    result ="No"
print(result)

Submission status: Accepted

Solution code:
word = input()

if word.count('a') == 1 and word.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[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()
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:
s = input()
ans = True
if "a" not in s:
    ans = False
if "b" not in s:
    ans = False
if "c" not in s:
    ans = False
    
if ans:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def resolve():
    s = input()
    a = s.find("a")
    b = s.find("b")
    c = s.find("c")
    if a != -1 and b != -1 and c != -1:
        print("Yes")
    else:
        print("No")
resolve()

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()
ans="Yes" if "a"in s and "b"in s and "c" in s else "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 = sorted(list(input()))

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

Submission status: Accepted

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

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:
#!/usr/bin/env python3

s = list(str(input()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().rstrip()
if ''.join(sorted(s)) == 'abc':
    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('a' in s and 'b' in s and 'c' in s):
    print("Yes")
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(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:
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 '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') == 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:
n = input()
print("Yes" if len(set(n)) == 3 else "No")

Submission status: Accepted

Solution code:
S=str(input())
X="abc"
Y=[]
for i in range(3):       
    if S[i] in X:
        if S[i] not in Y:
            Y.append(S[i])
if len(Y)==3:
    ans="Yes"
else:
    ans="No"
print(ans)

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:
L=list(input())
if len(set(L))==3:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
m=input()

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

Submission status: Accepted

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

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] != a[2] and a[0] != a[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = str(input())
dic = {}
dic.setdefault('a',0)
dic.setdefault('b',0)
dic.setdefault('c',0)
    
for i in range(len(s)):
    dic.setdefault(s[i],0)
    dic[s[i]] += 1

if dic['a']==1 and dic['b']==1 and dic['c']==1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
print(["No","Yes"][input()in"abcab bacba"])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
a = [0]*3
for i in s:
  if i=="a":
    a[0] += 1
  elif i == "b":
    a[1] += 1
  elif i =="c":
    a[2] +=1
 
if a[0]==a[1]==a[2] ==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:
print('NYoe s'[sum([ord(i) for i in input()])==294::2])

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:
#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)]
#a = [int(input()) for _ in range(n)]



s = sorted(input())

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

Submission status: Accepted

Solution code:
Sls = list(input())
if Sls.count('a') == 1 and Sls.count('b') == 1 and Sls.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 = input()
check =["a","b","c"]
_S = []
result =0
for i in S:
    _S.append(i)

for i in _S:
    if i in check:
        check.remove(i)
        result+=1

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

Submission status: Accepted

Solution code:

S = input()

if set(S) == set("abc"):
  print("Yes")
else:
  print("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(set(S)) == 3:
        print('Yes')
    else:
        print('No')

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = str(input())
a = ['a', 'b', 'c']
for i in s:
    if i not in a:
        print('No')
        exit()
    else:
        a.remove(i)
print('Yes')

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    S = input()
    S = sorted(S)
    if S == ['a','b','c']:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
l = []
for i in range(3):
  l += s[i]
if 'a' in l and 'b' in l and 'c' in l:
  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())
s1 = sorted(s)
if ''.join(s1) == 'abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

a = ['a','b','c']

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

Submission status: Accepted

Solution code:
S=list(input())
S.sort()
T=["a","b","c"]
if S==T:
  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=input()
if set(S)=={'a','b','c'}: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()

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

Submission status: Accepted

Solution code:
n=input()
if n=="abc"or n=="acb" or n=="bac" or n=="bca" or n== "cab" or n=="cba":
  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=="cab" or s=="cba":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
l = list(input())

print("Yes") if l.count("a") * l.count("b") * l.count("c") == 1 else print("No")

Submission status: Accepted

Solution code:
N=input()

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

Submission status: Accepted

Solution code:
n = input()
acount = 0
bcount = 0
ccount = 0
for s in n:
    if s == 'a':
        acount+=1
    if s == 'b':
        bcount+=1
    if s == 'c':
        ccount+=1
if acount == 1 & bcount == 1 & ccount == 1:
    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()
ans = 'Yes'
if 'a' not in s:
    ans = 'No'
if 'b' not in s:
    ans = 'No'
if 'c' not in s:
    ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
from itertools import permutations
from sys import exit
S=input()
for s in permutations('abc'):
  if S == ''.join(s):
    print('Yes')
    exit(0)
print('No')

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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

Submission status: Accepted

Solution code:
a = list(input())

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

Submission status: Accepted

Solution code:
print(sorted(list(input())) == list("abc") and "Yes" or "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

t1 = s.count('a')
t2 = s.count('b')
t3 = s.count('c')

if t1 == 1 and t2 == 1 and t3 == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import Counter
s = Counter(list(input()))
if len(s)==3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()

if S.count("a") == 1and S.count("b") == 1and S.count("c") == 1:
    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 = 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.count("a") and S.count("b") and S.count("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:
print("Yes" if len(set(input()))==3 else "No")

Submission status: Accepted

Solution code:
a = input()
if ''.join(sorted(a)) == "abc":
  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()

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

Submission status: Accepted

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

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

    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=list(set(list(input())))
if len(S)==3:
    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()
flagA = False
flagB = False
flagC = False
for i in range(3):
  if S[i] == "a":
    flagA = True
  elif S[i] == "b":
    flagB = True
  elif S[i] == "c":
    flagC = True
  else:
    pass
if flagA and flagB and flagC:
  print("Yes")
else:
  print("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()
print("Yes" if s[0] != s[1] != s[2] != s[0] else "No")

Submission status: Accepted

Solution code:
a = input()

aa = ''.join(list(sorted(a)))

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

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

s = sorted(read().decode().rstrip())
print('Yes' if ''.join(s) == 'abc' 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()
print('Yes' if S.count('a') == S.count('b') == S.count('c') == 1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
check = list(input())
check.sort()
abc = ["a","b","c"]
if check == abc:
    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:
s = sorted(input())
ans = "Yes" if s == list("abc") else "No"
print(ans)

Submission status: Accepted

Solution code:
S = sorted(input())
if S[0]+S[1]+S[2] == 'abc':
    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()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('NYoe s'[sorted(list(input()))==list('abc')::2])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    S = input()
    ans = set()
    for c in S: ans.add(c)
    if ans == {'a', 'b', 'c'}:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
S = list(input())
if len(S) != 3:
    sys.exit


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