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

a = 500 * K

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

Submission status: Accepted

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

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:
N,M= [int(i) for i in input().split()]
print("Yes" if N*500 >= M else "No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k, x = input().split()
if 500 * int(k) >= int(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()))
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:
from sys import stdin
k, x = map(int, stdin.readline().rstrip().split())

total = 500 * k

if total < x:
    answer = "No"
else:
    answer = "Yes"

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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:
def solve(string):
    k, x = map(int, string.split())
    return "Yes" if k * 500 >= x else "No"


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
print('YNeos'[a*500<b::2])

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:
i = input()
s = i.split(' ')
K = int(s[0])
X = int(s[1])
if 500*K>=X:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys

K, X = [int(v) for v in sys.stdin.readline().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

inp_word = input()

# コマンドライン引数を変数に入れる
K,X = inp_word.split()

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

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

Submission status: Accepted

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

import sys

inp_word = input()

# コマンドライン引数を変数に入れる
K,X = inp_word.split()

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

k, x = [int(x) for x in input().rstrip().split()]
print('Yes' if k * 500 >= 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:
import sys
MAX_INT = int(10e12)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import math
import time
import numpy as np
import collections


KX = str(raw_input()).split()
K = int(KX[0])
X = int(KX[1])

if(X <= 500*K):
  print("Yes")
else:
  print("No")
# print(str(poi1)+ " " + str(poi2));

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():
    n,m = map(int,input().split())
    if n*500 >= m:
        print('Yes')
    else:
        print('No')
if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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, random, itertools, 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 = float('INF')

#solve
def solve():
    k, x = LI()
    if k * 500 >= x:
        print("Yes")
    else:
        print("No")
    return


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,k=map(int,input().split())
print("YNeos"[n*500<k::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 = [int(s) for s in input().split()]
print("YNeos"[int(not 500*k>=x)::2])

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
import heapq
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
DVSR = 1000000007
def POW(x, y): return pow(x, y, DVSR)
def INV(x, m=DVSR): return pow(x, m - 2, m)
def DIV(x, y, m=DVSR): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(input())
def FLIST(n):
    res = [1]
    for i in range(1, n+1): res.append(res[i-1]*i%DVSR)
    return res
def gcd(x, y):
    if x < y: x, y = y, x
    div = x % y
    while div != 0:
        x, y = y, div
        div = x % y
    return y

K,X=LI()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(i) for i in input().split()]
K, X = l
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 = [int(x) for x in input().split()]
print('Yes' if K*500 >= X else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def wczytaj_liste(): 
    wczytana_lista = input()
    lista_znakow = wczytana_lista.split()
    ostateczna_lista = []
    for element in lista_znakow:
        ostateczna_lista.append(int(element))
    return ostateczna_lista 

def yen_coins():
    X, K = wczytaj_liste()
    if X * 500 >= K:
        print("Yes")
    else: 
        print("No")
        
yen_coins()

Submission status: Accepted

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

if rest >= b:
   ans = "Yes"
else:
   ans = "No"

print(ans)

Submission status: Accepted

Solution code:
inp = input().split()
K = int(inp[0])
X = int(inp[1])

#print("K= ", K,"X= ", X)

result = "Yes"

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

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:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
import sys

def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
K = a[0]
X = a[1]

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:
a,b = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:

k, y = (int(x) for x in input().split())

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

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())
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:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    k,x=INTM()
    if k*500>=x:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

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

else:
    print('No')

Submission status: Accepted

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

if int(x) <= int(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())
print("YNeos"[k*500<x::2])

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

Submission status: Accepted

Solution code:
a,b = input().strip().split()
a = int(a)
b = int(b)
p = 500 * a
if p >= b:
  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:
#abc150a

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

Submission status: Accepted

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

"""
name: A-500.py
プログラムの説明
"""

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
KX = input().split()
K = int(KX[0])
X = int(KX[1])
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 sys

def main():
	
	#sys.stdin = open('input150a.txt')
	
	k, s = map(int, input().split())
	
	mk = k * 500
	if mk >= s:
		print('Yes')
	else:
		print('No')
	
if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
n, m = [int(x) for x in input().split()]
n *= 500
if n >= m:
    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:
X,K = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
s = input().split()
K = int(s[0])
X = int(s[1])
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, x = map(int, input().split()) # 500円玉の枚数

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    resolve()

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 X <= 500*K:
    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:
from sys import stdin
#n = int(stdin.readline().rstrip())
#l = list(map(int, stdin.readline().rstrip().split()))
k,x = map(int, stdin.readline().rstrip().split())
#S = [list(map(int, stdin.readline().rstrip().split())) for _ in range(h)]#hの定義を忘れずに

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:
#coding:utf-8
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 bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353


k, x = list(map(int, sys.stdin.buffer.readline().split()))
ok = 500 * k >= x
if ok\
        :
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

from collections import deque, defaultdict
import itertools as ite
import sys
import math
from decimal import *

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

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

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

Submission status: Accepted

Solution code:
from sys import stdin
K, X = [int(_) for _ in stdin.readline().rstrip().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:
a,b = list(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:
from heapq import heappush, heappop
from collections import deque
import re
import math
import functools


def sRaw():
    return input().rstrip("\r")


def iRaw():
    return int(input())


def ssRaw():
    return input().split()


def isRaw():
    return list(map(int, ssRaw()))


INF = 1 << 29


def mk1d(n, val=INF):
    return [val for i in range(n)]

def mk2d(h, w, val=INF):
    return [[val for i in range(w)]for i in range(h)]

DIV = 998244353


def convolve(a, b):
    p, g = 1107296257, 5
    n0, n1 = len(a), len(b)
    n = 1 << (max(n0, n1) - 1).bit_length() + 1
    a = a + [0] * (n-n0)
    b = b + [0] * (n-n1)
    w = pow(g, (p - 1) // n, p)
    invw = pow(w, p-2, p)

    def fft(f):
        d = n // 2
        v = w
        while d >= 1:
            u = 1
            for i in range(d):
                for j in range(i, n, 2*d):
                    f[j], f[j+d] = (f[j] + f[j+d]) % p, u * (f[j] - f[j+d]) % p
                u = u * v % p
            v = v * v % p
            d //= 2

    def ifft(f):
        d = 1
        while d < n:
            v = pow(invw, n // (2 * d), p)
            u = 1
            for i in range(d):
                for j in range(i, n, 2*d):
                    f[j+d] *= u
                    f[j], f[j+d] = (f[j] + f[j+d]) % p, (f[j] - f[j+d]) % p
                u = u * v % p
            d *= 2

    fft(a), fft(b)
    for i in range(n):
        a[i] = a[i] * b[i] % p
    ifft(a)
    invn = pow(n, p - 2, p)
    return [a[i] * invn % p for i in range(n0 + n1 - 1)]


def main():
    N,M = isRaw()
    ans = "Yes" if 500*N >=M else "No"
    return ans

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

Submission status: Accepted

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

if n[0]*500>=n[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())
print('Yes' if 500*K>=X else 'No')

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[] for _ in range(num)]
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

K,X = II()

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

Submission status: Accepted

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

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:
# coding: utf-8
# Your code here!

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

Solution code:
K, X = tuple(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 (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, x = list(map(int, input().split()))

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

Submission status: Accepted

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

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