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:
s=input()
print('Yes'if s.count('a')==s.count('b')==s.count('c')else'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 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 set(s) == {'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[0] != s[2]:
  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')
#1文字目と2文字目　2文字目と3文字目　1文字目と3文字目
# 全て異なればOK?
# aaa bbb acc X
# abc bca cba O

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:
S = str(input())

ans = ["abc", "acb", "bac", "bca", "cab", "cba"]
if S in ans:
  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:
a = str(input())
s = set()
for x in a:
  s.add(x)
if len(s)==3:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

s.sort()

ans = ''.join(s)


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("YNeos"[len({*input()})<3::2])

Submission status: Accepted

Solution code:
s = input()
t = set(['a', 'b', 'c'])
u = set()
for i in s:
  u.add(i)
print('Yes' if t == u else 'No')

Submission status: Accepted

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

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 S == "abc":
    print("Yes")
elif S == "bac":
    print("Yes")
elif S == "acb":
    print("Yes")
elif S == "bca":
    print("Yes")
elif S == "cab":
    print("Yes")
elif S == "cba":
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
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)
INF = 10**9
mod = 10**9+7

S = list(s())
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 = str(input())
apple = []
for i in s:
    apple.append(i)
print("Yes" if len(apple) == len(set(apple)) else "No")

Submission status: Accepted

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

s = sorted(list(str(input())))

if ''.join(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 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 set(s) == set(['a','b','c']):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

# check
if S == {"a", "b", "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 = sorted(input())
if s[0] == 'a' and s[1] == 'b' and s[2] == 'c':
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    S = input().rstrip()

    if all(s in S for s in "abc"):
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
if S == 'abc':
    print('Yes')
elif S == 'acb':
    print('Yes')
elif S == 'acb':
    print('Yes')
elif S == 'bac':
    print('Yes')
elif S == 'bca':
    print('Yes')
elif S == 'cab':
    print('Yes')
elif S == 'cba':
    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()
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
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = sr()
kind = len(set(S))
bl = kind == 3
print('Yes' if bl else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np
import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial#, gcd
from bisect import bisect_left #bisect_left(list, value)
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep='\n')

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()
S = sorted(S)
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 = list(input())
if "".join(sorted(s)) == "abc":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s = set(input())
if s == set(['a', 'b', '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=len(set(input()));print('NYoe s'[s==3::2])

Submission status: Accepted

Solution code:
s = sorted(list(input()))
print('Yes' if ''.join(s) == 'abc' else '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 len(set(S)) == 3 :
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s=input()
l=list(set(s))
if len(l)==3:
  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:
def main():
    s = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    S = input()
    if sorted(list(S)) == sorted(list('abc')):
        return True
    return False
if main():
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
l = list(input())
print ('Yes') if set(l) == {'a','b','c'} 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 = input()
s = sorted(s)
v = ['a','b','c']
if s == v: print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
def actual(s):
    if (s[0] != s[1]) and (s[1] != s[2]) and (s[2] != s[0]):
        return 'Yes'

    return 'No'

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

Submission status: Accepted

Solution code:
def actual(s):
    if set(s) == {'a', 'b', 'c'}:
        return 'Yes'

    return 'No'

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
if n.count("a") == 1 and n.count("b") == 1 and n.count ("c") == 1:
    print("Yes")
else:
    print("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 = 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 = input()

c_a = s.count('a')
c_b = s.count('b')
c_c = s.count('c')

if c_a == c_b == c_c ==1:
  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('Yes' if ''.join(sorted([i for i in input()]))=='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 = sorted(input())

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

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

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

Submission status: Accepted

Solution code:
s = input()
s = [i for i in s]
s.sort()
print('Yes' if ''.join(s) == 'abc' 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:
print("Yes" if sorted(input()) == list("abc") else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

if 'a' in S:
    if 'b' in S:
        if 'c' in S:
            print('Yes')
            exit(0)
print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S= input()
ls = list(S)
ls.sort()
if ls == ["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:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    print('Yes') if s.count('a')==1 and s.count('b')==1 and s.count('c')==1 else print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=list(input())
s.sort()
if s[0]=="a" and s[1]=="b" and s[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 len(set(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:
s=input()
l=set([])
for i in s:
    l.add(i)
if l==set(['a','b','c']):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import re
s=input()
count=0
if re.search(r'a',s):
    count+=1
if re.search(r'b',s):
    count+=1
if re.search(r'c',s):
    count+=1
if count==3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = list(input())
li.sort()
s = ''
for i in li:
  s += i
if s == 'abc':
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import collections
counter = collections.Counter()

for i in input():
    counter[i]+=1

if len([i for i in counter.values() if i>=1]) ==3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import collections
counter = collections.Counter()

for i in input():
  	counter[i] += 1

if len([i for i in counter.values() if i >= 1]) == 3:
	print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

l=list(input())
l.sort()
# print(l)
if l==list('abc'):print('Yes')
else:print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('NYoe s'[set(input())=={'a','b','c'}::2])

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") == 1 and s.count("b") == 1 and s.count("c") == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


s = 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()
a = s.count("a")==1
b = s.count("b")==1
c = s.count("c")==1

print("Yes" if all([a, b, c]) else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
if "a" in x and "b" in x and "c" in x:
    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 = sorted(input())

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

Submission status: Accepted

Solution code:
S = input()
abc_combination = ["abc","acb","bac","bca","cab","cba"]
if S in abc_combination:
	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 = list(input())
if len(set(s)) == 3:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# Python3 (3.4.3)
import sys
input = sys.stdin.readline

# -------------------------------------------------------------
# function
# -------------------------------------------------------------


# -------------------------------------------------------------
# main
# -------------------------------------------------------------
S = list(input().rstrip())

print("Yes" if "".join(sorted(S))=="abc" else "No")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(['No', 'Yes'][''.join(sorted(list(input()))) == 'abc'])

Submission status: Accepted

Solution code:
from collections import Counter
a = Counter("abc")
if a==Counter(input()):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=str(input())
s=list(s)
s=list(set(s))
s.sort()
if len(s)>=3:
  if s[0]=="a" and s[1]=="b" and s[2]=="c":
    print("Yes")
  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:
def resolve():
	s = input()
	if 'a' in s and 'b' in s and 'c' in s:
		print('Yes')
	else:
		print('No')
resolve()

Submission status: Accepted

Solution code:
s = input()
t = []
for c in s:
  t.append(c)
if sorted(t) == ['a', 'b', 'c']:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed May 13 17:27:13 2020

@author: shinba
"""

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()
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 == "cab" or s == "cba":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s = input()
ok = True
for c in "abc":
    ok &= c in s

print('Yes' if ok 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 "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:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    S=list(input())
    S.sort()
    S=''.join(S)
    YesNo(S=='abc')
    

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_93_A()

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()
s = ''.join(sorted(s))
if s == 'abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
S = input()
print("Yes" if all(c in S for c in "abc") 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:
a=input()
if a=='abc' or a=='acb' or a=='bac' or a=='bca' or a=='cab' or a=='cba':
  print('Yes')
else:
  print('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:
a=input()
if ('a' in a)and('b'in a)and('c'in a):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# = map(int, input().split())
s = 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
import math

#a,b,c = map(int, input().split())
s = input()
li = [''] * 3
for i in range(3):
    li[i] = s[i]
li.sort()
li2 = ['a', 'b', 'c']
if (li == li2):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
s=list(input())
s = set(s)
sc = len(s)

if sc!=3:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
s = list(input())

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

s = set(input())
a = set(["a","b","c"])

print("Yes" if s == a else "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 = ''.join(sorted(list(input())))
if S == 'abc':
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion
print('Yes' if tuple([i for i in rs()]) in list(permutations('abc')) else '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 and C == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import Counter
s = list(input())
ans = Counter(s)
if ans['a']==1 and ans['b']==1 and ans['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()

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

Submission status: Accepted

Solution code:

S = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print('YNeos'[set(input())!=set('abc')::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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