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


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

t2= d/s
if(t>=t2):
  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('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')
elif D<=S*T:
  print('Yes')

Submission status: Accepted

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

calc = math.ceil(D/S)

if calc <= T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

m = D / S

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

time = D/S

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

div = d//s
md = d%s

if md == 0:
  if div <= t:
    print("Yes")
    exit()
else:
  if div+1 <= t:
    print("Yes")
    exit()

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 = list(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 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')
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())

f=d/s

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
line = input().split()
line = list(map(int, line))

if line[0]/line[2] <= line[1]:
  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())

t = D / S

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 標準入力を取得
D, T, S = list(map(int, input().split()))

# 求解処理
ans = str()
if D <= S * T:
    ans = "Yes"
else:
    ans = "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:
d,t,s=input().split(" ")
d=int(d)
t=int(t)
s=int(s)
if t>=d/s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python
#pyrival orz
import os
import sys
from io import BytesIO, IOBase

"""
    for _ in range(int(input())):
    n,m=map(int,input().split())
    n=int(input())
    a = [int(x) for x in input().split()]
"""

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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

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

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

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

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

Submission status: Accepted

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

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

    print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest
import os

# 再帰処理上限(dfs作成時に設定するのが面倒なので限度近い値を組み込む)
sys.setrecursionlimit(999999999)


# 実装を行う関数
def resolve(test_def_name=""):
    d, t, s = map(int, input().split())

    aa = t * s

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


# テストクラス
class TestClass(unittest.TestCase):
    def assertIO(self, assert_input, output):
        stdout, sat_in = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(assert_input)
        resolve(sys._getframe().f_back.f_code.co_name)
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, sat_in
        self.assertEqual(out, output)

    def test_input_1(self):
        test_input = """1000 15 80"""
        output = """Yes"""
        self.assertIO(test_input, output)

    def test_input_2(self):
        test_input = """2000 20 100"""
        output = """Yes"""
        self.assertIO(test_input, output)

    def test_input_3(self):
        test_input = """10000 1 1"""
        output = """No"""
        self.assertIO(test_input, output)

    # 自作テストパターン
    def test_original(self):
        pass


# 実装orテストの呼び出し
if __name__ == "__main__":
    if os.environ.get("USERNAME") is None:
        # AtCoder提出時の場合
        resolve()

    else:
        # 自PCの場合
        unittest.main()

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

Submission status: Accepted

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


if __name__ == '__main__':
    Qa()

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('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 - t*s <= 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 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:
dts = input().split()

d = int(dts[0])
t = int(dts[1])
s = int(dts[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 T * S >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if D%S==0:
    if int(D/S)<=T:
        print("Yes")
    else:
        print("No")
        
else:
    if int(D/S)+1<=T:
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
d,t,s = map(int, input().split())

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

Submission status: Accepted

Solution code:
A,B,C=map(int,input().split())
if B>=(A/C):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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:
num_line = input().split(" ")
kyori = int(num_line[0])
funsoku = int(num_line[1])
time = int(num_line[2])

result = 0
if funsoku*time >= kyori:
    result = 1

if result==0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

if D/S <= T :
    ans = 'Yes'
else :
    ans = 'No'

print(ans)

Submission status: Accepted

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

main()

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:
int_a, int_b, int_c= map(int, input().split())

#print(int_a, int_b, int_c)
if int_a/int_c <= int_b:
  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())
d = T * S
ans = 'Yes' if d >= D else 'No'

print(ans)

Submission status: Accepted

Solution code:
import numpy as np

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

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

else:
    print("No")

Submission status: Accepted

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

a = T*S

if a >= D:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")
al = "abcdefghijklmnopqrstuvwxyz"

d,t,s = I()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

DTS=np.array(input().split(" "),dtype=np.int64)
D=DTS[0]
T=DTS[1]
S=DTS[2]

time=float(D/S)

if(T>=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())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque

# スペース区切りの整数の入力
D, T, S = map(int, input().split())

tmp = D / S

if tmp >  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:
if __name__ == '__main__':
    D, T, S = map(int, input().split())
    if D / T > S:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
firstLine = input()
distance, time, speed = list(map(int,firstLine.split(' ')))[0], list(map(int,firstLine.split(' ')))[1], list(map(int,firstLine.split(' ')))[2]

if distance / speed <= time:
  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:
from sys import stdin

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
x, y, z = list(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 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 s*t < d :
  print("No")
else :
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans=None

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

print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 >= (D / S) else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
d, t, s = list(map(int, input().split()))
# print(d, t, s)
# a = d / s
# print(a)
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 - T*S <=0:
    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('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:
def solve(d,t,s):
    if d/s <= t:
        return "Yes"
    return "No"


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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if(D/S <= 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:
'''
Created on 2020/08/29

@author: okazakieiichiro
'''

d, t, s = (int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip('\r\n')

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())
ttt=d-t*s
if (ttt <= 0):
  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])

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

Submission status: Accepted

Solution code:
import sys
from sys import stdin
input = 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/s <=t:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3.8
# -*- coding: utf-8 -*-
# abc177/abc177_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    D, T, S = i2nn()
    if D / S <= T:
        print('Yes')
    else:
        print('No')
    return

main()

Submission status: Accepted

Solution code:
strin = input()
D, T, S = int(strin.split(" ")[0]), int(strin.split(" ")[1]), int(strin.split(" ")[2])
if (D / S) <= T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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