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: Wrong Answer

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

m = d//s

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a = d/s

if(a < t):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
x,y,z = map(int,input().split())
if x/z>=y:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
from math import *

def cin(): # To take limited number of inputs
    return map(int,input().split())

def cins(): # To take space sepreated strings
    return input.split()

def cino(test=False): # To take individual int input (test = False)
    if not test:
        return int(input())
    else: # To take string input (test = True)
        return input()

def cina(): # array input
  return list(map(int,input().split()))

def ssplit(): # multiple string input
    return list(input().split())

def printlist(l): # To print space seperated array
    for i in l:
        print(i,end=" ")

def main():
    a,b,c = cin()
    if a//c <= b:
      print("Yes")
    else:
      print("No")

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:

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


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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

time = d/s

if t > time:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from __future__ import division, print_function
import sys
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

import os, sys, bisect, copy
from collections import defaultdict, Counter, deque
#from functools import lru_cache   #use @lru_cache(None)
if os.path.exists('in.txt'): sys.stdin=open('in.txt','r')
if os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')
#
def input(): return sys.stdin.readline()
def mapi(arg=0): return map(int if arg==0 else str,input().split())
#------------------------------------------------------------------


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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
from sys import stdin,stdout
from collections import defaultdict
import math
from bisect import bisect
#input=stdin.readline
#def print(x):stdout.write(str(x)+'\n')
d,t,s=map(int,input().split())
if s*t<=d:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

a=d/s

if a<=s:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
if A-B*C>=0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import sys
import math
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def LIST()  : return list(MAP())
def NIJIGEN(H): return [list(input()) for i in range(H)]
D,T,S=MAP()
if T*S<=D:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# https://atcoder.jp/contests/abc177/tasks/abc177_a

r = 0

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

# print(r)

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:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines

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 <= t * 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:
(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())
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())
# Dm離れている, T分後, 分速Sm
if S * T >= D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools as fts
import itertools as its
import math
import sys

INF = float('inf')
YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(D: int, T: int, S: int):
    return [NO, YES][D/S <= T]


def main():

    sys.setrecursionlimit(10 ** 6)

    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
    print(f'{solve(D, T, S)}')


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

Submission status: Accepted

Solution code:
a, b, c = map(int,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if y*z >= x:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
D, T, S = (int(d) for d in 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) >= 0) 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('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 * s >= d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = map(int, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# import numpy as np
import sys, math, heapq
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")

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

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

Submission status: Accepted

Solution code:
#輸入字串並分隔，以list儲存
str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))  
#print(num) #D,T,S

#若T<(D/S)->遲到
if num[1] >= (num[0]/num[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#輸入字串並分隔，以list儲存
str_in = input()
num = [int(n) for n in str_in.split()]
num =list(map(int, str_in.strip().split()))  
#print(num) #D,T,S

#若T<(D/S)->遲到
if num[1] > (num[0]/num[2]):
    print("Yes")
elif num[1] == (num[0]/num[2]):
    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:
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:
# -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline
MOD = 10**9+7

def main():
    D, T, S = list(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())
if d/s <=t:
    print("Yes")
else:print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

min = d / s

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


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

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

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

d,t,s=dts()

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

Submission status: Accepted

Solution code:
#n = int(input()) #入力
#a, b = (int(x) for x in input().split())
#a, b = map(int, input().split())

#a = [int(x) for x in input().split()]
#a = list(map(int, input().split()))
#a = [list(map(int,input().split(" "))) for i in range(N)]   #2次元


#a.sort() # C++ の sort(a.begin(), a.end());
#a.append(3) # C++ の a.push_back(3);


#exit(0) # return 0 的な。終了できる。
## 整数の切り捨て除算は // (ダブルスラッシュ)


#a[始まりの位置: 終わりの位置: スライスの増分] # (a は配列)


#import numpy as np  #importに100 ms 程度かかる。
import math
import copy
import string
#math.gcd(a, b) で、gcd 計算できる。
#math.pi は円周率。

INF = int(10**18) #べき乗 C++ の pow(10, 18) or 1e18;
pi = math.pi

MOD = 1000000007
#MOD = 1000000009
#MOD = 998244353




#繰り返し2乗法
#N^aの、Mで割った余りを求める。
def my_pow(N, a, M):
    if(a == 0):
        return 1
    else:
        if(a % 2 == 0):
            tempo = my_pow(N, a/2, M)
            return (tempo * tempo) % M
        else:
            tempo = my_pow(N, a - 1, M)
            return (tempo * N) % M




#N_C_a を M で割った余り
def my_combination(N, a, M):
    res = 1

    for i in range(0, a):
        res *= N - i
        res %= M

    for i in range(0, a):
        res *= my_pow(i + 1, M - 2, M)
        res %= M

    return res




#N_C_i を M で割った余りを、v[i] に代入する。
def my_combination_table(N, M, v):
    if(len(v) < N + 1):
        l = N + 1 - len(v)
        tempo = [1] * l
        v.extend(tempo)

    for i in range(1, N + 1):
        v[i] = v[i - 1] * (N - (i - 1))
        v[i] %= M

        v[i] *= my_pow(i, M - 2, M)
        v[i] %= M

    return




#math.factorial で階乗は計算できる。
#math.gcd で gcd は計算できる。
#np.gcd.reduce(A) #(Aは配列) で、Aの全ての要素の gcd が計算できる。





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

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
#template
"""
H,W = inputlist()
st = inputlist()
gl = inputlist()
maze = ['0']*H
for i in range(H):
    maze[i] = list(input())
table = [[10**9+7]*W for _ in range(H)]

"""
D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#template
def inputlist(): return [int(j) for j in input().split()]
#template
"""
H,W = inputlist()
st = inputlist()
gl = inputlist()
maze = ['0']*H
for i in range(H):
    maze[i] = list(input())
table = [[10**9+7]*W for _ in range(H)]

"""
D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= 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())

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


print(ans)

Submission status: Accepted

Solution code:
def solve(string):
    d, t, s = map(int, string.split())
    return "Yes" if d <= t * s else "No"


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

Solution code:
from sys import stdin

input = stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# from typing import *

YES = 'Yes'
NO = 'No'

# def solve(D: int, T: int, S: int) -> str:
def solve(D, T, S):
    return S * T >= D

# generated by online-judge-template-generator v4.4.0 (https://github.com/kmyk/online-judge-template-generator)
def main():
    D, T, S = map(int, input().split())
    a = solve(D, T, S)
    print(YES if a else 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())
if t >= d/s:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a,b,c = map(int, input().split())
if a <= b*c :
  print('Yes')
elif a > b*c :
   print('No')

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque, Counter, OrderedDict
from bisect import bisect_left, bisect_right
from functools import reduce, lru_cache
from heapq import heappush, heappop, heapify

import itertools
import math, fractions
import sys, copy

def L(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline().rstrip())
def SL(): return list(sys.stdin.readline().rstrip())
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def R(n): return [sys.stdin.readline().strip() for _ in range(n)]
def LR(n): return [L() for _ in range(n)]
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def LIR1(n): return [LI1() for _ in range(n)]
def SR(n): return [SL() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]

def perm(n, r): return math.factorial(n) // math.factorial(r)
def comb(n, r): return math.factorial(n) // (math.factorial(r) * math.factorial(n-r))

def make_list(n, *args, default=0): return [make_list(*args, default=default) for _ in range(n)] if len(args) > 0 else [default for _ in range(n)]

dire = [[1, 0], [0, 1], [-1, 0], [0, -1]]
dire8 = [[1, 0], [1, 1], [0, 1], [-1, 1], [-1, 0], [-1, -1], [0, -1], [1, -1]]
alphabets = "abcdefghijklmnopqrstuvwxyz"
ALPHABETS = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
MOD = 1000000007
INF = float("inf")

sys.setrecursionlimit(1000000)

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def ap_in_time(distance, time_for_ap, speed) -> str:
    return 'Yes' if distance <= time_for_ap * speed else 'No'


if __name__ == '__main__':
    a, b, c = map(int, input().split())
    print(ap_in_time(a, b, c))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = input().rstrip().split(" ")
distance = int(a[0])
deadline = int(a[1])
speed = int(a[2])
if distance / speed > deadline:
  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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    D, T, S = map(int, readline().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())

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

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,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())
print("YNeos"[s*t<d::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(s*t >= d):
	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())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import numpy as np

sts = input()

st = sts.split(' ')
d = int(st[0])
t = int(st[1])
s = int(st[2])

# print(d)
# print(t)
# print(s)

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

x = D / S

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

Submission status: Accepted

Solution code:
def main(D, T, S):
    time = D//S
    if D%S != 0:
        time += 1
    if time <= T:
        return 'Yes'
    else:
        return 'No'

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

Submission status: Accepted

Solution code:
from sys import stdin
def ip():
    return stdin.readline().rstrip()
d,t,s=map(int,ip().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=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())

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