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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math


def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())


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


if __name__ == '__main__':
    main()

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:
import os
import sys
import math
import heapq
from decimal import *
from io import BytesIO, IOBase
from collections import defaultdict, deque

def r():
    return int(input())
def rm():
    return map(int,input().split())
def rl():
    return list(map(int,input().split()))

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

Submission status: Accepted

Solution code:


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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#print(d/s)

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

Submission status: Accepted

Solution code:
from collections import deque
import sys, copy, itertools,heapq
input = sys.stdin.readline

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

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

Submission status: Accepted

Solution code:
dd, tt, ss = list(map(float,input().split()))

if dd/ss <= tt:
    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*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())

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

Submission status: Accepted

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

def main(d,t,s):
    if d<=t*s:
        return 'Yes'
    else:
        return 'No'

if __name__=='__main__':
    d,t,s=readinput()
    ans=main(d,t,s)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

a,b,c=list(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:
n,m,s=map(int,input().split())
if n/m>float(s):
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    D, T, S = map(int, sys.stdin.readline().rstrip().split())
    if D/S <= T:
        print("Yes")
    else:
        print("No")

main()

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

if ((T * S - D) >= 0):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
# 
# 
# @stop_watch
def solve(D, T, S):
    if S * T >= D:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    # S = input()
    # N = int(input())
    D, T, S = map(int, input().split())
    # As = [int(i) for i in input().split()]
    # Bs = [int(i) for i in input().split()]
    solve(D, T, S)

Submission status: Accepted

Solution code:
import sys
d,t,s = map(int, sys.stdin.readline().rstrip("\n").split())
if t*s-d >=0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math

#https://atcoder.jp/contests/agc008/submissions/15248942
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inm = lambda: map(int, sys.stdin.readline().split())
inl = lambda: list(inm())
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

D,T,S = inm()

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

Submission status: Accepted

Solution code:
class UnionFind:
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


xnk = input().split()
D = int(xnk[0])
T = int(xnk[1])
S= int(xnk[2])

time = D/S

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

D,T,S = (int(x) for x in input().rstrip('\n').split())
if S*T>=D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import itertools
tokens = itertools.chain.from_iterable(map(str.split, sys.stdin))

yesno = ['No', 'Yes']
d = int(next(tokens))
t = int(next(tokens))
s = int(next(tokens))

ans = yesno[d / s <= t]
print(ans)

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

anchor = D / S

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

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

Submission status: Accepted

Solution code:

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

resolve()

Submission status: Accepted

Solution code:
import sys

if __name__ == '__main__':
	D, T, S = list(map(lambda x: int(x), sys.stdin.readline().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/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= map(int,input().split())
if d>s*t:
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if(T >= tt):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
import math
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()
d,t,s=get_ints()
a=t*s
if a>=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

if D/S <= T:#間に合う
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

ans="Yes"

if D>S*T: 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:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

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

A = T*S

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

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

Submission status: Accepted

Solution code:
def main():
    import copy
    D , T, S = map(int, input().split())
    #A_list = list(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 = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
import sys


def resolve(in_):
    D, T, S = map(int, next(in_).split())
    return 'Yes' if D <= T * S else 'No'

    

def main():
    answer = resolve(sys.stdin)
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect
import sys
import math
input = sys.stdin.readline
import functools

from collections import defaultdict

############ ---- Input Functions ---- ############

def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))

############ ---- Solution ---- ############

def solve():
    [D, T, S] = inlt()
    return "Yes" if T * S >= D else "No" 
    

if len(sys.argv) > 1 and sys.argv[1].startswith("input"):
    f = open("./" + sys.argv[1], 'r')
    input = f.readline

res = solve()
print(str(res))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
dts = input().split()
d = int(dts[0])
t = int(dts[1])
s = int(dts[2])

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:
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("YNeos"[t*s < d::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
import heapq
import cProfile
from collections import Counter, defaultdict, deque
from functools import reduce
import math


def get_int():return int(stdin.readline().strip())
def get_tuple():return map(int, stdin.readline().split())
def get_list():return list(map(int, stdin.readline().split()))

d,t,s = get_tuple()
t_r = d/s
if t<t_r: 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())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = "No"
if D / S <= T:
    ans = "Yes"

print(ans)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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:
#Written by Shagoto

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

Submission status: Accepted

Solution code:
def INT():
    return int(input())

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

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

D, T, S = MI()

print("Yes" if D <= T * S 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:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    D, T, S = map(int, input().split())
    if S * T >= D:
        print("Yes")
    else:
        print("No")


main()

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
from math import floor, sqrt, factorial, hypot, log  # log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter, defaultdict, deque
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from bisect import bisect_left, bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint


def ceil(a, b): return (a + b - 1) // b


inf = float('inf')
mod = 10 ** 9 + 7


def pprint(*A):
    for a in A:     print(*a, sep='\n')


def INT_(n): return int(n) - 1


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


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [I() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')
import sys
import itertools
import copy


def main():
    D, T, S = MI()
    # L = LLIN(N)
    if D / T <= S:
        print('Yes')
    else:
        print('No') 
    cnt = 0
    # for l in L:
    #     num = l[0] ** 2 + l[1] ** 2 
    #     if num <= D ** 2:
    #         cnt+=1
    # print(cnt)
    # print(row)
    # total = sum(row)
    # target = total - K
    # if K == total:
    #     print(1)
    #     sys.exit()
    # col = []
    # for w in range(W):
    #     cnt = 0
    #     for h in range(H):    
    #         print(A[h][w])
    #         if A[h][w] == '#':
    #             cnt += 1
    #     col.append(cnt)
    # print(col)
    # ans = 0
    # for w in range(W):
    #     for h in range(H):
    #         if A[h][w] == '#':
    #             if col[w] + row[h] - 1 == target:
    #                 print(str(h) + str(w))
    #                 ans +=1
    #         else:
    #             if col[w] + row[h] == target:
    #                 print(str(h) + str(w))
    #                 ans +=1
    # print(ans)
    #     for  in x:


    # print('AC x ' + str(cnt['AC']))
    # print('WA x ' + str(cnt['WA']))
    # print('TLE x ' + str(cnt['TLE']))
    # print('RE x ' + str(cnt['RE']))
    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

D, T, S = MAP()

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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:
import sys
D,T,S=map(int, sys.stdin.readline().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(x) for x in input().split()]
if d <= t*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:
def resolve():
    D, T, S = map(int, input().split())
    if D <= T * S:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    resolve()

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:
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:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# abc177_a.py

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

Submission status: Accepted

Solution code:
import math
import sys,collections
from sys import stdin, stdout  
#MAXN = 10000001

def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip() 
def input(): return sys.stdin.readline().strip()
#spf = [0 for i in range(MAXN)] 
def file():
	sys.stdin = open('input.py', 'r')
	sys.stdout = open('output.py', 'w') 
def is_subsequence(x, y):
    """Test whether x is a subsequence of y"""
    x = list(x)
    for letter in y:
        if x and x[0] == letter:
            x.pop(0)

    return not x    
def sieve(): 
	spf[1] = 1
	for i in range(2, MAXN): 
		spf[i] = i 
	for i in range(4, MAXN, 2): 
		spf[i] = 2

	for i in range(3, mt.ceil(mt.sqrt(MAXN))): 
		if (spf[i] == i): 
			for j in range(i * i, MAXN, i): 
				if (spf[j] == j): 
					spf[j] = i 
def getFactorization(x): 
	ret = list() 
	while (x != 1): 
		ret.append(spf[x]) 
		x = x // spf[x] 

	return ret 
def getFloor(A, x):

    (left, right) = (0, len(A) - 1)

    ind,floor = -1,-1
    while left <= right:
        mid = (left + right) // 2
        '''if A[mid] == x:
            return mid'''
        if x < A[mid]:
            right = mid - 1
        else:
            floor = A[mid]
            ind=mid
            left = mid + 1
            
    return ind
def check(st) : 
  
    # Compute sum of digits 
    n = len(st) 
    digitSum = 0
      
    for i in range(0,n) : 
        digitSum = digitSum + (int)(st[i]) 
  
    # Check if sum of digits 
    # is divisible by 9. 
    return (digitSum % 9 == 0)     
def isPowerOfTwo(n): 
    if (n == 0): 
        return False
    while (n != 1): 
            if (n % 2 != 0): 
                return False
            n = n // 2
            
              
    return True
def kitte(n):
	c=0
	while(n!=0):
		n=n//2
		c+=1
	return c	
def aa(b,c):
	m=min(b,c)
	b-=m
	c-=m
	if(c>0 and b>0):
		return(m+((b+c)//3))
	else:
		return(m)
def bb(a,c):
	m=min(a,c)
	a-=m
	c-=m
	if(c>0 and a>0):
		return(m+((a+c)//3))
	else:
		return(m)
def cc(b,a):
	m=min(b,a)
	b-=m
	a-=m
	if(a>0 and b>0):
		return(m+((b+a)//3))
	else:
		return(m)		
#file()
#sieve() 
mod=(10**9)+7	
def main():
	d,s,t=get_ints()
	if(s*t>=d):
		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 = map(int, input().split())

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