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( ))
di = s*t
if di >= d:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def inputt():
    return sys.stdin.readline().strip()
def printt(n):
    sys.stdout.write(str(n)+'\n')
def listt():
    return [int(i) for i in inputt().split()]
D,T,S=map(int,input().split())
if (D/S)<=T:
    printt("Yes")
else:
    printt("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().strip().split()))

if T*S >= D :
    print("Yes")
else:
    print("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())

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

Submission status: Accepted

Solution code:
# A - Don't be late

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

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if t < d / s:
    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:
lol = input()
lst = lol.split()

for i in range(len(lst)):
    lst[i] = int(lst[i])

d = lst[0]
t = lst[1]
s = lst[2]
q = s*t
if q < d:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
distance, time, speed = [int(x) for x in input().split()]

if distance/speed <= time:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

d,t,s = map(int,read().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:
D, T, S = map(int, input().split())

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

Submission status: Accepted

Solution code:
d, t, s = input().split()
print('Yes' if(int(t)*int(s)) >= int(d) 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:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
 
d, t, s = map(int, input().split())
if d <= t * s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
input1 = list(map(int, input().split()))
D = input1[0]
T = input1[1]
S = input1[2]

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

Submission status: Accepted

Solution code:
import numpy as np
from copy import deepcopy
from heapq import heappop, heappush
from bisect import bisect_left, bisect
from collections import Counter, defaultdict, deque
from itertools import product, permutations, combinations

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

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

exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, t, s = map(float, input().split())
take = d/s
if take <= t:
    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 d/s <= t :
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s = map(float, 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:
d,t,s = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    l_input = list(map(int, input().split()))
    time = l_input[0] / l_input[2]
    if(time <= l_input[1]):
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if a[0]/a[2]<=a[1]:
  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 solve(D,T,S):
  return "Yes" if D/S<=T else "No"

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

D,T, S = LI()

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<=S*T else 'No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**6)

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())
duration = float(D)/float(S)
if duration > T:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())
if a<=b*c:
    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 i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

d,t,s = i2()
a = d/s
if a <= t:
	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:
import sys

input = sys.stdin.readline

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

time = D / S

if(time <= T):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
print("Yes" if a/c <= b 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:
  ans = 'Yes'
else:
  ans = 'No'

print(ans)

Submission status: Accepted

Solution code:
D,T,S=map(int, input().split())
A=T*S
if A >=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 t*s >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#! /usr/bin/env python
# -*- coding: utf-8 -*-
# vim:fenc=tf-8
#

"""
"""

from collections import defaultdict
import bisect

import sys
input = sys.stdin.readline

def solve(d,t,s):
    if (d+s-1)//s <= t:
        print('Yes')
    else:
        print('No')

            

def main():
    d,t,s = map(int,input().split())
    solve(d,t,s)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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


def main():
    probA()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
time = d/t
if time <= s:
    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:
d,t,s=map(int,input().split())
if s == 0:
    print("No")
elif d/s <= t :
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
X = input().split()
D = int(X[0])
T = int(X[1])
S = int(X[2])

time = D/S

if time <= 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:
d, t, s = map(int,input().split())
r = d % s
l = d / s
if l <= 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:
from math import *

def cin(): # To take limited number of inputs
    return map(int,input().split())

def cins(): # To take space sepreated strings
    return input.split()

def cino(test=False): # To take individual int input (test = False)
    if not test:
        return int(input())
    else: # To take string input (test = True)
        return input()

def cina(): # array input
  return list(map(int,input().split()))

def ssplit(): # multiple string input
    return list(input().split())

def printlist(l): # To print space seperated array
    for i in l:
        print(i,end=" ")

def main():
    a,b,c = cin()
    if a/c <= b:
      print("Yes")
    else:
      print("No")

if __name__ == '__main__':
    main()

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

if(b>=(a/c)):
    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:
d,t,s=map(int,input().split())
if (d/s<=t) : print("Yes")
else : print ("No")

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if c*b>=a:
  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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,T,S = [int(e) for e 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:
D, T, S = map(int, input().split())
print("Yes") if T>=D/S else print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

d,t,s=map(int,input().split())    #->x=1,y=2

if (d-(t*s)) <= 0:
    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 = (int(y) for y in input().split())

x=d/s
if x>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/s<=t:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
cnt = d/s
if cnt <= 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())
    if d <= t * s:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 29 20:26:17 2020

@author: wiste
"""

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


if d > s*t:
    ans = 'No'
else:
    ans = 'Yes'


print(ans)

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(d, t, s)
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 t >= ans:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

def main():
    mod=10**9+7
    d,t,s=MI()
    
    tt=d/s
    
    if t<tt:
        print("No")
    else:
        print("Yes")

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

result = 'Yes' if D <= T * S else 'No'

print(result)

Submission status: Accepted

Solution code:
input_list = input().rstrip().split(' ')
D = int(input_list[0])
T = int(input_list[1])
S = int(input_list[2])

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:
from sys import stdin, stdout
def gmi(): return map(int, stdin.readline().strip().split())
def gms(): return map(str, stdin.readline().strip().split())
def gari(): return list(map(int, stdin.readline().strip().split()))
def gars(): return list(map(int, stdin.readline().strip().split()))
def gs(): return stdin.readline().strip()
def gls(): return list(stdin.readline())
def gi(): return int(stdin.readline())

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

Submission status: Accepted

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

Submission status: Accepted

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

x=d/s

if t>=x:
    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 <= T * S:
  print("Yes")
else:
  print("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())
print("Yes") if d <= t * s else print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
D, T, S = map(float, input().split())
ss = D/S

if (ss <= T):
  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=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 / S) <= T:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
    D, T, S = map(int, input().split())
    if float(T) < float(D) /float(S) :
        print("No")
    else:
        print("Yes")
    #N = int(input())
    #A = [int(s) for s in input().split()]
    #

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 = map(int, input().split())
if (d / s <= t):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

if D <= T * S:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    d, t, s = map(int, input().split(" "))

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
jikan=d/s
if jikan<=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
def main():
    # n = int(input())

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_str = input()
input_elements = input_str.split()

d = float(input_elements[0])
t = float(input_elements[1])
s = float(input_elements[2])

arrive_time = d / s

if t >= arrive_time:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
time = D/S
if time <= T:
  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
import math
D, T, S = list(map(int, input().split()))

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

else:
    print('Yes')

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
D=a[0]
T=a[1]
S=a[2]
 
v=D/T
if S>=v:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
d, t, s = [int(a) for a in input().split()]
if s * t >= d:
  print("Yes")
else:
  print("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
d, t, s = map(int, input().split())

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

Submission status: Accepted

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

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:
D, T, S = map(int, input().split())
ans = 'Yes'
if D > T*S:
    ans = 'No'
print(ans)

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:
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7

from math import gcd

Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()

d,t,s =  Ri()
if d/s <= t:
    Yes()
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())


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

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
print('YNeos'[s * t < d::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
L = input().split()
D, T, S = [int(i) for i in L]

if T*S < D:
    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 = [int(hoge) for hoge in input().split()]
if S*T >=D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d,t,s = [int(i) for i in input().split()]
k = d/t
if s >= k:
  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 D - S*T <= 0:
    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:
import math
d, t, s = map(int, input().split())

if math.ceil(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 = list(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:
from itertools import combinations
import math
#N = int(input())
#C = input()
D, T, S=map(int,input().split())
#C = []
#for i in range(N):
#    C.append(list(map(int,input().split())))

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

Submission status: Accepted

Solution code:
import sys

def solve():
      input = sys.stdin.readline
      D, T, S = map(int, input().split())
      if S * T >= D: print("Yes")
      else: print("No")

      return 0

if __name__ == "__main__":
      solve()

Submission status: Accepted

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

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:
import math
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 T >= D / S:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
def read():
    D, T, S = map(int, input().split(' '))
    return D, T, S

def func(D, T, S):
    return D / S <= T


if __name__ == '__main__':
    D, T, S = read()
    print('Yes' if func(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:
def main():
    D, T, S = map(int, input().split())
    answer = solve(D, T, S)
    print(answer)


def solve(D, T, S):
    return 'Yes' if D <= S * T else 'No'


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
D, T, S = list(map(int, input().split()))
if int(D / S) < T or ((D % S) == 0 and int(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("No")
else:
    print("Yes")

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 <= t * s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

a = d/s

if a <= t:
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

A =  D/S

if (A  > T):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
from sys import stdin


D,T,S = [ int(x) for x in stdin.readline().rstrip().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 = map(int, input().split())
print("Yes" if d/s<=t else "No")

Submission status: Accepted

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

m = float(D) / float(S)

if int(T) >= m:
  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:
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(float,input().split())

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

Submission status: Accepted

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

d = li[0]
t = li[1]
s = li[2]

if d > t*s:
    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')