s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s222239902 | p02570 | u282813849 | 1598731662 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9204 | 476 | def multmod(a,b,m):
ans = 0
a = a % m
while b:
if (b & 1): # odd
ans = (ans + a) % m
a = (2 * a) % m
b >>= 1 # b = b / 2
return ans
n = int(input())
S = [int(a) for a in input().split()]
divisor = 10**9 + 7
tot = 0
a,b = 0,0
arr_sum = sum(S) #% divisor
arr_ssq = arr_sum*arr_sum %... |
s517829189 | p02570 | u900776974 | 1598731658 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8868 | 102 | d,t,s=intput().split()
d=int(d)
t=int(t)
s=int(s)
d1=s*t
if d<=d1:
print("Yes")
else:
print("No")
|
s660543259 | p02570 | u482029770 | 1598731628 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9160 | 101 | D = int(input())
T = int(input())
S = int(input())
if(D/S<=T):
print('Yes')
else:
print('No') |
s411617042 | p02570 | u900776974 | 1598731595 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8848 | 101 | d,t,s=intput().split()
d=int(d)
t=int(t)
s=int(s)
d1=s*t
if d<=d1:
print("Yes")
else:
print("No)
|
s632134894 | p02570 | u252405453 | 1598731584 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9240 | 926 | def abc177d():
n, m = map(int, input().split())
check = [-1] * n
pair = []
group_no = 0
group = {}
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
if check[a] == check[b]:
if check[a] == -1:
group[group_no] = {a, b}
... |
s479064874 | p02570 | u944396627 | 1598731559 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9060 | 277 | def main():
N=input()
A=list(map(int, input().split()))
mod_value = 10**9 + 7
sum_ = 0
b_sum = 0
for i in range(len(A)-1):
b_sum = b_sum + A[len(A)-i-1]
sum_ = sum_ + (A[len(A)- i - 2]*b_sum) % mod_value
print(sum_%mod_value)
main() |
s347335100 | p02570 | u505493564 | 1598731526 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9244 | 858 | # union find, bfs
import sys
from collections import deque
si = sys.stdin.readline
def main():
[n, m] = [int(e) for e in si().split()]
if not m:
print(1)
return
visited = [False]*(n+1)
fm = [set() for _ in range(n+1)]
mx, comp = 0, 0
while m:
m -= 1
[a, b] = ... |
s806810000 | p02570 | u153047519 | 1598731523 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9084 | 181 | n = int(input())
a = list(map(int, input().split()))
result = 0
for i in range(n):
for j in range(i + 1, n):
result += a[i] * a[j]
result = result % (10**9 + 7)
print(result)
|
s715446631 | p02570 | u941047297 | 1598731511 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9352 | 834 | from collections import defaultdict
def generate_primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for ... |
s888343185 | p02570 | u900776974 | 1598731495 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8968 | 73 | d,t,s=intput().split()
d1=s*t
if d<=d1:
print("Yes")
else:
print("No) |
s839126615 | p02570 | u207767041 | 1598731449 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 68792 | 171 | n = int(input())
lst = list(map(int,input().split()))
val = 0
for i in range(len(lst)-1):
for j in range(i+1,len(lst)):
val += (lst[i]*lst[j])
print(val%((10**9)+7)) |
s921095919 | p02570 | u883866798 | 1598731400 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8808 | 97 | D,T,S = map(input().split())
result = D / S
if T <= result :
print('Yes')
else:
print('No') |
s166456179 | p02570 | u719044784 | 1598731396 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9080 | 174 | 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)
|
s687078394 | p02570 | u337396147 | 1598731368 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9160 | 279 | from itertools import combinations
def main():
N = int(input())
A = tuple(map(int, input().split()))
answer = solve(N, A)
print(answer)
def solve(N, A):
return sum(x * y for x, y in combinations(A, 2)) % (10**9 + 7)
if __name__ == "__main__":
main()
|
s296936130 | p02570 | u999503965 | 1598731313 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8988 | 266 | s=input()
t=input()
if len(s)==len(t):
num=0
for i,j in zip(s,t):
if i!=j:
num+=1
else:
for i in range(len(s)-len(t)+1):
a=s[i:len(t)+i]
num=0
for i,j in zip(t,a):
if i!=j:
num+=1
num=min(1000,num)
print(num)
|
s548100811 | p02570 | u644139801 | 1598731215 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9124 | 94 | d=int(input())
t=int(input())
s=int(input())
if t>=d/s:
print("YES")
else:
print("NO") |
s047749094 | p02570 | u680540873 | 1598731203 | Python | Python (3.8.2) | py | Runtime Error | 117 | 27148 | 176 | 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)) |
s769674849 | p02570 | u924915048 | 1598731189 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8888 | 104 | D, T, S =input().split(' ')
i = int(D/S)
if i > T:
answer = "No"
else:
answer = "Yes"
print answer
|
s316619093 | p02570 | u924915048 | 1598731133 | Python | Python (3.8.2) | py | Runtime Error | 32 | 8812 | 111 | D, T, S =map(int, input().split())
i = int(D/S)
if i > T:
answer = "No"
else:
answer = "Yes"
print answer
|
s259225285 | p02570 | u283937533 | 1598731097 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8992 | 80 | D, T, S = map(int, input().split())
if D/S <= T:
print(Yes)
else:
print(No)
|
s123940835 | p02570 | u924915048 | 1598731091 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8868 | 108 | D, T, S =map(input().split(''))
i = int(D/S)
if i > T:
answer = "No"
else:
answer = "Yes"
print answer
|
s701658849 | p02570 | u086138398 | 1598731054 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9188 | 601 | N,M = map(int,input().split())
edge = []
for i in range(M):
a,b = map(int,input().split())
add = []
for j in range(len(edge)):
if a in edge[j] or b in edge[j]:
edge[j].append(a)
edge[j].append(b)
add.append(j)
if len(add) == 0:
edge.append([a,b])
e... |
s016348698 | p02570 | u924915048 | 1598731009 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8848 | 103 | D, T, S =input().split('')
i = int(D/S)
if i > T:
answer = "No"
else:
answer = "Yes"
print answer
|
s133649055 | p02570 | u622293701 | 1598730993 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9004 | 24 | if(D<=S*T)
Yes
else
No |
s519616460 | p02570 | u935685410 | 1598730934 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9092 | 168 | N = int(input())
A = tuple(map(int,input().split()))
MOD = 10**9+7
count = 0
for i in range(N-1):
count += ((sum(A[0:i+1])%MOD)*(A[i+1]%MOD))%MOD
print(count%MOD)
|
s858895724 | p02570 | u764066313 | 1598730902 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9240 | 684 | 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... |
s981212256 | p02570 | u730747703 | 1598730850 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8988 | 85 | D, T, S = map(int, input.split())
if (D / S) <= T:
print("Yes")
else:
print("No") |
s978675873 | p02570 | u099006712 | 1598730780 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9152 | 211 | import itertools
n = int(input())
a = [int(x) for x in input().split()]
s = 0
for (i, j) in list(itertools.permutations(range(n), 2)):
if i >= j:
continue
s += a[i] * a[j]
print(s % 1000000007)
|
s375096240 | p02570 | u755524167 | 1598730768 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8964 | 167 | 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") |
s089820728 | p02570 | u732963817 | 1598730768 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9472 | 347 | 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:
... |
s610622119 | p02570 | u283937533 | 1598730763 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9148 | 80 | D, T, S = map(int, input().split())
if D /S <= T:
print(Yes)
else:
print(No) |
s716377304 | p02570 | u730747703 | 1598730737 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8920 | 72 | D, T, S = map(int, input.split())
print("Yes" if (D / S) <= T else "No") |
s956805952 | p02570 | u198336369 | 1598730718 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9088 | 249 | n = int(input())
a = list(map(int, input().split()))
sum = 0
b = [i % (10**9+7) for i in a if i % (10**9+7) != 0]
# print(b)
for j in range(0,len(b)-1):
for k in range(j+1,len(b)):
c = b[j]*b[k]
sum = sum + c
print(sum%(10**9+7)) |
s006162603 | p02570 | u727051308 | 1598730712 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9172 | 174 | 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 )
|
s835084986 | p02570 | u852790844 | 1598730655 | Python | Python (3.8.2) | py | Runtime Error | 121 | 27092 | 271 | import sys
import numpy as np
readline = sys.stdin.readline
read = sys.stdin.read
MOD = 10**9 + 7
n = int(input())
a = np.array(readline().split(), dtype=np.uint64)
r = np.cumsum(a[::-1])[::-1]
r &= MOD
x = a[:-1] * r[1:]
x %= MOD
ans = int(np.sum(x) % MOD)
print(ans)
|
s198678627 | p02570 | u893661063 | 1598730653 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9028 | 284 | S = str(input())
T = str(input())
ans = 10000
for i in range(len(S)-len(T)+1):
c = S[i:]
cnt = 0
for j in range(len(T)):
if str(T[j]) != str(c[j]):
cnt += 1
if cnt = 0:
ans = 0
elif ans > cnt and cnt >=1:
ans = cnt
print (ans) |
s626025085 | p02570 | u893661063 | 1598730617 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8964 | 282 | S = str(input())
T = str(input())
ans = 10000
for i in range(len(S)-len(T)+1):
c = S[i:]
cnt = 0
for j in range(len(T)):
if str(T[j]) != str(c[j]):
cnt += 1
if cnt = 0:
ans = 0
if ans > cnt and cnt >=1:
ans = cnt
print (ans) |
s017368979 | p02570 | u304602561 | 1598730597 | Python | PyPy3 (7.3.0) | py | Runtime Error | 936 | 79040 | 8966 | # ===============================================================================================
# importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
import sys
import os
from io import BytesIO, IOBase
from itertools import *
import bisect
from heapq import ... |
s954967873 | p02570 | u177388368 | 1598730592 | Python | PyPy3 (7.3.0) | py | Runtime Error | 106 | 68568 | 472 | n,m=list(map(int,input().split()))
par=[i for i in range(n)]
ro=dict(int)
for i in range(n):
ro[i]=1
def root(i):
if par[i]==i:
return i
else:
return root(par[i])
def unite(x,y):
rx=root(x)
ry=root(y)
if rx!=ry:
par[rx]=ry
ro[ry]+=ro[rx]
ro[rx]=0
for i i... |
s145360737 | p02570 | u213314609 | 1598730591 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8976 | 84 | D, T, S = map(int, input()).split()
if T*S <= D:
print('Yes')
else:
print('No') |
s914305017 | p02570 | u811535874 | 1598730578 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9196 | 232 | n = int(input())
a = list(map(int, input().split()))
total = 0
for i in range(n - 1):
temp = []
for j in range(i + 1, n):
temp.append((a[i]*a[j]) % (10**9 + 7))
total += sum(temp) % (10**9 + 7)
print(total % (10**9 + 7)) |
s246943994 | p02570 | u875584014 | 1598730576 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9176 | 163 | N=int(input())
lst=list(map(int,input().split()))
A=0
for i in range(N-1):
for j in range(i+1,N):
A+=(lst[i]%(10**9+7))*(lst[j]%(10**9+7))
print(A%(10**9+7)) |
s029100700 | p02570 | u899782392 | 1598730554 | Python | PyPy3 (7.3.0) | py | Runtime Error | 93 | 74800 | 761 | import math
N = int(input())
A = list(map(int, input().split()))
def calc_primes(n):
data = [i for i in range(2, n + 1)]
for d in data:
data = [x for x in data if (x == d or x % d != 0)]
return data
# primes = calc_primes(int(math.sqrt(10**6))) ... |
s590522224 | p02570 | u183432736 | 1598730546 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9068 | 361 | S = str(input())
T = str(input())
tempcount = 0
mincount = 0
if S in T:
print("0")
exit
for i in range(len(S) - len(T)+1):
for j in range(len(T)):
if S[i + j] != T[j]:
tempcount += 1
if i == 0:
mincount = tempcount
elif tempcount < mincount:
mincount = tempcount... |
s872388445 | p02570 | u919519672 | 1598730527 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9088 | 396 | def probB():
S = input()
T = input()
maxequal = 0
for i in range(len(S) - len(T)):
count = 0
for j in range(len(T)):
if S[i + j] == T[j]:
count += 1
if (count > maxequal):
maxequal = count
print(len(T) - maxequal if maxequal > ... |
s725139844 | p02570 | u777800738 | 1598730505 | Python | Python (3.8.2) | py | Runtime Error | 116 | 27152 | 194 | 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) |
s795763502 | p02570 | u511899838 | 1598730499 | Python | Python (3.8.2) | py | Runtime Error | 176 | 37400 | 464 | import numpy as np
from scipy.sparse.csgraph import connected_components
from scipy.sparse import csr_matrix
import collections
N, M = map(int, input().split())
edge = np.array([input().split() for _ in range(M)], dtype=np.int8).T
if M == 0:
print(1)
else:
tmp = np.ones(M, dtype=np.int8).T
graph = csr_ma... |
s290690463 | p02570 | u243733932 | 1598730488 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9080 | 317 | def main():
N = int(input())
As = list(map(int, input().split()))
sum_ = 0
for i in range(N - 1):
for j in range(i + 1, N):
sum_ += ((As[i] % (10 ** 9 + 7)) * (As[j] % (10 ** 9 + 7))) % (10 ** 9 + 7)
sum_ %= 10 ** 9 + 7
print(sum_)
if __name__ == '__main__':
main() |
s268585882 | p02570 | u283937533 | 1598730470 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9060 | 81 | D, T, S = map(int, input().split())
if D / S <= T:
print(Yes)
else:
print(No) |
s342382185 | p02570 | u875584014 | 1598730461 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9112 | 163 | N=int(input())
lst=list(map(int,input().split()))
A=0
for i in range(N-1):
for j in range(i+1,N):
A+=(lst[i]%(10**9+7))*(lst[j]%(10**9+7))
print(A%(10**9+7)) |
s384180195 | p02570 | u398721438 | 1598730439 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8996 | 339 | import java.util.*;
public class A
{
public static void main(String[] args)
{
Scanner sc = new Scanner(System.in);
int d = sc.nextInt();
int t = sc.nextInt();
int s = sc.nextInt();
float tdash = d/s;
if (tdash > (float)t)
System.out.println("No");
else
System.out.pri... |
s649768967 | p02570 | u777800738 | 1598730434 | Python | Python (3.8.2) | py | Runtime Error | 114 | 27136 | 182 | 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) |
s144344030 | p02570 | u158587446 | 1598730423 | Python | PyPy3 (7.3.0) | py | Runtime Error | 109 | 68508 | 130 | i = input().split()
d = i[0]
t = i[1]
s = i[2]
dt = i[0] / i[2]
lt = i[1]
if dt <= lt:
print('Yes')
else:
print('No') |
s457664478 | p02570 | u336979293 | 1598730390 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8992 | 92 |
d,t,s = map(int,input().split())
if (d − s*t <= 0):
print('Yes')
else :
print('No')
|
s783880942 | p02570 | u362576692 | 1598730319 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9160 | 110 | D = int(input())
T = int(input())
S = int(input())
res = D/S
if(res<=T):
print("Yes")
else:
print("No")
|
s418218459 | p02570 | u185851743 | 1598730288 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9080 | 46 | if S*T > D:
print('Yes')
else:
print('No') |
s599173431 | p02570 | u438720156 | 1598730274 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9016 | 71 | d,t,s=input().split()
x=d/s
if x<=t:
print("Yes")
else:
print("No)
|
s278577535 | p02570 | u755524167 | 1598730217 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9172 | 267 | 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") |
s624627707 | p02570 | u438720156 | 1598730154 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9052 | 79 | d,t,s=map(int,input().split())
x=d/s
if x<=t:
print("Yes")
else:
print("No) |
s122908031 | p02570 | u956910277 | 1598730116 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9092 | 91 | d,t,s = list( map( int , input().split() ))
if d <= t*s:
return "Yes"
else:
return "No" |
s753415897 | p02570 | u362576692 | 1598730094 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9132 | 117 | D = int(input())
T = int(input())
S = int(input())
res = float(D/S)
if(res<=T):
print("Yes")
else:
print("No")
|
s189196664 | p02570 | u644139801 | 1598730017 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8988 | 73 | d,t,s=map(int,input(.split())
if d/s<=t:
print("YES")
else:
print("NO") |
s478624530 | p02570 | u794406065 | 1598730010 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9008 | 98 | info=input().split()
D=info[0]
S=info[1]
T=info[2]
if D/S<=T:
print('Yes')
else:
print('No') |
s957157138 | p02570 | u944396627 | 1598729970 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9032 | 220 | def main():
N=input()
A=list(map(int, input().split()))
mod_value = 10**9 + 7
sum_ = 0
for i in range(len(A)-1):
sum_ = sum_ + A[i]*sum(A[i+1:]) % mod_value
print(sum_ % mod_value)
main() |
s498866059 | p02570 | u804613609 | 1598729962 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9096 | 114 | inp_ = input()
imp_list = imp_.spilt()
if inp_list[0] / inp_list[1] <= 80:
print("Yes")
else:
print("No") |
s172939453 | p02570 | u806988802 | 1598729954 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8968 | 210 | n = input()
a_list = input().split(" ")
b = [int(a) for a in a_list]
max = 10**9 + 7
sum = 0
for i in range(0, len(b)-1):
for j in range(i+1, len(b)):
sum += b[i] * b[j]
sum = sum % max
print(sum)
|
s058896473 | p02570 | u804613609 | 1598729918 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9020 | 102 | inp_list = input().spilt()
if inp_list[0] / inp_list[1] <= 80:
print("Yes")
else:
print("No") |
s223775810 | p02570 | u804613609 | 1598729812 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9084 | 104 | inp_list = input().spilt()
if (inp_list[0] / inp_list[1]) <= 80:
print("Yes")
else:
print("No") |
s279720989 | p02570 | u364091522 | 1598729778 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9016 | 59 | D = 3000
T = 5
S = 600
print("T * S = D" + str(T * S = D)) |
s372764635 | p02570 | u878739773 | 1598729758 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9156 | 135 | d=int(input())
t=int(input())
s=int(input())
if s!=0:
tm=d/s
else:
tm=t+1
if tm<=t:
print("Yes")
else:
print("No")
|
s394978957 | p02570 | u364091522 | 1598729734 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9092 | 60 | D = 3000
T = 5
S = 600
print("T * S = D" + str(T * S))
Yes |
s964534179 | p02570 | u364091522 | 1598729716 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9036 | 66 | D = 3000
T = 5
S = 600
print("T * S = D" + str(T * S = D))
"Yes" |
s883552980 | p02570 | u343545816 | 1598729701 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9092 | 85 | d,t,s = input().split()
time = d/s
if time <= t:
print("Yes")
else:
print("No") |
s875059630 | p02570 | u336979293 | 1598729644 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8852 | 104 | d = int(input())
t,s = map(int,input().split())
if d − s*t <= 0:
print('Yes')
else :
print('No')
|
s119150487 | p02570 | u755524167 | 1598729626 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9148 | 325 | 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... |
s240100367 | p02570 | u347502437 | 1598729589 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9180 | 218 | N = int(input())
A = list(input().split())
B = [int(a) for a in A]
x = 10**9+7
summation = 0
for i in range(N-1):
for j in range(i+1,N):
summation += (B[i] * B[j])
summation % x
print(summation % x) |
s285048519 | p02570 | u878739773 | 1598729583 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9164 | 135 | d=int(input())
t=int(input())
s=int(input())
if s!=0:
tm=d/s
else:
tm=t+1
if tm<=t:
print("Yes")
else:
print("No")
|
s770045272 | p02570 | u336979293 | 1598729581 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9036 | 100 | d = int(input())
t,s = map(int,input().split())
if d − s*t <= 0:
print('Yes')
else print('No')
|
s912014587 | p02570 | u101232733 | 1598729571 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9184 | 193 | n= int(input())
aas= list(map(int, input().split(' ')))
ans=0
for i in range(n-1):
for j in range(i+1, n):
ans+= aas[i]*aas[j]
if ans>(10**9+7):
ans= ans% (10**9+7)
print(ans) |
s068682707 | p02570 | u794406065 | 1598729511 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8996 | 45 | if D/S<=T:
print("Yes")
else:
print("No") |
s223276428 | p02570 | u430928274 | 1598729484 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8940 | 92 | d, t, s = map(int, input().split())
if d =< t * s :
print("Yes")
else :
print("No") |
s400169292 | p02570 | u336979293 | 1598729446 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9008 | 101 | d = input().split()
t,s = map(int,input().split())
if d − s*t < 0:
print('Yes')
else print('No') |
s573330347 | p02570 | u794406065 | 1598729438 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9024 | 73 | total_minute=D/S
if total_minute<=T:
print("Yes")
else:
print("No") |
s258929225 | p02570 | u878739773 | 1598729432 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9056 | 106 | d=int(input())
t=int(input())
s=int(input())
tm=d/s;
if tm<=t:
print("Yes")
else:
print("No")
|
s111575357 | p02570 | u911211665 | 1598729406 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9020 | 137 | li = input().split()
print(li)
d = int(li[0])
t = int(li[1])
s = int(li[2])
if(d/s >= t):
print("Yes")
if else(d/s < t):
print("No") |
s648750600 | p02570 | u683530136 | 1598729402 | Python | Python (3.8.2) | py | Runtime Error | 32 | 8880 | 302 | import math
# input d:距離（メートル） , t:待ち合わせまで何分 , s:速度（分速sメートル）
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)
|
s132357510 | p02570 | u235053098 | 1598729397 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9152 | 283 | import sys
input = sys.stdin.readline
num = int(input())
an = list(map(int, input().split()))
ans = 0
for i in range(len(an)):
for j in range(len(an)):
if i < j:
kake = an[i] * an[j]
kake %= ((10 ** 9) + 7)
ans += kake
ans %= ((10 ** 9) + 7)
print(ans) |
s419774595 | p02570 | u272975200 | 1598729383 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9060 | 85 | d=input
t=input
s=input
x=t*s
y=d-x
if y<=0:
print("yes")
else:
print("no")
|
s251699349 | p02570 | u794406065 | 1598729378 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8952 | 70 | total_minute=D/S
if total_minute<=T:
print("Yes")
else:
print("No |
s210622127 | p02570 | u643426419 | 1598729362 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9160 | 178 | # -*- 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)
|
s320199857 | p02570 | u665090185 | 1598729108 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9192 | 173 | D = int(input())
T = int(input())
S = int(input())
if D <= 10000 or T <= 10000 or S <= 10000:
A = D / S
if A <= T:
print("Yes")
else:
print("No") |
s562579270 | p02570 | u790970861 | 1598729091 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9104 | 108 | s = input()
D = float(s[0])
T = float(s[1])
S = float(s[2])
if (D > T * S):
print("No")
else:
print("Yes") |
s362962541 | p02570 | u536866787 | 1598729055 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9152 | 85 | d, t, s = list(map(int, input()))
if (s * t >= d):
print('Yes')
else:
print('No') |
s004366976 | p02570 | u293917550 | 1598729035 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9112 | 109 | d,t,s = list(map(int,input().split()))
times = distance/speed
if times<=t:
print("Yes")
else:
print("No") |
s323497547 | p02570 | u182106353 | 1598729002 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9144 | 132 | D=int(input())
T=int(input())
S=int(input())
actualTime = int(D/S)
if(actualTime<=T):
print ("Yes")
else:
print ("No")
|
s737679038 | p02570 | u284854859 | 1598728976 | Python | PyPy3 (7.3.0) | py | Runtime Error | 127 | 68624 | 970 | import sys
from math import gcd
input = sys.stdin.buffer.readline
n = int(input())
a = list(map(int,input().split()))
def primes(n):
ass = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
... |
s860022470 | p02570 | u364091522 | 1598728948 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9056 | 12 | 5000 1 1
No |
s965520226 | p02570 | u856398397 | 1598728931 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8852 | 199 | class Solution:
def solve(self, D, T, S):
time = D/S
if time <= T:
return True
else:
return False
A = Solution()
D,T,S = map(int, input().split())
print(A.solve(D,T,S)
|
s108585992 | p02570 | u183149151 | 1598728899 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9156 | 129 | i = list(map(int,input().split()))
i[0] = d
i[1] = t
i[2] = s
sum = d / s
if sum < t:
print("Yes")
else:
print("No")
|
s343380123 | p02570 | u349489051 | 1598728896 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9020 | 85 | d=int(input)
t=int(input)
s=int(input)
if d/s <=t:print("yes")
else:print("no")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.