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: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys

sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()

k,x = LI()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
K,X = [int(x) for x in stdin.readline().rstrip().split()]
if 500*K >= X:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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 permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

K, X = MAP()

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

Submission status: Accepted

Solution code:
import sys

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 LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    k,x=MI()
    if 500*k>=x:print("Yes")
    else:print("No")
main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K, X = map(int, input().split())
print("YNeos"[500*K<X::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if a * 500 >= b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    K, X = [int(item) for item in input().split()]

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

K, X = MAP()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K, X = [int(i) for i in input().split(" ")]

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

Submission status: Accepted

Solution code:
N = input().split()
for a in range(len(N)):
    N[a] = int(N[a])

if N[1]/N[0] <= 500:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N,K=map(int,input().split())
if 500*N>=K:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
k, x = [int(i) for i in sys.stdin.readline().split()]
if k * 500 >= x:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k1, x1 = input().split()

k = int(k1)
x = int(x1)

total = 500 * k

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

Submission status: Accepted

Solution code:
a, b = map(int, input().split())
print(['No', 'Yes'][a * 500 >= b])

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

k = int(k)
x = int(x)

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Fri Jan 10 20:59:19 2020

@author: masat
"""

K, X = map(int, input().split())

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect
stdin = sys.stdin
mod = 10**9 + 7

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
K,X=map(int,input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    sc = Scan()
    K, X = sc.intarr()

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


def dfs(N):
    global dp
    if N <= 0:
        return 1

    if dp[N] > -1:
        return dp[N]
    ans = 0
    for i in range(1, 7):
        ans += dfs(N-i)
    dp[N] = ans
    return ans


class Scan():

    def intarr(self):
        num_array = list(map(int, input().split()))
        return num_array

    def intarr_ver(self, n):
        return [int(input()) for _ in range(n)]

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


def display(array):
    for a in range(len(array)):
        if len(array) - a != 1:
            print(array[a], end=' ')
        else:
            print(array[a])


def gcd(a, b):  # 最大公約数
    while b:
        a, b = b, a % b
    return a


def lcm(a, b):  # 最小公倍数
    return a * b // gcd(a, b)


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


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


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    K, X = map(int, input().split())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k,x = map(int,input().split())
result = 0
for i in range(k):
    result += 500

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

Submission status: Accepted

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

    if sm >= X:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
import numpy as np

def main():
    K, X = map(int, input().split())
    if (500 * K) >= X:
        print("Yes")
    else:
        print("No")
    return 0

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

total = k * 500
ans = "No"

if total >= x:
  ans = "Yes"

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

K, X = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
K, X = [int(i) for i in input().split(" ")]

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

Submission status: Accepted

Solution code:
import numpy as np
# N = int(input())
# H = [int(x) for x in input().split()]
K, X = map(int, input().split())
if 500 * K >= X:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k ,x = [int(i) for i in input().split(" ")]

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


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


def read_float():
    return float(input())


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


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(K, X):
    return 'Yes' if 500*K >= X else 'No'


def main():
    K, X = read_int_n()
    print(slv(K, X))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  k,x=LI()

  if k*500>=x:
    return 'Yes'
  return 'No'

# main()
print(main())

Submission status: Accepted

Solution code:

K, X = map(int, input().split())

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

k, x = map(int, readline().split())

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

Submission status: Accepted

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

[K, X] = [int(i) for i in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
k, x = map(int, input().split())


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


def solve(K: int, X: int):
    if 500*K >= X:
        yes()
    else:
        no()

    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(K, X)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
sys.setrecursionlimit(300000)

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(K: int, X: int):
    if 500 * K >= X:
        ret = YES
    else:
        ret = NO
    print(ret)
    return

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    X = int(next(tokens))  # type: int
    solve(K, X)

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*X >= 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:
import math 
def lcm(x,y):
    return x*y//math.gcd(x,y)
n,m = map(int,input().split())
a = list(map(int,input().split()))
gcds = a[0]
for i in a:
    gcds = lcm(gcds,i)
a = [i//2 for i in a]
a_0 = a[0]
for i in a:
    a_0 = lcm(a_0,i)
#print(a_0,gcds)
if a_0 < m:
    ans = math.ceil((m - a_0) // gcds)
elif a_0 == m:
    ans = 1
else:
    ans = 0
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

if 500*i >= 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:i+3] == 'ABC':
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
#https://atcoder.jp/contests/abc150/tasks/abc150_a
K= [ ]
K= int(input())

X= [ ]
X= int(input())

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

Submission status: Runtime Error

Solution code:
#https://atcoder.jp/contests/abc150/tasks/abc150_a
K= [ ]
K= int(input())

X= [ ]
X= int(input())

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

Submission status: Runtime Error

Solution code:
#https://atcoder.jp/contests/abc150/tasks/abc150_a
K= int(input())

X= int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import gcd

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

memo = {}

def lcm(a,b):
    return a//gcd(a,b)*b

b = 1

for a in A:
    b = lcm(a//2, b)
    if b > M:
        break

if any([2 * b // a % 2 == 0 for a in A]):
    print(0)
else:
    ans = M // b
    print(ans - ans // 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
tmp = input()

N = int(tmp[0])
X = int(tmp[1])

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

Submission status: Runtime Error

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