problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02570 | s112403915 | Accepted | d,t,s=map(int,input().split())
if d<=t*s:
print('Yes')
else:
print('No') |
p02570 | s502270758 | Accepted | d, t, s = list(map(int, input().split()))
if d <= t*s:
print("Yes")
else:
print("No") |
p02570 | s109950159 | Accepted | d, t, s = map(int, input().split())
take_time = d / s
print('Yes' if t >= take_time else 'No')
|
p02570 | s011563969 | Accepted | D, T, S = map(int, input().split())
if T * S >= D:
print("Yes")
else:
print("No") |
p02570 | s339063604 | Accepted | d,t,s=map(int,input().split())
time=d/s
if(t<time):
print('No')
else:
print('Yes') |
p02570 | s027965482 | Accepted | # = int(input())
# = str(input())
D, T, S = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
# = [list(map(int, input().split())) for i in range(N)]
if S*T - D >= 0:
print("Yes")
else:
print("No")
|
p02570 | s298763758 | Accepted | import sys
sys.setrecursionlimit(10**6)
def main(input, print):
D, T, S = map(int, input().split())
if D / S <= T:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main(sys.stdin.readline, print)
|
p02570 | s858130074 | Accepted | print('Yes' if eval(input().replace(' ','<=',1).replace(' ','*',1)) else 'No') |
p02570 | s567012074 | Accepted | D, T, S = map(int, input().split())
ans = 'No'
if D / S <= T:
ans = 'Yes'
print(ans) |
p02570 | s661220692 | Accepted | d,t,s =[int(c) for c in input().split()]
tt = d /s
if tt <= t:
print("Yes")
else:
print("No") |
p02570 | s184259308 | Accepted | #: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"
input = sys.stdin.readline
######... |
p02570 | s396613611 | Accepted | def main():
D, T, S = map( int, input().split())
if S*T >= D:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p02570 | s553927256 | Accepted | D, T, S = map(int, input().split())
if D <= S * T:
print('Yes')
else:
print('No') |
p02570 | s554488335 | Accepted | D, T, S = map(int, input().split())
# 割り算（＝少数が出る）は使わずに、整数演算のみで解く
if D <= S*T: print('Yes')
else: print('No') |
p02570 | s410769306 | Accepted | a = input().split()
D = int(a[0])
T = int(a[1])
S = int(a[2])
if D/S > T:
print('No')
else:
print('Yes')
|
p02570 | s369653799 | Accepted | d,s,t = map(float, input().split())
if d/t <= s:
print('Yes')
else:
print('No')
|
p02570 | s585114284 | Accepted | import sys
sys.setrecursionlimit(500005)
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
d, t, s = na()
print("Yes" if s * t >= d else "No") |
p02570 | s671858521 | Accepted | d, t, s = map(int, input().split())
print("Yes" if d <= t * s else "No")
|
p02570 | s817734817 | Accepted | #A
D,T,S= map(int,input().split())
if D/S<=T:
print("Yes")
else:
print("No") |
p02570 | s195804595 | Accepted | d, t, s = map(int, input().split())
if(d/s <= t):print("Yes")
else:print("No") |
p02570 | s693321291 | Accepted | # import sys; input = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
#処理内容
def main():
D, T, S = getlist()
if S * T >= D:
print("Yes")
else:
print("No")
if __name__ == '_... |
p02570 | s530015233 | Accepted | d, t, s = map(int, input().split())
if d/s <= t:
print("Yes")
else:
print("No")
|
p02570 | s107208386 | Accepted | def main():
D, T, S = map(int, input().split())
answer = solve(D, T, S)
print(answer)
def solve(D, T, S):
return 'Yes' if D <= S * T else 'No'
if __name__ == "__main__":
main()
|
p02570 | s633182143 | Accepted | d, t, s = map(int, input().split())
if d / s <= t:
print('Yes')
else:
print('No') |
p02570 | s286149455 | Accepted | d,t,s=map(int,input().split())
if d/s<=t:
print("Yes")
else:
print("No") |
p02570 | s590267900 | Accepted | td,tm,dpm =tuple(map(int,input().split(" ")))
if td/dpm <= tm:
print("Yes")
else:
print("No") |
p02570 | s587815751 | Accepted | d, t, s = map(int, input().split())
if d / s <= t:
print("Yes")
else:
print("No")
|
p02570 | s929276877 | Accepted | D, S, T = map(int, input().split())
print('Yes' if S * T >= D else 'No')
|
p02570 | s868736389 | Accepted | def on_time(D, T, S):
if T >= (D / S):
return True
return False
def start():
d,t,s = [int(x) for x in input().split(" ")]
if on_time(d,t,s):
print("Yes")
else:
print("No")
start()
|
p02570 | s005080959 | Accepted | d,t,s = map(int, input().split())
if s*t >= d:
print("Yes")
else:
print("No")
|
p02570 | s681867322 | Accepted | d, t, s = map(int, input().split())
if d <= t*s:
print('Yes')
else:
print('No') |
p02570 | s661796011 | Accepted | d,t,s = map(int,input().split())
if d <= t * s:
print('Yes')
else:
print('No')
|
p02570 | s087232278 | Accepted | d,t,s =map(int,input().split())
if t*s >= d:
print('Yes')
else:
print('No') |
p02570 | s777681492 | Accepted | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... |
p02570 | s095038458 | Accepted | D, T, S = map(int, input().split())
if T*S>=D:
print('Yes')
else:
print('No')
|
p02570 | s267207611 | Accepted | d, t, s = map(int, input().split())
if d/s <= t:
print("Yes")
else:
print("No") |
p02570 | s925840773 | Accepted | D, T, S = list(map(int, input().split()))
if D/S <= T:
print("Yes")
else:
print("No") |
p02570 | s054922479 | Accepted | D, T, S = map(int, input().split())
if D > T * S:
print("No")
else:
print("Yes") |
p02570 | s934221621 | Accepted | D,T,S = map(int,input().split())
if(D/S <= T):
print("Yes")
else:
print("No") |
p02570 | s693721521 | Accepted | d, t, s = map(int, input().split())
if d / s <= t:
print("Yes")
else:
print("No") |
p02570 | s570398794 | Accepted | D, N, S = map(int, input().split())
if D <= N * S:
print('Yes')
else:
print('No') |
p02570 | s428455780 | Accepted | d, t, s = map(int, input().split())
a = (d + s - 1) // s
if a > t:
print('No')
else:
print('Yes')
|
p02570 | s583238546 | Accepted | d,t,s = list(map(int,input().split()))
if d/s <= t:
print('Yes')
else:
print('No') |
p02570 | s287322035 | Accepted | D,T,S = map(int,input().split())
if D / S <= T :
print('Yes')
else:
print('No') |
p02570 | s949794989 | Accepted | x, y, z = input().split()
x = int(x)
y = int(y)
z = int(z)
if x / z <= y:
print("Yes")
else:
print("No") |
p02570 | s896448383 | Accepted | d,t,s = map(int,input().split())
if d/s <=t:
print("Yes")
else:
print("No") |
p02570 | s551590933 | Accepted | 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') |
p02570 | s788537235 | Accepted | n=input()
n=n.split()
d,t,s=int(n[0]),int(n[1]),int(n[2])
if s>=(d/t):
print("Yes")
else:
print("No") |
p02570 | s368281925 | Accepted | D ,T, S = map(int,input().split())
if (D )/ S <= T :
print('Yes')
else:
print('No') |
p02570 | s081749056 | Accepted | D, T, S = list(map(int, input().split()))
if (D <= T * S):
print("Yes")
else:
print("No")
|
p02570 | s472924337 | Accepted | D, T, S = map(int, input().split(' '))
if S*T >= D:
print('Yes')
else:
print('No') |
p02570 | s041939948 | Accepted | d,s,t = map(int,input().split())
print('Yes' if d/s <= t else 'No') |
p02570 | s718103465 | Accepted | import sys
import math
from collections import defaultdict
from bisect import bisect_left, bisect_right
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
... |
p02570 | s622106225 | Accepted | D,T,S = map(int,input().split())
if T * S >= D:
print('Yes')
else:
print('No')
|
p02570 | s435535093 | Accepted | D,T,S=map(int,input().split())
if S*T<D:
print("No")
else:
print("Yes")
|
p02570 | s664395827 | Accepted | D, T, S = map(int, input().split(' '))
if T*S >= D:
print("Yes")
else:
print("No") |
p02570 | s909335539 | Accepted | d, t, s = map(int, input().split())
time = d / s
if time <= t:
print('Yes')
else:
print('No') |
p02570 | s498694179 | Accepted | D,T,S = map(int, input().split())
X = D/S
if X > T:
print('No')
else:
print('Yes') |
p02570 | s459919098 | Accepted | D,T,S=(int(x) for x in input().split())
if D/S<=T:
print('Yes')
else:
print('No')
|
p02570 | s575026826 | Accepted | d,s,t = list(map(int,input().split(" ")))
if s * t >= d:
print("Yes")
else:
print("No") |
p02570 | s392636577 | Accepted | D,T,S = map(int,input().split())
if D/S <= T:
print("Yes")
elif D/S > T:
print("No") |
p02570 | s933101960 | Accepted | d, t, s = (int(each) for each in input().split())
if s * t >= d:
print('Yes')
else:
print('No')
|
p02570 | s570107952 | Accepted | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
... |
p02570 | s084232313 | Accepted | D, T, S = map(int, input().split())
time = D/S
if time <= T:
print("Yes")
else:
print("No") |
p02570 | s603946768 | Accepted | a,b,c = map(int,input().split())
print("Yes" if a/b <= c else "No") |
p02570 | s794137065 | Accepted | d,t,s = map(int,input().split())
ans = d / s
if ans <= t:
print("Yes")
else:
print("No") |
p02570 | s976104447 | Accepted | d,t,s = map(float, input().split())
if d/s <= t:
print('Yes')
else:
print('No') |
p02570 | s034805809 | Accepted | d,t,s=map(int,input().split())
print('YNeos'[d>t*s::2]) |
p02570 | s724220648 | Accepted | d, t, s = map(int, input().split())
print('Yes' if d / s <= t else 'No')
|
p02570 | s276324663 | Accepted | d,t,s = map(int, input().split())
if s*t >= d:
print('Yes')
else:
print('No') |
p02570 | s663801151 | Accepted | def main():
d, t, s = map(int, input().split())
if d / s <= t:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() |
p02570 | s159063610 | Accepted | # -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline
MOD = 10**9+7
def main():
D, T, S = list(map(int,input().split()))
print('Yes' if D/S <= T else 'No')
if __name__ == "__main__":
main()
|
p02570 | s051305077 | Accepted |
d,t,s=map(int,input().split())
if d<=t*s:
print("Yes")
else:
print("No")
|
p02570 | s191268540 | Accepted | D, T, S = map(int, input().split(' '))
result = 'Yes' if D <= T * S else 'No'
print(result) |
p02570 | s457550302 | Accepted | D,T,S=map(int,input().split())
if D/S<=T:
print("Yes")
else:
print("No")
|
p02570 | s501098309 | Accepted | D, T, S = map(int, input().split())
print('Yes' if S >= D/T else 'No')
|
p02570 | s273600357 | Accepted | D, T, S = map(int, input().split())
if D <= T*S:
print("Yes")
else:
print("No") |
p02570 | s837713458 | Accepted | D,T,S = map(int,input().split())
if D/S > T:
print('No')
else:
print('Yes') |
p02570 | s362811896 | Accepted | a,b,c=map(int,input().split())
if(b*c)>=a:
print("Yes")
else:
print("No") |
p02570 | s755910483 | Accepted | #A
d, t, s = map(int, input().split())
ans = ("Yes" if (d/s) <= t else "No")
print(ans) |
p02570 | s944064211 | Accepted | d, t, s = map(int, input().split())
if d/s <= t:
print('Yes')
else:
print('No') |
p02570 | s539707453 | Accepted | d, t, s = map(int, input().split())
if d/s <= t:
print("Yes")
else:
print("No") |
p02570 | s518889641 | Accepted | D, T, S = input().split()
if int(D)/int(T) <= int(S) :
print("Yes")
else:
print("No") |
p02570 | s187520965 | Accepted | #template
def inputlist(): return [int(j) for j in input().split()]
#template
"""
H,W = inputlist()
st = inputlist()
gl = inputlist()
maze = ['0']*H
for i in range(H):
maze[i] = list(input())
table = [[10**9+7]*W for _ in range(H)]
"""
D,T,S = inputlist()
time = D//S + int(D%S != 0)
if time <= T:
print("Yes")
... |
p02570 | s721808591 | Accepted | n,m,s=map(int,input().split())
if n/m>float(s):
print("No")
else:
print("Yes") |
p02570 | s260618752 | Accepted | d,t,s=map(int,input().split())
if d/t<=s:
print('Yes')
else:
print('No') |
p02570 | s551376291 | Accepted |
import collections
from functools import lru_cache
import bisect
INF = float("inf")
ZERO = 0
ONE = 1
def read():
return input().strip()
def readInt():
return int(input().strip())
def readList():
return list(map(int, input().strip().split()))
def solve(D, T, S):
return S*T >= D
D, T, S = read... |
p02570 | s430892182 | Accepted | d, t, s = map(int, input().split())
q, mod = divmod(d, s)
if mod ==0:
if q <=t:
print("Yes")
else:
print("No")
elif q+1 <= t:
print("Yes")
else:
print("No")
|
p02570 | s706043498 | Accepted | D, T, S = map(int, input().split())
NT = D/S
if NT > T:
print("No")
else:
print("Yes") |
p02570 | s411199658 | Accepted | D, T, S = map(int, input().split())
if T >= D/S:
print('Yes')
else:
print('No') |
p02570 | s067855448 | Accepted | D, T, S = map(int, input().split())
if D <= S * T:
print("Yes")
elif D > S * T:
print("No") |
p02570 | s855190498 | Accepted | D, T, S = map(int, input().split())
if (D/T) > S:
print('No')
else:
print('Yes') |
p02570 | s133052076 | Accepted | d,t,s = map(int, input().split())
if d <= t*s:
print("Yes")
else:
print("No") |
p02570 | s647227034 | Accepted | D,T,S = map(int,input().split())
print("Yes" if D/S <= T else "No") |
p02570 | s354875847 | Accepted | d,t,s = map(int,input().split())
if d <= t*s:
print('Yes')
else:
print('No') |
p02570 | s922436477 | Accepted | D, T, S = map(int, input().split())
if S * T >= D:
print('Yes')
else:
print('No') |
p02570 | s217776632 | Accepted |
D, T, S = map(int, input().split())
if D/S <= T:
print('Yes')
else: print('No')
|
p02570 | s621894912 | Accepted | D,T,S=map(int,input().split())
t=D/S
if t<=T:
print('Yes')
else:
print('No') |
p02570 | s758705355 | Accepted | d,t,s=map(int,input().split())
if d/s<=t:
print("Yes")
else:
print("No") |
p02570 | s410946937 | Accepted | d, t, s = [int(x) for x in input().split(' ')]
if d > t * s:
print('No')
else:
print('Yes') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.