TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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?

Submission attempts (in order):
d,t,s=list(map(int,input().split(" ")))
if(d/s <= t):
  print("YES")
print("NO")

d,t,s=list(map(int,input().split(" ")))
if(d/s <= t):
    print("YES")
else:print("NO")

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

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
D,S,T = map(int,input().split()))
print("Yes" if D<=S*T else "No")

D,S,T = map(int,input().split())
print("Yes" if D<=S*T else "No")

Verdicts: Runtime Error

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

Submission attempts (in order):
# -*- coding: utf-8 -*-
N= int(input())
A= list(map(int,input().split(' ')))
 
ans = 0
for i in range(len(A)-1):
  for j in range(i+1, len(A)):
    ans += A[i]*A[j]
 
print(ans)


# -*- coding: utf-8 -*-
D, T, S= map(int,input().split(' '))
print('Yes' if D / S <= T else 'No')


Verdicts: Runtime Error

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

Submission attempts (in order):
D,T,S=map(int,input().split())
if D/S<=T:
    print("YES")
else:
    print("NO")

d,t,s = map(int,input().split())
if t*s >= d:
    print("YES")
else:
    print("NO")

d,t,s=map(int,input(.split())
if d/s<=t:
	print("YES")
else:
	print("NO")

d=int(input())
t=int(input())
s=int(input())
if d/s<=t:
    print("YES")
else:
    print("NO")

d,t,s=map(int,input().split())
if t*s>=d:
    print("YES")
else:
    print("NO")

d=int(input())
t=int(input())
s=int(input())

if d/s<=t:
    print("YES")
else:
    print("NO")

d=int(input())
t=int(input())
s=int(input())
if t>=d/s:
    print("YES")
else:
    print("NO")

d,t,s=map(int,input().split())
if d/s<=t:
    print("YES")
else:
    print("NO")

d=int(input())
t=int(input())
s=int(input())
if t*s>=d:
    print("YES")
else:
    print("NO")

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

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

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

Submission attempts (in order):
list1 = input().split(" ")
if int(list1[0]) <= int(list1[1]) * int(list[2]):
    print("Yes")
else:
    print("No")

list1 = input().split(" ")
if int(list1[0]) <= int(list1[1]) * int(list1[2]):
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

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

Submission attempts (in order):
D, T, S = map(int, input().split())

if D/S <= T:
  print('yes')
else:
  print('no')

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
D,T,S = [int(i) for i in input().split()]

if S*T >= D:
	print("YES")
else:
	print("NO")

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
d = int(input())
t = int(input())
s = int(input())

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

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

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D, T, S=map(int,input().split())

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

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

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

Verdicts: Wrong Answer

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

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

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

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

Submission attempts (in order):
d,t,s=list(map(int, input().split()))
if t*s<d:
   print('Yes')
else:
   print('No')

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
D, S, T = map(int, input().split())
if S*T <= D:
  print("Yes")
else:
  print("No")

N = int(input())
A = list(map(int, input().split()))
a = (sum(A)**2)
b =  sum([(a**2) for a in A])
print(((a-b)%(10**9+7))//2)

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

Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
D,T,S = input().split(' ')
if D/S>T:
  print('No')
else
  print('Yes')

S=input()
T=input()
i=0
j=0
match = 0
for i in Range(len(S)-len(T)):
  count = 0
  for j in Range(Len(T)):
    if S[i+j]==T[j]:
      count=count+1
  
  if match<count:
    match=count

print(Len(T)-match)
      

S=input()
T=input()
match=0
for i in range(len(S)-len(T)):
    count=0
    for j in range(len(T)):
        if S[i+j]==T[j]:
            count=count+1
    if match<count:
        match=count
print(len(T)-match)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

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

Submission attempts (in order):
a, b, c = map(int, input().split())
if a < b*c:
    print("yes")
else:
    print('no')

a, b, c = map(int, input().split())
if a <= b*c:
    print("Yes")
else:
    print('No')

Verdicts: Wrong Answer

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

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

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

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

Verdicts: Runtime Error

Runtime Error

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

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

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


Verdicts: Runtime Error

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

Submission attempts (in order):
dts_s = input().split()
dts_i = [int(n) for n in dts_s]
if dts_i[0]/dts_i[1] > dts_i[2]:
  print("NO")
else:
  print("YES")

dts_s = input().split()
dts_i = [int(n) for n in dts_s]
if dts_i[0]/dts_i[1] > dts_i[2]:
  print("No")
else:
  print("Yes")

Verdicts: Wrong Answer

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

Submission attempts (in order):
import numpy as np
N = int(input())
Sum = []
A = list(map(int, input().split()))
Sum = [A[i]*A[j] for j in range(N) for i in range(j)]
print(np.array(Sum).sum()%(1000000000+7))

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


Verdicts: Runtime Error

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

Submission attempts (in order):
import math


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

output = "";

if d/s >= s:
    if math.ceil(d/s) = s:
        output = "Yes"
    else:
        output = "No"
else:
    output = "Yes"

print(output)


import math


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

output = "";

if d/s > t:
    output = "No"
else:
    output = "Yes"

print(output)



Verdicts: Runtime Error

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

Submission attempts (in order):
D, T, S = map(int, input().split())

if D/S < T:
  print("yes")
  
else:
  print("no")

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

if D/S <= T:
  print("yes")
  
else:
  print("no")

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

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

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
a=list(map(int,input().split()))
D=a[0]
T=a[0]
S=a[0]

v=D/T
if s>=v:
  print("Yes")
else:
  print("No")

a=list(map(int,input().split()))
D=a[0]
T=a[1]
S=a[2]
 
v=D/T
if S>=v:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

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

Submission attempts (in order):
d,t,s = map(int,input().split())
if d <= t*s{
  print("Yes")
}
else{
  print("No")

}

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

Verdicts: Runtime Error

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

Submission attempts (in order):
n = int(input())
a_list = list(map(int, input().split()))
ama_a = sum(a_list)
ans = 0
mod = 10**9+7
for i in a_list:
  ans+=i**2
ans = ama_a**2-ans
ans *= (mod+1)/2
ans %= mod
print(int(ans))

              
    

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D = int(input())
T = int(input())
S = int(input())
if D/S - T >0:
    print('No')
else:
    print('Yes')

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

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
s = map(int, input().split())
d = s[0]
t = s[1]
s = s[2]
if d >= t * s:
  print("Yes")
else:
  print("No")

s = input().split()
d = int(s[0])
t = int(s[1])
s = int(s[2])
if d >= t * s:
  print("Yes")
else:
  print("No")

s = input().split()
d = int(s[0])
t = int(s[1])
s = int(s[2])
if d <= t * s:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Wrong Answer

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
mod = 10**9 + 7
ak = 0
ak_2 = 0

for i in range(N):
  ak += A[i]
  ak_2 += A[i] ** 2
s = int(((ak ** 2) - ak_2) // 2)
print(s % mod)

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

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

Verdicts: Runtime Error

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

Submission attempts (in order):
inputs = input().split()

meter = int(inputs[0])
limit_minutes = int(inputs[1])
speed = int(inputs[2])

if meter > limit_minutes * speed:
    print("no")
else:
    print("yes")

inputs = input().split()

meter = int(inputs[0])
limit_minutes = int(inputs[1])
speed = int(inputs[2])

if meter > limit_minutes * speed:
    print("No")
else:
    print("Yes")


Verdicts: Wrong Answer

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

Submission attempts (in order):
D, S, T = map( int, input().split() )

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

N = int( input())
A = list( map( int, input().split()))
 
mod = 10 ** 9 + 7
 
total = sum( A )
ret = 0
for a in A:
  ret = ( ret + ( total - a ) * a  ) 
print( ( ret // 2 ) % mod )

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

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

Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
d, s, t = [int(i) for i in input().split()]
if s * t >= d:
  	print("Yes")
else
	print("No")

d, s, t = [int(i) for i in input().split()]
if s * t >= d:
  	print("Yes")
else:
	print("No")


Verdicts: Runtime Error

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

Submission attempts (in order):
D, T, S = list(map(int,input().split()))

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

D, T, S = list(map(int,input().split()))
 
if D <= T * S:
   print('Yes')
else:
   print('No')

Verdicts: Wrong Answer

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

Submission attempts (in order):
D, T, S = map(int, input().split())
if (D/S) >= T:
  print("Yes")
else:
  print("No")

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
d, t, s = map(int, input().split())
if t <= d/float(s):
    print("Yes")
else:
    print("No")

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
d,t,s = map(int, input().split())
if s*t<=d:
    print("Yes")
else:
    print("No")

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

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

Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
d, t, s = map(int, input().split())
dist = 0
time = 0
while dist < d and time<=t:
    dist += s
    time += 1
if time > t:
    print("NO")
else:
    print("YES")

d, t, s = map(int, input().split())
count = 1
while s < d:
    s += s
    count += 1
print("YES") if (count <= t) else print("NO")

d, t, s = map(int, input().split())
count = 1
while s < d:
    s = 2 * s
    count += 1
print("YES") if(count<=t) else print("NO")

d, t, s = map(int, input().split())
count = 1
tmp = s
while s < d:
    s += tmp
    count += 1
print("YES") if (count <= t) else print("NO")

d, t, s = map(int, input().split())
dist = 0
time = 0
while dist < d and time<=t:
    dist += s
    time += 1
if time > t:
    print("No")
else:
    print("Yes")

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
a = int(input())
p = list(map(int,input().split()))
mod = 10**9 + 7

sum_list =[p[i]*p[t] for i in range(a) for t in range(a) if i<=t and not i ==t]
num = sum(sum_list)%mod
print(num)

a,b,c  = map(int,input().split())
if a <= b*c:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))

x = sum(A)
y = sum([A[i] ** 2 for i in range(N)])

print(((x ** 2 - y) // 2) % (10 ** 9 + 7))

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

if S * T <= D:
	print("YES")
else:
	print("NO")

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

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

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

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

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
D,T, S = map(int, input().split())
if T*S>=D:
  print('Yes')
 else:
  print('No')

a, b, c = map(int, input().split())
if a<=b*c:
    print('Yes')
else:
    print('No')
    

Verdicts: Runtime Error

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

Submission attempts (in order):
u=0
u=int(input())
A = list(map(int,input().split()))
n = len(A)
prr = 0
for i in range(n):
    for j in range(i + 1, n):
        prr = prr + A[i] * A[j]
print(prr)











d,t,s=list(map(int,input().split()))
if d//s<=t:
    print("Yes")
elif d=0 or t=0 or s=0:
    print("Yes")

    
else:
    print("No")



d,t,s=list(map(int,input().split()))
if d/s<=t:
    print("Yes")
elif d==0 or t==0 or s==0:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
d,t,s=input().split()
if(s>=(d/t)):
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

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

Submission attempts (in order):
N = int(input())
A = input().split()
B = [0]*N

for i in range(N):
  A[i] = int(A[i])
  B[i] = A[i]*A[i]

print( ( ( (sum(A)*sum(A)) - sum(B) ) // 2 ) % ( 10**9 + 7 ) // 2 )


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

Verdicts: Runtime Error

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

Submission attempts (in order):
input_data = input()
data = split(int(input_data))
d = data[0]
t = data[1]
s = data[2]
print("Yes") if d / s > t else print("No")

data = input("put:")
data = data.split()
print("Yes") if int(data[0]) / int(data[2]) <= int(data[1]) else print("No")

data = input()
data = data.split()
print("Yes") if int(data[0]) / int(data[2]) <= int(data[1]) else print("No")

Verdicts: Runtime Error

Wrong Answer

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

Submission attempts (in order):
D, T, S = map(int, input.split())
print("Yes" if (D / S) <= T else "No")

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

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


Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
a,b,c = map(int, input().split()) 
if a/c >= b:
  print("Yes")
else:
  print("No")

a,b,c = map(int, input().split()) 
if a/c <= b:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

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

Submission attempts (in order):
import math
import itertools
import functools

_ = input()
A = list(map(int, input().split()))

for a, b in itertools.combinations(A, 2):
    if math.gcd(a, b) != 1:
        if functools.reduce(math.gcd, A) == 1:
            print('setwise coprime')
        else:
            print('not coprime')
        break
else:
    print('pairwise coprime')


D, S, T = map(int, input().split())
print('Yes' if S * T >= D else 'No')


Verdicts: Runtime Error

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

Submission attempts (in order):
D = int(input())
T = int(input())
S = int(input())

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

D = int(input())
T = int(input())
S = int(input())

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

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

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
n, m = list(map(int, input().split()))
am = []
bm = []
for _ in range(m):
    a, b = list(map(int, input().split()))
    am.append(a)
    bm.append(b)

groups = []
for ai, bi in zip(am, bm):
    ag = None
    bg = None
    for g, group in enumerate(groups):
        if ai in group:
            ag = g
        if bi in group:
            bg = g
    if ag is None:
        if bg is None:
            groups.append([ai, bi])
        else:
            groups[bg].append(ai)
    else:
        if bg is None:
            groups[ag].append(bi)
        else:
            if ag != bg:
                groups[ag].extend(groups[bg])
                del groups[bg]


# for group in groups:


max_gr_len = max([len(group) for group in groups] + [1])

print(max_gr_len)


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


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


Verdicts: Runtime Error

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

Submission attempts (in order):
for i in range(len(S)-len(T)+1):
	sub_S = S[i:i+len(T)]
	cnt = 0
	for j in range(len(T)):
		if sub_S[j] != T[j]:
			cnt += 1
	cnt_list.append(cnt)
print(min(cnt_list))

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D,T,S= [int(x) for x in input("Enter values in the range of 1 and 10000: ").split()] 
if (D and T) and S <=10000 and D/S<=T:
    print("Yes")
else:
    print("No")

D=int(input("Enter a number in the range of 0 and 10000: "))
T=int(input("Enter a number in the range of 0 and 10000: "))
S=int(input("Enter a number in the range of 0 and 10000: "))
def DontBeLate(D,T,S):
    
    if (D and T) and S <=10000 and D/S==T:
        print("Yes")
    else:
        print("No")
(DontBeLate(D,T,S))


D=int(input("Enter a number in the range of 0 and 10000 10000: "))
T=int(input("Enter a number in the range of 0 and 10000: "))
S=int(input("Enter a number in the range of 0 and 10000: "))

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

D,T,S= [int(x) for x in input("Enter values in the range of 1 and 10000: ").split()] 
if (D and T) and S <=10000 and D/S==T:
    print("Yes")
else:
    print("No")

D,T,S= [int(x) for x in input("Enter values in the range of 1 and 10000: ").split(",")] 5
if (D and T) and S <=10000 and D/S==T:
    print("Yes")
else:
    print("No")

D,T,S= [int(x) for x in input("Enter values in the range of 1 and 10000: ").split(",")] 
if (D and T) and S <=10000 and D/S<=T:
    print("Yes")
else:
    print("No")

D,T,S= [int(x) for x in input().split()]
if 1<=(D and T)<=10000 and (1<=S<=10000 and D/S<=T):
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

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

Submission attempts (in order):
d,t,s = map(int,input())
if t*s <= d:
    print("Yes")
else:
    print("No")

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

Verdicts: Runtime Error

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

Submission attempts (in order):
D,T,S = map(int,input().split())
if D/S <=T :
 print("YES")
else  :                       
 print("NO")    

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


Verdicts: Wrong Answer

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

Submission attempts (in order):
D = input()
T = input()
S = input()

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

D = input()
T = input()
S = input()

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

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

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

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
import sys
import math
import itertools
import collections
from collections import deque
from collections import defaultdict

sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
MOD2 = 998244353
INF = float('inf')
input = lambda: sys.stdin.readline().strip()

NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()

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

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

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

        if x == y:
            return

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

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

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

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

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

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

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

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

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
    
def main():
    
    N, M = NMI()
    
    uf = UnionFind(N)
    
    for m in range(M):
        A,B = NMI()
        uf.union(A-1, B-1)

    ans = 0
    for n in range(N):
        ans = max(ans,uf.size(n))
    print(ans)



if __name__ == '__main__':
    main()

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

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

Verdicts: Runtime Error

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

Submission attempts (in order):
N = int(input())
A = list(map(int, input().split()))
result = 0
i = 0
for x in A[:N]:
  for y in A[i+1:]:
    result += x * y
  i += 1

print(result.__mod__(10**9 + 7))

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

Verdicts: Runtime Error

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

Submission attempts (in order):
d,t,s=map(int, input().split());print("YNeos"[t*s>=d::2])

d,t,s=map(int, input().split());print("YNeos"[t*s<d::2])

Verdicts: Wrong Answer

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

Submission attempts (in order):
d,t,s=map(int,input().split())
if d/s<t:
  print('yes')
else:
  print('no')

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
d,t,s = map(int,input().split())

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

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

Verdicts: Wrong Answer

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

Submission attempts (in order):
allsets = []
n,t = list(map(int,input().split()))
for _ in range(t):
    a,b = list(map(int,input().split()))
    if a < b and [a,b] not in allsets:
        allsets.append([a,b])
    elif b < a and [b,a] not in allsets:
        allsets.append([b,a])
# print(allsets)
hmap = {}
visitedNode = {}
for a,b in allsets:
    if a in visitedNode:
        if b not in hmap[visitedNode[a]]:
            hmap[visitedNode[a]].append(b)
        del visitedNode[a]
        continue
    if a in hmap:
        hmap[a].append(b)
        visitedNode[b] = a
    else:
        hmap[a] = [b]
        visitedNode[b] = a
# print(hmap)
res = 0
for k,v in hmap.items():
    res = max(res,len(v)+1)
print(res)


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

Verdicts: Runtime Error

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

Submission attempts (in order):
s = input()
t = input()
minCount = len(t)
i = 0
while i < len(s) and i + len(t) <= len(s):
    countSame = 0
    j = 0
    while j < len(t):
        if t[j] == s[i+j]:
            countSame += 1
        j += 2
        minCount = min(len(t) - countSame, minCount)
    i += 1
print(minCount)


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

Verdicts: Runtime Error

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

Submission attempts (in order):
D,T,S = map(int,input().split())
if D//S <= T :
    print("YES")
else :
    print("NO")

D,T,S = map(int,input().split())
if D*T <= S :
    print("YES")
else :
    print("NO")

d,t,s=map(int,input().split())
if d/s<=t:
    print("YES")
else:
    print("NO")

D,T,S = map(int,input().split())
if D//T <= S :
    print("YES")
else :
    print("NO")

D,T,N = map(int,input().split())
if D/T <= N :
    print("YES")
else :
    print("NO")

D,T,S = map(int,input().split())
if D/S <= T:
    print("YES")
else:
    print("NO")

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

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

Submission attempts (in order):
N=input()
A=map(int,input().split(' '))
summed=0
for i in range(0,N):
	for j in range(i+1,N):
		sumed+=A[i]*A[j]
MOD=10**9+7
print(sumed%MOD)


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


Verdicts: Runtime Error

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

Submission attempts (in order):
import numpy as np
n=int(input())
t=input().split(' ')
num=np.zeros(n)
for a in range(n):
  num[a]=int(t[a])
a=np.sum(num)**2
b=np.sum(num**2)
x=int((a-b)/2)
x=x%(10**9+7)-1
print(x)

import numpy as np
n=int(input())
t=np.array(input().split(' '))
num=np.zeros(n)
for a in range(n):
  num[a]=int(t[a])
a=np.sum(num)**2
b=np.sum(num**2)
x=int((a-b)/2)
x=(x-1)%(10**9+7)
print(x)

x=input().split(' ')
d=int(x[0])
s=int(x[1])
t=int(x[2])
if t<d/s:
  print('No')
else:
  print('Yes')

Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
# cording:utf-8


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


if (D / S) <= T:
    print("yes")
else:
    print("no")


# cording:utf-8


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


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


Verdicts: Wrong Answer

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

Submission attempts (in order):
type_in = input()
s = type_in.split(' ')
D = int(s[0])
T = int(s[1])
S = int(s[2])
print(s, T, S, T * S)
if (D <= T * S):
	print("Yes")
else:
	print("No")

s = input()
D = float(s[0])
T = float(s[1])
S = float(s[2])
if (D > T * S):
	print("No")
else:
	print("Yes")

type_in = input()
s = type_in.split(' ')
D = int(s[0])
T = int(s[1])
S = int(s[2])
if (D <= T * S):
	print("Yes")
else:
	print("No")

Verdicts: Wrong Answer

Runtime Error

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

Submission attempts (in order):
if D/S<=T:
  print("Yes")
else:
  print("No")

total_minute=D/S

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

info=input().split()

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

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

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

info=input().split()
 
D=int(info[0])
S=int(info[1])
T=int(info[2])
 
if D/S<=T:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

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

Submission attempts (in order):
D, S, T= map(int, input().split())

time = D/S

if time >= T:
    print("Yes")

else :
    print("No")



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

time = D/S

if time >= T:
    print("yes")

else :
    print("no")



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

time = D/S

if T >= time:
    print("Yes")

else :
    print("No")



Verdicts: Wrong Answer

Wrong Answer

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

Submission attempts (in order):
d,t,s　=　map(int,input.split())

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

##A - Don't be late
D,T,S = map(int,input().split())
if D / S <= T:
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

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

Submission attempts (in order):
D = int(input())
T = int(input())
S = int(input())

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


D = int(input())
T = int(input())
S = int(input())

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


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

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


Verdicts: Runtime Error

Runtime Error

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

Submission attempts (in order):
string_list = split(input())
D = int(string_list[0])
T = int(string_list[1])
S = int(string_list[2])
kyori = T * S
if D<=kyori:
  print('Yes')
else:
  print('No')

string_list = input().split(' ')
D = int(string_list[0])
T = int(string_list[1])
S = int(string_list[2])
kyori = T * S
if D<=kyori:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

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

Submission attempts (in order):
D,T,S = map(int,input().split)

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

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

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

Verdicts: Runtime Error

Accepted