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:
l=list(map(int,input().split()))
k,x=l[0],l[1]
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:
k,x = map(int,input().split())
print(['Yes','No'][500*k<x])

Submission status: Accepted

Solution code:
coin , mon = map(int,input().split())

if coin*500 >= mon:
    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('YNeos'[500*K<X::2])

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7


K, X = rl()

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

Submission status: Accepted

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

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 = input().split()
K = int(K)
X = int(X)
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:
# -*- coding: utf-8 -*-
K, X = map(int, input().split())
if 500*K >= X:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if K*500 >= Z:
    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:
N,K=map(int,input().split())

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

Submission status: Accepted

Solution code:
#ライブラリの読み込み
import math

#入力値の格納
k,x = map(int,input().split())

#判定
if k * 500 >= x:
    text = "Yes"
else:
    text = "No"

#表示
print(text)

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 x <= 500 * k 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:
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    K, X = input([int, 2])
    yesno(X <= K * 500)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    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('No')
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


def solve(K: int, X: int):
    if 500 * K >= X:
        print(YES)
    else:
        print(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:
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("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import math

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 = 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()]
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:
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1


k,x=input2()

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

Submission status: Accepted

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

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:
# ABC150A - 500 Yen Coins

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:
a = list(map(int,input().split()))
x = 500*a[0]
if x >=a[1]: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 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:
def q1():
    K, X = (int(i) for i in input().split())
    if K * 500 >= X:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    q1()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = input()
k = int(a.split()[0])
x = int(a.split()[1])

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

Submission status: Accepted

Solution code:
#A

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

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

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

Submission status: Accepted

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


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

    ret = "No"
    if 500 * k >= x:
        ret = "Yes"
    return ret


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

Submission status: Accepted

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

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:
icase=0
if icase==0:
    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 500*a >= b:
    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 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 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 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:
a,X=map(int, input().split())

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

K, X = MAP()

print("Yes" if 500*K >= 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:
a,b=map(int,input().split())
if 500*a>= b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
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 k*500>=x:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
#ABC150-A
K,X=map(int,input().split())
print('Yes' if 500*K>=X else 'No')

Submission status: Accepted

Solution code:
# Problem A - 500 Yen Coins

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

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

Submission status: Accepted

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

if a[0] * 500 >= a[1]:
  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 500 * k >= x 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:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    k, x = list(map(int, readline().split()))
    print("Yes" if 500 * k >= x else "No")


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

sum = x * 500
if sum >= k:
    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())

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

Submission status: Accepted

Solution code:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# /home/remina/PycharmProjects/atcoder/A-500YenCoins.py
#
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())
print('Yes'if 500*k>=x else '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(10 ** 7)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#--500 Yen Coins

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

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

print(ans)

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('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 = list(map(int,input().split()))

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

else :
    print("No")

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

Submission status: Accepted

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

total=k*500

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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())
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:
inputted = list(map(int, input().split()))
K = inputted[0]
X = inputted[1]

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

print(answer);

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
coin,money=map(int,input().split())

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

Submission status: Accepted

Solution code:
import os

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = 500*k

if s >=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, x = map(int, input().split())
if n*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:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from fractions import gcd                    # for Python3.4.3


def main():
    mod = 10000007                  # 10^9+7
    inf = float('inf')
    input = sys.stdin.readline      # 改行文字が残ることに注意
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def ii():  return int(input())
    def mi():  return map(int, input().rstrip().split())
    def lmi(): return list(map(int, input().rstrip().split()))
    def li():  return list(input().rstrip())
    
    k, x = mi()
    print("Yes") if k*500>=x 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:
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: 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,raw_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:
# ABC 150: A – 500 Yen Coins
k, x = map(int, input().split())
print('Yes' if 500 * k >= x else 'No')

Submission status: Accepted

Solution code:
k, n = (int(x) for x in input().split())
if 500*k >= 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:
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 x<=500*k:
    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:
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

K, X = lr()
bl = 500 * K >= X
print('Yes' if bl else 'No')
# 35

Submission status: Accepted

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

ans = 'Yes'
if 500 * k < x:
    ans = 'No'

print(ans)

Submission status: Accepted

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

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


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
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:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

def main():
  k, x = map(int, readline().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())
coin = 500*K
print("Yes" if coin>=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:
n = input()
(p,q) = n.split()
if 500 * int(p) >= int(q):
    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, m = (int(s) for s in 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=list(map(int, input().split()))
if K*500 >= X:
    print('Yes')
else:
    print('No')