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:
import sys
import math
from collections import defaultdict, deque, Counter
from copy import deepcopy
from bisect import bisect, bisect_right, bisect_left
from heapq import heapify, heappop, heappush
    
input = sys.stdin.readline
def RD(): return input().rstrip()
def F(): return float(input().rstrip())
def I(): return int(input().rstrip())
def MI(): return map(int, input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float,input().split()))
def Init(H, W, num): return [[num for i in range(W)] for j in range(H)]
    
    
def main():
    d, t, s =MI()
    num = d/s
    if num <= t:
        print("Yes")
    else:
        print("No")
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

    need_s = d / t

    if s >= need_s:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    abc177_a()

Submission status: Accepted

Solution code:
_list = list(map(int, input().split()))
if _list[1] * _list[2] >= _list[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:
line = input().rstrip().split(" ")
D = int(line[0]) #距離
T = int(line[1]) #分数
S = int(line[2]) #分速

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

Submission status: Accepted

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

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

Submission status: Accepted

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

result = D/S

if result > T:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
# n=int(stdin.readline())
d,t,s=list(map(float,stdin.readline().split()))
t1=d/s
print('Yes' if t>=t1 else 'No')

Submission status: Accepted

Solution code:
# abc177_a.py
# https://atcoder.jp/contests/abc177_a


# [開発時用] ログ関数
def lg(value):
    flag = False
    flag = True
    if flag:
        print(str(value))


# [開発時用] exit処理
def xt(log):
    lg('★exit() - ' + str(log))
    exit()


# 本体
def get_results():

    # 引数処理部
    lines = list()
    # 仕様でn行と決まっている場合(の例)
    lines_count = 1
    # 先頭行のNで行数が決まる場合(の例)
    # line = input()
    # lines.append(line)
    # N = int(line)
    # lines_count = N
    for _ in range(lines_count):
        lines.append(input())

    # 演算部
    # S = lines[0]
    # X = int(lines[0])
    D, T, S = list(map(int, lines[0].split()))
    # values = list(map(int, lines[0].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    results = list()

    if D / S > T:
        result = 'No'
    else:
        result = 'Yes'

    results.append(result)

    return results


# 主処理
def main():
    results = get_results()

    for result in results:
        print(result)


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
mod = 10**9 + 7
def solve():
    d, t, s = map(int, input().split())
    print('Yes' if t * s >= d else 'No')
t = 1
while t > 0:
    solve()
    t -= 1

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

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

Submission status: Accepted

Solution code:
import sys
import bisect as bi
import math
from collections import defaultdict as dd
import heapq
import itertools
input=sys.stdin.readline
from random import randint
##import numpy as np
#sys.setrecursionlimit(10**7)
mo=10**9+7
def cin():
    return map(int,sin().split())
def ain():            
    return list(map(int,sin().split()))
def sin():
    return input()
def inin():
    return int(input())

for _ in range(1):
    a,b,c=cin()
    if(b*1.0>=(a/c)):
        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")

elif d / s <= t:
    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:
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())

a = d/s

if(a <= 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 = [int(item) for item in 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 T*S >= D:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
dts = input()
d_t_s = dts.split()
d = int(d_t_s[0])
t = int(d_t_s[1])
s = int(d_t_s[2])
if d/s > t:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    D, T, S = map(int, input().split())
    return S * T >= D

print('Yes' if main() else 'No')

Submission status: Accepted

Solution code:
import sys

input_ = sys.stdin.readline

D, T, S = [int(x) for x in input_().strip().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:
mod = 1000000007
eps = 10**-9


def main():
    import sys
    input = sys.stdin.readline

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

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:
#!/usr/bin/env python3


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


def main():
    d, t, s = (int(z) for z in input().split())
    if judge(d, t, s):
        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())
time = D / S
if time > T:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
def resolve():
    import sys
    input = sys.stdin.readline

    d, t, s = [int(x) for x in input().rstrip().split(" ")]

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]


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

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

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

print(['No','Yes'][(D/T)<=S])

Submission status: Accepted

Solution code:
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
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 float(d)/float(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())

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

Submission status: Accepted

Solution code:
a = input("").split(" ")
a = [int(b) for b in a]
d = a[0]
t = a[1]
s = a[2]
if d <= (t*s):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
i = list(map(int, input().split()))
##    みちのり
##　　はさや　じかん

D=i[0]
T=i[1]
S=i[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:
#-*-coding:utf-8-*-

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
d = 0
t = 0
s = 0

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

Submission status: Accepted

Solution code:
def main():
    x = [int(_) for _ in input().split()]
    d = x[0]
    t = x[1]
    s = x[2]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

[D,T,S] = list(map(int,input().split()))
jikan=D/S
if jikan>T:
    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())
a = d / s

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ammount = input()

lst = ammount.split(" ")

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

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:
from typing import List
import sys


def solution(inp: List) -> str:
    D = int(inp[0])
    T = int(inp[1])
    S = int(inp[2])
    if D/S <= T:
        return "Yes"
    return "No"


inp: List = []
for j in sys.stdin:
    inp += j.split()
print(solution(inp))

Submission status: Accepted

Solution code:
import collections

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

q, mod = divmod(D, S)

if mod == 0:
  if q <= T:
    print("Yes")
  else:
    print("No")
else:
  if q <= T-1:
    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]=list(map(int,input().split()))
time=d/s
ans="No"
if time<=t:
    ans="Yes"

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:
def solution(D,T,S):
    return 'Yes' if T >= (D/S) else 'No'

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

if 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 sys, 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_list()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def walk(d, t, s)-> int :
  minutes = d / s
  if minutes <= t:
    return 'Yes'
  return 'No'

if __name__ == "__main__":
  input = list(map(int, input().split()))
  print(walk(input[0], input[1], input[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 = input().split(' ')

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

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 = [ int(v) for v in input().split(" ") ]

if T >= (D/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 = list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# from typing import Optional
# from typing import List
# from typing import Dict
# from typing import Tuple
# from typing import Sequence


def main():
    args = input().split()
    D = int(args[0])
    T = int(args[1])
    S = int(args[2])

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


if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
def Takoyaki():
    
    data = list(map(int,input().split()))

    num = data[0] / data[2]

    if num <= data[1]:
                
        print('Yes')

    else:
        print('No')

if __name__ == '__main__':
    Takoyaki()

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
print('Yes' if 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 <= 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(_) for _ 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/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("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())

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

print(ans)

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:
nums = [int(e) for e in input().split()]

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

import math
import re
import numpy as np
import copy

#読み込む
S = input().split(' ')
D = int(S[0])
T = int(S[1])
S = int(S[2])

time = D / S

ans = "No"

if time <= T:
    ans = "Yes"

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

Submission status: Accepted

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

Submission status: Accepted

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


m = d/s

if m <=t:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline    ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')
# from math import ceil, floor, log2
# from collections import deque, defaultdict
# from itertools import combinations as comb, combinations_with_replacement as comb_w, accumulate, product, permutations
# from heapq import heapify, heappop, heappush
# import numpy as np    # cumsum
# from bisect import bisect_left, bisect_right

def solve():
    d, t, s = MI()
    if s * t >= d:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    solve()

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

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

distance = T * S

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

Submission status: Accepted

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


if __name__ == "__main__":
    print(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())

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

if m <= t :
  print("Yes")
else :
  print("No")

Submission status: Accepted

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        for line in sys.stdin:
            lines.append(line.strip())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (d, t, s) = [int(e) for e in lines[0].split(" ")]
    

    return (d, t, s)


def solve(d, t, s):

    tmp = d / s 
    result = 'No'
    if tmp <= t:
        result = 'Yes'


    return result
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

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