Problem:


Score : 100 points

Problem Statement

Takahashi is meeting up with Aoki.

They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.

Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.

Will he arrive in time?

Constraints

1 \leq D \leq 10000

1 \leq T \leq 10000

1 \leq S \leq 10000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

D T S

Output

If Takahashi will reach the place in time, print Yes; otherwise, print No.

Sample Input 1

1000 15 80

Sample Output 1

Yes

It takes 12.5 minutes to go 1000 meters to the place at a speed of 80 meters per minute. They have planned to meet in 15 minutes so he will arrive in time.

Sample Input 2

2000 20 100

Sample Output 2

Yes

It takes 20 minutes to go 2000 meters to the place at a speed of 100 meters per minute. They have planned to meet in 20 minutes so he will arrive just on time.

Sample Input 3

10000 1 1

Sample Output 3

No

He will be late.



Sample input:
1000 15 80


Sample output:
Yes

Submission status: Accepted

Solution code:
d, t, s = map(int,input().split())
print('Yes' if t*s >=d else 'No')

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())

if t*s >= d:
    print('Yes')
    
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d / float(s) <= t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if S >= D/T :
    print ("Yes")
else :
    print ("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d <= t*s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())

if d/s<=t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    D, T, S = map(int, input().split())
    print('Yes') if T*S>=D else print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if t*s>=d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = list(map(int, input().split()))

if -(-D // S) <= T:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if T * S >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

# スペース区切りの整数の入力
d, t, s = map(int, input().split())

# print(d/t)

if (d / t) <= s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int,input().split())
t = D / S

if t<=T or D == 0:
  print("Yes")
elif S == 0 or T == 0:
  print("No")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
	d, t, s = map(int, input().split())
	print("Yes") if d/s<=t else\
		     print("No")
main()

Submission status: Accepted

Solution code:
#A
d,t,s =map(int,input().split())
if t*s>=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-


def main():
    D, T, S = map(int, input().split())
    print("No" if T * S < D else "Yes")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

def resolve():
    num = list(map(int, input().split()))
    time = num[0] / num[2]
    if time <= num[1]:
        print("Yes")
    else:
        print("No")
resolve()

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if D/T <= S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
T = d/s
if(t>=T):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
import sys
import os
from operator import mul

sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))

if os.getenv("LOCAL"):
    inputFile = basename_without_ext = os.path.splitext(os.path.basename(__file__))[0]+'.txt'
    sys.stdin = open(inputFile, "r")
INF = float("inf")


D,T,S = LI()
if T < D/S:
    ans = 'No'
else:
    ans = 'Yes'


print(ans)

Submission status: Accepted

Solution code:
D, T, S = map(int,input().split())


if D/S <= T:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())

if d/t>s:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

answer = D / S

if T >= answer:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = list(map(int,input().split()))
if D <= T*S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print("Yes" if d/s <= t else "No")

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
if T*S >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

print('Yes' if s*t>=d else 'No')

Submission status: Accepted

Solution code:
import sys

# A - Don't be late
D, T, S = map(int, input().split())

if S * T >= D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split(" "))

if D/S <= T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

kyori = line[0]
lim = line[1]
speed = line[2]

ans = kyori/speed

if ans <= lim:
  print("Yes")

else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if d/s<=t :
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t ,s = map(int, input().split())
if d <= s * t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

print("Yes" if s*t >= d else "No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

r = d/t
print("Yes" if r <= s else "No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if T*S >= D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D,T,S = (int(x) for x in input().split())

disable = D - T*S

if disable>0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
def tc(arr):
    tn = arr[0]/arr[2]
    return "Yes" if tn<=arr[1] else "No"





u = list(map(int, input().split()))
print(tc(u))

Submission status: Accepted

Solution code:
d, t, s = list(map(int, input().split()))
if d > t*s:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if S*T >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
def digit():
    return int(input())
def list1():
    return list(map(int,input().split()))
def isperfectsquare(n):
    return True if int(math.sqrt(n)+0.5)**2==n else False

def main():
    s,t,d=list1()
    print('Yes' if s/d<=t else 'No')
main()

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if S * T >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print('Yes' if d <= t*s else 'No')

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())

if (D/S)>T:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
print('Yes' if d<=t*s else 'No')

Submission status: Accepted

Solution code:
D,T,S = list(map(int, input().split()))

if S*T >= D:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
A=[int(_) for _ in input().split()]
if A[0]<=A[1]*A[2]: 
  print("Yes")
else: 
  print("No")

Submission status: Accepted

Solution code:
def solve():
    D, T, S = map(int, input().split())
    if T * S >= D:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if S * T >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
idou=T*S
if D <=idou:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print('Yes' if d/s <= t else 'No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if S * T >= D:
  print('Yes') 
else:
  print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if D > T*S:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
D, T, S = [int(v) for v in input().split()]
print("Yes" if D / S <= T else "No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d <= t * s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
ans=D/S
if ans<=T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = [int(x) for x in input().split()]
print(["Yes", "No"][d > t*s])

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
m=D/S
if m<=T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if(d/s <= t):
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
D,T,S = list(map(int,input().split())) 
if (D <= T * S):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
print ("Yes") if d/s <= t else print ("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
print("No") if d / s > t else print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

print('Yes' if d / s <= t else 'No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d <= t*s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from sys import stdin

d, t, s = [int(x) for x in stdin.readline().rstrip().split()]

print("Yes" if s * t >= d else "No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if (d/s)<=t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D,T,S=map(int, input().split())
if S*T>=D:
    print ("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())

print('Yes' if t>=d/s else 'No')

Submission status: Accepted

Solution code:
d, t, s = list(map(int, input().split()))
if d/s <= t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
from decimal import *
import random

d,t,s = map(int, input().split())
if(s*t>= d):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int, input().split())
if d<=t*s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = list(map(int,input().split()))
if(t>=(d/s)):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    d, t, s = map(int, input().split())
    if d <= (t*s):
        ans = 'Yes'
    else:
        ans = 'No'

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
print("Yes" if D <= S*T else "No")

Submission status: Accepted

Solution code:
d,t,s=list(map(int,input().split()))
if d<=s*t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())

dist = t * s

if dist >= d:
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())
if d/s >t:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if D <= T * S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import numpy as np
from math import ceil as C, floor as F, sqrt
from collections import defaultdict as D, Counter as CNT
from functools import reduce as R
import heapq as HQ

class Heap:
  def __init__(self, data, reverse=False):
    self.reverse = -1 if reverse else 1
    self.data = [self.reverse * d for d in data]
    HQ.heapify(self.data)
  def push(self, x): return HQ.heappush(self.data, self.reverse * x)
  def pop(self): return self.reverse * HQ.heappop(self.data)

ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'
def _X(): return sys.stdin.readline().rstrip().split(' ')
def _S(ss): return tuple(ss) if len(ss) > 1 else ss[0]
def S(): return _S(_X())
def Ss(): return list(S())
def _I(ss): return tuple([int(s) for s in ss]) if isinstance(ss, tuple) else int(ss)
def I(): return _I(S())
def _Is(ss): return list(ss) if isinstance(ss, tuple) else [ss]
def Is(): return _Is(I())

d, t, s = I()
print('Yes' if d/s <= t else 'No')

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
if D>T*S:
  print('No')
  
else:
  print('Yes')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if S*T >= D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

if n[0] <= n[1] * n[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if a[0] / a[2] > a[1]:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if d/s<=t:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())

if D/S<=T:
  print ("Yes")
else :
  print ("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

print('Yes' if D / S <= T else 'No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d <= t * s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
d,s,t = map(int, input().split())

if s*t >= d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())

ans = d / s

if ans > t:
    print("No")
else :
    print("Yes")

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if D/S>T:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
#n = int(input())
d, t, s = map(int, input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]

if t*s >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = list(map(int, input().split()))

if s * t < d:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d/s<=t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())

if D / S <= T :
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
d, t, s = [int(i) for i in input().split()]

if(s*t >= d):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

print('Yes' if T * S >= D else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())


m = t * s
if d <= m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
print('Yes' if eval(input().replace(' ','<=',1).replace(' ','*',1)) else 'No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if T >= D / S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if D/S <=T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())

if d/s <= t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
if d <=s*t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    d,t,s=map(int,input().split())
    print("Yes" if d/s<=t else "No")
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
def func(D,T,S):
  actualTime = D / S
  if actualTime <= T:
    return "Yes"
  else:
    return "No"


if __name__ == "__main__":
    inputStr = input().split(' ')
    D = int(inputStr[0])
    T = int(inputStr[1])
    S = int(inputStr[2])
    print(func(D,T,S))

Submission status: Accepted

Solution code:
d, t, s = list(map(int, input().split()))
ans = 'Yes' if d / s <= t else 'No'
print(ans)

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
print("Yes" if d <= t * s else "No")

Submission status: Accepted

Solution code:
D, T, S = list(map(int, input().split()))
if D / S <= T: print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if D <= T*S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int,input().split())
if (a / c) <= b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
a = d/s
if t>=a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d <= t*s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())

if D/S<=T:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d, t, s = list(map(int, input().split()))
if d / t <= s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if D/S <= T:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:

d,t,s = map(int,input().split())


if d <= t * s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
if D/S <= T:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())

if s*t>=d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

d, t, s = map(int, input().split())
if t * s >= d:
  answer = 'Yes'
else:
  answer = 'No'
print(answer)

Submission status: Accepted

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

class main:
  def judge(d, x):
    if d <= x:
      print("Yes")
    else:
      print("No")

if __name__ == "__main__":
  d, t, s = map(int, input().split())
  dis = t * s
  main.judge(d,dis)

Submission status: Accepted

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

import sys

input = iter(sys.stdin.read().splitlines()).__next__

D, T, S = map(int, input().split())

print('Yes' if D <= T*S else 'No')

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
if T*S>=D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if S * T >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d/s > t:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d > t * s:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

print("Yes" if D <= T*S else "No")

Submission status: Accepted

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

print("YNeos"[a/c > b::2])

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())
if d/s > t: print('No')
else: print('Yes')

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())

if D/S<=T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())

if (D/T) <= S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D <= S * T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d > t*s:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
print('Yes' if (D+S-1)//S <= T else 'No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if D<=S*T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int, input().split())
print('Yes' if S*T>=D else 'No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
if D > S*T:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split());print('YNeos'[a/b>c::2])

Submission status: Accepted

Solution code:

D, T, S = list(map(int, input().split()))

if D <= S * T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print('Yes' if -(-d//s) <= t else 'No')

Submission status: Accepted

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

#n = int(input())
#l = list(map(int, input().split()))

'''
a=[]
b=[]
for i in range():
    A, B = map(int, input().split())
    a.append(A)   
    b.append(B)'''
import math
d,t,s=map(int, input().split())
if math.ceil(d/t)>s:
    print("No")
else: print("Yes")

Submission status: Accepted

Solution code:
from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from functools import lru_cache
import math

#setrecursionlimit(10**6)
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())

INF, NINF = float('inf'), float('-inf')
MOD = 10**9 + 7

def main():
	d, t, s = rli()
	x = d/s 
	print("Yes" if x <= t else "No")
	stdout.close()

if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d/s > t:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d <= t*s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

print("Yes" if D / S <= T else "No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d/s > t:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if s*t >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d,t,s= map(int,input().split())
if s*t<d:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if d <= t*s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

ans = 'No'
if D / S <= T:
    ans = 'Yes'
print(ans)

Submission status: Accepted

Solution code:
import sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
def MI():return map(int,input().split())
def LI():return [int(i) for i in input().split()]
def LI_():return [int(i)-1 for i in input().split()]
def NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def NLI(n):return [[int(i) for i in input().split()] for i in range(n)]
def NLI_(n):return [[int(i)-1 for i in input().split()] for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def RA():return map(int,open(0).read().split())
def RLI(n=8,a=1,b=10):return [random.randint(a,b)for i in range(n)]
def RI(a=1,b=10):return random.randint(a,b)
def Rtest(T):
    case,err=0,0
    for i in range(T):
        inp=INP()
        a1,ls=naive(*inp)
        a2=solve(*inp)
        if a1!=a2:
            print((a1,a2),inp)
            err+=1
        case+=1
    print('Tested',case,'case with',err,'errors')
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
#mo=998244353
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
#sys.setrecursionlimit(10**9)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()

show_flg=False
show_flg=True

ans=0


d,t,s=LI()
Yn(t*s>=d)

Submission status: Accepted

Solution code:
d, t, s = map(int,input().split())
if s*t >= d:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
d, t, s =  map(int, input().split())
print("Yes" if t * s >= d else "No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
print("Yes" if D <= T * S else "No")

Submission status: Accepted

Solution code:
d, t, s = [int(x) for x in input().split()] 

ans = d / s

if ans > t:
   print('No')
elif ans < t or ans == t:
   print('Yes')

Submission status: Accepted

Solution code:
d,t,s = list(map(int,input().split()))

if t*s>=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
text = input()
text = text.split()

if int(text[1]) * int(text[2]) >= int(text[0]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d,t,s=map(int, input().split())
if d/t <= s:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
# A
D, T, S = map(int, input().split())
ans = 'Yes'

if D / S > T:
    ans = 'No'
print(ans)

Submission status: Accepted

Solution code:
D,T,S = list(map(int,input().split()))
if S*T>=D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
D,T,S = map(int,input().split())
a = ["Yes","No"]
print(a[D > S*T])

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
if d/s <= t:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())

if D <= T * S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))

a,b,c = inlt()
if a/c <= b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S = [int(x) for x in input().split()]

if D <= T * S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d / s <= t:
    print('Yes')
    exit()
else:
    print('No')
    exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
D, T, S = list(map(int, input().split()))

ans = "Yes" if D / S <= T else "No"

print(ans)

Submission status: Accepted

Solution code:
d,t,s = map(int, input().split())

if d/s<=t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
d, t, s = M()
if d/s <= t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
G,t,v = map(int,input().split(" "))
if G > v*t:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())

if (d <= t*s):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D, T, S= map(int, input().split())

if D/T<=S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int,input().split())

if s*t >= d:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if S*T<D:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
ans = "Yes" if t * s >= d else "No"
print(ans)

Submission status: Accepted

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

def main():
    d, t, s = map(int, input().split())
    if (t * s < d):
        print("No")
    else:
        print("Yes")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
if D<=T*S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())

if d <= s * t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
d, t, s =map(int, input().split())

if s * t >= d :
    print ("Yes")
else :
    print ("No")