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

if bool(s) is not True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


    

if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

count = 0
for c in S:
    if c == 'a':
        count += 1
    elif c == 'b':
        count += 2
    elif c == 'c':
        count += 4
if count == 7:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = input()
if 'a' in n and 'b' in n and 'c' in n:
  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:
s = input()
ans="Yes"
if s[0]==s[1] or s[0]==s[2] or s[1]==s[2]:
    ans = "No"
print(ans)

Submission status: Accepted

Solution code:
s = raw_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 -*-

# AtCoder Beginner Contest
# Problem A

if __name__ == '__main__':
    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 -*-
"""
A - abc of ABC
https://beta.atcoder.jp/contests/abc093/tasks/abc093_a

"""
import sys
from sys import stdin
input = stdin.readline


def main(args):
    S = input().strip()
    if 'a' in S and 'b' in S and 'c' in S:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main(sys.argv[1:])

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

list=["abc","acb","bac","bca","cab","cba"]

if s in list: 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 '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 = raw_input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
import sys

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

Submission status: Accepted

Solution code:
s = list(input())

if set(s) == {'a', 'b', 'c'}:
    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 = list(input())
if 'a' in S and 'b' in S and 'c' in S:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, k = map(int, input().split())
x = [i for i in range(a, b+1)]
if len(x) <= 2 * k:
  ans = x
else:
  ans = x[:k] + x[-k:]

for i in ans:
  print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
A,B,K = map(int,input().split())
if not (1 <= A <= B <= 10 ** 9):
    sys.exit()
if not (1 <= K <= 100):
    sys.exit()

result = list(range(A,B+1))[0:K] + list(range(A,B+1))[-K:]
result = list(set(result))
result.sort()
for I in result:
    print(I)

Submission status: Runtime Error

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: Runtime Error

Solution code:
def actual(A, B, C, X):
    count = 0

    for n_500yen in range(A + 1):
        for n_100yen in range(B + 1):
            for n_050yen in range(C + 1):
                amount = 500 * n_500yen + 100 * n_100yen + 50 * n_050yen

                if amount == X:
                    count += 1

    return count

A = int(input())
B = int(input())
C = int(input())
X = int(input())

print(actual(A, B, C, X))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = input()
if S == 'abc':
    return 'Yes'
elif S == 'acb':
    return 'Yes'
elif S == 'acb':
    return 'Yes'
elif S == 'bac':
    return 'Yes'
elif S == 'bca':
    return 'Yes'
elif S == 'cab':
    return 'Yes'
elif S == 'cba':
    return 'Yes'
else:
    return 'NO'

Submission status: Runtime Error

Solution code:
S = input()
if S == 'abc':
    return Yes
elif S == 'acb':
    return Yes
elif S == 'acb':
    return Yes
elif S == 'bac':
    return Yes
elif S == 'bca':
    return Yes
elif S == 'cab':
    return Yes
elif S == 'cba':
    return Yes
else:
    return NO

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
def main():
  s = input()
  if s = 'abc' or s = 'bca' or s = 'cab':
    print('Yes')
  else:
    print('No')

if __name__ == '__main__':
  main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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: Runtime Error

Solution code:
# C - Same Integers
# https://atcoder.jp/contests/abc093/tasks/arc094_a

nums = list(map(int,input().split()))
abc= sum(nums)
X = max(nums)


if X%2 != abc%2:
    X += 1
print((3*X - abc)//2)


# 増加させるかず -> 3X - abc
# 捜査回数      -> (3X - abc) //2

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding: utf-8
# hello worldと表示する
#dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

lis=sorted(LI())
count=0
while lis[0]+2<lis[2]:
    lis[0]+=2
    count+=1
while lis[1]+2<lis[2]:
    lis[1]+=2
    count+=1
#print(count)
#print(lis)
u=lis[0]
for i in range(3):
    lis[i]-=u
#print(lis)
lis.sort()
ad=1
if lis==[0,0,0]:
    ad=0
elif lis==[0,0,1]:
    ad=1
elif lis==[0,1,1]:
    ad=2
elif lis==[0,1,2]:
    ad=3
elif lis==[0,0,2]:
    ad=2
elif lis==[0,2,2]:
    ad=1
print(count+ad)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

a, b, c = input()

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

Submission status: Runtime Error

Solution code:

a, b, c = input()

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

Submission status: Runtime Error

Solution code:

S = input()

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a, b, c = sorted(map(int, input().split()))
print(c - b + (b-a)//2 + (b-a)%2*2)

Submission status: Runtime Error

Solution code:
a,b,c = map(int, input().split())
A = [a,b,c]
A.sort()

if (((A[2]-A[1])%2==0) and ((A[2]-A[0])%2==0)) or (((A[2]-A[1])%2==1) and ((A[2]-A[0)]%2==1)):
    print(int(A[2]-(A[0]+A[1])/2))
else:
    print(int(A[2]-(A[0]+A[1])/2+3/2))

Submission status: Runtime Error

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

S = input()
print("Yes" if length(set(A))==3 else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = [int(i) for i in input().split()]
A.sort()
s,m,l = A
count = 0
ls = l-s
lm = l-m
count += ls//2 + lm//2
if ls%2 == 0 and lm%2 == 0:
  print(count)
  exit()
elif ls%2 == 1 and lm%2 == 1:
  count += 1
  print(count)
else:
  count += 2
  print(count)

Submission status: Runtime Error

Solution code:
A = [int(i) for i in input().split()]
s,m,l = A.sort()
count = 0
ls = l-s
lm = l-m
count += ls//2 + lm//2
if ls%2 == 0 and lm%2 == 0:
  print(count)
  exit()
elif ls%2 == 1 and lm%2 == 1:
  count += 1
  print(count)
else:
  count += 2
  print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b;return true;}return false;}
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

int main() {
    string s;
    cin >> s;
    sort(all(s));

    if (s == "abc") cout << "Yes" << endl;
    else cout << "No" << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B,K=map(int,input().split())
C=set()
for i in range(A,A+K):
    C.add(i)
for t in range(B-K-1,B+1):
    C.add(t)
for s in C:
    print(s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
moji=input()

if moji.sort()=="abc":
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def solve():
    ABC = list(sorted(map(int, input().split())))

    # 最初にプラス1で近づける
    A, B, C = ABC[0], ABC[1], ABC[2]

    a, amod = divmod((C-A),2)
    b, bmod = divmod((C-B),2)
    A += a * 2
    B += b * 2

    if C == A and C == B:
        return a + b
    elif C > A and C > B:
        return a + b  
    elif C > A and C == B:
        return a + b + 2
    elif C > B and C == A :
        return a + b + 2
    else:
        return 0
def main():
    print(solve())

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def solve():
    ABC = list(sorted(map(int, input().split())))

    # 最初にプラス1で近づける
    A, B, C = ABC[0], ABC[1], ABC[2]

    a, amod = divmod((C-A),2)
    b, bmod = divmod((C-B),2)
    A += a * 2
    B += b * 2

    if C == A and C == B:
        return a + b
    elif C > A and C > B:
        return a + b  
    elif C > A and C == B:
        return a + b + 2
    elif C > B and C == A :
        return a + b + 2
    else:
        return 0

def main():
    print(solve())

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
s = input()

s = sorted()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#A,B,K = [int(i) for i in input().rstrip().split()]
A,B,K = list(map(int, input().rstrip().split()))

#nums=[i for i in range(A,B+1)]
nums=list(range(A,B+1))

if K <= len(nums)//2:
  print(*(nums[:K] + nums[-K:]),sep="\n")
else:
  print(*nums,sep="\n")

Submission status: Runtime Error

Solution code:
a,b,k=map(int,input().split())
r1=[i for i in range(a,min(b+1,a+k))]
r2=[i for i in range(max(a,b-k+1),b+1)]
r1.extend(r2)
result=set(r1)
for i in sorted(result):
    print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=map(int,raw_input().split())
sa=0
sb=0
sc=0
for i in range(len(s)):
  if s[i]=="a":
    sa+=1
  if s[i]=="b":
    sb+=1
  if s[i]=="c":
    sc+=1
if sa==1 and sb==1 and sc==1:
    print "Yes"
else: 
    print "No"

Submission status: Runtime Error

Solution code:
s=map(int,raw_input().split())
sa=0
sb=0
sc=0
for i in range(len(s)):
  if s[i]=="a":
    sa+=1
  if s[i]=="b":
    sb+=1
  if s[i]=="c":
    sc+=1
if sa==1 and sb==1 and sc==1:
    print "Yes"
else: 
  print "No"

Submission status: Runtime Error

Solution code:
s=map(int,raw_input().split())
sa=0
sb=0
sc=0
for i in range(len(s)):
  if s[i]=="a":
    sa+=1
  if s[i]=="b":
    sb+=1
  if s[i]=="c":
    sc+=1
if sa=1 and sb=1 and sc=1:
    print "Yes"
else: 
  print "No"

Submission status: Runtime Error

Solution code:
s=raw_input()
sa=0
sb=0
sc=0
for i in range(len(s)):
  if s[i]=="a":
    sa+=1
  if s[i]=="b":
    sb+=1
  if s[i]=="c":
    sc+=1
if sa=1 and sb=1 and sc=1:
    print "Yes"
else: 
  print "No"

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S = sorted(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
s = input()
print("Yes" if s.count["a"]*s.count["b"]*s.count["c"] == 1 else "No")

Submission status: Runtime Error

Solution code:
s=sorted(input())
ans="abc"
flag=1
for i in range(3)
	if s[i] != ans[i]:
    	print("No")
        flag=0
    	break
if flag==1:
  print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
//typedef boost::multiprecision::cpp_int ll;
typedef long double dd;

#define i_7 (ll)(1E9+7)
//#define i_7 998244353
#define i_5 i_7-2
ll mod(ll a){
    ll c=a%i_7;
    if(c>=0)return c;
    return c+i_7;
}
 
typedef pair<ll,ll> l_l;
ll inf=(ll)1E16;
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define pb push_back
ll max(ll a,ll b){if(a<b)return b;else return a;}
ll min(ll a,ll b){if(a>b)return b;else return a;}

void Max(ll &pos,ll val){pos=max(pos,val);}//Max(dp[n],dp[n-1]);
void Min(ll &pos,ll val){pos=min(pos,val);}
void Add(ll &pos,ll val){pos=mod(pos+val);}
dd EPS=1E-9;
#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define fi first
#define se second
////////////////////////////

int main(){fastio
    
    return 0;
}

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())

def search(a,b,c):
    lst = [0,0,0]
    if a%2 == b%2:
        lst = [1,1,0]
        if a%2==c%2:
            lst = [1,1,1]
    elif a%2 == c%2:
        lst = [1,0,1]
    else:
        lst = [0,1,1]
    return lst


def make(a,b,c):
    lst = [a,b,c]
    lst.sort()
    lst[0] += 2
    return lst[0],lst[1],lst[2]

if __name__ == "__main__":
    ans = 0
    l = search(a,b,c)
    if sum(l) == 3:
        pass
    else:
        ans += 1
        a += l[0]
        b += l[1]
        c += l[2]
    while a != b or a != c:
        a,b,c = make(a,b,c)
        ans += 1
    print(ans)

Submission status: Runtime Error

Solution code:
lst1 = list(input())
iflen(lst1) != 3:
    print("No")
    exit()
for i in ["a","b","c"]:
    if not i in lst1:
        print("No")
        exit()
print("Yes")

Submission status: Runtime Error

Solution code:
a, b, c = (i for i in input().split())
if ord(a) + ord(b) + ord(c) == ord('a') + ord('b') + ord('c'):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s = input()
na = 0
nb = 0
nc = 0
for c in s:
  if c == 'a': na += 1
  if c == 'b': nb += 1
  if c == 'c': nc += 1

if a == b == c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s = input()
a = 0
b = 0
c = 0
for c in s:
  if c == 'a': a += 1
  if c == 'b': b += 1
  if c == 'c': c += 1

if a == b == c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s = input()
a = b = c = 0
for c in s:
  if c == 'a': a += 1
  if c == 'b': b += 1
  if c == 'c': c += 1

if a == b == c:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
s=input().strip()
a=[]
for i in range(3):
    a.append(s[i])
a.sort()
if a[0]=="a" and a[1]=="b" and a[2]="c":
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = str(input())

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

Submission status: Runtime Error

Solution code:
s = str(input())

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

Submission status: Runtime Error

Solution code:
s = str(input())

print('Yes' if s.count(a)+s.count(b) == 2 else 'No')

Submission status: Runtime Error

Solution code:
s = str(input())

print('Yes' if s.count(a)+s.count(b)==2 else 'No')

Submission status: Runtime Error

Solution code:
s = str(input())

print('Yes' if s.count(a)+s.count(b)=2 else 'No')

Submission status: Runtime Error

Solution code:

def main()->None:
    L = list(map(int, input().split()))
    print(L)
    L.sort()
    count = 0
    # 最大値が偶数の時
    if L[2] % 2 == 0:
        L[0] += 1
        L[2] += 1
        count += 1
        flag = True
        while flag:
            L[0]+=1
            L[1]+=1
            count += 1
            if L[1] == L[2]:
                flag = False
    # 最大値が奇数の時
    else:
        flag = True
        while flag:
            L[0] += 1
            L[1] += 1
            count += 1
            if L[1] == L[2]:
                flag = False
        flag = True
        while flag:
            L[0] += 2
            count += 1
            if L[0] == L[2]:
                flag = False
    print(count)




if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
L=list(map(int,sys.stdin.readline().split()))
cnt=0
while True:
  L.sort()
  if L[2]-L[0]>=2:
    L[0]+=2
  elif L[2]-L[1]>=2:
    L[1]+=2
  elif L[0] !=L[1] or L[1] !=L[2]:
    L[0]+=1
    L[1]+=1
  if L[0]==L[1]==L[2]:
    break
  cnt+=1
  
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, K = map(int, input().split())
lst1 = list(range(A, A+K))
lst2 = list(range(B-K+1, B+1))
ans = set(lst1 + lst2)
ans = list(sorted(ans))
for i in ans:
  print(i)

Submission status: Runtime Error

Solution code:
L=[cha[i] for i in int().split()]
sorted.L
if L=='abc':
  print('Yes')
else :
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from sys import stdin
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return [x for x in mi()]
def si(): return stdin.readline()
a=si()
print('Yes' if 'a' in a and 'b' in a and 'c' in a else 'No')

Submission status: Runtime Error

Solution code:
from sys import stdin
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return [x for x in mi()]
def si(): return stdin.readline()
a=list(input())
print('Yes' if sorted(a)==['a', 'b', 'c'] else 'No')

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
if a >= 1 and b >= 1 and a <= 9 and b <= 9:
    print("Yes")
    exit()
print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A, B, K = map(int, input().split())
if B-A+1 >= 2*K: 
    res_list = [i for i in range(A, A+K)] + [i for i in range(B-K+1, B+1)]
else: 
    res_list = [i for i in range(A, B+1)]
for i in res_list:
    print(i)

Submission status: Runtime Error

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