Problem:


Score : 100 points

Problem Statement

Takahashi is meeting up with Aoki.

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

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

Will he arrive in time?

Constraints

1 \leq D \leq 10000

1 \leq T \leq 10000

1 \leq S \leq 10000

All values in input are integers.

Input

Input is given from Standard Input in the following format:

D T S

Output

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

Sample Input 1

1000 15 80

Sample Output 1

Yes

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

Sample Input 2

2000 20 100

Sample Output 2

Yes

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

Sample Input 3

10000 1 1

Sample Output 3

No

He will be late.



Sample input:
1000 15 80


Sample output:
Yes

Submission status: Accepted

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

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

Submission status: Accepted

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

x = t*s

if d <= x:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import copy
import math
import time
import statistics
import math
import itertools
import bisect
import sys
from decimal import *
from collections import deque


def get_int():
    return int(input())

def get_string():
    return input()

def get_int_list():
    return [int(x) for x in input().split()]

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

def get_int_multi():
    return map(int, input().split())

def get_string_char_list():
    return list(str(input()))

# print("{} {}".format(a, b))
# a_list = [0] * a
sys.setrecursionlimit(10 ** 6)

def main():
    start = time.time()

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

    #print(time.time() - start)


if __name__ == '__main__':
    main()

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:
dis, limit, speed = map(int, input().split())
time = dis / speed
judge = 'Yes' if time <= limit else 'No'
print(judge)

Submission status: Accepted

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

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 T * S >= D:
        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('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 = list(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())

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

Submission status: Accepted

Solution code:
str = input()
str = [int(x) for x in str.split()]

if(str[0] <= str[1] * str[2]):
  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>=D/S:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
l = list(map(int, input().split()))
d = l[0]
t = l[1]
s = l[2]
if t*s < d:
    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*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 = map(int, input().split())


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

Submission status: Accepted

Solution code:
# Python template 
from collections import defaultdict 
import sys
import math 

def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()


(d,t,s)= get_ints()

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

Submission status: Accepted

Solution code:
a = input().split()
a_num = [int(i) for i in a]

if a_num[0] / a_num[2] <= a_num[1]:
    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:
string = input()
val = string.split()
D = float(val[0])
T = float(val[1])
S = float(val[2])

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

Submission status: Accepted

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

Submission status: Accepted

Solution code:
d,s,t =[int(x) for x in 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 S*T >= D:
        print("Yes")
    else:
        print("No")
if __name__ == '__main__':
    main()

Submission status: Accepted

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

distance = T * S

if D <= distance:
  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())

dist = t * s

if dist >= 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('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_line = list(input().split())
input_line = [int(n) for n in input_line]
 
[D, T, S] = input_line
condition = D <= T*S
if condition:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D, T, S = list(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())
a=D/S
if T>=a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if d-s*t <= 0:
	print("Yes")

else:
	print("No")

Submission status: Accepted

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

Dist = s*t

if d <= Dist:
    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:
n,t,s = map(int,input().split(" "))
if n <= 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:
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
def celi(a,b):
    return -(-a//b)
sys.setrecursionlimit(5000000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


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


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


if __name__ == '__main__':
    inputs = read()
    outputs = solve(*inputs)
    if outputs is not None:
        print("%s" % str(outputs))

Submission status: Accepted

Solution code:
d, t, x = map(int, input().split())
if x*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)<=1 else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

B = int(A[1]) * int(A[2])

if int(A[0]) <= B:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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())
print('Yes' if t*s >= d else '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:
# input 入力を受け取る split 入力された文字列をスペースで分けて解釈 
# int integer整数 整数として解釈
# map ()内のものを、前の変数にそれぞれ割り当てる
D,T,S = map(int, input().split())

#T 時間 S 速さ の積が D 距離 を上回るかどうか？

# * 掛け算
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:
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

else:
  print("No")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)

input = sys.stdin.readline


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

    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
data = input().split()
time = int(data[0]) /  int(data[2])
if int(data[1]) >= time :
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:

meters, minutes, metersPerMinute = map(int, input().split())

willReach = meters <= metersPerMinute * minutes

if willReach:
    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 sys, bisect, math, itertools, string, queue, copy
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

d, t , s = inpm()
if(d > t * s):
    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:
d,t,s=map(int,input().split())
print('YNeos'[d>t*s::2])

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))


def solve():
    d, t, s = inl()
    return s * t >= d


print("Yes" if solve() else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#_______________________________________________________________#
def fact(x):
	if x == 0:
		return 1
	else:
		return x * fact(x-1)
def lower_bound(li, num): 
	answer = -1
	start = 0
	end = len(li)-1

	while(start <= end):
		middle = (end+start)//2
		if li[middle] >= num:
			answer = middle
			end = middle - 1
		else:
			start = middle + 1
	return answer #index where x is not less than num
def upper_bound(li, num): 
	answer = -1
	start = 0
	end = len(li)-1

	while(start <= end):
		middle = (end+start)//2

		if li[middle] <= num:
			answer = middle
			start = middle + 1
		
		else:
			end = middle - 1
	return answer #index where x is not greater than num

def abs(x):
	return x if x >=0 else -x
def binary_search(li, val, lb, ub): 
	ans = 0
	while(lb <= ub):
		mid = (lb+ub)//2
		#print(mid, li[mid])
		if li[mid] > val:
			ub = mid-1
		elif val > li[mid]:
			lb = mid + 1
		else:
			ans = 1
			break
	return ans
def kadane(x): #maximum sum contiguous subarray
	sum_so_far = 0
	current_sum = 0
	for i in x:
		current_sum += i
		if current_sum < 0:
			current_sum = 0
		else:
			sum_so_far = mpos(sum_so_far,current_sum)
	return sum_so_far
def pref(li):
	pref_sum = [0]
	for i in li:
		pref_sum.append(pref_sum[-1] + i)
	return pref_sum

#_______________________________________________________________#
'''
      ▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄▄
   ▄███████▀▀▀▀▀▀███████▄
░▐████▀▒▒Aestroix▒▒▀██████
░███▀▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▀████
░▐██▒▒▒▒▒KARMANYA▒▒▒▒▒▒████▌         ________________
░▐█▌▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒████▌  ? ?   |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|
░░█▒▒▄▀▀▀▀▀▄▒▒▄▀▀▀▀▀▄▒▒▐███▌   ?    |___CM ONE DAY___|
░░░▐░░░▄▄░░▌▐░░░▄▄░░▌▒▐███▌     ? ? |▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒|
░▄▀▌░░░▀▀░░▌▐░░░▀▀░░▌▒▀▒█▌    ? ?    
░▌▒▀▄░░░░▄▀▒▒▀▄░░░▄▀▒▒▄▀▒▌      ? 
░▀▄▐▒▀▀▀▀▒▒▒▒▒▒▀▀▀▒▒▒▒▒▒█     ? ? 
░░░▀▌▒▄██▄▄▄▄████▄▒▒▒▒█▀       ? 
░░░░▄█████████ ████=========█▒▒▐▌
░░░▀███▀▀████▀█████▀▒▌
░░░░░▌▒▒▒▄▒▒▒▄▒▒▒▒▒▒▐
░░░░░▌▒▒▒▒▀▀▀▒▒▒▒▒▒▒▐
░░░░░████████████████
'''
from math import *
#for _ in range(int(input())):
for _ in range(1):
	#n = int(input())
	#p,f = map(int,input().split())
	d,t,s = map(int,input().split())
	#ws,wa = map(int,input().split())
	#b = list(input())
	#x = int(input())
	#n = len(b)
	#s2 = input()
	#r, g, b, w = map(int,input().split())
	#a = list(map(int,input().split()))
	#b = list(map(int,input().split()))
	#s1 = list(st)
	if d/s > t:
		print('No')
	else:
		print('Yes')

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

Submission status: Accepted

Solution code:

import collections
from functools import lru_cache
import bisect

INF = float("inf")
ZERO = 0
ONE = 1


def read():
    return input().strip()


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


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


def solve(D, T, S):
    return S*T >= D


D, T, S = readList()
print("Yes" if solve(D, T, S) else "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:
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=(int(i) for i in input().split())
if(s*t>=d):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

else:
    print("No")

Submission status: Accepted

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

# 割り算（＝少数が出る）は使わずに、整数演算のみで解く
if D <= S*T: print('Yes')
else: print('No')

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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('NYoe s'[d<=t*s::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:
a, b, c = map(int, input().split())

if a <= b * c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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


def solve(D: int, T: int, S: int):

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



# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    D = int(next(tokens))  # type: int
    T = int(next(tokens))  # type: int
    S = int(next(tokens))  # type: int
    solve(D, T, S)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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