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 = 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 500 * K >= X:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

ans = a*500

if ans >= b:
  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, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

price=500*K

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
import math
from fractions import gcd
from itertools import count
from functools import lru_cache
from collections import defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

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


main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
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('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 =map(int,input().split())
if 500*k >= 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  = 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())
print('Yes' if 500 * k >= x 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:
# 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:
s=list(map(int,input().split()))
a=s[0]*500
if s[1]<=a:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
#N = int(input())
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,b=[int(x) for x in input().split()]
if 500*a>=b:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
A, B = map(int, input().split())
if A * 500 >= B: 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:
[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())
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=[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 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:
K, X = list(map(int, input().split()))

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

Submission status: Accepted

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

if c>=K:
    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:
#coding:utf-8
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]
    K,X = LMIIS()
    if K*500 >= X:
        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:
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())
print('Yes' if 500*k >= 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 = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
import math
import bisect
import collections
import itertools
import heapq
import string
import sys
sys.setrecursionlimit(10**9)
def gcd(a,b):return math.gcd #最大公約数
def lcm(a,b):return (a*b) // math.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return map(int, input().split()) #整数map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i: divisors.append(n//i)
    return divisors
def is_prime(n):
    if n == 1: return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0: return False 
    return True
def primes(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i * 2, n + 1, i): is_prime[j] = False
    return [i for i in range(n+1) if is_prime[i]]
def sieve_of_e(n):
    is_prime = [True] * (n+1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5)+1):
        if not is_prime[i]: continue
        for j in range(i * 2, n+1, i): is_prime[j] = False
    return is_prime

K,X = imn()

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

Submission status: Accepted

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

if 500 * kx[0] >= kx[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:
import sys, re, os
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
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

# 最小公倍数
def gcd(a, b):
  if a < b:
      a, b = b, a
  while a % b != 0:
      a, b = b, a % b
  return b
 
# 最大公約数 
def lcm(a, b):
  y = a*b / gcd(a, b)
  return int(y)

k, x = MAP()

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

Submission status: Accepted

Solution code:
import sys
from pprint import pprint

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


if __name__ == '__main__':
    k, x = map(int, sys.stdin.readline().strip().split(" "))
    solve(k, x)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
'''input
2 2
1 2
3 4
3 4
2 1
'''
# A coding delight
from sys import stdin, stdout
import gc
from copy import deepcopy
gc.disable()
input = stdin.readline

	
# main starts
k, x = list(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())

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:
import sys; readline = sys.stdin.readline
from collections import deque

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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


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

Submission status: Accepted

Solution code:
from sys import stdin
import numpy as np


# noinspection PyShadowingBuiltinsInspection

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

    return


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

Submission status: Accepted

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

main()

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:
import sys


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
# 2020/01/10

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

p = 500*k

if(p>=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(v) for v in input().split()]

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

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
#input = sys.stdin.readline
import math

import itertools

#import bisect

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default


#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]
def main():
    k,x = map(int, input().split())
    print("Yes") if k*500>=x 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, x = map(int, input().split())
if 500 * n >= 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 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:
  ans = "Yes"
else:
  ans = "No"
print(ans)

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:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

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

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

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

Submission status: Accepted

Solution code:
from sys import stdin
import math

a,b = [int(x) for x in stdin.readline().rstrip().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:
import sys
from fractions import gcd
from itertools import groupby as gb
from itertools import permutations as perm
from itertools import combinations as comb
from collections import Counter as C
from collections import defaultdict as dd
sys.setrecursionlimit(10**5)
def y(f):
    if f:
        print('Yes')
    else:
        print('No')
def Y(f):
    if f:
        print('YES')
    else:
        print('NO')
def Z(f):
    if f:
        print('Yay!')
    else:
        print(':(')
def ispow(n):
    if int(n**.5)**2==n:
        return True
    return False

a,b = map(int,input().split())
y(a * 500 >= b)

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

Submission status: Accepted

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

k, x = [int(i) for i in 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('No')
else:
    print('Yes')

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def num():
    return int(input())
def nums():
    return list(map(int,input().split()))

K,X = nums()
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:
#!/usr/bin/env python3
import sys

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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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


if __name__ == '__main__':
    print(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:
a,x = map(int,input().split())

print('Yes' if a * 500 >= x else '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:
import sys,math,string,bisect
input=sys.stdin.readline
from collections import deque,defaultdict
L=lambda : list(map(int,input().split()))
Ls=lambda : list(input().split())
M=lambda : map(int,input().split())
I=lambda :int(input())
S=lambda :input().strip()
n,m=M()
if(n*500<m):
    print("No")
else:
    print("Yes")

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

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())
print(("No","Yes")[K*500>=X])

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 = [int(i) for i in 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(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())
ans = "Yes"if k*500 >=x else "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 K*500>=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:
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())
print("YNeos"[500*k<x::2])

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    K,X = MI()
    if 500*K >= X:
        print("Yes")
    else:
        print("No")
        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
# import numpy as np
# import scipy
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): # n=1
    return int(input())
def inpm(): # x=1,y=2
    return map(int,input().split())
def inpl(): # a=[1,2,3,4,5,...,n]
    return list(map(int, input().split()))
def inpls(): # a=['1','2','3',...,'n']
    return list(input().split())
def inplm(n): # x=[] 複数行
    return list(int(input()) for _ in range(n))
def inpll(n): # [[1,1,1,1],[2,2,2,2],[3,3,3,3]]
    return [list(map(int, input().split())) for _ in range(n)]

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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