Problem:


Score : 100 points

Problem Statement

Takahashi has K 500-yen coins. (Yen is the currency of Japan.)
If these coins add up to X yen or more, print Yes; otherwise, print No.

Constraints

1 \leq K \leq 100

1 \leq X \leq 10^5

Input

Input is given from Standard Input in the following format:

K X

Output

If the coins add up to X yen or more, print Yes; otherwise, print No.

Sample Input 1

2 900

Sample Output 1

Yes

Two 500-yen coins add up to 1000 yen, which is not less than X = 900 yen.

Sample Input 2

1 501

Sample Output 2

No

One 500-yen coin is worth 500 yen, which is less than X = 501 yen.

Sample Input 3

4 2000

Sample Output 3

Yes

Four 500-yen coins add up to 2000 yen, which is not less than X = 2000 yen.



Sample input:
2 900


Sample output:
Yes

Submission status: Runtime Error

Solution code:
import itertools

n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
ls = list(itertools.permutations(range(1,n+1)))

print(abs(ls.index(p)-ls.index(q)))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define rep(i,s,n) for (ll i = s; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int,int>;

int main() {
  int k,x;
  cin >> k >> x;
  if (k*500 >= x) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}

Submission status: Runtime Error

Solution code:
4 2000

Submission status: Runtime Error

Solution code:
K, X = map(int, input().split())
if 500*K >= X:
  print("Yes")
else;
  print("No")

Submission status: Runtime Error

Solution code:
K, X = list(map(int, input()))

if K * 500 >= X:
  	print('Yes')
else:
  	print('No')

Submission status: Runtime Error

Solution code:
k,x = map(int,input().split())
if k*500 >= X:  
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
k,x = map(int,input().split())
if k*500 >= X:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N=input()
N=int(N)
S=input()
count=0
for i in range(N-2):
  if S[i]=="A" and S[i+1]=="B" and S[i+2]=="C":
    count=count+1
print(count)

Submission status: Runtime Error

Solution code:
k,x = map(int,input())

if 500*k >= x:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
k,x = mnap(int,input())

if 500*k >= x:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
K = input()
X = input()

if (X <= 500*K):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:

K = input()
X = input()

if (X <= 500*K):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
b, c = list(map(int, input().split()))
if 500 * b => c :
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(input())
count = 0
if n % 3 != 0 and n >= 3:
  for i in range (1,n):  
    if s[i-1] == 'A' and s[i] == 'B' and s [i+1] == 'C':
      count += 1
elif n % 3 == 0 and n >= 3:
  for i in range(1, n-1):
    if s[i-1] == 'A' and s[i] == 'B' and s [i+1] == 'C':
      count += 1
if n == 2:
  print(0)
else:
  print(count)

Submission status: Runtime Error

Solution code:
from itertools import permutations

N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
num_P = 0
num_Q = 0

li = list(permutations(range(1, N + 1)))

#print(P, Q, li)
print(abs(li.index(P) - li.index(Q)))
#print(li)
#print(li.index(P))
#print(li.index(Q))

Submission status: Runtime Error

Solution code:
k,x = map(int,input().split)
print("Yes" if 500*k>=x else "No")

Submission status: Runtime Error

Solution code:
n, s = map(int, input())
print("Yes" if 500*n >= s else "No")

Submission status: Runtime Error

Solution code:
K, X = map(int, input().split())
wealth = 500 * K
if K >= X:
  print('Yes")
else:
  print('No')

Submission status: Runtime Error

Solution code:
K, X = int(input())
wealth = 500 * K
if K >= X:
  print('Yes")
else:
  print('No')

Submission status: Runtime Error

Solution code:
def solve(n,s):
  cnt = 0
  for i in range(len(s)-2):
    if "A" == s[i] and "B" == s[i+1] and "C" == s[i+2]:
      cnt+=1
  return cnt
 
n = int(input())
s = input()
ans = solve(n,s)
print(ans)

Submission status: Runtime Error

Solution code:
N=int(input())
s=input()
 
print(s.count('ABC'))

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
 
print(S.count('ABC'))

Submission status: Runtime Error

Solution code:
K,X=map(int, input().split())
if 500*K >=X:
    print("yes")
else*
    print("No")

Submission status: Runtime Error

Solution code:
def main():
    n = int(input())
    s = input()

    prev = ''
    c = 0

    for i in s:
        if prev == '':
            if i == 'A':
                prev = 'A'
        elif prev == 'A':
            if i == 'A':
                pass
            elif i == 'B':
                prev = 'B'
            else:
                i == ''
        elif prev == 'B':
            if i == 'A':
                prev = 'A'
            elif i == 'C':
                c += 1
                prev = ''
            else:
                prev = ''

    print(c)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
k=int(input())
x=int(input())
if 500*k>=x:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
K,N=map(int,input().split())
if 500*K>=X:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
k, x = int(input())
if 500 * k >= x:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
def f(A,N,k,x):
  C=[A[(i+k)%N]^x for i in range(N)]
  return C

import numpy as np
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))

M=max(A+B)
Msup=2**(int(np.log2(M)+1))

for k in range(0,N):
  for x in range(0,Msup+1):
    if f(A,N,k,x)==B:
      print(k,"",x)

Submission status: Runtime Error

Solution code:
K,X=int(input().split())
if K*500>=X:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
A=list(map(int,input().split()))
B=[A[i]//2 for i in range(len(A))]

from fractions import gcd 
x=B[0]
for i in range(1,N):
  x=(x*B[i])//gcd(x,B[i])
lcm=x  
if all((lcm//b)%2==1 for b in B):
  Max=M//lcm
  if MaX%2==1:
    print((Max+1)//2)
  else:
    print((Max)//2)
else:
  print(0)

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
A=list(map(int,input().split()))
B=[A[i]//2 for i in range(len(A))]

import math
ans=B[0]
for i in range(1,N):
  ans=math.gcd(ans,B[i])
mul=B[0]//ans
for j in range(1,N):
  mul=mul*(B[j]//ans)
lcm=ans*mul

if all((lcm//b)%2==1 for b in B):
  Max=M//lcm
  if MaX%2==1:
    print((Max+1)//2)
  else:
    print((Max)//2)
else:
  print(0)

Submission status: Runtime Error

Solution code:
N=int(input())
P=list(map(int,input().split()))
Q=list(map(int,input().split()))

def mul(n):
  s=1
  for t in range(1,n+1):
    s=s*t
  return s

def f(x):
  result=0
  M=len(x)
  for i in range (x):
    k=0
    for j in range(i,M):
      if x[i]>x[j]:
        k=k+1
    result=result+k*mul(M-i-1)
  return result

print(abs(f(P)-f(Q)))

Submission status: Runtime Error

Solution code:
N=int(input())
P=list(map(int,input().split()))
Q=list(map(int,input().split()))

def mul(n):
  s=1
  for t in range(1,n+1):
    s=s*t
  return s

def f(x):
  result=0
  M=len(x)
  for i in range (x):
    k=0
    for j in range(i,M):
      if x[i]>x[j]:
        k=k+1
      result=result+k*mul(M-i-1)
  return result

print(f(P)-f(Q))

Submission status: Runtime Error

Solution code:
k,x = map(int,input().spleit())

if x =< k*500:
  print('Yes')

else:
  print('No')

Submission status: Runtime Error

Solution code:
k,x = map(int,input().spleit())

if x <= k*500:
    print('Yes')

else:
    print('No')

Submission status: Runtime Error

Solution code:
k,x = map(int,input().spleit())

if x =< k*500:
    print('Yes')

else:
    print('No')

Submission status: Runtime Error

Solution code:
import itertools

N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
permutation = list(itertools.permutations([x for x in range(1, N + 1)]))

a = permutation.index(P) + 1
b = permutation.index(Q) + 1
print(abs(a - b))

Submission status: Runtime Error

Solution code:
k,x=map(int, input()split())

if 500*k >= x:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
k. x = map(int, input().split())
if k*500 >= x:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N = int(input())
cha = input()
print(cha.count("ABC"))

Submission status: Runtime Error

Solution code:
N = list(map(int,input().split(" ")))

if N[0]*500 >= N[1]:
  print("Yes")
elif:
  print("No")

Submission status: Runtime Error

Solution code:
K, X = map(int, input().split)
a = 500*K

if a >= X:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
k=input()
x=input()
if(500*k<x):
  print("no")
else:
  print("yes")

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
ans = 0
for i in range(N-2):
    if S[i] == "A" and S[i+1] == "B" and S[i+2] == "C":
        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
n.m=map(int,input().split())
if 500*n>=m:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
if 500 * k >= x:
  print('Yse')
else:
  print('No')

Submission status: Runtime Error

Solution code:
import numpy as np
k, x = map(int, input().split())
if x <= k*500:
    print('Yes')
else:
    print('No')
k, x = map(int, input().split())

Submission status: Runtime Error

Solution code:
K,X=map(int,input().split())
ans=YES
if 500*K<X:
    ans=NO
print(ans)

Submission status: Runtime Error

Solution code:
k, x = ISI()
if 500*k<x:print("No")
else:print("Yes")

Submission status: Runtime Error

Solution code:
n, x = int(input())
if x <= n*500:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:


k,x=n1()
print("Yes" if k*500>=x else "No")

Submission status: Runtime Error

Solution code:
import sys
stdin=sys.stdin

ns=lambda:stdin.readline().rstrip()
ni=lambda:int(stdin.readline().rstrip())
nm=lambda:map(int,stdin.readline().rstrip())
nl=lambda:list(map(int,stdin,readline().rstrip()))

K,X=nm()
print('Yes' if X<=500*K else 'No')

Submission status: Runtime Error

Solution code:
mod = 10**9+7
import sys
from collections import Counter, defaultdict, deque
from itertools import product, permutations, combinations, combinations_with_replacement
from itertools import accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from math import ceil,floor
from copy import deepcopy
from heapq import heappop,heappush,heapify
import heapq


# l = ['a', 'a', 'a', 'a', 'b', 'c', 'c']
# c = Counter(l)

# d = defaultdict(int)

sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1

# リストの要素を改行を挟んで表示する
p2D = lambda x: print(*x, sep="\n")
# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())

def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

# 入力全てを整数に変換したものの配列を受け取る
# def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI(): return list(map(lambda x:int(x), sys.stdin.readline().split()))
def HI(): return list(map(lambda x:int(x)*(-1), sys.stdin.readline().split()))



# n = II()
# p = tuple(MI())
# q = tuple(MI())

# l = list(permutations(list(range(1,n+1))))
# print(abs(l.index(p)-l.index(q)))
def gcd(a, b):
	if b == 0:
		return a
	else:
		return gcd(b, a%b)
 
def lcm(a, b):
	return a // gcd(a, b) * b
 
N, M = MI()
A = LI()
A = [a//2 for a in A]


while A[0] % 2 == 0:
	for i in range(N):
		if A[i] % 2 != 0:
			print(0)
			exit()
		A[i] //= 2
	M //= 2

 
for i in range(N):
	if A[i] % 2 == 0:
		print(0)
		exit()
 
lcm_ = 1
for i in range(N):
	lcm_ = lcm(lcm_, A[i])
	if M < lcm_:
		print(0)
		exit()
 
print((M // lcm_ + 1) // 2)

Submission status: Runtime Error

Solution code:
import java.util.*;
import java.io.*;
 
public class Main {
    public static void main (final String[] args) {
        final Scanner s = new Scanner(System.in);
        int k = Integer.parseInt(s.next());
        int x = Integer.parseInt(s.next());
        
        if (k*500 < x) System.out.println("No");
        else System.out.println("Yes");
    }
}

Submission status: Runtime Error

Solution code:
k, x = map(int, input().split())
print('Yes' if 500*k>=x else'No)

Submission status: Runtime Error

Solution code:
import unittest
from io import StringIO
import sys
sys.setrecursionlimit(10 ** 5 + 10)


def input(): return sys.stdin.readline().strip()


def resolve():

    n, m = map(int, input().split())
    A = list(map(int, input().split()))
    B = [0]*n
    for i in range(n):
        B[i] = A[i]//2
    
    for i in range(n):
        cnt=0
        while B[i]%2==0:
            B[i]//2
            cnt+=1
        if i==0:
            temp=cnt
        else:
            if cnt!=temp:
                ok=False
                break
            if i==n-1:
                ok=True
    if ok:
        from functools import reduce
        from fractions import gcd

        def lcm(A, B):
            return A * B // gcd(A, B)

        # リストを引数にとる
        l = reduce(lcm, B)
        print(-(-(m//l) // 2))
        
    else:
        print(0)


resolve()

Submission status: Runtime Error

Solution code:
def is_much_money(num_of_coin, yen):
  if num_of_coin * 500 >= yen:
    return "Yes"
  else:
    return "No"

if __name__ == "__main__":
    num_of_coin, yen = int(input().split())
    judgement = is_much_mony(num_of_coin, yen)
    print(judgement)

Submission status: Runtime Error

Solution code:
k,x=map(int,input().split())
print("Yes" if 500*k>=x "No" else)

Submission status: Runtime Error

Solution code:
K, X = map(int, input())

print("Yes" if 500*K >= X else "No")

Submission status: Runtime Error

Solution code:
K,X=input().split()
k=int(K)
x=int(X)
if 500*k>==x:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
k,x =map(int,input().split()))
if k*500 >= x:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
lie = input()
li = list(lie)
cnt = 0
for i in range(len(li) - 2):
    if li[i] == "A" and li[i+1] == "B" and li[i+2] == "C":
        cnt += 1
    else:
        pass
print(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())
lie = input()
li = list(lie)
cnt = 0
for i in range(len(li) - 4):
    if li[i] == "A" and li[i+1] == "B" and li[i+2] == "C":
        cnt += 1
    else:
        pass
print(cnt)

Submission status: Runtime Error

Solution code:
n = int(input())
lie = input()
li = list(lie)
cnt = 0
for i in range(len(li) - 3):
    if li[i] == "A" and li[i+1] == "B" and li[i+2] == "C":
        cnt += 1
    else:
        pass
print(cnt)

Submission status: Runtime Error

Solution code:
###F Prob.ABC 150##
import numpy as np
import copy
N = int(input())
a_list = list(map(int,input().split()))
b_list = list(map(int,input().split()))

not_x_flag   = 0
not_all_flag = 0
def list_rotate(list_num):
    copy_list = copy.deepcopy(list_num)
    copy_zero = copy_list[0]
    copy_list = copy_list[1:]
    copy_list.append(copy_zero)
    
    return copy_list

k_counter = 0
XOR_list = np.zeros_like(a_list)
k_x_list = []

while(True):
    
    XOR_list = np.zeros_like(a_list)

    for i in range(N):
        XOR_list[i] = (b_list[i])^(a_list[i])
        
    
    XOR_uniset = list(set(XOR_list))
    if (len(XOR_uniset) == 1):
        
        k_x_list.append((k_counter,XOR_uniset[0]))
        
    a_list = list_rotate(a_list)
    k_counter += 1
        
    if (k_counter >= N):
        break
        
        
for kx in k_x_list:
    print("{} {}".format(kx[0],kx[1]))

Submission status: Runtime Error

Solution code:
k = int(input())
x = int(input())

if k * 500 >= x:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
K,M = map(int,input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys
k, x = map(int, sys.stdin.readline())
if k*500 >= x:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
k,x=[int(i)for i in input().split()]
if x>500k:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
K, X = map(int,input().split)
if 500*K >= X:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
K = int(input())
X = int(input())

if 500*K >= X:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
K = int(input())
X = int(input())

if 500*x >= X:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
if 500 * a >= b:
  print("Yes")
else
print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
S = [i for i in input()]
ans = 0
for i in range(N):
    if S[i] == "A":
        if S[i+1] == "B":
            if S[i+2] == "C":
                ans += 1
print(ans)

Submission status: Runtime Error

Solution code:

N = int(input())
C = list(map(int, input().split()))
C.sort()

ans = 0
mod = 10**9 + 7

for l in range(N):
    r = N - l - 1
    if r > 0:
        ans += C[l] * (pow(2, r-1, mod) * r + pow(2, r, mod)) * pow(2, l, mod)
    else:
        ans += C[l] * (pow(2, r, mod)) * pow(2, l, mod)
        
print(int(ans * pow(2, N, mod)) % mod)

Submission status: Runtime Error

Solution code:
K, X = map(int, input().split())
print("Yes" if 500*K > = X else "No")

Submission status: Runtime Error

Solution code:
K, X = map(int, input().split())
print("Yes" if 500*K > = 2000 else "No")

Submission status: Runtime Error

Solution code:
n = int(input())
if n%2 == 0:
  print('yes')
 else:
  print('No')

Submission status: Runtime Error

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

if(a*500>=X):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a=int(input())
X=int(input())
if(a*500>=X):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
total = 500 * int(input())
line = int(input())
if total >= line:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import sys
from itertools import permutations
def input(): return sys.stdin.readline().rstrip()
def main():
    n=int(input())
    P=tuple(map(int,input().split()))
    Q=tuple(map(int,input().split()))
    p_list=list(permutations(range(1,n+1)))
    print(abs(p_list.index(Q)-p_list.index(P)))

if __name__=='__main__':
    main()

Submission status: Runtime Error

Solution code:
K,X=map(int,input().split())

if 500＊K　>=　X:
  print('yes')
else:
  print('no')

Submission status: Runtime Error

Solution code:
K,X=map(int,input().split)

if 500*K >= X:
  print('yes')
else:
  print('no')

Submission status: Runtime Error

Solution code:
K,X=map(int,input().split)

if 500*K>=X:
  print('yes')
else:
  print('no')

Submission status: Runtime Error

Solution code:
K,X=map(int,input().split)

if 500*K>=X:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
K,X=input().split
K=int(K)
X=int(X)

if 500*K>=X:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
K,X=input().split
if K*2>X:
  print("yes")
else:
  print("no")

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
print(S.count('ABC'))

Submission status: Runtime Error

Solution code:
N=input()
S=input()
print(S.count('ABC'))

Submission status: Runtime Error

Solution code:
from collections import defaultdict, deque
import sys, heapq, bisect, math, itertools, string, queue, copy, time
from fractions import gcd
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
a = 0
b = 0
k = 0

for i in itertools.permutations(range(1,n+1)):
    k += 1
    if i == p:
        a = k
    if i == q:
        b = k
ans = abs(a-b)
print(ans)

Submission status: Runtime Error

Solution code:
K, X = map(int, input())
print("Yes" if 500*K>=X else "No")

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
ans=0
for i in range(N-2):
	if S[i]+S[i+1]+S[i+2]=='ABC':
		ans+=1
print(ans)

Submission status: Runtime Error

Solution code:
k=int(input())
x=int(input())
 
if 500*k >= x:
print("'Yes'")
else:
print("'No'")

Submission status: Runtime Error

Solution code:
k = int(input())
x = int(input())
 
if 500*k < x:
print("No")
else:
print("Yes")

Submission status: Runtime Error

Solution code:
K, X = map(int,input().split())

if 500*K >= X:
  print('Yes')
  else:
    print('No')

Submission status: Runtime Error

Solution code:
K,X = map(int, input().split())

if 500*K>=x:
  print('yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
k=int(input())
x=int(input())

if 500*k < x:
print("No")
else
print("Yes")

Submission status: Runtime Error

Solution code:
K X = map(int,input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
K X = map(int,input().split())
if 500*K >= X:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
K, X = map(int, input().split())
if K*500 <X:
    print('NO')
  else:
    print('Yes')

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
for i in range(N):
    if S[i]+S[i+1]+S[i+2] == 'ABC':
        a += 1
    if i == N - 3:
        break
print(a)

Submission status: Runtime Error

Solution code:
inputted = list(map(int, input().split()))
K = int(input())
X = int(input())

total = 500 * K;
answer = 'Yes' if total >= X else 'No';

print(answer);

Submission status: Runtime Error

Solution code:
K = int(input())
X = int(input())

total = 500 * K;
answer = 'Yes' if total >= X else 'No';

print(answer);

Submission status: Runtime Error

Solution code:
int main(){
            int K,X;
            scanf(“%d%d", &K, &X);
            if(500*K>X)printf(“Yes\n”);
            Else printf(“No\n”);
                  }

Submission status: Runtime Error

Solution code:
#include <stdio.h>

Int main(){
            int K,X;
            scanf(“%d%d", &K, &X);
            if(500*K>X)printf(“Yes\n”);
            Else printf(“No\n”);
}

Submission status: Runtime Error

Solution code:
X=500*K
if X>K
	print("Yes")
   X<K
    print("No")

Submission status: Runtime Error

Solution code:
from sys import stdin
K, X = [int(x) for x in stdin.readline().rstrip().split()]

if X =< K*500:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n = int(input())
s = input()
print(s.count("ABC"))

Submission status: Runtime Error

Solution code:
from itertools import permutations

n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))

p_index = 0
q_index = 0
for i, perm in enumerate(permutations(range(1, n+1))):
    if perm == p:
        p_index = i
    if perm == q:
        q_index = i
print(abs(p_index - q_index))

Submission status: Runtime Error

Solution code:
N = int(input())
P = list(map(int, input().split()))
Q = list(map(int, input().split()))

fac = [0] * 8
fac[1] = 1
for i in range(2, N):
    fac[i] = i * fac[i - 1]

a = 0
l = list(range(1, N + 1))
for i in range(N):
    a += l.index(P[i]) * fac[len(l) - 1]
    l.remove(P[i])

b = 0
l = list(range(1, N + 1))
for i in range(N):
    b += l.index(Q[i]) * fac[len(l) - 1]
    l.remove(Q[i])

print(abs(a - b))

Submission status: Runtime Error

Solution code:
K,X=map(int,input().split)
if 500*K<X:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
data = input().spilt()

k = int(data[0])
x = int(data[1])

if x <= 500 * k:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
K, X = int(input())
if 500*K >= X:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def resolve():
    c = input()

    print(chr(ord(c)+1))


if __name__ == "__main__":
    resolve()

Submission status: Runtime Error

Solution code:
N = input()
S = input()

print(S.count("ABC"))

Submission status: Runtime Error

Solution code:
import itertools

n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))

list_range = list(range(1,n+1))
pattern_list = list(itertools.permutations(list_range, n))
pattern_list.sort()
ans = [0] * 2
for i in range(len(pattern_list)):
  if p == list(pattern_list[i]):
    ans[0] = i + 1
  elif q == list(pattern_list[i]):
    ans[1] = i + 1
print(abs(ans[0] - ans[1]))

Submission status: Runtime Error

Solution code:
K = int(input())
X = int(input())

if 500 * K >= X:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
k,x = list(map(int,input().split()))
if 500 * k >= x
   print('Yes')
else:
   print('No')

Submission status: Runtime Error

Solution code:
def check(number, string):
  n = 0
  count = 0
  while n < number:
    if string[n] == 'A':
      if string[n+1] == 'B':
        if string[n+2] == 'C':
          count += 1

    n += 1
  
  print(count)


input_num = int(input())
input_str = input()

check(input_num, input_str)

Submission status: Runtime Error

Solution code:
n=int(input())
s=list(input())
count=0
for i in range(n):
  if i<=48:
    if s[i]=='A' and s[i+1]=='B' and s[i+2]=='C':
      count+=1
    
print(count)

Submission status: Runtime Error

Solution code:
A,B = map(int,input())
if A * 500 >= B:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
A,B = map(int,input())
If A * 500 >= B:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
K,X = map(int,input())

if K*500>=X:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
lenghts = int(input())
document = input()

count = 0
for start in range(lenghts -2):
  if document[start: start+3] == 'ABC':
    count += 1
  
print(count)

Submission status: Runtime Error

Solution code:
k,X=list(map(int,input().split()))
if(K*500>=X):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
k = int(input())
x = int(input())
if k * 500 >= x:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
processedIp = input.split(' ')
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
processedIp = input.split(" ")
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
# import math
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
from itertools import permutations
# import numpy as np


# k,x = map(int, input().split())

n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
m = [i + 1 for i in range(n)]
c = 0
for i in permutations(m):
    c += 1
    # print(i)
    if list(i) == p:
        a = c
    if list(i) == q:
        b = c
print(abs(a - b))

Submission status: Runtime Error

Solution code:
# import math
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np


# k,x = map(int, input().split())

n = int(input())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
m = [i + 1 for i in range(n)]
c = 0
for i in permutations(m):
    c += 1
    # print(i)
    if list(i) == p:
        a = c
    if list(i) == q:
        b = c
print(abs(a - b))

Submission status: Runtime Error

Solution code:
print("Yes" if int(input()) * 500 >= int(input()) else "No")

Submission status: Runtime Error

Solution code:
A,B = map(int,input().split())

if(500*K>=X):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
K=int(input())
X=int(input())
if(X<=K*500):
    print("Yes")
else:
   print("No")

Submission status: Runtime Error

Solution code:
k, x = map(int, input().spilt())
if 500*k >= x:
	print("Yes")
else:
	print ("No")

Submission status: Runtime Error

Solution code:
a = list(map(int,input().split()))
if 500 * a[0] >= a[1] :
  print(Yes)
else :
  print(No)

Submission status: Runtime Error

Solution code:
def solve():
    N, M = map(int, input().split())
    return 'Yes' if None*500 >= M else 'No'

print(solve())

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()

#Y = len(S.replace('ABC',''))
#print((N-Y)//3)

print(S.count('ABC'))

Submission status: Runtime Error

Solution code:
K = input("How many yen coins are there?")
X = input("How much are they worth?")
if K * 500 >= X:
  print("Yes")
  return True
 else:
  print("No")
  return False

Submission status: Runtime Error

Solution code:
K,X=map(int,input().split())
if 500*K>=X:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
def main():
    K,X = list(map(int,input().split()))
    if(500*k > X):
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
K,X =[int(i)for i in input().split()]
if 500K >=X:
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

Solution code:

K, X = input().strip().split()
K, X = [int(K), int(X)]
sougaku = 500*K
if sougaku >= X:
    print('Yes')
    else:
        print('No')

Submission status: Runtime Error

Solution code:

K, X = input().strip().strip()
sougaku = 500*K
if sougaku >= X
    print('Yes')
    else
    print('No')

Submission status: Runtime Error

Solution code:
k, x = map(int, input())

print("Yes" if 500*k >= x else "No")

Submission status: Runtime Error

Solution code:
import itertools
n = int(input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
nums = [i for i in range(1,n+1)]
fac = [words for words in itertools.permutations(nums)]
ans = abs(fac.index(p) - fac.index(q))
print(ans)

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
c=int(500*a-b)
if c >0:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
input1 = list(map(int,input().split()))
K = input[0]
X = input[1]
if K * 500 >= X:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
money,sum=int(input().split())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
money=int(input().split())
sum=int(input())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
money=int(input())
sum=int(input())
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
money=input()
sum=input()
money500=500*money
if money500>=sum:
    print('Yes')
else:
    print('No')
return 0