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

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

Submission status: Accepted

Solution code:
dist, t_fun, s_hayasa = map(int, input().split())

kyori = t_fun * s_hayasa

if (kyori >= dist):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 29 21:05:56 2020

@author: naoki
"""

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

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
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 = 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())

can_reachable = t * s

if d <= can_reachable:
    print("Yes")
else:
    print("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:
# -*- coding: utf-8 -*-
 
import sys
import math

d,t,s = [int(i) for i in input().split(' ')]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()
inp_list = inp.split()
inp_list = [int(i) for i in inp_list] 
if inp_list[0] / inp_list[1] <= inp_list[2]:
    print("Yes") 
else:
    print("No")

Submission status: Accepted

Solution code:
from __future__ import division, print_function
# import threading
# threading.stack_size(2**27)
# import sys
# sys.setrecursionlimit(10**7)
# sys.stdin = open('inpy.txt', 'r')
# sys.stdout = open('outpy.txt', 'w')
from sys import stdin, stdout
import bisect            #c++ upperbound
import math
import heapq
i_m=9223372036854775807
def inin():
    return int(input())
def stin():
    return input()
def spin():
    return map(int,stin().split())
def lin():                           #takes array as input
    return list(map(int,stin().split()))
def matrix(n):
    #matrix input
    return [list(map(int,input().split()))for i in range(n)]

################################################
def string2intlist(s):
    return list(map(int, s))

def calculate_sum(a, N): #sum of a to N
    # Number of multiples 
    m = N / a 
    # sum of first m natural numbers 
    sum = m * (m + 1) / 2
    # sum of multiples 
    ans = a * sum
    return ans
def series(N):
    return (N*(N+1))//2

def count2Dmatrix(i,list):
    return sum(c.count(i) for c in list)

def modinv(n,p):
    return pow(n,p-2,p)

def GCD(x, y): 
    x=abs(x)
    y=abs(y)
    if(min(x,y)==0):
        return max(x,y)
    while(y): 
        x, y = y, x % y 
    return x
def LCM (x, y):
    return (x * y) // GCD(x, y)
    
def Divisors(n) : 
    l = []  
    for i in range(1, int(math.sqrt(n) + 1)) :
        if (n % i == 0) : 
            if (n // i == i) : 
                l.append(i) 
            else : 
                l.append(i)
                l.append(n//i)
    return l
def isprime(n):
    for i in range(2, int(math.sqrt(n))+1):
        if n%i==0:
            return False
    return True
prime=[]
def SieveOfEratosthenes(n): 
    global prime
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
        if (prime[p] == True): 
            for i in range(p * p, n+1, p): 
                prime[i] = False
        p += 1
    f=[]
    for p in range(2, n): 
        if prime[p]: 
            f.append(p)
    return f
q=[]       
def dfs(n,d,v,c):
    global q
    v[n]=1
    x=d[n]
    q.append(n)
    j=c
    for i in x:
        if i not in v:
            f=dfs(i,d,v,c+1)
            j=max(j,f)
            # print(f)
    return j
# d = {}
 
"""*******************************************************"""
d, t, s = spin()
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())
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:
D , T , S  = map ( int , input().strip().split(" ") ) ;
t1 = ( D // S )  +  ( 0 if D % S == 0 else 1 ) ;
print ( "Yes" if t1 <=T 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 - s*t <= 0):
  print('Yes')
else:
  print('No')

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 sys

input = sys.stdin.readline

def main():
    ans = 'No'
    d,t,s = map(int, input().split())
    if s*t >= d:
        ans = 'Yes'
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d , t , s = map(int,input().split())
n = d / s
if n > 0 and n <= 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())

LATE = ( T*S < D )

if LATE:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
D, T, S = (int(i) for i in 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 >= a/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:
answer = input()
 
answer = answer.split(' ')
 
if int(answer[2])*int(answer[1])>=int(answer[0]):
  print("Yes")
else :
  print("No")

Submission status: Accepted

Solution code:
d, t, s = [int(i) for i in input().split()] 
print("Yes" if(d / s <= t) else "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:
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())

x = a/c

if x<=b:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
d, s, t = map(int, input().split())
k = s* t
if k>=d:
  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:
info=input().split()
 
D=int(info[0])
S=int(info[1])
T=int(info[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:
import itertools

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

Submission status: Accepted

Solution code:
distance, time, speed = input().split()
actual_speed = int(distance) / int(time)
if actual_speed > int(speed):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
p = list(map(int, input().split()))
if (p[0] <= p[1] * p[2]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#d <= t  * s ?

a = input().rstrip().split(" ")

d, t, s = map(int, a)

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

Submission status: Accepted

Solution code:
a,b, c = map(int, input().split())
q = a/c
#print(q)
#o=a/c
#print(b)
if b >= q :
  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:
	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 = 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<=T*S:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

speed = int(d) / int(t)

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline  # 文字列読み込む時はこっち
ra = range
enu = enumerate


def exit(*argv, **kwarg):
    print(*argv, **kwarg)
    sys.exit()


def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと


def a_int(): return int(readline())


def ints(): return list(map(int, readline().split()))


def read_col(H):
    '''H is number of rows
    A列、B列が与えられるようなとき
    ex1)A,B=read_col(H)    ex2) A,=read_col(H) #一列の場合'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, readline().split())))
    return tuple(map(list, zip(*ret)))


def read_tuple(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(tuple(map(int, readline().split())))
    return ret


def read_matrix(H):
    '''H is number of rows'''
    ret = []
    for _ in range(H):
        ret.append(list(map(int, readline().split())))
    return ret
    # return [list(map(int, read().split())) for _ in range(H)] # 内包表記はpypyでは遅いため


MOD = 10**9 + 7
INF = 2**31  # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right  # , insort_left, insort_right
from functools import reduce
from math import gcd


def lcm(a, b):
    # 最小公倍数
    g = gcd(a, b)
    return a // g * b


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def solve():
    d,t,s=map(int,input().split())
    r=t*s
    return 'Yes' if r>=d else 'No'

print(solve())

Submission status: Accepted

Solution code:
d, t, s = map(int, input().split())
# in T minutes, takahashi can walk S*T meters
# is this >= D?
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('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())
print("Yes" if D/S<=T else "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:
#can i cover d meters in t
#walking at s
d,t,s = map(int , raw_input().split())
print 'Yes' if s*t >= d else 'No'

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
D,T,S=map(int,input().split())
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:
import math
from math import gcd,pi,sqrt
INF = float("inf")

import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
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 main():
    d,t,s = i_map()
    if s*t < d:
        print("No")
    else:
        print("Yes")

if __name__=="__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

# input d:距離（メートル） , t:待ち合わせまで何分 , s:速度（分速sメートル）
d, t, s = map(int, input().split())

output = "";

if d/s > t:
    output = "No"
else:
    output = "Yes"

print(output)

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

Submission status: Accepted

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

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:
type_in = input()
s = type_in.split(' ')
D = int(s[0])
T = int(s[1])
S = int(s[2])
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())

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

Submission status: Accepted

Solution code:
D,T,S=(int(x) for x in input().split())
Time=float(D)/float(S)
if T>=Time:
    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:
# python3

def main():
    text = input()
    distance, time_requird, speed = map(float, text.split(' '))
    if distance/speed > time_requird:
        print("No")
    else:
        print("Yes")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
D,T,S=input().split()
D=int(D)
T=int(T)
S=int(S)
a=float(T-D/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 ('No')
else:
  print ('Yes')

Submission status: Accepted

Solution code:

import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline


def array(size, init=0):
    return [[init for j in range(size[1])] for i in range(size[0])]


def acinput():
    return list(map(int, input().split(" ")))


def II():
    return int(input())


D, T, S = acinput()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC177 A
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())

time = D / S
if T >= time:
    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=(int(x) for x in input().split())
if 1 <= d and 1 <= t and 1 <= s:
  if d <= 10000 and t <= 10000 and s <= 10000:
    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/S <= T else 'No')

Submission status: Accepted

Solution code:
class Solution:
    def solve(self, D, T, S):
        time = D/S
        if time <= T:
            return 'Yes'
        else:
            return 'No'

if __name__ == '__main__':
    D, T, S = map(int, input().split())
    A = Solution()
    print(A.solve(D, T, S))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import _heapify_max, _heappop_max, _siftdown_max
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import Fraction               # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)



def main():
    Num = Union[int, float]
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79e+308
    # inf = 2 ** 63 - 1             # (for fast JIT compile in PyPy) 9.22e+18
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input():  return sys.stdin.readline().rstrip()
    def ii():     return int(input())
    def isp():    return input().split()
    def mi():     return map(int, input().split())
    def mi_0():   return map(lambda x: int(x)-1, input().split())
    def lmi():    return list(map(int, input().split()))
    def lmi_0():  return list(map(lambda x: int(x)-1, input().split()))
    def li():     return list(input())
    def debug(x): print(x, file=sys.stderr)
    # def _heappush_max(h, item): h.append(item); _siftdown_max(h, 0, len(h)-1)
    
    
    d, t, s = mi()
    print('Yes' if t * s >= d else 'No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
dist, t_fun, s_hayasa = map(int, input().split())

kyori = t_fun * s_hayasa

if (kyori >= dist):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
import sys
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7


D,T,S = LI()

j = D / S

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
    if row <= 0:
        return [[] for _ in range(col)]
    elif col == 1:
        return [I() for _ in range(row)]
    else:
        read_all = [LI() for _ in range(row)]
        return map(list, zip(*read_all))

#################

D,T,S = LI()

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:
# -*- coding: utf-8 -*-

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