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())
if D >= 1 and D <= 10000:
    if T >= 1 and T <= 10000:
        if S >= 1 and S <= 10000:
            if T >= D/S:
                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:
from math import ceil
d,t,s=map(int,input().split())
if t>=ceil(d/s):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.buffer.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 = input().split()
d = float(D)
t = float(T)
s = float(S)

a = float(d / s)

if a > 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())
c='No'
if T*S>=D:
    c='Yes'
print(c)

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
inpl = lambda: list(map(int,input().split()))
D, T, S = inpl()
if S * T >= 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:
inp = [int(x) for x in input().split()]
D = inp[0]
T = inp[1]
S = inp[2]
res = "No" if D > T*S else "Yes"
p = print(res)

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 is_late(distance, time, speed):
  if distance/speed <= time:
    return "Yes"
  else:
    return "No"
  
if __name__ =="__main__":
  user = [int(i) for i in input().split()]
  print(is_late(user[0], user[1], user[2]))

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:
#%%
from sys import exit, stdin

input = stdin.readline
import copy

# from collections import deque,Counter
# import numpy as np


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

Submission status: Accepted

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

t = D/S

if T<t:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) ]))
def invr():
    return(map(int,input().split()))
  
i = inlt()
D = i[0]
T = i[1]
S = i[2]
 
if D/T > S:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

if int(S)*int(T)>=int(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:
if __name__ == "__main__":
    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')
else:
    print('No')

Submission status: Accepted

Solution code:
line = input()

items = line.split()

d = int(items[0])
t = int(items[1])
s = int(items[2])

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

Submission status: Accepted

Solution code:
d, t, s = input().split(" ")
 
if int(s) * int(t) < int(d):
  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:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
ar=input().split()
if int(ar[0])/int(ar[2])<=int(ar[1]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

time = d / s
ans = "Yes"

if time > t:
  ans = "No"
  
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
try:
    D,T,S=map(int,input().split())
    t=D/S
    if t<=T:
        print("Yes")
    else:
        print("No")
except EOFError as e:
    print(e)

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


def solve(d, t, s):
    result = "No"
    if d <= t * s:
        result = "Yes"
    return result


def main():
    d, t, s = input_from_console()
    print(solve(d, t, s))


if __name__ == "__main__":
    import sys

    if sys.gettrace():  # Check if the python interpreter is in debug mode or not.
        check_cases()
    else:
        main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#
# 177A
#
s = input()
a = s.split()

d = int(a[0])
t = int(a[1])
s = int(a[2])

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

Submission status: Accepted

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

D = int(a[0])
T = int(a[1])
S = int(a[2])

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:
#A - Don't be late
D,T,S= map(int,input().split())

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

Submission status: Accepted

Solution code:
inputArr = input().split(" ")
check = int(inputArr[2]) - (int(inputArr[0]) / int(inputArr[1]))
if check >= 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, t, s = list(map(lambda x: int(x), 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>=D/S:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
input_data = input()

D = float(input_data.split(" ")[0])
T = float(input_data.split(" ")[1])
S = float(input_data.split(" ")[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/t <= s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

    min = D / S

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

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
from sys import stdin

D, T, S = [int(x) for x in stdin.readline().rstrip().split()]

print("Yes" if T * S >= D 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:
# import math


def get_int_args():
    args = input().split()
    return list(map(int, args)), len(args)


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


if __name__ == '__main__':
    a, b, c = tuple(get_int_args()[0])
    if (a <= b * c):
        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:
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:
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())
c=d/s
cc= round(c,2)
if cc<=t:
    # print(c)
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

t = S[0]/S[2]

if t <= S[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:
range,time,speed = map(int, input().split())
if time >= range/speed:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    d, t, s = map(int, input().split())


    q = d/s

    if t < q:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
import sys
import  math
import fractions
from collections import defaultdict
stdin = sys.stdin
     
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

Solution code:
d,t,s=map(float, raw_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:
a = list(map(int,input().split()))
syoyou = a[0]/a[2]
if syoyou <= a[1]:
    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())
add = 0
for i in range(T):
  add += S
  if add >= D:
    print('Yes')
    exit()
print('No')

Submission status: Accepted

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

import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Submission status: Accepted

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

TT = round(D / S, 5)

if TT <= T:
    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:
line = input().split()

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

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

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
dist = 0
time = 0
while dist < d and time<=t:
    dist += s
    time += 1
if time > 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 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:
input_n = input()
n = str(input_n)

#listN = list(n)
listN = n.split(' ')

distance = int(listN[0])
time = int(listN[1])
speed = int(listN[2])

if (distance / speed) <= time:
    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 = T * S - D
if a >= 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def NextInts(): return map(int,input().split())

D,T,S = NextInts()

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

Submission status: Accepted

Solution code:
#import sys

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,T, S = map(float, input().split())
if D <= T*S :
    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:
inputValue=input()

l=inputValue.split(" ")
D=int(l[0])
T=int(l[1])
S=int(l[2])

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

Submission status: Accepted

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

s = l[0]/l[2]

if s <= l[1]:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
arr=[int(i) for i in input().split()]
if(arr[0]/arr[2]<=arr[1]):
  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())

num=t*s

if num>=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 = (int(x) for x in input().split())
print('Yes' if s*t >= d else '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 = [int(x) for x in input().split()]
if d/s <= t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
strd,strt,strs =  input().split()

d = int(strd)
t = int(strt)
s = int(strs)

yesno = 'Yes'

if d > t * s:
  yesno = 'No'

print(yesno)

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

Submission status: Accepted

Solution code:
import sys
from collections import deque
import bisect
import copy
import heapq
import itertools
import math
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]


def main():
    D, T, S = read_values()
    print("Yes" if D <= T * S else "No")


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(3):
    str[i] = int(str[i])

a = float(str[0] / str[2])

if a <= str[1]:
    print("Yes")
    
else:
    print("No")

Submission status: Accepted

Solution code:
d,t,s=map(int,input().split())
x=s*t-d
if x>=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:
import sys

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

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())
X = D/S
if X > 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 = (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:
D, T, S = map(float,input().split())

if float(D)/float(S) <= T:
    print('Yes')
elif float(D)/float(S) > T:
    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 = (int(x) for x in 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<=t*s:
  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())
if t*s >= d : print('Yes')
else : print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
dts = input().split()
if int(dts[1])*int(dts[2]) >= int(dts[0]):
    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 = [int(i) for i in input().split()]

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

Submission status: Accepted

Solution code:
import sys

a = input().split()

b = int(a[0]) / int(a[2])

if b <= int(a[1]):
    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")



# 2darray [[0] * 4 for i in range(3)]
# import itertools

Submission status: Accepted

Solution code:
D,S,T = map(int,input().split())
val = 0
for i in range(T):
    val += S
if val >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
D,T,S=input().split()
if int(T)*int(S) >= int(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:
# coding: utf-8
# Your code here!
# 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 = input().split()
D = float(D)
T = float(T)
S = float(S)
speed = D/T
if S >= speed:
    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:
def main():

    # 標準入力からデータの受け取り
    l_list = list(map(int, input().split()))
    d = l_list[0]
    t = l_list[1]
    s = l_list[2]

    # 待ち合わせまでの時間に間に合う？
    if (d / s <= t):
        print("Yes")
    else:
        print("No")


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

t = D / S

if t <= 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:
import numpy as np

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

o = d / s
if o <= t:
    o = 'Yes'
else:
    o = 'No'

print(o)

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:
# your code goes here
a,b,c=map(int,input().split())
if b>=a/c:
	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())
result = T * S
if result >= D:
    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 =(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())
print('Yes') if d <= t*s 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())
print("Yes" if d-s*t<=0 else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

if __name__ == '__main__':
    a = list(map(int, input().rstrip().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())
print("YNeos"[d/s>t::2])

Submission status: Accepted

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

D = i[0]
T = i[1]
S = i[2]

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 t*s>=abs(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:
arr = list(map(int, input().rstrip().split()))
D = arr[0]
T = arr[1]
S = arr[2]
if (D/T)<=S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

Submission status: Accepted

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

Submission status: Accepted

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

ts = d / s
diff = ts - t
if diff > 0:
  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= map(int,input().split())
D1=T*S
if(D1>=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=[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().rstrip().split()))

targetPos = D_T_S[0]
time_Limit = D_T_S[1]
velocity = D_T_S[2]

arrival_time = targetPos / velocity
if (arrival_time > time_Limit):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

    print('No')
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:
n = list(map(int,input().split()))
t = n[0] / n[2]
if t <= n[1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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