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:
money=input()
sum=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')

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 = map(int, input().split())
 if 500 * k >= x:
  print('Yes')
 else:
  print('No)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k,x =map(int,input())
if x<=500*k:
  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 * x) >= K:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

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 = input()
X = input()

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

Submission status: Runtime Error

Solution code:
print("No" if int(input())*500<int(input()) else "yes")

Submission status: Runtime Error

Solution code:
A=input().split()
if int(A[0])*500 => int(A[1]):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N=int(input())
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().split())
if 500*k >= x:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

n = k * 500

if n => x:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

n = k * 500

if n = > x:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
N,M = (int(x) for x in input().split())

if N*5 > = M:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

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 = input().split()

def main(K,X):
  if K * 500 >= X:
    print('Yes')
  else:
    print('No')
 
if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
K,X = 2 900

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

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
count=0
for i in range(N):
    if (S[i:i+3]=="ABC"):
        count=count+1
print(count)

Submission status: Runtime Error

Solution code:
x,k=map(int,input().split())
if x*500>=k:
  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 = list(input())
count = 0
for i in range (n-2):
    if s[i]=="A" and s[i+1]=="B" and s[i+2]=="C":
        count += 1
print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
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 += 1

print(count)

Submission status: Runtime Error

Solution code:
N = int(input())
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 += 1

print(count)

Submission status: Runtime Error

Solution code:
N = int(input())
S = list(input())
count = 0

for i in range(N-2):
    if S[i]==("A") and S[i+1]==("B") and S[i+2]==("C"):
        count += 1

print(count)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
total=500*k
if total=>X:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A = []
x,y = map(int,input()A.split())

if 500*x-y >= 0:
  print("Yes")
  
  else:
    print("No")

Submission status: Runtime Error

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return tuple(map(int,input().split()))

def onem(): #Nとかの取得
    return int(input())


import fractions
from functools import reduce
def gcd(*numbers):
    return reduce(fractions.gcd, numbers)

def gcd_list(numbers):
    return reduce(fractions.gcd, numbers)
def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

def main():
    n = onem()
    a = l()

    k = lcm_list(a[:n//2])
    kk = lcm_list(a[n//2:])
    k = lcm(k,kk)
    su = 0

    for i in range(n):
        su += k//a[i]
        
        su %= mod

    print(su)

if __name__ == "__main__":
    
    main()

import collections
import itertools
import operator


class UnionFind:
    def __init__(self, x):
        class KeyDict(dict):
            def __missing__(self, key):
                self[key] = key
                return key

        self.parent = KeyDict()
        self.rank = collections.defaultdict(int)
        self.size = collections.defaultdict(lambda: 1)
        if x is not None:
            for elem in range(x+1):
                _, _, _ = self.parent[elem], self.rank[elem],self.size[elem]

    def find(self, x):
        if self.parent[x] == x:
            return x
        else:
            self.parent[x] = self.find(self.parent[x])
            return self.parent[x]

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if not self.are_same(x,y):
            xx = self.size[x]
            yy = self.size[y]
            if self.rank[x] < self.rank[y]:
                self.parent[x] = y
                self.size[y] += xx
            else:
                self.parent[y] = x
                self.size[x] += yy
        if self.rank[x] == self.rank[y]:
            self.rank[x] += 1

    def Size(self,x):
        return self.size[self.find(x)]

    def are_same(self, x, y):
        '''print(x,y,self.find(x),self.find(y),self.find(x) == self.find(y))'''
        return self.find(x) == self.find(y)

    def grouper(self):
        roots = [(x, self.find(x_par)) for x, x_par in self.parent.items()]
        root = operator.itemgetter(1)
        for _, group in itertools.groupby(sorted(roots, key=root), root):
            yield [x for x, _ in group]

n,m = m()

print("Yes" if 500 * n >= m else "No")

Submission status: Runtime Error

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

for n in range(int(N)-2):
    if S[n] == "A" and S[n+1] == "B" and S[n+2] == "C":
        ABCCount = ABCCount + 1

print(ABCCount)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if 500 * int(K) >= X:
  print("YES")
else:
  print("NO")

Submission status: Runtime Error

Solution code:
A = list(map(int, input().split()))
if A[0] * 500 >= A[1]:
  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 500*k=>x:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

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())
print(0--n//500)

Submission status: Runtime Error

Solution code:
n, k = map(int,input().spllit())

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

Submission status: Runtime Error

Solution code:
import sys
import numpy as np
 
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
 
k,x=map(int,input(),.split())

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

Submission status: Runtime Error

Solution code:
from functools import lru_cache
import sys

sys.setrecursionlimit(10**8)

N = int(input())
S = input()

@lru_cache(maxsize=None)
def dp(s):
    result = s.count("ABC")
    return result
print(dp(S))

Submission status: Runtime Error

Solution code:
from functools import lru_cache
import sys

sys.setrecursionlimit(10**8)

N = int(input())
S = input()

@lru_cache(maxsize=None)
def dp(s):
    print(s.count("ABC"))
print(dp(S))

Submission status: Runtime Error

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

print(s.count('ABC'))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input().split())
if n[0]*500 > n[1]:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n, m = map(int, input().split())
a = list(map(int, input().split()))

import math
from functools import reduce

# for i, j in enumerate(a):

def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def gcd_list(numbers):
    return reduce(math.gcd, numbers)

kouyakusuu = gcd_list(a)
koubaisuu = lcm_list(a)

buf = 1
for i, j in enumerate(a):
    buf *= j / kouyakusuu

ans = (m - buf) // koubaisuu + 1

print(int(ans))

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 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:
str('K') = range(1,100)
str('X') = range(100000)
1 <= K < 100
1 <= X <10**5
a = 500*K
if X < a:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = 500*K
if X < a:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a = 500*K
list[K,a]:
  if X < a:
    	print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
K, X= map(int, input().split())
if K * 500 > X:
  print("Yes")
else:
  prine("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:
i(j)=map(int,input().split())
if i*500>=j:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


def LI(): return list(map(int, input().split()))


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


mod = 1000000007
inf = 1e10
#solve


def solve():
    n, m = LI()
    a = LI()
    bi = 0
    while not (a[0] & 1):
        bi += 1
        a[0] = a[0] >> 1
    for ai in a[1:]:
        tmp = 0
        while not (ai & 1):
            tmp += 1
            ai = ai >> 1
        if tmp == bi:
            continue
        print(0)
        return

    def lcm(a):
        from fractions import gcd
        x = a[0]
        for i in range(1, len(a)):
            x = (x * a[i]) // gcd(x, a[i])
        return x
    lc = lcm(list(map(lambda x: x >> 1 : set(a))))
    print((m + lc) // lc // 2)
    return


#main
if __name__ == '__main__':
    solve()

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

print('Yes' if X/500<=k else'NO')

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 = int(input())
X = int(input())
k = K * 500
if k > X:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# include <bits/stdc++.h>
using namespace std;

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import fractions
from functools import reduce
N,M= map(int,input().split())
A=[int(x) for x in input().split()]
def lcmpair(a,b):
    return (a*b)// fractions.gcd(a,b)
def lcm(List):
    return reduce(lcmpair,List,1)
lcmB = lcm(A) //2

crit = 0
pena = 0
num = A[0]
while num%2 == 0:
    crit +=1
    num = num//2
count = 0
for i in A:
    count = 0
    while i%2 == 0 :
        count +=1
        i = i//2
    if count != crit:
        pena = 1

if lcmB > M:
    print(0)
elif pena ==1:
    print(0)
else:
    print(((M//lcmB)+1)//2)

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:
char = input().split(" ")
if int(char[0])*500 >= (char[1]):
    print("Yes")
else: 
    print("No")

Submission status: Runtime Error

Solution code:
char = input().split(" ")
if char[0]*500 >= char[1]:
    print("Yes")
else 
    print("No")

Submission status: Runtime Error

Solution code:
n=input()
s=input()

print(s.count("ABC"))

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
import math

n, m = map(int, input().split())
*a, = map(int, input().split()) 

a = [ai >> 1 for ai in a]

import fractions
from functools import reduce

def getLCM(a, b):
    return a * b // fractions.gcd(a, b)

def f(x):
    cnt = 0
    while x%2 == 0:
        x //= 2
        cnt += 1
    return cnt

cnt = f(a[0])
for i in range(1, len(a)):
    if cnt != f(a[i]):
        print(0)
        break
else:
    lcm = reduce(lambda x, y: getLCM(x, y), a)
    ans = (m-lcm) // (lcm*2) + 1 if m >= lcm else 0
    print(ans)

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 k*500 < x:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

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

if k*500 < x:
    print("no")
else:
    print("yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=raw_input()
s=s.split()
if x<=k*500:
 a="Yes"
else:
 a="No"
print(a)

Submission status: Runtime Error

Solution code:
s=raw_input()
s=s.split()
if x<=k*500
 a="Yes"
else;
 a="No"
print(a)

Submission status: Runtime Error

Solution code:
s=raw_input()
s=s.split()
if x<=k*500;
 a="Yes"
else;
 a="No"
print(a)

Submission status: Runtime Error

Solution code:
tar, max = map(int, input().sprit())
if max <= tar * 500:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
tar, max = map(int, input(),sprit())
if max <= tar * 500:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = int(input())
 
word = input()
 
counter = 0
for i in range(len(word)):
  if len(word[i:]) >= 3:
    if word[i:i+3] == 'abc':
      counter += 1
      
print(counter)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k,m=map(input().split())
c=500*k
if(c<m):
  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:
K,X=map(int,input().split())
if(500*K>=X):
  print("Yes")
else:
  print("No)

Submission status: Runtime Error

Solution code:
#include<iostream>
#include<algorithm>
#include <iostream> 
#include <algorithm> 
#include<string>
#include<queue>
#include<utility>
#include<fstream>
#include<queue>
#include<set>
#include<stack>
#include<bits/stdc++.h>
#define ll long long int
#define ull unsigned long long int
#define I(a) scanf("%d",&a)
#define I2(a,b) scanf("%d%d",&a,&b)
#define I3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define L(a) scanf("%lld",&a)
#define L2(a,b) scanf("%lld%lld",&a,&b)
#define L3(a,b,c) scanf("%lld%lld%lld",&a,&b,&c)
#define PI(a) printf("%d",a)
#define PL(a) printf("%lld",a)
#define PT(t) printf("Case %d: ",t)
#define PB push_back
#define x first
#define y second
#define xx first.first
#define xy first.second
#define yx second.first
#define yy second.second
#define SC scanf
#define PC printf
#define NL printf("\n")
#define SET(a) memset(a,0,sizeof a)
#define SETR(a) memset(a,-1,sizeof a)
#define SZ(a) ((int)a.size())-1
#define f(i,a,b) for(int i=a;i<=b; i++)
#define fr(i,a,b) for(int i=a;i<=b; i++)
#define frr(i,a,b) for(int i=a;i>=b; i--)
#define frv(i,a)  for(int i=0;i<a.size();i++)
#define pi 2.0*acos(0.0)
#define R(a) freopen(a, "r", stdin);
#define W(a) freopen(a, "w", stdout);
#define CB(x) __builtin_popcount(x)
#define STN(a) stringtonumber<ll>(a)
#define lol printf("BUG\n")
#define Endl "\n"
#define mk make_pair
using namespace std;
template <class T> inline T BM(T p, T e, T M)
{
    ll ret = 1;
    for(; e > 0; e >>= 1)
    {
        if(e & 1) ret = (ret * p) % M;
        p = (p * p) % M;
    }
    return (T)ret;
}
template <class T> inline T gcd(T a, T b)
{
    if(b == 0)return a;
    return gcd(b, a % b);
}
template <class T> inline T mdINV(T a, T M)
{
    return BM(a, M - 2, M);
}
template <class T> inline T PW(T p, T e)
{
    ll ret = 1;
    for(; e > 0; e >>= 1)
    {
        if(e & 1) ret = (ret * p);
        p = (p * p);
    }
    return (T)ret;
}
 
 
template <class T>bool ISLEFT(T a, T b, T c)
{
    if(((a.xx - b.xx) * (b.yy - c.yy) - (b.xx - c.xx) * (a.yy - b.yy)) < 0.0)return 1;  //Uporer dike //A,b,c, x okkher ordera sorted
    else return 0;
}
 
 
typedef pair<int,int >P;
//////////////////////////
/////////////////////////
//#include<bits/stdc++.h>
using namespace std;
#define Base1   101LL
#define Base2   10000079LL
#define Base3   10000103LL
#define MOD1    1000000007LL
#define MOD2    1000000009LL
#define MOD3    1000000021LL
#define mx 100000//Number of charter of main string
#define mx1 25000// Number off character of total charcater
#define mx2 500// Number of pattern and number of ch of each pattern
 
 int main(){
     ll x,y;
     L2(x,y);
     if(x*500>=y)cout<<"YES"<<endl;
     else cout<<"NO"<<endl;

     return 0;
 }

Submission status: Runtime Error

Solution code:
import fractions
from functools import reduce
N,M= [int(i) for i in input().split()]
n = [int(i) for i in input().split()]
#print(n)
n=sorted(set(n),reverse = True)
bs = n[0]
#print(n)
#c=len(n)


def lcm_b(a, b):
        #print("base",a,b)
        return (a * b) // fractions.gcd(a, b)

def lcm_o():
        global n
        return reduce(lcm_b, n)

def chk(v):
        global n
        for i in range(1,30):
                if v%2 == 1:break
                v = v//2
        t=2**(i-1)
        for j in range(len(n)):
                if n[j] % t == 0 and (n[j] / t) % 2 == 1:
                        n[j] = int(n[j]/t)
                else: return 0
        return i-1

if len(n) > 0:
        
        c = chk(n[-1])
        
        if  c != 0:
                v = lcm_o()*(2**(c-1))
                
                if v > M:
                        print(0) 
                else:
                        v = M//v
                        if v%2==1: v+=1
                        print(int(v//2))
        
        else: print(0)
elif N==1:
        v = int(bs*0.5)
        v = M//v
        if v%2==1: v+=1
        print(int(v//2))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
k=intinput()
x=intinput()
if x <= k :
  print("Yes")
else :
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

ans = []
l = range(1, N + 1)
import itertools


for v in itertools.permutations(l, N):
    if list(v) == P:
      a = v.index(P)
        
    if list(v) == Q:
      b = v.index(Q)  
    

print(abs(b - a))

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 = input()
x = input()

if 500 * int(k) >= int(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(Yes)

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:
k,x=mpa(int,input().split())
if 500*k >= x:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
def read_int(): return int(input())
N = read_int()
def read_str(): return input().strip()
S = list(read_str())

__DEBUG__ = False

def solution():
    count = 0    
    for i in range(N-2):
        if __DEBUG__: print(f"checking {S[i]} at index: {i}")
        if S[i] == 'A':
            if S[i+1] == 'B' and S[i+2] == 'C':
                count += 1
                continue
    return count

    
if __name__ == '__main__':
    print(solution())

Submission status: Runtime Error

Solution code:
# https://atcoder.jp/contests/abc150/tasks/abc150_a

def read_int_n(): return list(map(int, input().split()))

K, X = read_int_n()

print(f"Nubmer coins K = {K}; Total X = {X}")
if K*500 >= X:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
    def twoSum(self, k, x) -> str:        
        if k * 500 >= x:
          return "Yes"
        else:
          return "No"

Submission status: Runtime Error

Solution code:
k, x = (int(x) for x in input().split())

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

Submission status: Runtime Error

Solution code:
k, x = (int(x) for x in input().split())

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

Submission status: Runtime Error

Solution code:
# 高橋君は500円玉をK枚持っています。 これらの総額がX円以上である場合は Yes を、そうでない場合は No を出力してください。
# コマンドライン引数 K X
# 制約　1≤K≤100　1≤X≤10^5

import sys

# コマンドライン引数を変数に入れる
if 1 < len(sys.argv) < 4:
    K = sys.argv[1]
    X = sys.argv[2]

# コマンドライン引数が想定外
else:
    print("引数の指定に誤りがあります")

# 総額の保持
sum = 500 * int(K)

# 出力文の作成
if sum >= int(X):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
import sys
input = sys.stdin.readline
n, m = [int(x) for x in input().rstrip().split()]
a = [int(x)//2 for x in input().rstrip().split()]
a = list(set(a))

def find_gcd(a, b):
    if b == 0:
        return a
    return find_gcd(b, a % b)


gcd = a[0]
product = 1
for x in a:
    gcd = find_gcd(gcd, x)
    product *= x

lcm = product // gcd

for x in a:
    if (lcm // x) % 2 == 0:
        print(0)
        sys.exit(0)

print((m // lcm + 1) // 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
if rest >= b:
   print('Yes')
else:
   print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input()
print(input().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:
k=0
x=0
y = 500*k

if y > x
 print("Yes")
  else
  print("No")
  end if

Submission status: Runtime Error

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

N, M = map(int, input().split())
a_list = list(set(map(int, input().split())))

a = [int(i/2) for i in a_list]
ans = a[0]
for i in range(1, len(a)):
    ans = ans * a[i] // fractions.gcd(ans, a[i])

if ans <= M:
    b = M // ans

    if b % 2 == 1:
        print(b // 2 + 1)
    else:
        print(b // 2)
else:
    print(0)

Submission status: Runtime Error

Solution code:
k,v = int(input())
if k*500>=v: 
  print('yes')
else:
  print('no')

Submission status: Runtime Error

Solution code:
a
hnbb


hh

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b = input()

if a*500 >= b:
  print('yes')
else:
  print('no')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

X = int(x)
K = int(k)

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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