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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


def calculate(d, t, s):

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


calculate(D, T, S)

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


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    d, t, s = list(map(int, readline().split()))
    print("Yes" if d <= t * s else "No")


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
d=input()
arr = [int(i) for i in d.split()]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

t_2 = d/s

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = 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('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 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())
print('Yes' if d / s <= t 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:
A=list(map(int,input().split()))
if(A[0]<=A[1]*A[2]):
  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')
        return
    else:
        print('No')
        return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding:UTF-8
import sys


def resultSur97(x):
    return x % (10 ** 9 + 7)


if __name__ == '__main__':
    # ------ 入力 ------#
    aList = list(map(int, input().split()))     # スペース区切り連続数字


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

Submission status: Accepted

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

d, t, s = read()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

li=list(map(int,input().split()))

if li[0]<=li[1]*li[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
D, T, S = map(int, input().split())
temp = S*T
if D > temp:
    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())
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('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().split(' '))

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

Submission status: Accepted

Solution code:

def main():
    d,t,s = map(int, input().split())
    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 (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:
st = str(input())
dum = st.split()
d = int(dum[0])
t = int(dum[1])
s = int(dum[2])

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

def main():
    input = sys.stdin.readline
    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:
def LI():return list(map(int,input().split()))
def II():return int(input())
def yes():return print("Yes")
def no():return print("No")
#INF=float("inf")
#from collections import deque, defaultdict, Counter
#from heapq import heappop, heappush
#from itertools import product, combinations
#from functools import reduce, lru_cache
#from math import pi, gcd
#from decimal import Decimal

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

class Unionfind:
    def __init__(self, N):
        self.p = list(range(N))
        self.rank = [0] * N
        self.size = [1] * N

    def root(self, x):
        if self.p[x] != x:
            self.p[x] = self.root(self.p[x])

        return self.p[x]

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

    def unite(self, x, y):
        u = self.root(x)
        v = self.root(y)

        if u == v: return

        if self.rank[u] < self.rank[v]:
            self.p[u] = v
            self.size[v] += self.size[u]
            self.size[u] = 0
        else:
            self.p[v] = u
            self.size[u] += self.size[v]
            self.size[v] = 0

            if self.rank[u] == self.rank[v]:
                self.rank[u] += 1

    def count(self, x):
        return self.size[self.root(x)]


d,t,s=LI()

if (d<=t*s):
    yes()
else:
    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):
    if T >= D/S:
        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:
def LI():return list(map(int,input().split()))
def II():return int(input())
def yes():return print("Yes")
def no():return print("No")
INF=float("inf")
from collections import deque, defaultdict, Counter
from heapq import heappop, heappush
from itertools import product, combinations
from functools import reduce, lru_cache
from math import pi, gcd
from decimal import Decimal

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

class Unionfind:
    def __init__(self, N):
        self.p = list(range(N))
        self.rank = [0] * N
        self.size = [1] * N

    def root(self, x):
        if self.p[x] != x:
            self.p[x] = self.root(self.p[x])

        return self.p[x]

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

    def unite(self, x, y):
        u = self.root(x)
        v = self.root(y)

        if u == v: return

        if self.rank[u] < self.rank[v]:
            self.p[u] = v
            self.size[v] += self.size[u]
            self.size[u] = 0
        else:
            self.p[v] = u
            self.size[u] += self.size[v]
            self.size[v] = 0

            if self.rank[u] == self.rank[v]:
                self.rank[u] += 1

    def count(self, x):
        return self.size[self.root(x)]


d,t,s=LI()

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

Submission status: Accepted

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

YES = 'Yes'
NO = 'No'

# def solve(D: int, T: int, S: int) -> str:
def solve(D, T, S):
    return YES if D <= T*S else NO
    

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def LI():return list(map(int,input().split()))
def II():return int(input())
def yes():return print("Yes")
def no():return print("No")
INF=float("inf")
from collections import deque, defaultdict, Counter
from heapq import heappop, heappush
from itertools import product, combinations
from functools import reduce, lru_cache
from math import pi, gcd
from decimal import Decimal

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

class Unionfind:
    def __init__(self, N):
        self.p = list(range(N))
        self.rank = [0] * N
        self.size = [1] * N

    def root(self, x):
        if self.p[x] != x:
            self.p[x] = self.root(self.p[x])

        return self.p[x]

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

    def unite(self, x, y):
        u = self.root(x)
        v = self.root(y)

        if u == v: return

        if self.rank[u] < self.rank[v]:
            self.p[u] = v
            self.size[v] += self.size[u]
            self.size[u] = 0
        else:
            self.p[v] = u
            self.size[u] += self.size[v]
            self.size[v] = 0

            if self.rank[u] == self.rank[v]:
                self.rank[u] += 1

    def count(self, x):
        return self.size[self.root(x)]


d,t,s=LI()

if (d<=t*s):
    yes()
else:
    no()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# 日本語を入力できるようにするために上記一文が必要


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


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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a,b,c=map(int,input().split())
if a<=b*c:print("Yes")
else:print("No")
  
#連続acしなきゃ……

Submission status: Accepted

Solution code:
import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    #n = int(stdin.readline().rstrip())
    d,t,s = map(int, stdin.readline().rstrip().split())
    #l = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    if s*t >= d:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    solve()

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:
# URL : https://atcoder.jp/contests/abc177/tasks/abc177_a
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())

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

Submission status: Accepted

Solution code:
import sys

line = sys.stdin.readline().strip().split(" ")

d = float(line[0])
t = float(line[1])
s = float(line[2])

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

Submission status: Accepted

Solution code:
def dontbelate(D,T,S):
    if T <  D//S:
        return 'No'
    elif T > D//S:
        return 'Yes'
    else:
        if D%S == 0:
            return 'Yes'
        else:
            return 'No'


if __name__ == "__main__":
    D,T,S = map(int, input().split())
    print(dontbelate(D,T,S))

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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:
#                               #
    # author : samars_diary #
    # 13-09-2020 │ 11:26:57 #
#                               #

import sys, os.path

#if(os.path.exists('input.txt')):
    #sys.stdin = open('input.txt',"r")
    #sys.stdout = open('output.txt',"w")

sys.setrecursionlimit(10 ** 5)

def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))

#print=sys.stdout.write

def solve():
    d,t,s=mii()
    if d/s<=t:
        print('Yes')
    else: print('No')
solve()

Submission status: Accepted

Solution code:
A = input().split()

L = int(A[1])*int(A[2])
D = int(A[0])


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

Submission status: Accepted

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

if D >C * 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 = [int(x) for x in 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())

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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
from collections import deque
from collections import Counter
import math

def readInt():
  return int(input())
def readInts():
  return list(map(int, input().split()))
def readChar():
  return input()
def readChars():
  return input().split()

d,t,s = readInts()

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 t < d/s:
  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:
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 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, 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 sys
sys.setrecursionlimit(1000000000)
import math
from math import gcd
def lcm(a, b): return a * b // gcd(a, b)
from itertools import count, permutations, combinations, chain, product
from functools import lru_cache
from collections import deque, defaultdict
from operator import itemgetter
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok

def get_inv(n, modp):
    return pow(n, modp-2, modp)

def factorials_list(n, modp):    # 10**6
    fs = [1]
    for i in range(1, n+1):
        fs.append(fs[-1] * i % modp)
    return fs

def invs_list(n, fs, modp):     # 10**6
    invs = [get_inv(fs[-1], modp)]
    for i in range(n, 1-1, -1):
        invs.append(invs[-1] * i % modp)
    invs.reverse()
    return invs

def comb(n, k, modp):
    num = 1
    for i in range(n, n-k, -1):
        num = num * i % modp
    den = 1
    for i in range(2, k+1):
        den = den * i % modp
    return num * get_inv(den, modp) % modp

def comb_from_list(n, k, modp, fs, invs):
    return fs[n] * invs[n-k] * invs[k] % modp

#

class UnionFindEx:
    def __init__(self, size):
        #正なら根の番号、負ならグループサイズ
        self.roots = [-1] * size
    def getRootID(self, i):
        r = self.roots[i]
        if r < 0:   #負なら根
            return i
        else:
            r = self.getRootID(r)
            self.roots[i] = r
            return r
    def getGroupSize(self, i):
        return -self.roots[self.getRootID(i)]
    def connect(self, i, j):
        r1, r2 = self.getRootID(i), self.getRootID(j)
        if r1 == r2:
            return False
        if self.getGroupSize(r1) < self.getGroupSize(r2):
            r1, r2 = r2, r1
        self.roots[r1] += self.roots[r2]    #サイズ更新
        self.roots[r2] = r1
        return True

Yes = 'Yes'
No = 'No'

from pprint import pprint

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





main()

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

Submission status: Accepted

Solution code:
x, y, z = input().split()
x = int(x)
y = int(y)
z = int(z)
if x / z <= y:
    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<=0: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')

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:
a,b,c = (int(x) for x in input().split())

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

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

Submission status: Accepted

Solution code:
text = [int(e) for e in input().split()]

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

Submission status: Accepted

Solution code:
# 入力
D, T, S = input().split()

# 以下に回答を記入
D = int(D)
T = int(T)
S = int(S)

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

Submission status: Accepted

Solution code:
# 入力
D, T, S = input().split()

# 以下に回答を記入
D = int(D)
T = int(T)
S = int(S)

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

Submission status: Accepted

Solution code:
#A問題
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")