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:
# coding: utf-8
#import numpy as np
import re
import math
from collections import defaultdict,deque,Counter
from fractions import Fraction
import bisect
import itertools
from itertools import accumulate
from copy import deepcopy

import heapq
import random
import time
import os
import sys
from functools import lru_cache,reduce
readline=sys.stdin.readline
sys.setrecursionlimit(100000)
alp="abcdefghijklmnopqrstuvwxyz"
numbers="0123456789"
mod=int(10**9+7)
inf=int(10**19)
class Set():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(bool)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        if not self.find(x):
            heapq.heappush(self.heap,x)
            self.dic[x]=True
            self.size+=1

    def remove(self,x):
        if self.find(x):
            self.dic[x]=False
            self.size-=1

    def find(self,x):
        return self.dic[x]
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==False:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class multiset():
    def __init__(self,A=[]):
        self.heap=[]
        self.dic=defaultdict(int)
        self.size=0
        for a in A:self.add(a)
    
    def __str__(self):
        return str(self.heap)
    
    def add(self,x):
        heapq.heappush(self.heap,x)
        self.dic[x]+=1
        self.size+=1

    def remove(self,x):
        if self.dic[x]>0:
            self.dic[x]-=1
            self.size-=1
    
    def count(self,x):
        return self.dic[x]

    def find(self,x):
        return self.dic[x]>0
    
    def top(self):
        while self.heap and self.dic[self.heap[0]]==0:
            heapq.heappop(self.heap)
        if self.heap:return self.heap[0]
        else:return None

    def pop(self):
        ret=None
        if self.heap:
            ret=self.top()
            self.remove(ret)
        return ret
class Edge():
    def __init__(self,x,y,val=1):
        self.x=x
        self.y=y
        self.val=val
class Point():
    def __init__(self,y,x):
        self.x=x
        self.y=y
class unionfind():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(n)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):
            self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def yn(b):print("yes" if b else "no")
def Yn(b):print("Yes" if b else "No")
def YN(b):print("YES" if b else "NO")
def ispow(a,b):
    now=b
    while now<a:
        now*=b
    return now==a
def getbin(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def getfacs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def nextcomb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def getprimes(n):
    if n==0:return []
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    ret=[]
    for a in range(n+1):
        if(A[a]):ret.append(a)
    return ret
def isprime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(b,t,f):return t if b else f
def factorize(n):
    b = 2
    ret=defaultdict(int)
    while b * b <= n:
        while n % b == 0:
            n //= b
            ret[b]+=1
        b+=1
    if n > 1:ret[n]+=1
    return ret
def inputintlist(row=1): 
    if row==1:
        ret=list(map(int,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=int(input())
    return ret
def inputfloatlist(row=1): 
    if row==1:
        ret=list(map(float,input().split()))
    else:
        ret=[None]*row
        for a in range(row):
            ret[a]=float(input())
    return ret
def istanchouzouka(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>=a:
            f=False
        prev=a
    return f
def istanchouhigensyou(A):
    f=True
    prev=min(A)-1
    for a in A:
        if prev>a:
            f=False
        prev=a
    return f
def getallsum(A):
    s=sum(A)
    dp=defaultdict(int)
    dp[0]=1
    for a in range(0,len(A)):
        for b in range(s,-1,-1):
            if b-A[a]>=0:
                dp[b]+=dp[b-A[a]]
    return dp
def yuukoutomukou(edges):
    ret=deepcopy(edges)
    for edge in edges:
        if not edge.x==edge.y:
            ret.append(Edge(edge.y,edge.x,edge.val))
    return ret
def dijkstra(edges,V,start):
    from queue import PriorityQueue
    mincost=[inf]*V
    G=[[] for a in range(V)]
    for edge in edges:
        G[edge.x].append([edge.val,edge.y])
    Q=PriorityQueue()
    Q.put([0,start])#[cost,x]
    while not Q.empty():
        nowcost,nowx=Q.get()
        if mincost[nowx]==inf:
            mincost[nowx]=nowcost
            for cost,y in G[nowx]:
                newcost=nowcost+cost
                Q.put([newcost,y])
    return mincost
def warshallfloyd(edges,V):
    mincost=[[inf for b in range(V)] for a in range(V)]
    for a in range(V):mincost[a][a]=0
    for edge in edges:
        mincost[edge.x][edge.y]=min(mincost[edge.x][edge.y],edge.val)#x→yが複数ある場合のためにmin()する
    for k in range(V):
        for s in range(V):
            for t in range(V):
                if mincost[s][k]==inf or mincost[k][t]==inf:continue
                mincost[s][t]=min(mincost[s][t],mincost[s][k]+mincost[k][t])
    return mincost
def bellemanford(edges,V,start):
    mincost=[inf]*V
    mincost[start]=0
    for _ in range(V):
        for edge in edges:
            if mincost[edge.x]==inf:continue
            mincost[edge.y]=min(mincost[edge.y],mincost[edge.x]+edge.val)
    return mincost
def getmd(x1,y1,x2,y2):return abs(x1-x2)+abs(y1-y2)
def geted(x1,y1,x2,y2):return math.sqrt((x1-x2)**2+(y1-y2)**2)
class fordfulkerson():
    def __init__(self,edges,V,s,t):
        self.V=V
        self.used=[False]*V
        self.G=[[] for a in range(V)]
        self.s=s
        self.t=t
        for edge in edges:
            self.G[edge.x].append({"x":edge.x,"y":edge.y,"cap":edge.val,"rev":len(self.G[edge.y])})
            self.G[edge.y].append({"x":edge.y,"y":edge.x,"cap":0,"rev":len(self.G[edge.x])-1})
    def dfs(self,v,t,f=inf):
        if v==t:return f
        self.used[v]=True
        for a in range(len(self.G[v])):
            x=self.G[v][a]["x"]
            y=self.G[v][a]["y"]
            cap=self.G[v][a]["cap"]
            rev=self.G[y][self.G[x][a]["rev"]]
            if self.used[y] or cap==0:continue
            f2=self.dfs(y,t,min(f,cap))
            if f2>0:
                self.G[v][a]["cap"]-=f2
                rev["cap"]+=f2
                return f2
        return 0
    def maxflow(self):
        flow=0
        while True:
            self.used=[False]*V
            zouka=self.dfs(self.s,self.t)
            if zouka==0:break
            flow+=zouka
        return flow
def zipsort(*args):
    ziplist=sorted(zip(*args))
    for a in range(len(args)):
        for b in range(len(ziplist)):
            args[a][b]=ziplist[b][a]
def zipreverse(*args):
    ziplist=list(zip(*args))
    rev=[]
    for a in range(len(ziplist)-1,-1,-1):
        rev.append(ziplist[a])
    for a in range(len(args)):
        for b in range(len(rev)):
            args[a][b]=rev[b][a]

def to10(A):
    ret=0
    for a in range(len(A)-1,-1,-1):
        ret+=X[a]*2**(N-1-a)
    return ret
######################################################################################################

D,T,S=inputintlist()


d=T*S
Yn(d>=D)

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

Submission status: Accepted

Solution code:
import math

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

ans = D - (S*T)

if ans > 0:
    print("No")
else:
    print("Yes")

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:
d, t, s = map(int, input().split())

dif = d / s

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

Submission status: Accepted

Solution code:
def resolve():
    import sys
    sys.setrecursionlimit(10 ** 6)  # 再帰関数の再帰の深さを設定
    to_index = lambda x: int(x) - 1  # 入力した数字に1を引いたものを返す
    print_list_in_2D = lambda x: print(*x, sep="\n")  # リストの要素を改行を挟んで表示する関数

    # 入力を整数に変換して受け取る
    def input_int(): return int(input())

    def map_int_input(): return map(int, input())

    MII = map_int_input

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

    def MII_to_index(): return map(to_index, input())

    def MII_split_to_index(): return map(to_index, input().split())

    # 入力全てを整数に変換したものの配列を受け取る
    def list_int_inputs(): return list(map(int, input()))

    LII = list_int_inputs

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

    # 2次元リスト化
    def LII_2D(rows_number): return [LII() for _ in range(rows_number)]

    def LII_split_2D(rows_number): return [LII_split() for _ in range(rows_number)]

    d, t, s = MII_split()

    print('Yes' if d / s <= t else 'No')
def resolve():
    import sys
    sys.setrecursionlimit(10 ** 6)  # 再帰関数の再帰の深さを設定
    to_index = lambda x: int(x) - 1  # 入力した数字に1を引いたものを返す
    print_list_in_2D = lambda x: print(*x, sep="\n")  # リストの要素を改行を挟んで表示する関数

    # 入力を整数に変換して受け取る
    def input_int(): return int(input())

    def map_int_input(): return map(int, input())

    MII = map_int_input

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

    def MII_to_index(): return map(to_index, input())

    def MII_split_to_index(): return map(to_index, input().split())

    # 入力全てを整数に変換したものの配列を受け取る
    def list_int_inputs(): return list(map(int, input()))

    LII = list_int_inputs

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

    # 2次元リスト化
    def LII_2D(rows_number): return [LII() for _ in range(rows_number)]

    def LII_split_2D(rows_number): return [LII_split() for _ in range(rows_number)]

    d, t, s = MII_split()

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

resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,sys,bisect,heapq
from collections import defaultdict,Counter,deque
from itertools import groupby,accumulate
#sys.setrecursionlimit(200000000)
int1 = lambda x: int(x) - 1
input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__
ilele = lambda: map(int,input().split())
alele = lambda: list(map(int, input().split()))
ilelec = lambda: map(int1,input().split())
alelec = lambda: list(map(int1, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
#MOD = 1000000000 + 7
def Y(c):  print(["NO","YES"][c])
def y(c):  print(["no","yes"][c])
def Yy(c):  print(["No","Yes"][c])

D,T,s = ilele()
dis =s*T
Yy(dis>= D)

Submission status: Accepted

Solution code:
d, t, s = map(lambda x: int(x), 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 T*S>=D else "No")

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    D, T, S = MAP()

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

# print('-----output-----')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
#
# FileName: 	A
# CreatedDate:  2020-08-29 20:57:54 +0900
# LastModified: 2020-08-29 21:01:15 +0900
#


import os
import sys
# import numpy as np
# import pandas as pd


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:
import math

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

D= i[0]
T = i[1]
S = i[2]

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

Submission status: Accepted

Solution code:
d,t,s = map(int,input().split())
if s*t - d >=0:
    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:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
d, t, s  = map(int, input().split())

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
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 = MI()
    a = D / S
    if a <= T:
        print('Yes')
    else:
        print('No')









if __name__ == "__main__":
    main()

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

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:
#!/usr/bin python3
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

result = d/t

if result > s:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys
import numpy as np
import math  # gcdもあるよ
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate #リストを与えると累積和を返す
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache #メモ化

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

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

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

if d <= t * s:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    d, t, s = MI()
    if d/s <= t:
        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 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=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 T * S >= D else 'No')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
# sys.stdin  = open("input.txt")
d,t,s=map(int,input().split())
if s*t>=d:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

if D <= N * 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<=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())
print('Yes' if d/s<=t 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:
def main():
    D, T, S = map(int, input().split())
    cnt = 0
    if D % S == 0:
        cnt = D // S
    else:
        cnt = D // S
        cnt += 1

    if cnt <= T:
        print('Yes')
    else:
        print('No')



if __name__ == "__main__":
    main()

Submission status: Accepted

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

print('Yes' if d / s <= t 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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    d, t, s = LI()
    if d > t * s:
        print("No")
    else:
        print("Yes")

main()

Submission status: Accepted

Solution code:
import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 19
MOD = 10 ** 19 + 7
EPS = 10 ** -10

D, T, S = MAP()

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

Submission status: Accepted

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

if a > b*c:
    print('No')
if a <= b*c:
    print('Yes')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def getN():
    return int(input())
def getNM():
    return map(int, input().split())
def getList():
    return list(map(int, input().split()))
def getArray(intn):
    return [int(input()) for i in range(intn)]
def input():
    return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
    return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
    return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
  ns = []
  while len(ns) < rantime:
    n = random.randint(ran1, ran2)
    if not n in ns:
      ns.append(n)
  return sorted(ns)

def rand_query(ran1, ran2, rantime):
  r_query = []
  while len(r_query) < rantime:
    n_q = rand_ints_nodup(ran1, ran2, 2)
    if not n_q in r_query:
      r_query.append(n_q)
  return sorted(r_query)

from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
from heapq import heapify, heappop, heappush
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right

import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7

#############
# Main Code #
#############

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

Submission status: Accepted

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

num = math.ceil(d/s)
print("Yes" if num <= t else "No")

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  x, y, z = map(int, input().split())
  
  if x <= y * z:
    print('Yes')
  else:
    print('No')

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

Submission status: Accepted

Solution code:
import sys
import math

D, T, S = map(int, sys.stdin.readline().strip().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d, t, s = 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")