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 S >= (D / 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 s*t<d:
    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:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    d, t, s = rli()
    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('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:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
def main():
    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(solve(D, T, S))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    #test()
    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=[int(i) for i in input().split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

Solution code:
x,y,z = map(int,input().split())
c = x/z
print('Yes'if c <= y 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:
# -*- coding: utf-8 -*-
d, t, s = map(int, input().split())
if t * s >= d:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
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())
print('Yes' if S * T >= D 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 = [int(i) for i in 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:
#!/usr/bin/env python3
import sys

input = sys.stdin.readline


def Y():
    print("Yes")


def N():
    print("No")


def ST():
    return input().rstrip()


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


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


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


d, t, s = MI()
if d / s > t:
    N()
else:
    Y()

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, open(0).read().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 (D + S - 1) // S <= T:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
d, t, s = map(int,input().rstrip().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>float(T)):
    print('No')
else:
    print('Yes')

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:
a, b, c = map(int, raw_input().split())
print ["No", "Yes"][b * c >= a]

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

Submission status: Accepted

Solution code:
# ===============================================================================================
# importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import *
from math import *
from copy import *
from collections import deque
from collections import Counter as counter  # Counter(list)  return a dict with {key: count}
from itertools import combinations as comb  # if a = [1,2,3] then print(list(comb(a,2))) -----> [(1, 2), (1, 3), (2, 3)]
from itertools import permutations as permutate
from bisect import bisect_left as bl
# If the element is already present in the list,

# the left most position where element has to be inserted is returned.
from bisect import bisect_right as br
from bisect import bisect

# If the element is already present in the list,
# the right most position where element has to be inserted is returned

# ==============================================================================================
# fast I/O region

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None


    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

# inp = lambda: sys.stdin.readline().rstrip("\r\n")

# ===============================================================================================
### START ITERATE RECURSION ###
from types import GeneratorType


def iterative(f, stack=[]):
    def wrapped_func(*args, **kwargs):
        if stack: return f(*args, **kwargs)
        to = f(*args, **kwargs)
        while True:
            if type(to) is GeneratorType:
                stack.append(to)
                to = next(to)
                continue
            stack.pop()
            if not stack: break
            to = stack[-1].send(to)
        return to

    return wrapped_func


#### END ITERATE RECURSION ####

# ===============================================================================================
# some shortcuts

mod = 1000000007


def inp(): return sys.stdin.readline().rstrip("\r\n")  # for fast input

def out(var): sys.stdout.write(str(var))  # for fast output, always take string

def lis(): return list(map(int, inp().split()))

def stringlis(): return list(map(str, inp().split()))

def sep(): return map(int, inp().split())

def strsep(): return map(str, inp().split())


def zerolist(n): return [0] * n

def nextline(): out("\n")  # as stdout.write always print sring.

def testcase(t):
    for p in range(t):
        solve()

def printlist(a):
    for p in range(0, len(a)):
        out(str(a[p]) + ' ')

def lcm(a, b): return (a * b) // gcd(a, b)

def power(x, y, p):
    res = 1  # Initialize result
    x = x % p  # Update x if it is more , than or equal to p
    if (x == 0):
        return 0
    while (y > 0):
        if ((y & 1) == 1):  # If y is odd, multiply, x with result
            res = (res * x) % p

        y = y >> 1  # y = y/2
        x = (x * x) % p
    return res

def ncr(n, r): return factorial(n) // (factorial(r) * factorial(max(n - r, 1)))

def isPrime(n):
    if (n <= 1): return False
    if (n <= 3): return True
    if (n % 2 == 0 or n % 3 == 0): return False
    i = 5
    while (i * i <= n):
        if (n % i == 0 or n % (i + 2) == 0):
            return False
        i = i + 6
    return True


d,t,s=sep()
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:
ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
ceil = math.ceil
d,t,s = ma()
if t*s>=d:
    f=True
else:f=False
yn(f)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
s=d/s
if 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("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 t >= time:
    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:
import sys
input = sys.stdin.buffer.readline

#sys.setrecursionlimit(10**9)
#from functools import lru_cache

def RD(): return input().rstrip().decode()
def II(): return int(input())
def FI(): return float(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()


def main():
	d,t,s=MI()
	ans="No"

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














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())
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:
def main():
    import math
    d, t, s = map(int, input().split())
    m = math.ceil(d/s)
    print("Yes" if m <= t else "No")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    if a[1] >= a[0] / a[2]:
        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:
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())
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 t*s >= d: print("Yes")
else: print("No")

Submission status: Accepted

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


def read_ints():
    return map(int, input().split(' '))


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

Submission status: Accepted

Solution code:
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
from functools import reduce, lru_cache
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def MAP1()  : return map(lambda x:int(x)-1,input().split())
def LIST()  : return list(MAP())
def LIST1() : return list(MAP1())

d, t, s = MAP()
if t >= d/s:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
#======================================================#
def main():
    d, t, s = MII()
    if d/s <= t:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")
#import numpy as np
INF = float("inf")
#d = defaultdict(int)
#d = defaultdict(list)
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:
#!/usr/bin/env python3
import sys
import numpy as np

YES = "Yes"  # type: str
NO = "No"  # type: str


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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    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
    solve(D, T, S)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if s * t >= d:
    ans = "Yes"
else:
    ans = "No"

print(ans)

Submission status: Accepted

Solution code:
a,b,c=[int(_) for _ in input().split()]
if a/c<=b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys


def main():
    input = sys.stdin.buffer.readline
    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())
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:
#n, m, q = map(int, input().split())
#List = list(map(int, input().split()))
#req = [list(map(int, input().split())) for _ in range(q)]
#t = t[:-1]
#print(ans[j], end = "") 改行無しで出力
#[0]*n
#sort = sorted(a)[::-1] 降順
#if l[i] == l[j]: continue
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 / s > t:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys


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


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

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



if __name__ == "__main__":
    main()

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
import sys
import math
import collections
import decimal
import itertools
from collections import deque
from functools import reduce
import heapq
import copy
import numpy as np
#n = int(input())
d, t, s = map(int, sys.stdin.readline().split())
#n = input()
#a = list(map(int, sys.stdin.readline().split()))


x = d / s

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

def lcm(a, b):  
    return (a*b)/gcd(a, b)

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()

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

D, T, S = In.ints()

if D/S <= T:
    Out.str("Yes")
else:
    Out.str("No")

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

if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

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 math
ini = lambda : int(input())
inm = lambda : map(int,input().split())
inl = lambda : list(map(int,input().split()))
gcd = lambda x,y : gcd(y,x%y) if x%y else y
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])
    if arr==[]:
        arr.append([n, 1])
    return arr
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    divisors.sort()
    return divisors
 
#maincode-------------------------------------------------

d,t,s = inm()
if d - t * s > 0:
    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 T*S<D: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:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil,pi,factorial
    from operator import itemgetter
    def I(): return int(input())
    def MI(): return map(int, input().split())
    def LI(): return list(map(int, input().split()))
    def LI2(): return [int(input()) for i in range(n)]
    def MXI(): return [[LI()]for i in range(n)]
    def SI(): return input().rstrip()
    def printns(x): print('\n'.join(x))
    def printni(x): print('\n'.join(list(map(str,x))))
    inf = 10**17
    mod = 10**9 + 7
#main code here!
    d,t,s=MI()
    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())
print('Yes' if d/s<=t else 'No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
 
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 t <d/s:
    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 S * T < D:
    print("No")
else:
    print('Yes')

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

#a = int(input())
#b = list(map(int, input().split()))
d, t, s = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]

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())
print("Yes") if t*s >= d 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())
if T >= D/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:
def li():
    return [int(x) for x in input().split()]

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