AtCoder Beginner Contest 093 - abc of ABC

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-----
bac

-----Sample Output-----
Yes

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

Source: atcoder | Difficulty: EASY


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


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


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


S = str(input())
get_list = sorted(S)
abc_list = ['a', 'b', 'c']
if get_list == abc_list:
	print('Yes')
else:
	print('No')


n = input()
print('Yes') if set(n) == set('abc') else print('No')


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


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


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


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


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


print('YNeos'[len(set(input())) < 3::2])


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


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


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


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


S = input()
A = sorted(S)
hantei = ''.join(A)
if hantei == 'abc':
	result = 'Yes'
else:
	result = 'No'
print(result)


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


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


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


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


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


print(['No', 'Yes'][sorted(input()) == list('abc')])


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


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


print(['No', 'Yes'][len(set(list(input()))) == 3])


print('YNeos'[sorted(input()) != list('abc')::2])


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


moji = list(map(str, input().strip()))
print(('No', 'Yes')[len(set(moji)) == 3])


print(['No', 'Yes'][set('abc') == set(input())])


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


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


print('Yes' if ''.join(sorted(list(input()))) == 'abc' else 'No')


print('Yes' if sorted(input()) == sorted('abc') else 'No')


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


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


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


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


print(['No', 'Yes'][''.join(sorted(input())) == 'abc'])


print(['Yes', 'No'][not 3 == len(set(input()))])


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


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


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)


s = set(input())
print(['No', 'Yes'][len(s) == 3])


a = input()
print('Yes' if all((a.count(t) > 0 for t in 'abc')) else 'No')


s = len(set(input()))
print('NYoe s'[s == 3::2])


s = str(input())
if ord(s[0]) + ord(s[1]) + ord(s[2]) == ord('a') + ord('b') + ord('c'):
	ans = 'Yes'
else:
	ans = 'No'
print(ans)


import sys
from io import StringIO
import unittest

class TestClass(unittest.TestCase):

	def assertIO(self, input, output):
		(stdout, stdin) = (sys.stdout, sys.stdin)
		(sys.stdout, sys.stdin) = (StringIO(), StringIO(input))
		resolve()
		sys.stdout.seek(0)
		out = sys.stdout.read()[:-1]
		(sys.stdout, sys.stdin) = (stdout, stdin)
		self.assertEqual(out, output)

	def test_入力例_1(self):
		input = 'bac'
		output = 'Yes'
		self.assertIO(input, output)

	def test_入力例_2(self):
		input = 'bab'
		output = 'No'
		self.assertIO(input, output)

	def test_入力例_3(self):
		input = 'abc'
		output = 'Yes'
		self.assertIO(input, output)

	def test_入力例_4(self):
		input = 'aaa'
		output = 'No'
		self.assertIO(input, output)

def resolve():
	S = input()
	if 'a' in S and 'b' in S and ('c' in S):
		print('Yes')
	else:
		print('No')

def __starting_point():
	resolve()
__starting_point()


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


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


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


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


S = input()
print('Yes' if all((c in S for c in 'abc')) else 'No')


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


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


a = set(list(input().strip()))
print('Yes' if len(a) == 3 else 'No')


print(['No', 'Yes'][input() in 'abcab bacba'])


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


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


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


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


s = set(input())
t = {'a', 'b', 'c'}
print('Yes' if s == t else 'No')


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


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')
			return
	print('Yes')

def __starting_point():
	main()
__starting_point()


a = sorted(input())
a = ''.join(a)
print('Yes' if a == 'abc' else 'No')


s = list(input())
s.sort()
print('Yes' if s[0] + s[1] + s[2] == 'abc' else 'No')


print('YNeos'[set(map(str, input())) != {'a', 'b', 'c'}::2])


print('Yes' if ''.join(sorted(str(input()))) == 'abc' else 'No')


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


print('Yes' if {c for c in input()} == {'a', 'b', 'c'} else 'No')


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


def abc093a(input: str) -> str:
	str_list = ['abc', 'acb', 'bac', 'bca', 'cab', 'cba']
	if input not in str_list:
		return 'No'
	else:
		return 'Yes'
s = str(input())
print(abc093a(s))


print('Yes' if ''.join(sorted(input().strip())) == 'abc' else 'No')


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


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


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


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


import numpy as np
S = input()
s = [st for st in S]
if len(np.unique(s)) == 3:
	print('Yes')
else:
	print('No')


s = input()
print('NYoe s'['a' in s and 'b' in s and ('c' in s)::2])


S = str(input())
list_S = list(S)
if 'a' in list_S and 'b' in list_S and ('c' in list_S):
	print('Yes')
else:
	print('No')


abc = sorted(input())
print(['No', 'Yes'][abc == ['a', 'b', 'c']])


list01 = list(input())
list02 = list(set(list01))
if len(list02) == 3:
	print('Yes')
else:
	print('No')


print('NYoe s'[sum([ord(i) for i in input()]) == 294::2])


a = input()
print(['Yes', 'No'][len(set(a)) < 3])


S = input()
print('NYoe s'[all([s in S for s in 'abc'])::2])


s = input()
S = set([s[0], s[1], s[2]])
print('Yes' if len(S) == 3 else 'No')


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


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


A = input()
print('Yes' if ''.join(sorted(A)) == 'abc' else 'No')


S = input()
print(['No', 'Yes']['a' in S and 'b' in S and ('c' in S)])


s = set(input())
x = set(list('abc'))
print('Yes' if s == x else 'No')


print(sorted(list(input())) == list('abc') and 'Yes' or 'No')


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


(a, b, c) = input()
if a != b and b != c and (c != a):
	print('Yes')
else:
	print('No')


s = input()
print('Yes' if all([c in s for c in 'abc']) else 'No')


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


s = list(input())
print('YNeos'[len(set(s)) < 3::2])