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 =(int(x) for x in input().split())
vt = D/S
if vt<=T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
s = list(map(int,input().strip().split()))
def main():
    if s[0] / s[2] <= s[1]:
        print("Yes")
    else:
        print("No")
    return

main()

Submission status: Accepted

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

Submission status: Accepted

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

D, T, S = LI()


def main():
    x = (D - 1) // S + 1
    ans = "Yes" if x <= T else "No"
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
d, t, s = [list(map(int, s.split())) for s in open(0)][0]
if t >= d/s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n , m, p = map(int, input().split())
#lst = list(map(int, input().split()))
if n/p <= m:
    print("Yes")
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
row = input().split()
dist = int(row[0])
time_meet = int(row[1])
speed = int(row[2])

time_need = dist / speed
if time_need <= time_meet:
    print('Yes')
else:
    print("No")

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
ok = d / s <= t
if ok:
    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 = [int (x) for x in input().split()]

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

Submission status: Accepted

Solution code:
def main():
  user_in = input("")

  D, T, S = user_in.split(" ")
  need_time = float(D) / float(S)
  
  if(need_time <= int(T)):
  	print("Yes")
  else:
  	print("No")
  
 
if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
d, t, s = map(int,input().split())

ret = 'No'
if s * t >= d:
    ret = 'Yes'

print(ret)

Submission status: Accepted

Solution code:
import sys
import re
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left, bisect_right
from functools import reduce
from decimal import Decimal, getcontext
# input = sys.stdin.readline
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7
num_list = []
str_list = []


def main():
    D,T,S = i_map()
    time = 0
    if D%S == 0 :
        time = D//S
    else:
        time = D//S+1

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

    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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


def main():
    [d, t, s] = [int(e) for e in si().split()]
    if d <= t*s:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
kk = list(map(int, input().split()))
D, T, S = kk
if D > T*S:
  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:
D, T, S = map(int, input().split())
X_minute = D/S
if X_minute<=T:
    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())
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:
input1 = input()
input1 = input1.split()
D, T, S = int(input1[0]), int(input1[1]), int(input1[2])
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,m,s = map(int,input().split())
if(d/s <= m):print("Yes")
else:print("No")

Submission status: Accepted

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

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

cost_t = D  / S
if T >= cost_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())
if d/s <= t:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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


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

Submission status: Accepted

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

r = d//s
if d % s != 0:
    r += 1

if t >= r:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

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 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())
# 標準入力 distance.time.speed

elapsed_time = d / s
# 実際に経過する時間を変数に代入
if elapsed_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 T*S < D:
    print("No")

else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

meter = int(inputs[0])
limit_minutes = int(inputs[1])
speed = int(inputs[2])

if meter > limit_minutes * speed:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = input().split(" ")
i1 = int(i[0])
i2 = int(i[1])
i3 = int(i[2])

arrive = (i1 / i3) <= i2
if arrive:
  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) = 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 = (int(x) for x in 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:
d, t, s = map(int, input().split())
if d/s >t:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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


dont_be_late()

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

Submission status: Accepted

Solution code:
D, S, T = 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')
elif D>T*S:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
a=[int(i) for i in a.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())
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("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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[D,T,S]=[int(_) for _ in input().split()]
print(['No','Yes'][D <= T*S])

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

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

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

Submission status: Accepted

Solution code:
import numpy as np
D,T,S=(int(x) for x in input().split())
if T<D/S:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input()
dis = int(data.split()[0])
time = int(data.split()[1])
speed = int(data.split()[2])


if dis <= time * speed:
	print("Yes")
  
else:
	print("No")

Submission status: Accepted

Solution code:
from sys import stdin
d,t,s = map(int, 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())
print("Yes" if d/s<=t else "No")

Submission status: Accepted

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

Submission status: Accepted

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

i = D/T

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

Submission status: Accepted

Solution code:
def checkMinutes(D, T, S):
    time_needed = D / S
    if time_needed <= T:
        return 'Yes'
    else:
        return 'No'    

input_arr = list(map(int, input().rstrip().split()))
D = input_arr[0]
T = input_arr[1]
S = input_arr[2]
print(checkMinutes(D, T, S))

Submission status: Accepted

Solution code:
dts = input().split()
D=int(dts[0])
T=int(dts[1])
S=int(dts[2])
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:
D, T, S = list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
nums=[int(e) for e in input().split()]
if nums[0]>nums[1]*nums[2]:
    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:
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())
u = d / s

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

Submission status: Accepted

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

Submission status: Accepted

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

ans=D/S

if T>=D/S:
    print("Yes")
    exit()

print("No")

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
D, T, S = [int(i) for i in input().split()]
if float(D)/S <= 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("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()
ID = float(D)
IT = float(T)
IS = float(S)
M = ID / IS



if M <= IT:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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


def main():
    D,T,S = list(map(int, sys.stdin.readline().split()))

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
intp = input().split(" ")
d,t,s = int(intp[0]), int(intp[1]), int(intp[2])

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

Submission status: Accepted

Solution code:
D, S,T=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 = (int(x) for x in input().split())

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

Submission status: Accepted

Solution code:
D, T, S = list(map(int, input().split()))
print('Yes') if S * T >= D 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 __future__ import division
d,t,s=map(int,raw_input().split())

def solve(d,t,s):
    x=float(d/s)
    
    if x<=t:
        return "Yes"
    else:
        return "No"
print(solve(d,t,s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = [int(x) for x in input().split()]
if l[0]/l[2] <= l[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:
s = input().split()
intD = int(s[0])
intT = int(s[1])
intS = int(s[2])

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

Submission status: Accepted

Solution code:
#Dm Tmin Sm/min

line = input().split()
D = int(line[0])
T = int(line[1])
S = int(line[2])

hurry = D / S

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

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

Submission status: Accepted

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

Submission status: Accepted

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

k = D/S

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

Submission status: Accepted

Solution code:
import numpy as np
s = [input() for i in range(1)]
list1 = list(map(int, s[0].split()))
d = list1[0]
t = list1[1]
s = list1[2]

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

Submission status: Accepted

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

s_list = s.split()

distance = int(s_list[0]) #m
time = int(s_list[1]) #min
sokudo = int(s_list[2]) #m/min

if(distance / sokudo) <= time:
    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 > 0:
    if D//S+1 > T:
        print("No")
        exit()
else:
    if D/S > T:
        print("No")
        exit()
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:
details = input()
new_details = details.split()
D = int(new_details[0])
T = int(new_details[1])
S = int(new_details[2])
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("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:
DTS = [int(i) for i in input().split()]
D = DTS[0]
T = DTS[1]
S = DTS[2]
if D/T <= S:
    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:
hako=list(map(int,input().split()))
S=hako.pop()
T=hako.pop()
D=hako.pop()
if S*T>=D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
from decimal import Decimal

D, T, S = map(int, input().split())
print('Yes' if Decimal(D / S) <= Decimal(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 = [int(s) for s in input().split()]
print('Yes' if D / S <= T else 'No')

Submission status: Accepted

Solution code:
[d, t, s] = map(int, input().split(" "))
travelled_dist = s*t
print('Yes' if travelled_dist >= d else '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:
x,y,z = map(int,input().split())
if x/z<= y:
	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())

ans = s*t

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

Submission status: Accepted

Solution code:
dts = input().split(" ")
d = int(dts[0])
t = int(dts[1])
s = int(dts[2])
cond1 = d >= 1 and d <= 10000
cond2 = t >= 1 and t <= 10000
cond3 = s >= 1 and s <= 10000
temp = 0
if cond1 == True and cond2 == True and cond3 == True:
    temp = t * s
    if temp >= d:
        print("Yes")
    else:
        print("No")
else:
    print()

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

Submission status: Accepted

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

Submission status: Accepted

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

k = d / s
if k > t:
    print("No")
else:
    print("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:
#one, two, three, four, five = map(int, input().split())
#li = list(map(int, input().split()))
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())

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

Submission status: Accepted

Solution code:
def main():
    D, T, S = map(int, input().split())
    needtime = D/S
    if needtime <= T:
        print("Yes")
    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:
s = input()
l = s.split(' ')

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

Submission status: Accepted

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

if num[0]/num[2] <= num[1]:
    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:
line = input(' ').split()
minu = int(line[0]) / int(line[2])
time = int(line[1])
if minu > time:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from functools import lru_cache
import sys
from itertools import product,combinations
from functools import reduce,lru_cache
import heapq

def vfunc(f): return lambda *lst, **kwargs: list(map(lambda *x:f(*x,**kwargs),*lst))

def list_t(l): return vfunc(lambda *args:args)(*l)

def rvfunc(f): return lambda *lst, **kwargs: list(map(lambda *x:rvfunc(f)(*x,**kwargs) if all(vfunc(lambda y:isinstance(y,list))(x)) else f(*x,**kwargs),*lst))

def reader():return vfunc(lambda l:l.split())(sys.stdin.readlines())

d,t,s = rvfunc(int)(reader()[0])
print('Yes' if d/t<=s 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())
print('Yes') if d/s <= t 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:
inputs = input().split()
D = int(inputs[0])
T = int(inputs[1])
S = int(inputs[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
""" A
"""
import sys
import math
from functools import reduce
from bisect import bisect_left

def readString():
    return sys.stdin.readline()

def readInteger():
    return int(readString())

def readStringSet(n):
    return sys.stdin.readline().split(" ")[:n]

def readIntegerSet(n):
    return list(map(int, readStringSet(n)))

def readIntegerMatrix(n, m):
    return [lambda _: readIntegerSet(m) for _ in range(0, n)]

def main(D, T, S):
    return "Yes" if T * S >= D else "No"

if __name__ == "__main__":
    _D, _T, _S = readIntegerSet(3)

    print(main(_D, _T, _S))

Submission status: Accepted

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

if result >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


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


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

Submission status: Accepted

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

Submission status: Accepted

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

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

t = D / S

if t <= T:
  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:
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')