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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s568298511 | p02570 | u536873421 | 1599673712 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9184 | 86 | d, t, s = map(int, input())
t_d = t * d
if td >= d:
print("yes")
else:
print("no") |
s140204289 | p02570 | u801274036 | 1599670287 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9076 | 162 | 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') |
s655653782 | p02570 | u136282556 | 1599667922 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9124 | 109 | D=int(input('D='))
T=int(input('T='))
S=int(input('S='))
if (D/S)<=T:
print('Yes')
else:
print('No') |
s069198223 | p02570 | u325864493 | 1599659254 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8956 | 104 | D = int(input())
T = int(input())
S = int(input())
if D / S <= T:
print("Yes")
else:
print("No") |
s587348211 | p02570 | u325864493 | 1599659215 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9088 | 100 | D = int(input())
T = int(input())
S = int(input())
if D / S <= T:
print(Yes)
else:
print(No) |
s173962357 | p02570 | u325864493 | 1599659136 | Python | PyPy3 (7.3.0) | py | Runtime Error | 90 | 74580 | 100 | D = int(input())
T = int(input())
S = int(input())
if D / S <= T:
print(Yes)
else:
print(No) |
s471092024 | p02570 | u248996551 | 1599658214 | Python | PyPy3 (7.3.0) | py | Runtime Error | 89 | 74800 | 792 | import sys
N=int(input())
A = list(map(int,input().split()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
if gcd_list(A) > 1:
print("not coprime")
sys.exit()
D = [i for i in range(max(A)+1)] #i... |
s764953248 | p02570 | u248996551 | 1599658034 | Python | PyPy3 (7.3.0) | py | Runtime Error | 91 | 74616 | 792 | import sys
N=int(input())
A = list(map(int,input().split()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
if gcd_list(A) > 1:
print("not coprime")
sys.exit()
D = [i for i in range(max(A)+1)] #i... |
s586312038 | p02570 | u658600714 | 1599648081 | Python | PyPy3 (7.3.0) | py | Runtime Error | 180 | 74816 | 171 | m = 10**9 + 7
n = input()
a = list(map(int,input().split()))
ans = 0
for i in range (len(a)):
for j in range (i+1,len(a)):
ans += a[i]*a[j]
ans = ans%m
print(ans) |
s066502873 | p02570 | u905029819 | 1599637186 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9076 | 95 | D,T,S = input(int()),input(int()), input(int())
if S*T >=D:
print('Yes')
else:
print('No') |
s244941350 | p02570 | u905029819 | 1599637017 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9028 | 92 | D=input(int())
T=input(int())
S=input(int())
if S*T >=D:
print('Yes')
else:
print('No') |
s105405133 | p02570 | u905029819 | 1599636991 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9084 | 98 | D=input(int())
T=input(int())
S=input(int())
if S*T >=D:
print('Yes')
else:
print('No') |
s588462302 | p02570 | u905029819 | 1599636916 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8924 | 97 | D=input(int())
T=input(int())
S=input(int())
if S*T >=D:
print('Yes)
else:
print('No') |
s144616949 | p02570 | u353919145 | 1599634892 | Python | PyPy3 (7.3.0) | py | Runtime Error | 108 | 74656 | 246 | d=int(input())
t=int(input())
s=int(input())
if d == 0:
print ('error')
elif t == 0:
print ('error')
elif s == 0:
print ('error')
else:
if (s*t) >= d :
print ('Yes')
else:
print ('No') |
s734913486 | p02570 | u816631826 | 1599634599 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8936 | 112 | d=input()
t=input()
s=input()
if (s*t >= d):
print ('Yes')
else:
print ('No') |
s923060660 | p02570 | u863370423 | 1599634542 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8832 | 110 | d=input()
t=input()
s=input()
if s*t >= d:
print ('Yes')
else:
print ('No') |
s525322274 | p02570 | u353919145 | 1599634396 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8992 | 125 | d=int(input())
t=int(input())
s=int(input())
if s*t >= d:
print ('Yes')
else:
print ('No') |
s346599339 | p02570 | u089230684 | 1599634319 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9068 | 243 | d=int(input())
t=int(input())
s=int(input())
if d == 0:
print ('error')
elif t == 0:
print ('error')
elif s == 0:
print ('error')
else:
if s*t >= d:
print ('Yes')
else:
print ('No') |
s242714534 | p02570 | u094386916 | 1599611801 | Python | PyPy3 (7.3.0) | py | Runtime Error | 100 | 74820 | 365 | import sys
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))#might need to remove the -1
def invr():
return(map(int,input().split()))... |
s037971150 | p02570 | u089230684 | 1599596590 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9140 | 248 | d=int(input())
t=int(input())
s=int(input())
if d == 0:
print ('error')
elif t == 0:
print ('error')
elif s == 0:
print ('error')
else:
if (s*t) >= d :
print ('Yes')
else:
print ('No')
|
s285411461 | p02570 | u816631826 | 1599596002 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9108 | 110 | d=int(input())
t=int(input())
s=int(input())
if (s*t) >= d :
print ('Yes')
else:
print ('No')
|
s983568272 | p02570 | u863370423 | 1599595228 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 123 | d=float(input())
t=float(input())
s=float(input())
if (int(d/t)) <= s:
print ('Yes')
else:
print ('No')
|
s752550297 | p02570 | u353919145 | 1599594012 | Python | PyPy3 (7.3.0) | py | Runtime Error | 90 | 74372 | 115 | d=float(input())
t=float(input())
s=float(input())
if (d/t) <= s:
print ('Yes')
else:
print ('No')
|
s799310648 | p02570 | u863370423 | 1599593904 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9028 | 115 | d=float(input())
t=float(input())
s=float(input())
if (d/t) <= s:
print ('Yes')
else:
print ('No')
|
s883864666 | p02570 | u246401133 | 1599580240 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9028 | 67 | x = int(input())
if x >= 30:
print("Yes")
else:
print("No") |
s445515598 | p02570 | u009584940 | 1599579831 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8980 | 101 | D=input()
T=input()
S=input()
y=int(T)*int(S)
if(int(D)<=int(y)):
print("yes")
else:
print("no") |
s770959881 | p02570 | u102960641 | 1599565676 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9064 | 235 | def compare(a,b):
res = 0
for x,y in zip(a,b):
if x == y:
res += 1
return res
s,t = map(int, input().split())
len_t = len(t)
ans = 0
for i in range(len(s)-len(t)+1):
ans = max(ans,compare(s[i:i+len_t],t))
print(ans)
|
s401371168 | p02570 | u483721532 | 1599557457 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8924 | 64 | D, T, S = map(input().split())
print('Yes' if D <T*S else 'No') |
s397266208 | p02570 | u449237691 | 1599512187 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9040 | 71 | D,T,S=map(int,input().split())
if T*S>D:
print(Yes)
else:
print(No) |
s436097609 | p02570 | u449237691 | 1599511812 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9160 | 71 | D,T,S=map(int,input().split())
if D<T*S:
print(Yes)
else:
print(No) |
s824984258 | p02570 | u449237691 | 1599511645 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8944 | 67 | D,T,S=map(int,input().split())
if D<S*T
print(Yes)
else
print(No) |
s797070510 | p02570 | u449237691 | 1599511295 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8904 | 67 | D,T,S map(int,input().split())
if D<S*T
print(Yes)
else
print(No) |
s444059451 | p02570 | u508960292 | 1599510396 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9120 | 287 | strS = input()
strT = input()
maxRange = 0
l = 0
while l <= (len(strS)-len(strT)):
m = 0
count = 0
while m < (len(strT)):
if strS[l+m] != strT[m]:
count += 1
m += 1
if maxRange > count:
maxRange = count
l += 1
print(maxRange)
|
s705384773 | p02570 | u508960292 | 1599509402 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9100 | 512 | strings = input().splitlines()
# 一致している数の最大値を取得する。
# そして、その一致している数と、Tの数を比較する。足りない文字数を補うと良い
strS = list(strings[0])
strT = list(strings[1])
maxRange = 0
l = 0
while l < (len(strS)-len(strT)):
m = 0
count = 0
while m < (len(strT)):
if strS[l+m] == strT[m]:
count += 1
m += 1
... |
s453421666 | p02570 | u250026974 | 1599504018 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8916 | 97 | D T S = map(int, input().split(" "))
A = S * T
if A >= D:
print("Yes")
else:
print("No") |
s753957443 | p02570 | u085970119 | 1599504010 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9092 | 172 | n = int(input()) # nは入力回数
num_list = [int(input()) for _ in range(n)]
a = num_list[0] / num_list[2]
if a <= num_list[1]:
print("Yes")
else :
print("No")
|
s415985223 | p02570 | u085970119 | 1599503891 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9188 | 191 | n = int(input()) # nは入力回数
num_list = [int(input()) for _ in range(n)]
arriving_tm = num_list[0] / num_list[2]
if arriving_tm <= num_list[1]:
print("Yes")
else :
print("No")
|
s572068810 | p02570 | u085970119 | 1599503845 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8836 | 502 | 待ち合わせ場所は高橋君の家から
D
メートル離れた地点であり、待ち合わせの時刻は
T
分後です。
高橋君は今から家を出発し、分速
S
メートルで待ち合わせ場所までまっすぐ移動します。
待ち合わせに間に合うでしょうか？
n = int(input()) # nは入力回数
num_list = [int(input()) for _ in range(n)]
arriving_tm = num_list[0] / num_list[2]
if arriving_tm <= num_list[1]:
print("Yes")
else :
print("No")
|
s340987878 | p02570 | u034786795 | 1599499211 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8900 | 97 | args = sys.argv
D = args[1]
T = args[2]
S = args[3]
if D/S < T
print("Yes")
else
print("No") |
s180392642 | p02570 | u092650292 | 1599481010 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9404 | 825 | import collections
n, m = map(int, input().split())
par = [i for i in range(0, n + 1)]
# print(par)
s = list()
"""
# union find(parには0も入れているので、par[1]=1になる)
def find(x):
if par[x] == x:
return x
else:
par[x] = find(par[x])
return par[x]
"""
def find(x):
while par[x] != x:
t... |
s415527466 | p02570 | u596797226 | 1599478710 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9056 | 76 | m, t, s = input().split()
if m // s <= t:
print('YES')
else:
print('No') |
s489621192 | p02570 | u340819006 | 1599464021 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9016 | 104 | d, t, s = map(int,input().split())
arrival = d/s
if arrival > t:
print('no')
else:
print('yes')
|
s677110459 | p02570 | u169042722 | 1599435697 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9080 | 69 | a,b,c=input().split()
if b*c>=a:
print ("Yes")
else:
print("No")
|
s117844139 | p02570 | u244434589 | 1599435592 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9060 | 198 | s=input()
t=input()
a = len(s)
b = len(t)
l = []
for i in range(a-b+1):
cnt = 0
c = s[i,i+t]
for x, y in zip(c, t):
if x != y:
cnt +=1
l.append(cnt)
print(min(l)) |
s094311568 | p02570 | u153427406 | 1599432734 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8932 | 100 | d,t,s=map(int,input().split())
actualTime=d/s
if actualTime=<t:
print('Yes')
else:
print('No') |
s487944010 | p02570 | u320763652 | 1599429948 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9072 | 98 | d,t,s == map(int, input().split())
tmp = d/s
if tmp <= t:
print("Yes")
else:
print("No") |
s361485324 | p02570 | u687044304 | 1599419141 | Python | PyPy3 (7.3.0) | py | Runtime Error | 95 | 68868 | 1281 | # -*- coding:utf-8 -*-
def prime_factor(n):
"""因数分解して因数のみを取得する"""
if n <= 1: return set()
ans = set()
i = 2
while i*i <= n:
while n%i == 0:
if not i in ans:
ans.add(i)
n //= i
i += 1
if n != 1:
ans.add(n)
return ans
def solv... |
s526591201 | p02570 | u658600714 | 1599411124 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9072 | 96 | d = int(input())
t = int(input())
s = int(input())
if s*t<d:
print('No')
else:
print('Yes') |
s758955655 | p02570 | u658600714 | 1599411059 | Python | PyPy3 (7.3.0) | py | Runtime Error | 86 | 74808 | 96 | d = int(input())
t = int(input())
s = int(input())
if s*t<d:
print('No')
else:
print('Yes') |
s822730167 | p02570 | u242192846 | 1599403287 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9020 | 92 | D, T, S = list(map(input().split()))
if D <= S * T:
print("Yes")
else:
print("No")
|
s099008142 | p02570 | u873190923 | 1599402471 | Python | PyPy3 (7.3.0) | py | Runtime Error | 301 | 80740 | 3027 | # input()
# int(input())
# map(int, input().split())
# list(map(int, input().split()))
# list(map(int, list(input()))) # スペースがない数字リストを読み込み
import math
import fractions
import sys
import bisect
import heapq # 優先度付きキュー(最小値取り出し)
import collections
from collections import Counter
from collections import deque
import pprin... |
s321254097 | p02570 | u174536291 | 1599401150 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9000 | 90 | d, t, s = map(int(input().split))
a = d / s
if a <= t:
print('Yes')
else:
print('No')
|
s871429984 | p02570 | u487965307 | 1599394813 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9144 | 115 | D= int(input('D='))
S= int(input('S='))
T= int(input('T='))
a=D/S
if(a<=T):
print('Yes')
else:
print('No') |
s556514255 | p02570 | u815043514 | 1599394771 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9124 | 234 | a=str(input())
b=str(input())
ans=[]
ans.append(len(b))
for i in range(len(a)-len(b)+1):
dif=0
k=a.find(b[i])
for j in range(len(b)):
if a[i+j]!=b[j]:
dif+=1
ans.append(dif)
print(min(ans)) |
s219165971 | p02570 | u150788544 | 1599393380 | Python | PyPy3 (7.3.0) | py | Runtime Error | 89 | 74836 | 532 | import math
n = int(input())
lst = list(map(int,input().split()))
l = lst[0]
g = lst[0]
pair_coprime = True
set_coprime = False
for i in range(1,n):
if set_coprime == False:
g = math.gcd(g,lst[i])
if g == 1:
set_coprime = True
if pair_coprime == True:
g_l = math.gcd(l,lst[i])
if g_l ==... |
s384892176 | p02570 | u204198275 | 1599391924 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9024 | 104 | nums=input().split()
t=int(nums[1])/int(nums[3])
if t<=int(nums[2]):
print("Yes")
else:
print("No")
|
s562905996 | p02570 | u204198275 | 1599391878 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9068 | 103 | nums=input().split()
t=int(nums[1])/int(nums[3])
if t<int(nums[2]):
print("Yes")
else:
print("No")
|
s278558019 | p02570 | u204198275 | 1599391792 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9076 | 102 | nums=input().split()
t=int(nums[1])/int(nums[2])
if t<int(nums[3]):
print("Yes")
else:
print("No") |
s314212647 | p02570 | u034128150 | 1599387096 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9084 | 105 | D, T, S = map(int, input().split())
if not __debug__:
print("Yes" if D < T * S else "No")
else:
1/0 |
s680491181 | p02570 | u034128150 | 1599386121 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8940 | 49 | import sys
assert sys.argv[1] == "ONLINE_JUDGE"
|
s077530169 | p02570 | u034128150 | 1599386028 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9004 | 30 | import sys
print(sys.argv[2]) |
s174126265 | p02570 | u034128150 | 1599386017 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8952 | 30 | import sys
print(sys.argv[3]) |
s542332530 | p02570 | u887670003 | 1599352435 | Python | PyPy3 (7.3.0) | py | Runtime Error | 89 | 74784 | 415 | #from sys import stdin
#input = stdin.readline
#inputRstrip = stdin.readline().rstrip
#x = input().rstrip()
#n = int(input())
#a,b,c = input().split()
#a,b,c = map(int, input().split())
ST = [input() for i in range(2)]
S = ST[0]
T = ST[1]
ans = len(T)
for i in range(len(S) - len(T) + 1):
count = len(T)
for j in ... |
s069833458 | p02570 | u714852797 | 1599351099 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9088 | 147 | 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)) |
s409061285 | p02570 | u887670003 | 1599349545 | Python | PyPy3 (7.3.0) | py | Runtime Error | 87 | 74720 | 232 |
from sys import stdin
input = stdin.readline().rstrip
#x = input().rstrip()
#n = int(input())
#a,b,c = input().split()
#a,b,c = map(int, input().split())
D,T,S = input().split()
if(T * S >= D):
print("Yes")
else:
print("No") |
s525361311 | p02570 | u367794409 | 1599340227 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9244 | 1434 | 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 ... |
s836743488 | p02570 | u367794409 | 1599340183 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9276 | 1419 | 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 = ... |
s634360447 | p02570 | u367794409 | 1599340154 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9324 | 1419 | 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 = ... |
s071725211 | p02570 | u367794409 | 1599340107 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9320 | 1419 | 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 = ... |
s158553881 | p02570 | u367794409 | 1599340025 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9220 | 1419 | 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 = ... |
s406506298 | p02570 | u176643848 | 1599335105 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9168 | 423 | print("前提条件を入力して下さい")
D = int(input("高橋くんの家から待ち合わせ場所までの距離D[m]を入力して下さい"))
T = int(input("待ち合わせの時刻までの時間[min]を入力した下さい"))
S = int(input("高橋くんの移動する速さ[m/min]を入力して下さい"))
# input_data = [D, T, S]
# print(input_data)
if (D / S <= T):
print("Yes")
else:
print("No") |
s431419861 | p02570 | u799978560 | 1599333175 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8880 | 83 | d,t,s = map(int,input.split())
if t <= d/s:
print("Yes")
else:
print("No") |
s675837822 | p02570 | u668552863 | 1599331992 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9048 | 209 | 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) |
s445464193 | p02570 | u689890477 | 1599331822 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8996 | 85 | d,t,s = map(int,input().split())
if d <= t*s{
print("Yes")
}
else{
print("No")
} |
s523847075 | p02570 | u668552863 | 1599331623 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9032 | 212 | 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)
|
s914723666 | p02570 | u336102890 | 1599331585 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9036 | 181 | n = int(input())
a = [int(s) for s in input().split()]
total=0
for i in range(n-1):
for j in range(n-i-1):
total=total+a[i]*a[i+j+1]%1000000007
print(total% 1000000007) |
s634048260 | p02570 | u075950453 | 1599331312 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8956 | 69 | d, t, s = input().split()
if t*s >= d:
print "Yes"
else:
print "No" |
s123527692 | p02570 | u075950453 | 1599331058 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9020 | 71 | d, t, s = input().split()
if t*s >= d:
return "Yes"
else:
return "No" |
s468938881 | p02570 | u668552863 | 1599330716 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8996 | 70 | D,T,S = input().split(' ')
if D/S>T:
print('No')
else
print('Yes') |
s136864641 | p02570 | u161322737 | 1599328048 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9172 | 252 | n = int(input())
a = list(map(int,input().split()))
sum = 0
ans = 0
# for i in range(n):
# a[i] = a[i] % (10**9 +7)
#
# s = 0
for i in range(n):
sum += a[i]
for i in range(n-1):
sum -= a[i]
ans += a[i] * sum
print(ans % (10**9 + 7))
|
s165237923 | p02570 | u302240043 | 1599311001 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9080 | 76 | x, y, z = int(input().split())
if y*z>=x:
print("Yes")
else:
print("No") |
s493036061 | p02570 | u569264010 | 1599309046 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9016 | 84 | D, T, S = map(int, input().split())
if D/T =< S:
print("Yes")
else:
print("No") |
s591330435 | p02570 | u728910348 | 1599308581 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9020 | 129 | 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") |
s098955969 | p02570 | u278475637 | 1599307380 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9140 | 101 | D = int(input())
T = int(input())
S = int(input())
if D > T*S:
print('No')
else:
print('Yes')
|
s769851828 | p02570 | u278475637 | 1599307127 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9076 | 54 | r = S * T
if r > D:
print('Yes')
else:
print('No') |
s349950344 | p02570 | u278475637 | 1599306765 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9008 | 76 | int main(D, T, S):
if D > T * S:
print('Yes')
else
print('No')
|
s412722490 | p02570 | u674239367 | 1599301597 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8800 | 82 | d,t,s = map(int, input().split())
if t <= d/s:
print('Yes')
else:
print('No') |
s899530672 | p02570 | u723425623 | 1599293173 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8980 | 74 | d,t,s=input().split()
if(s>=(d/t)):
print("Yes")
else:
print("No") |
s447741914 | p02570 | u235508145 | 1599290687 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9084 | 78 | D,T,S = map(int,input.split())
if D/S <= T:
print("Yes")
else:
print("No") |
s800651597 | p02570 | u235508145 | 1599290501 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8972 | 83 | D,T,S = map(int,input(),slpit())
if D/S <= T:
print("Yes")
else:
print("No")
|
s409900768 | p02570 | u235508145 | 1599290188 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8988 | 117 | D = input()
T = input()
S = input()
D = int(D)
T = int(T)
S = int(S)
if D/S <= T:
print(Yes)
else:
print(No)
|
s626874016 | p02570 | u188305619 | 1599258701 | Python | PyPy3 (7.3.0) | py | Runtime Error | 91 | 74840 | 726 | N, M = map(int,input().split())
pairs = []
for i in [0]*M:
inp = sorted(list(map(int,input().split())))
if inp not in pairs:
pairs.append(inp)
def solver(N,M,pairs):
group_list = []
max_len = 1
for i in pairs:
pair = sorted(i)
for j in range(len(group_list)):
if p... |
s481627826 | p02570 | u645937929 | 1599228451 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9108 | 115 | list1 = input().split(" ")
if int(list1[0]) <= int(list1[1]) * int(list[2]):
print("Yes")
else:
print("No") |
s135531538 | p02570 | u095704523 | 1599176614 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8960 | 106 | D = input('距離')
T = input('時間')
S = input('速度')
if D/S < T:
print('Yes')
else:
print('No') |
s679716329 | p02570 | u984149748 | 1599175397 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9160 | 89 | D,T,S=[int(input()) for i in range(3)]
if D/S<=T:
print('Yes')
else:
print('No')
|
s315476037 | p02570 | u343976048 | 1599151700 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9128 | 148 | # Dは距離 Tは制限時間 速度はS
D = int(input())
T = int(input())
S = int(input())
if D > T * S:
print("No")
else:
print("Yes") |
s092488807 | p02570 | u489893223 | 1599144899 | Python | Python (3.8.2) | py | Runtime Error | 31 | 8764 | 90 | a = input()
if int(a[0]) <= int(a[1]) * int(a[2]) :
print("Yes")
else:
print("No") |
s618607685 | p02570 | u489893223 | 1599144623 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8660 | 96 | a = input()
b = [int(i) for i in a]
if b[0] <= b[1] * b[2] :
print("Yes")
else:
print("No") |
s319999313 | p02570 | u972809050 | 1599129218 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9148 | 134 | D,T,S=int(input())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
if (D/S)>T:
print("He will be late")
else:
print("Yes") |
s407695718 | p02570 | u187516587 | 1599078845 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9096 | 80 | D,T,S=map(int,input().spltit())
if D>T*S:
print("No")
else:
print("Yes") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.