AtCoder Beginner Contest 177 - Don't be late

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-----
1000 15 80

-----Sample Output-----
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.

Difficulty: EASY

Starter code:

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


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


(d, t, s) = map(int, input().split())
print(['No', 'Yes'][(d + s - 1) // s <= t])


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


(distance, time, speed) = map(int, input().split())
if distance / speed <= time:
	print('Yes')
else:
	print('No')


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


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


import sys
readline = sys.stdin.readline
(D, T, S) = map(int, readline().split())
print(('No', 'Yes')[S * T >= D])


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


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


(D, T, S) = [int(s) for s in input().split()]
print('Yes' if D / S <= T else 'No')


MOD = 10 ** 9 + 7
(D, T, S) = list(map(int, input().split()))
ans = 'Yes' if S * T >= D else 'No'
print(ans)


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


(dis, time, spd) = map(int, input().split())
if dis / spd <= time:
	print('Yes')
else:
	print('No')


import re
import sys
lst = []
for line in sys.stdin:
	lst.append(line.rstrip('\n'))
regex = [[int(r) for r in re.findall('(\\d+)', line)] for line in lst]
verifica = lambda x: 'No' if x[0] / x[2] > x[1] else 'Yes'
[print(verifica(r)) for r in regex]


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


def IsInTime(d, t, s: int) -> bool:
	if s * t >= d:
		return True
	else:
		return False
(d, t, s) = list(map(int, input().split()))
if IsInTime(d, t, s):
	print('Yes')
else:
	print('No')


i = list(map(int, input().split()))
print('Yes' if i[0] <= i[1] * i[2] else 'No')


print('Yes' if eval(input().replace(' ', '<=', 1).replace(' ', '*', 1)) else 'No')


temp = input().split(' ')
d = int(temp[0])
t = int(temp[1])
s = int(temp[2])
if t * s >= d:
	print('Yes')
else:
	print('No')


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


(D, T, S) = map(int, input().split())
ans = ['No', 'Yes']
print(ans[int(T * S >= D)])


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


number = input().split(' ')
D = int(number[0])
T = int(number[1])
S = int(number[2])
time = D / S
if time <= T:
	print('Yes')
else:
	print('No')


from sys import stdin
(D, T, S) = [int(_) for _ in stdin.readline().rstrip().split()]
if D / S <= T:
	print('Yes')
else:
	print('No')


num = list(map(int, input().split()))
d = num[0]
speed = num[1]
limit_t = num[2]
time = d / speed
if time <= limit_t:
	print('Yes')
else:
	print('No')


(a, b, c) = map(int, input().split())
print('YNeos'[a / b > c::2])


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


(D, T, S) = map(int, input().split())
a = ['Yes', 'No']
print(a[D > S * T])


(D, T, S) = map(int, input().split())
print('YNeos'[T * S < D::2])


import sys
(d, t, s) = sys.stdin.readline().strip().split(' ')
d = int(d)
t = int(t)
s = int(s)
if d <= t * s:
	print('Yes')
else:
	print('No')


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


[D, T, S] = [int(_) for _ in input().split()]
print(['No', 'Yes'][D <= T * S])


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


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


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

def __starting_point():
	main()
__starting_point()


(D, T, S) = (int(x) for x in input().split())
tmp = D / S
if tmp <= T:
	print('Yes')
else:
	print('No')


(d, t, s) = map(int, input().split())
print('NYoe s'[d <= t * s::2])


(n, s, c) = map(int, input().split())
if n > s * c:
	print('No')
else:
	print('Yes')


import numpy as np

def __starting_point():
	x = input()
	(D, T, S) = list(map(int, x.split(' ')))
	estimated_time = D / S
	if T >= estimated_time:
		print('Yes')
	else:
		print('No')
__starting_point()


YES = 'Yes'
NO = 'No'

def solve(D, T, S):
	return YES if S * T >= D else NO

def main():
	(D, T, S) = list(map(int, input().split()))
	a = solve(D, T, S)
	print(a)

def __starting_point():
	main()
__starting_point()


val = input()
s_list = val.split(' ')
i_list = list(map(lambda x: int(x), s_list))
min_take = i_list[0] / i_list[2]
if i_list[1] >= min_take:
	print('Yes')
else:
	print('No')


(D, T, s) = map(int, input().split())
if s * T - D >= 0:
	print('Yes')
else:
	print('No')


(D, T, V) = map(int, input().split())
print('Yes' if D <= T * V else 'No')


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


(d, t, s) = input().strip().split()
(d, t, s) = [int(d), int(t), int(s)]
sum = d / s
if t >= sum:
	print('Yes')
else:
	print('No')


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


import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter

def input():
	return sys.stdin.readline().strip()

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

def lmp():
	return list(map(int, input().split()))
(d, t, s) = mp()
if s * t - d >= 0:
	print('Yes')
else:
	print('No')


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


import sys

def input():
	return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
MOD = 10 ** 9 + 7
INF = float('inf')

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

def __starting_point():
	main()
__starting_point()