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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s061707579 | p02570 | u379851743 | 1599068616 | Python | PyPy3 (7.3.0) | py | Runtime Error | 89 | 74740 | 81 | D, T, S = input().split()
sum = T * S
if D < sum
return "Yes"
else
return "No"
|
s509041161 | p02570 | u366558796 | 1599067859 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 74740 | 195 | from math import ceil
d, t, s = map(int, input().split())
u, l = ceil(d/t), d//t
if u == l:
if u <= s: print("Yes")
else: print("No")
else:
if d/t <= s: print("Yes")
else:print("No") |
s691808312 | p02570 | u379851743 | 1599067700 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 68700 | 5 | put D |
s759484950 | p02570 | u367107599 | 1599060317 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9164 | 99 | d = int(input())
t = int(input())
v = int(input())
if d/v > t:
print("No")
else:
print("Yes")
|
s604938402 | p02570 | u208633734 | 1599055125 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8880 | 74 | D,T,S = map(input().split())
if D/S>=T:
print("No")
else:
print("Yes") |
s679794167 | p02570 | u843764230 | 1599053081 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9092 | 101 | d,t,s = map(double, input().split())
time = d/s
if time > t:
print("Yes")
else:
print("No") |
s595588431 | p02570 | u498423166 | 1599046854 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9096 | 106 | D = int(input())
T = int(input())
S = int(input())
if D <= T * S:
print("Yes")
else:
print("NO")
|
s006132023 | p02570 | u509625752 | 1599039317 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8996 | 105 | D,T,S = map(int, input().split())
Time = int(D/S)
if Time =< T:
print("Yes")
else:
print("No")
|
s260841947 | p02570 | u509625752 | 1599039148 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8948 | 107 | D,T,S = map(int, input().split())
Time = float(D/S)
if Time =< T:
print("Yes")
else:
print("No")
|
s378895093 | p02570 | u509625752 | 1599038920 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9068 | 103 | D = int(input())
S = int(input())
T = int(input())
if D/S <= T:
return "Yes"
else:
return "No" |
s204812341 | p02570 | u509625752 | 1599038389 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8992 | 51 | if D/S <= T:
return "Yes"
else:
return "No" |
s241129892 | p02570 | u011348645 | 1599013892 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9032 | 106 | x, y,z = map(int, input().split())
test = x / z
if (test < y){
print('Yes')
}else{
print('No')
} |
s604602040 | p02570 | u461563687 | 1599012205 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8984 | 74 | d=input()
t=input()
s=input()
if d<=s*t:
print("Yes")
else print("No") |
s801391288 | p02570 | u854962015 | 1599000727 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9072 | 139 | N=int(input())
A=list(map(int,input().split()))
mod=10**9+7
S=0
M=0
for i in A:
S+=i
for i in A:
S-=i
M+=(S*i)%mod
print(M%mod) |
s270578394 | p02570 | u511975155 | 1599000078 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9052 | 172 | s = input()
t = input()
S,T = len(s),len(t)
ans = T
for i in range(S-T+1):
tmp = [c1!=c2 for c1,c2 in zip(s[i:i+T],t)].count(True)
ans = min(ans,tmp)
print(ans)
|
s363085280 | p02570 | u803865203 | 1598994420 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9480 | 802 | from collections import Counter
class UnionFind:
def __init__(self,num:int):
self.r = [-1 for i in range(num)]
def root(self,x:int):
if(self.r[x] < 0):
return x
self.r[x] = self.root(self.r[x])
return self.r[x]
def unite(self,x:int,y:int):
rx = self.root(... |
s206794372 | p02570 | u803865203 | 1598994392 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9484 | 817 | from collections import Counter
class UnionFind:
def __init__(self,num:int):
self.r = [-1 for i in range(num)]
def root(self,x:int):
if(self.r[x] < 0):
return x
self.r[x] = self.root(self.r[x])
return self.r[x]
def unite(self,x:int,y:int):
rx = self.root(... |
s105221903 | p02570 | u693592523 | 1598991394 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9044 | 106 | s = map(int, input().split())
d = s[0]
t = s[1]
s = s[2]
if d >= t * s:
print("Yes")
else:
print("No") |
s954953823 | p02570 | u175476241 | 1598987640 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8840 | 83 | D,T,S = map(int, input().split())
if (D/T > S):
print("No")
else:
print("Yes") |
s461296553 | p02570 | u175476241 | 1598987441 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9016 | 83 | D,T,S = map(int(), input().split())
if (D/T < S):
print("No")
else
print("Yes") |
s795509607 | p02570 | u175476241 | 1598986504 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9012 | 68 | x,y,z = input.split()
if (x/y >= z):
print("Yes")
elif
print("No") |
s197247678 | p02570 | u175476241 | 1598986400 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8816 | 67 | x,y,z = input.split()
if (x/y <= z)
print("Yes")
elif
print("No") |
s885162321 | p02570 | u175476241 | 1598986350 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9016 | 67 | x,y,z = input.split()
if (x/y >= z)
print("Yes")
elif
print("No") |
s694771375 | p02570 | u803578305 | 1598980273 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9064 | 90 | a, b, c = map(int, input().spulit())
if a <= b * c:
print("Yes")
else:
print("No") |
s077310437 | p02570 | u803578305 | 1598980167 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9068 | 88 | a, b, c = map(int, input().spulit())
if a <= b * c:
print("Yes")
else:
print("No") |
s862933289 | p02570 | u803578305 | 1598979863 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9012 | 85 | a, b, c = map(int, input().spulit())
if a <= b*c:
print("Yes")
else:
print("No") |
s215491720 | p02570 | u803578305 | 1598979697 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9088 | 87 | a, b, c = map(int, input().spulit())
if a <= b * c:
print("Yes")
else:
print("No") |
s310680684 | p02570 | u897187629 | 1598979654 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8960 | 174 | D = input() #distance
T = input() #time in minutes
S = input()#speed in metri al secondo
def res():
if D*S <= T:
print("Yes")
else:
print("No")
res() |
s795843181 | p02570 | u897187629 | 1598979592 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9092 | 143 | D = input() #distance
T = input() #time in minutes
S = input()#speed in metri al secondo
if D*S <= T:
print("Yes")
else:
print("No")
|
s462001703 | p02570 | u803578305 | 1598979508 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9076 | 87 | a, b, c = map(int, input().spulit())
if a <= b * c:
print("Yes")
else:
print("No") |
s658165035 | p02570 | u803578305 | 1598979321 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9024 | 86 | a, b, c = map(int, input().spulit())
if a / c <= b:
print('Yes')
else:
print('No') |
s680081037 | p02570 | u803578305 | 1598979189 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8972 | 88 | a, b, c = map(int, input().spulit())
if (a / c <= b):
print("Yes")
else:
print("No") |
s432785808 | p02570 | u803578305 | 1598978691 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8648 | 88 | a, b, c = map(int, input().spulit())
if (a / c) <= b:
print("Yes")
else:
print("No") |
s357278454 | p02570 | u803578305 | 1598978522 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9068 | 88 | a, b, c = map(int, input().spulit())
if (a / b) <= c:
print("Yes")
else:
print("No") |
s115961890 | p02570 | u803578305 | 1598977784 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9076 | 86 | a, b, c = map(int, input().spulit())
if a / b <= c:
print("Yes")
else:
print("No") |
s945836660 | p02570 | u803578305 | 1598977570 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9056 | 86 | a, b, c = map(int, input().spulit())
if a / c <= b:
print("Yes")
else:
print("No") |
s739583955 | p02570 | u803578305 | 1598977134 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8852 | 85 | a, b, c = map(int, input().spulit())
if a / c = b:
print("Yes")
else:
print("No") |
s143655394 | p02570 | u803578305 | 1598976896 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9160 | 94 | x = list(map(int, input().split()))
if x[0] / x[2] <= x[3]:
print("Yes")
else:
print("No") |
s058203898 | p02570 | u803578305 | 1598976854 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9024 | 84 | x = list(input().split())
if x[0] / x[2] <= x[3]:
print("Yes")
else:
print("No") |
s857497503 | p02570 | u803578305 | 1598976326 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9068 | 84 | x = list(input().split())
if x[0] / x[2] <= x[3]:
print("Yes")
else:
print("No") |
s554870823 | p02570 | u803578305 | 1598976267 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9076 | 94 | x = list(map(int, input().split()))
if x[0] / x[2] <= x[3]:
print("Yes")
else:
print("No") |
s855146518 | p02570 | u803578305 | 1598976098 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9076 | 76 | a, b, c = input().split()
if a / c <= b:
print("Yes")
else:
print("No")
|
s875758975 | p02570 | u803578305 | 1598975637 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9072 | 75 | a=input()
b=input()
c=input()
if a/c<b:
print("Yes")
else:
print("No") |
s612913235 | p02570 | u681735875 | 1598974655 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9144 | 107 | D, T, S = map(int, input().split())
time = float(D) / float(S)
if time <= T:
print(Yes)
else:
print(No) |
s055338971 | p02570 | u681735875 | 1598974025 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9052 | 94 | D, T, S = map(int, input().split())
time = D / S
if time <= T:
print(Yes)
else:
print(No) |
s600424033 | p02570 | u239368018 | 1598971815 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9140 | 60 | d, t, s = map(int,input())
print('Yes' if t*s >=d else 'No') |
s220072673 | p02570 | u694536861 | 1598968983 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9188 | 185 | 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) |
s399442503 | p02570 | u919332914 | 1598964675 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9080 | 124 | D = input("D")
T = input("T")
S = input("S")
def compare():
if D > T * S:
return "No"
else:
return "Yes"
|
s779073871 | p02570 | u331255836 | 1598962854 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8880 | 120 | num = list(map(int, input().split()))
time = num[0] / num[2]
if time <= num[1]:
print("Yes")
else:
print("No")
|
s730534098 | p02570 | u331255836 | 1598962173 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 121 | list = list(map(int, input().split()))
time = list[0] / list [2]
if time <= list[1]:
print("Yes")
else:
print("No) |
s588595470 | p02570 | u699636103 | 1598961329 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8936 | 92 | d, s, t = [int(i) for i in input().split()]
if s * t >= d:
print("Yes")
else
print("No") |
s571050962 | p02570 | u966322470 | 1598943590 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9092 | 71 | d,t,s=input().split()
if d/s<t :
print("Yes")
else:
print("No") |
s716232506 | p02570 | u750862908 | 1598939634 | Python | PyPy3 (7.3.0) | py | Runtime Error | 101 | 74612 | 114 | D,T,S = (int(x) for x in input().split())
disable = D - T*S
if disable>0:
print("No")
else
print("Yes") |
s267262902 | p02570 | u681735875 | 1598914450 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9080 | 73 | time = int(D) / int(S)
if time <= int(T):
print(Yes)
else:
print(No)
|
s002586215 | p02570 | u681735875 | 1598914279 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9108 | 57 | time = D / S
if time <= T:
print(Yes)
else:
print(No) |
s157795088 | p02570 | u359641414 | 1598908132 | Python | PyPy3 (7.3.0) | py | Runtime Error | 102 | 73980 | 292 | n = int(input())
a = list(map(int,input().split()))
max = (10 ** 9) + 7
#入力配列の総和
line = 0
for i in range (n):
line += a[i]
#a11, a22, ...対角線要素の総和
rem = 0
for i in range(n):
rem += a[i]*a[i]
sum = ((line*line) - rem) // 2
ans = sum % max
print(ans)
|
s732196237 | p02570 | u465423770 | 1598906495 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9008 | 152 | N = int(input())
A = list(map(int, input().split()))
mod = 1000000007
ans = 0
n = A[0]
for a in A[1:]:
ans += a * n
n += a
print(ans%mod)
|
s861312420 | p02570 | u829796346 | 1598904822 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9176 | 1495 | #!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)... |
s954192850 | p02570 | u887726241 | 1598892895 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9020 | 78 | d,t,s=list(map(int,input()))
if d <= (s*t):
print("YES")
elif:
print("NO") |
s334008283 | p02570 | u355213193 | 1598884077 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9108 | 191 | N=int(input())
A=list(map(int,input().split()))
import itertools
c = itertools.combinations(A, 2)
B=[]
a=0
for v in itertools.combinations(A, 2):
c=v[0]*v[1]
a=a+c
print(a%1000000007) |
s263610090 | p02570 | u450586332 | 1598879669 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8992 | 369 | #include <iostream>
using namespace std;
int main() {
//入力を受け取る
int D, T, S;
cin >> D >> T >> S;
//高橋君の移動時間を計算する
double time = (double)D / S;
//Tとtimeの大小関係に応じて出力をする
if (T >= time) {
cout << "Yes" << endl;
}
else {
cout << "No" << endl;
}
}
|
s800187834 | p02570 | u806976856 | 1598879641 | Python | PyPy3 (7.3.0) | py | Runtime Error | 88 | 74816 | 441 |
n,m=map(int,input().split())
root=[-1]*n
def r(x):
if root[x]<0:
return x
else:
root[x]=r(root[x])
return root[x]
def unite(x,y):
x=r(x)
y=r(y)
if x==y:
return
root[x]+=root[y]
root[y]=x
def size(x):
x=r(x)
return -root[x]
for i in range(m):
x,y=m... |
s712591113 | p02570 | u035453792 | 1598876124 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9092 | 88 | d,t.s = map(int,input().split())
a = d/s
if t>=a:
print("Yes")
else:
print("No") |
s928769813 | p02570 | u536642030 | 1598872509 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8812 | 111 | d, t, s = list(map(int, input().split()))
if d / t <= s:
print('Yes')
else:
print('No') |
s245229410 | p02570 | u536642030 | 1598872140 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8968 | 91 | d, t, s = list(map, int(input().split()))
if d / t <= s:
print('Yes')
else:
print('No') |
s960315457 | p02570 | u589432040 | 1598870628 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9116 | 83 | D, T, S = map(int. input().split())
if D/S <= T:
print("Yes")
else:
print("No") |
s321962050 | p02570 | u000138965 | 1598867436 | Python | PyPy3 (7.3.0) | py | Runtime Error | 93 | 74768 | 229 | import itertools
if __name__ == "__main__":
n = int(input())
li = list(map(int, input().split()))
array = list(itertools.combinations(li, 2))
sum = 0
for i in range(n):
sum += array[i][0] * array[i][1]
print(sum) |
s897833907 | p02570 | u720124072 | 1598864985 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9124 | 82 | d, t, s = map(int, input().split())
if d/s > t:
pirnt("No")
else:
print("Yes") |
s039758617 | p02570 | u588592871 | 1598863689 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9144 | 189 | n=int(input())
a=list(input().split(' '))
total=0
S_i=0
for i in range(n-1):
S_i+=int(a[n-1-i])
S_i=S_i%(7+10**9)
total+=S_i*int(a[n-2-i])
total=total%(7+10**9)
print(total) |
s081253298 | p02570 | u609922073 | 1598863497 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8960 | 81 | s = int(input().split())
if (s[0]/s[2])>s[1]:
print("No")
else:
print("Yes")
|
s281868987 | p02570 | u609922073 | 1598863411 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9036 | 79 | s = int(input().split())
if s[0]/s[2]>s[1]:
print("No")
else:
print("Yes")
|
s319140635 | p02570 | u609922073 | 1598863314 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9072 | 73 | s = input().split()
if s[0]/s[2]>s[1]:
print("No")
else:
print("Yes") |
s855489748 | p02570 | u097852911 | 1598835485 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9128 | 206 | s = input()
t = input()
m = len(s)
n = len(t)
did = m -n
li = []
for i in range(did+1):
su = 0
for j in range(n):
if t[j] ==s[i+j]:
su +=0
else:
su +=1
li.append(su)
print(min(li)) |
s686569615 | p02570 | u097852911 | 1598834641 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9016 | 76 | d ,t,s = map(int.input().split())
if d/s > t:
print(No)
else:
print(Yes) |
s891965540 | p02570 | u817693991 | 1598832288 | Python | Python (3.8.2) | py | Runtime Error | 113 | 27224 | 1255 | from math import gcd
import numpy as np
def setwise_coprime_check_fun(A_list, N):
gcd_all = A_list[0]
for i in range(N - 1):
gcd_all = gcd(gcd_all, A_list[i + 1])
if gcd_all == 1:
break
return gcd_all
def preprocess_fun(A_max):
p_flg = [True] * (A_max + 1)
D = [0] * (A_... |
s780796602 | p02570 | u437351386 | 1598825591 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9220 | 1040 | n=int(input())
a=list(map(int,input().split()))
import sys
import math
def setwise_coprime(a):
ans=a[0]
for i in range(1,n):
ans=math.gcd(ans,a[i])
return ans
#エラストテネスのふるい
def create_sieve(n):
sieve=[0]*(n+1)
for i in range(2,n+1):
if sieve[i]==0:
for j in range(i*i,n+1,i):
sieve[j]=i
... |
s683639760 | p02570 | u641446860 | 1598824143 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9164 | 80 | d,t,s=map(int, input().split())
if d/t <= s:
print("Yes")
else:
prinst("No") |
s863438523 | p02570 | u208309047 | 1598821909 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9060 | 486 | INF = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
S = [sum(A)]#A[0]~A[N-1]の総和を求める
ans = 0
for i in range(N):
key = S[-1]#Sの一番後ろの配列をとる(要素は一つしかない)
S.append(key - A[i])#総和からA[i]を引いてあげたものをS配列に加えてあげるS配列はみぎに行くにつれて値が小さくなる
#print(S)
ans += (A[i] * S[-1])#Ansは実際の総和計算に当たるもの
print(ans % INF) |
s913339939 | p02570 | u945065638 | 1598821857 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8816 | 300 | S =input()
T =input()
min_count = 10000
for i in range(len(S)-len(T)+1):
count = 0
for j in range(len(T)):
if T[i+j] != S[j]:
count += 1
min_count =min(count,min_count)
if min_count = 0:
print(min_count)
break
print(min_count) |
s925588275 | p02570 | u164471280 | 1598819831 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9200 | 1013 | # union-find
# https://note.nkmk.me/python-union-find/
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:
return self.find(self.parents[x])
... |
s426618730 | p02570 | u904331908 | 1598812067 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9176 | 218 | n = int(input())
list1 = list(map(int,input().split()))
mod = 10 ** 9 + 7
total = 0
y = sum(list1)
for i in range(0,n-1):
x = y- sum(list1[:i+1])
total += list1[i] * x % mod
total = total % mod
print(total)
|
s989444850 | p02570 | u625007758 | 1598806704 | Python | PyPy3 (7.3.0) | py | Runtime Error | 90 | 74060 | 138 | n = int(input())
a = [int(i) for i in input().split()]
s = sum(a)
ans = 0
for i in range(n-1):
s-=a[i]
ans+=s*a[i]
print(ans%(10**9+7)) |
s550958451 | p02570 | u864090097 | 1598806442 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9008 | 213 | N = int(input())
A = list(map(int ,input().split()))
MOD = 10**9+7
sum = 0
for i in range (N):
sum += A[i]
ans = 0
for i in range(N):
sum -= A[i]
ans += (A[i] * sum) % MOD
ans = ans % MOD
print(ans) |
s764399839 | p02570 | u457586786 | 1598805380 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9192 | 219 | N = int(input())
A = input().split(' ')
a = 0
sum = 0
for i in range(1, N):
sum += int(A[i])
for i in range(N):
a += int(A[i]) * sum
if i < N - 1:
sum -= int(A[i + 1])
print(int(a % (1e9 + 7))) |
s224285414 | p02570 | u373331656 | 1598805297 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9024 | 72 | D,T,S = input().split()
if S*T >= D:
print("Yes")
else:
print("No") |
s951889091 | p02570 | u760961723 | 1598803539 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9532 | 1783 | 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(... |
s809360772 | p02570 | u661040695 | 1598802159 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9032 | 99 | d, t, s = input().split()
int(d)
int(t)
int(s)
if(d/s <= t):
print('Yes')
else:
print('No') |
s022334758 | p02570 | u661040695 | 1598802084 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8996 | 83 | d, t, s = int(input().split())
if(d/s <= t):
print('Yes')
else:
print('No') |
s760958651 | p02570 | u661040695 | 1598801975 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9032 | 78 | d, t, s = input().split()
if(d/s <= t):
print('Yes')
else:
print('No') |
s659807943 | p02570 | u690576712 | 1598801868 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9036 | 212 | 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))
|
s715711923 | p02570 | u228288852 | 1598800157 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9000 | 84 | a=input().split()
if int(a[0])>int(a[1])*int(a[2]):
print("No")
else:
print("Yes") |
s301405053 | p02570 | u587429593 | 1598798665 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9060 | 99 | d = int(input())
t = int(input())
s = int(input())
if t*s >= d:
print('Yes')
else:
print('No') |
s757137928 | p02570 | u529168072 | 1598798470 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9060 | 197 | s=input()
a=len(s)
t=input()
b=len(t)
maxcnt=0
for i in range(a-b+1):
count=0
for j in range(b):
s1=s[i+j]
s2=t[j]
if(s1==s2):
count+=1
if(maxcnt<count):
maxcnt=count
print(b-maxcnt) |
s645337245 | p02570 | u587429593 | 1598798218 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9092 | 99 | d = int(input())
t = int(input())
s = int(input())
if d/s <= t:
print('Yes')
else:
print('No') |
s128338738 | p02570 | u850087201 | 1598793796 | Python | PyPy3 (7.3.0) | py | Runtime Error | 96 | 74892 | 1047 | import math
n = int(input())
a = [int(x) for x in input().split()]
l = [[] for i in range(n)]
def gcd(p,q):
while q != 0:
p = min(p%q,-(p%q)+q)
p,q = q,p
return p
g = a[0]
for i in range(1,n):
g = gcd(g,a[i])
if g != 1:
print("not coprime")
else:
def fur(x):
k = [1 for... |
s250739935 | p02570 | u987846648 | 1598791394 | Python | PyPy3 (7.3.0) | py | Runtime Error | 97 | 74752 | 434 | N = int(input()) #入力する整数
A = list(map(int,input().split())) #入力する数列A
SUMA = sum(A) #数列の和
MOD = 10**9 + 7 # mod
C = [0] * (N-1) #累積和数列
for i in range(N-1): #\sum_{j = i+1}^{N}を求めて数列に代入する
SUMA -= A[i]
C[i] = SUMA
ans = 0 #求める答え
for i in range(N-1):
ans += A[i]*C[i]
ans %= MOD #その都度modで割った余りにする
print(ans) #答えを出力する |
s917671352 | p02570 | u185851743 | 1598790349 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9060 | 235 | N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
sum = 0
for i in a_list:
sum += i
output_sum = 0
for idx, i in enumerate(a_list[:-1]):
sum -= a_list[idx]
output_sum += i*sum
print(output_sum%mod) |
s972195301 | p02570 | u185851743 | 1598790252 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8916 | 231 | N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
sum = 0
for i in a_list:
sum += i
output_sum=0
for idx, i in enumerate(a_list[:-1]):
sum -= a_list[idx]
output_sum += i*sum
print(output_sum%mod) |
s287683377 | p02570 | u185851743 | 1598790021 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9084 | 234 | N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
sum = 0
for i in a_list:
sum += i
output_sum = 0
for idx, i in enumerate(a_list[:-1]):
sum -= a_list[idx]
output_sum += i*sum
print(output_sum%mod) |
s868472692 | p02570 | u185851743 | 1598789961 | Python | Python (3.8.2) | py | Runtime Error | 34 | 9120 | 206 | N = input()
a_list = [int(i) for i in input().split(' ')]
mod = 1000000007
sum = 0
for i in a_list:
sum += i
for idx, i in enumerate(a_list[:-1]):
sum -= a_list[idx]
sum += i*sum
print(sum%mod) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.