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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s236699205 | p02258 | u894381890 | 1442206486 | Python | Python | py | Runtime Error | 0 | 0 | 263 | import sys
x = []
max = -10**9
for line in sys.stdin.readlines()
x.append(line.strip())
length = int(x[0])
x.remove(x[0])
for i in range(0, length):
for j in range(i + 1, length):
sa = int(x[j]) - int(x[i])
if max < sa:
max = sa
print max |
s447844701 | p02258 | u386372280 | 1442207007 | Python | Python | py | Runtime Error | 0 | 0 | 262 | import sys
lines = sys.stdin.readlines()
n = lines[0]
lst = lines[1:]
i = 0
for ri in lst:
if i is 0:
maxpro = lst[1] - lst[0]
for rj in lst[i+1:]:
sub = rj - ri
if maxpro < sub:
maxpro = sub
i += 1
print maxpro |
s591591033 | p02258 | u197445199 | 1442207010 | Python | Python | py | Runtime Error | 0 | 0 | 263 | import sys
my_list = []
max_list = []
len_line = int(sys.stdin.readline().strip())
for item in sys.stdin.readlines()[:-1]:
my_list.append(int(item.strip()))
for i in range(1, len_line):
max_list.append(my_list[i] - min(my_list[:i]))
print max(max_list) |
s668813270 | p02258 | u197445199 | 1442207246 | Python | Python | py | Runtime Error | 0 | 0 | 258 | import sys
my_list = []
max_list = []
len_line = int(sys.stdin.readline().strip())
for item in sys.stdin.read()[:-1]:
my_list.append(int(item.strip()))
for i in range(1, len_line):
max_list.append(my_list[i] - min(my_list[:i]))
print max(max_list) |
s199167246 | p02258 | u632424921 | 1442207586 | Python | Python | py | Runtime Error | 0 | 0 | 263 | num = raw_input()
num_list = []
for i in range(int(num)):
a = raw_input()
num_list.append(int(a))
minv = num_list[0]
for i in range(1, len(num_list)):
maxv = max(maxv, num_list[i] - minv)
minv = min(minv, num_list[i])
print maxv |
s388735668 | p02258 | u894381890 | 1442207738 | Python | Python | py | Runtime Error | 0 | 0 | 225 | import sys
x = []
for line in sys.stdin.readlines():
x.append(line.strip())
max = -(10**9)
min = x[1]
for i in range(2, x[0]):
sa = x[i] - min
if max < sa:
max = sa
if min > x[i]:
min = x[i]
print max |
s036786754 | p02258 | u894381890 | 1442208001 | Python | Python | py | Runtime Error | 0 | 0 | 252 | import sys
x = []
for line in sys.stdin.readlines():
x.append(line.strip())
max = -(10**9)
min = int(x[1])
for i in range(2, int(x[0]+1)):
sa = int(x[i]) - min
if max < sa:
max = sa
if min > int(x[i]):
min = int(x[i])
print max |
s135355881 | p02258 | u197445199 | 1442208348 | Python | Python | py | Runtime Error | 0 | 0 | 280 | num = raw_input()
for i in range(int(num)):
a = raw_input()
num_list.append(int(a))
min_ans = num_list[0]
max_ans = float("-inf")
for item in num_list[1:]:
if i - min_ans > max_ans:
max_ans = i - min_ans
if i < min_ans:
min_ans = i
print max_ans |
s332820620 | p02258 | u253463900 | 1442209952 | Python | Python3 | py | Runtime Error | 20 | 7804 | 461 | n = int(input())
num = n - 1
price = []
date = 0
max_pro = -999999999
while(n>0):
x = int(input())
dataset = [date,x]
price.append(dataset)
n -= 1
date += 1
price.sort(key=lambda price: price[1])
for i in range(0,num):
j = num
while(j > i):
if(price[i][0]<price[j][0]):
pro = price[j][1] - price[i][1]
break
j -= 1
if (max_pro < pro):
max_pro = pro
print ("{0}".format(max_pro)) |
s170695077 | p02258 | u313994256 | 1442212123 | Python | Python | py | Runtime Error | 0 | 0 | 373 | import sys
lines = sys.stdin.readlines()
n = lines[0]
lst = map(lambda x:int(x), lines[1:])
c = 0
while True:
if len(lst) ==0:
break
i = lst.index(max(lst))
sub_lst = lst[:i]
if len(sub_lst) ==0 and c == 0:
pass
elif len(sub_lst) -pre
else:
maxpro = max(lst) - min(sub_lst)
pre = lst[i]
lst = lst[i1:]
c+= 1
print maxpro |
s076674770 | p02258 | u313994256 | 1442212263 | Python | Python | py | Runtime Error | 0 | 0 | 373 | import sys
lines = sys.stdin.readlines()
n = lines[0]
lst = map(lambda x:int(x), lines[1:])
c = 0
while True:
if len(lst) ==0:
break
i = lst.index(max(lst))
sub_lst = lst[:i]
if len(sub_lst) ==0 and c == 0:
pass
elif len(sub_lst) -pre
else:
maxpro = max(lst) - min(sub_lst)
pre = lst[i]
lst = lst[i1:]
c+= 1
print maxpro |
s543625136 | p02258 | u313994256 | 1442212523 | Python | Python | py | Runtime Error | 0 | 0 | 374 | import sys
lines = sys.stdin.readlines()
n = lines[0]
lst = map(lambda x:int(x), lines[1:])
c = 0
while True:
if len(lst) ==0:
break
i = lst.index(max(lst))
sub_lst = lst[:i]
if len(sub_lst) ==0 and c == 0:
pass
elif len(sub_lst) -pre:
else:
maxpro = max(lst) - min(sub_lst)
pre = lst[i]
lst = lst[i1:]
c+= 1
print maxpro |
s536473979 | p02258 | u938745275 | 1447318520 | Python | Python | py | Runtime Error | 10 | 6236 | 289 | n = int(raw_input())
num_list = [int(raw_input()) for i in xrange(n)]
#print num_list
ans = 1 - pow(10, 9)
chk = num_list[0]
for i in range(1, n):
if num_list[i] >= chk:
continue
max_num = max(num_list[i+1:])
tmp = max_num - num_list[i]
if tmp > ans:
ans = tmp
print ans |
s783241453 | p02258 | u963402991 | 1447737266 | Python | Python3 | py | Runtime Error | 0 | 0 | 162 | N = int(input())
R = [int(input()) for i in range(N)]
maxv = R[1] - R[0]
minv = R[0]
for i in n:
maxv = max(maxv,i-minv)
minv = min(minv,i)
print (maxv) |
s084937921 | p02258 | u966364923 | 1450161178 | Python | Python3 | py | Runtime Error | 20 | 7760 | 327 | N = int(input())
A = [int(input()) for i in range(N)]
max_v = A[1] - A[0]
l = 0
r = 1
while r + 1 < N:
if A[l] > A[r]:
l = r
elif A[r] > A[r + 1]:
max_v = max(max_v, A[r] - A[l])
if A[l] > A[r + 1]:
l = r + 1
r = l
r += 1
max_v = max(max_v, A[r] - A[l])
print(max_v) |
s679109368 | p02258 | u639594975 | 1451718864 | Python | Python | py | Runtime Error | 0 | 0 | 57 | N = raw_input()
while line = sys.stdin.readlines():
|
s507958960 | p02258 | u639594975 | 1451719005 | Python | Python | py | Runtime Error | 0 | 0 | 52 | N = raw_input()
while line = sys.stdin.readlines(): |
s857499936 | p02258 | u970436839 | 1452047771 | Python | Python | py | Runtime Error | 0 | 0 | 159 | n = input()
for i in range(n):
R[i] = input()
max = 0
for i in range(n):
for j in range(i):
d = R[i] - R[j]
if max < d:
max = d
print max |
s569067348 | p02258 | u069446126 | 1452048938 | Python | Python | py | Runtime Error | 0 | 0 | 138 | n = raw_input()
max = 0
min = 0
for x in range(n):
x = raw_input()
if x > max:
max = x
if x < min:
min = x
print max-min
|
s495622222 | p02258 | u078762447 | 1452049311 | Python | Python | py | Runtime Error | 0 | 0 | 159 | n = raw_input()
x = 0
y = 0
a = raw_input()
for 1 in n-1:
c = raw_imput()
if a < c:
a = c
else:
y = a - c
if y > x:
x = y
print x |
s097123948 | p02258 | u970436839 | 1452049365 | Python | Python | py | Runtime Error | 0 | 0 | 125 | n = input()
maxi = 0
mini = 0
for i in range(n):
tmp = input n
maxi = max(maxi, tmp)
mini = min(mini, tmp)
print maxi |
s698709279 | p02258 | u069446126 | 1452074485 | Python | Python | py | Runtime Error | 0 | 0 | 557 | word = raw_input()
for i in range(len(word)):
if word[i] == '\n':
n = word[:i - 1]
word = word[i:]
break
n = int(n)
max = 0
min = 0
num = range(n)
for i in range(n):
for j in range(7):
if word[j] == '\n':
num[i] = word[:j - 1]
num[i] = int(num[i])
word = word[j:]
break
dif = range(n - 1)
min = 0
for i in range(n):
for j in range(i):
if num[j] < min:
min = num[j]
dif[i] = num[i] - min
if dif[i] > max:
max = dif[i]
print max |
s592141315 | p02258 | u069446126 | 1452075900 | Python | Python | py | Runtime Error | 0 | 0 | 281 | n = input()
list = []
for i in range(n):
list.append(input())
min = list[0]
max = list[0]
dif = []
for i in range(n):
for j in range(i - 1):
if list[j] < min:
min = list[j]
dif[i] = list[i] - min
if dif[i] > max:
max = dif[i]
print max |
s834494220 | p02258 | u069446126 | 1452076003 | Python | Python3 | py | Runtime Error | 0 | 0 | 281 | n = input()
list = []
for i in range(n):
list.append(input())
min = list[0]
max = list[0]
dif = []
for i in range(n):
for j in range(i - 1):
if list[j] < min:
min = list[j]
dif[i] = list[i] - min
if dif[i] > max:
max = dif[i]
print max |
s837479026 | p02258 | u069446126 | 1452076318 | Python | Python3 | py | Runtime Error | 0 | 0 | 292 | n = input()
list = []
for i in range(n):
list.append(input())
min = list[0]
max = list[0]
dif = []
for i in range(n):
for j in range(i - 1):
if list[j] < min:
min = list[j]
dif.append(list[i] - min)
if dif[i] > max:
max = dif[i]
print max |
s881481946 | p02258 | u069446126 | 1452076419 | Python | Python | py | Runtime Error | 0 | 0 | 281 | n = input()
list = []
for i in range(n):
list.append(input())
min = list[0]
max = list[0]
dif = []
for i in range(n):
for j in range(i - 1):
if list[j] < min:
min = list[j]
dif[i] = list[i] - min
if dif[i] > max:
max = dif[i]
print max |
s749031180 | p02258 | u613805578 | 1452078807 | Python | Python | py | Runtime Error | 0 | 0 | 182 | n = input()
for i in range(0, n-1)
R[i] = input()
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1)
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s253933275 | p02258 | u613805578 | 1452078878 | Python | Python | py | Runtime Error | 0 | 0 | 186 | n = input()
for i in range(0, n-1):
R[i] = input()
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s836777458 | p02258 | u613805578 | 1452078903 | Python | Python | py | Runtime Error | 0 | 0 | 186 | n = input()
for i in range(0, n-1):
R[i] = input()
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s979861445 | p02258 | u613805578 | 1452079072 | Python | Python | py | Runtime Error | 0 | 0 | 195 | n = input()
for i in range(0, n-1):
R = raw_input().split()
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s489682769 | p02258 | u613805578 | 1452079092 | Python | Python | py | Runtime Error | 0 | 0 | 198 | n = input()
for i in range(0, n-1):
R[i] = raw_input().split()
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s897516555 | p02258 | u613805578 | 1452079131 | Python | Python | py | Runtime Error | 0 | 0 | 205 | n = input()
for i in range(0, n-1):
R = map(int, raw_input().split())
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s251573777 | p02258 | u613805578 | 1452079181 | Python | Python | py | Runtime Error | 0 | 0 | 251 | n = input()
if n>= 2 and n <= 200000
for i in range(0, n-1):
R = map(int, raw_input().split())
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s830585870 | p02258 | u613805578 | 1452079260 | Python | Python | py | Runtime Error | 0 | 0 | 254 | n = input()
if n>= 2 and n <= 200000
for i in range(0, n-1):
R[i] = map(int, raw_input().split())
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s795579357 | p02258 | u613805578 | 1452079282 | Python | Python | py | Runtime Error | 0 | 0 | 221 | n = input()
if n>= 2 and n <= 200000
R = map(int, raw_input().split())
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s339988239 | p02258 | u613805578 | 1452079293 | Python | Python | py | Runtime Error | 0 | 0 | 222 | n = input()
if n >= 2 and n <= 200000
R = map(int, raw_input().split())
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s877498769 | p02258 | u613805578 | 1452079328 | Python | Python | py | Runtime Error | 0 | 0 | 252 | n = input()
if n >= 2 and n <= 200000
for i in range(0, n-1):
R = map(int, raw_input().split())
minv = R[0]
maxv = R[1] - R[0]
for j in range(1, n-1):
maxv = max(maxv, R[j] - minv)
minv = min(minv, R[j])
print maxv - minv |
s185940213 | p02258 | u613805578 | 1452079946 | Python | Python | py | Runtime Error | 0 | 0 | 218 | n = input()
R = []
for i in range(n):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n-1)
if minv > R[v]:
minv = R[v]
if maxv < R[v]:
maxv = R[v] - minv
print maxv |
s416312715 | p02258 | u613805578 | 1452079989 | Python | Python | py | Runtime Error | 0 | 0 | 219 | n = input()
R = []
for i in range(n):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n-1)
if minv > R[v]:
minv = R[v]
if maxv < R[v] - minv:
maxv = R[v]
print maxv |
s264246700 | p02258 | u613805578 | 1452080006 | Python | Python | py | Runtime Error | 0 | 0 | 220 | n = input()
R = []
for i in xrange(n):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n-1)
if minv > R[v]:
minv = R[v]
if maxv < R[v] - minv:
maxv = R[v]
print maxv |
s014241361 | p02258 | u613805578 | 1452080157 | Python | Python | py | Runtime Error | 0 | 0 | 227 | n = input()
R = []
for i in irange(n):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n-1):
if minv > R[v]:
minv = R[v]
if maxv < R[v] - minv:
maxv = R[v] - minv
print maxv |
s544009383 | p02258 | u613805578 | 1452080224 | Python | Python | py | Runtime Error | 0 | 0 | 229 | n = input()
R = []
for i in range(0, n-1):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n):
if minv > R[v]:
minv = R[v]
if maxv < R[v] - minv:
maxv = R[v] - minv
print maxv |
s255359569 | p02258 | u613805578 | 1452080257 | Python | Python | py | Runtime Error | 0 | 0 | 231 | n = input()
R = []
for i in range(0, n-1):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n):
if minv > R[v]:
minv = R[v]
elif maxv < R[v] - minv:
maxv = R[v] - minv
print maxv |
s308671255 | p02258 | u613805578 | 1452080332 | Python | Python | py | Runtime Error | 0 | 0 | 229 | n = input()
R = []
for i in range(1, n):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n):
if minv > R[v]:
minv = R[v]
elif maxv < R[v] - minv:
maxv = R[v] - minv
print maxv |
s747014561 | p02258 | u613805578 | 1452080339 | Python | Python | py | Runtime Error | 0 | 0 | 231 | n = input()
R = []
for i in range(1, n-1):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n):
if minv > R[v]:
minv = R[v]
elif maxv < R[v] - minv:
maxv = R[v] - minv
print maxv |
s423637281 | p02258 | u613805578 | 1452080346 | Python | Python | py | Runtime Error | 0 | 0 | 231 | n = input()
R = []
for i in range(0, n-1):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n):
if minv > R[v]:
minv = R[v]
elif maxv < R[v] - minv:
maxv = R[v] - minv
print maxv |
s208416695 | p02258 | u119456964 | 1452145923 | Python | Python | py | Runtime Error | 0 | 0 | 224 | max = 0
n_max = 19999
price = [0]*n_max
for i in range(n_max):
price[i] = int(raw_input())
for i in range(n_max):
for j in range(j, n_max+1):
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s219562549 | p02258 | u119456964 | 1452146835 | Python | Python | py | Runtime Error | 0 | 0 | 253 | max = 0
i = 0
j = 0
k = 0
n_max = 19999
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max):
for j in range(k, n_max):
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s163923714 | p02258 | u119456964 | 1452147504 | Python | Python | py | Runtime Error | 0 | 0 | 253 | max = 0
i = 0
j = 0
k = 0
n_max = 19999
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max):
for j in range(k, n_max):
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s184562523 | p02258 | u119456964 | 1452147641 | Python | Python | py | Runtime Error | 0 | 0 | 250 | max = 0
i = 0
j = 0
k = 0
n_max = 19
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max):
for j in range(k, n_max):
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s051713628 | p02258 | u119456964 | 1452147849 | Python | Python | py | Runtime Error | 0 | 0 | 248 | max = 0
i = 0
j = 0
k = 0
n_max = 10
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max)
for j in range(k, n_max)
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s391694357 | p02258 | u119456964 | 1452147865 | Python | Python | py | Runtime Error | 0 | 0 | 247 | max = 0
i = 0
j = 0
k = 0
n_max = 7
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max)
for j in range(k, n_max)
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s659824029 | p02258 | u119456964 | 1452147874 | Python | Python | py | Runtime Error | 0 | 0 | 247 | max = 0
i = 0
j = 0
k = 0
n_max = 6
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max)
for j in range(k, n_max)
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s494812790 | p02258 | u119456964 | 1452148066 | Python | Python | py | Runtime Error | 0 | 0 | 262 | max = 0
i = 0
j = 0
k = 0
n_max = int(raw_input())
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max)
for j in range(k, n_max)
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s927970395 | p02258 | u119456964 | 1452148116 | Python | Python | py | Runtime Error | 0 | 0 | 212 | max = 0
i = 0
j = 0
k = 0
n_max = int(raw_input())
price = [0]*n_max
for i in range(n_max)
for j in range(k, n_max)
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s540098289 | p02258 | u119456964 | 1452148202 | Python | Python | py | Runtime Error | 0 | 0 | 272 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = []
for k in range(n_max):
price.attend(int(raw_input())
for i in range(n_max)
for j in range(k, n_max)
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s654963618 | p02258 | u119456964 | 1452148460 | Python | Python | py | Runtime Error | 0 | 0 | 221 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(n_max)
for j in range(i, n_max)
if max <= price[j] - price[i]:
max = price[j] - price[i]
print max |
s517125560 | p02258 | u119456964 | 1452148504 | Python | Python | py | Runtime Error | 0 | 0 | 154 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(n_max)
if max <= price[j] - price[i]:
print max |
s050067593 | p02258 | u119456964 | 1452148521 | Python | Python | py | Runtime Error | 0 | 0 | 150 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6)
if max <= price[j] - price[i]:
print max |
s343541007 | p02258 | u119456964 | 1452148531 | Python | Python | py | Runtime Error | 0 | 0 | 151 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6):
if max <= price[j] - price[i]:
print max |
s209433987 | p02258 | u119456964 | 1452148673 | Python | Python | py | Runtime Error | 0 | 0 | 196 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(n_max)
for j in range(k, n_max)
if max <= price[j] - price[i]:
print max |
s700963537 | p02258 | u119456964 | 1452148687 | Python | Python | py | Runtime Error | 0 | 0 | 188 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6)
for j in range(k, 6)
if max <= price[j] - price[i]:
print max |
s790800202 | p02258 | u119456964 | 1452148694 | Python | Python | py | Runtime Error | 0 | 0 | 188 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6)
for j in range(j, 6)
if max <= price[j] - price[i]:
print max |
s513256299 | p02258 | u119456964 | 1452148711 | Python | Python | py | Runtime Error | 0 | 0 | 188 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6)
for j in range(j, 6)
if max <= price[5] - price[i]:
print max |
s975936149 | p02258 | u119456964 | 1452148727 | Python | Python | py | Runtime Error | 0 | 0 | 186 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(6)
for j in range(j, 6)
if max <= price[5] - price[i]:
print max |
s735097696 | p02258 | u119456964 | 1452148763 | Python | Python | py | Runtime Error | 0 | 0 | 186 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5)
for j in range(j, 5)
if max <= price[5] - price[i]:
print max |
s810244018 | p02258 | u119456964 | 1452148810 | Python | Python | py | Runtime Error | 0 | 0 | 183 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5)
for j in range(5)
if max <= price[5] - price[i]:
print max |
s041973546 | p02258 | u119456964 | 1452148929 | Python | Python | py | Runtime Error | 0 | 0 | 153 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5)
if max <= price[5] - price[i]:
print max |
s241973232 | p02258 | u119456964 | 1452148958 | Python | Python | py | Runtime Error | 0 | 0 | 147 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5)
if max <= price[5] - price[i]:
print max |
s967783322 | p02258 | u119456964 | 1452148977 | Python | Python | py | Runtime Error | 0 | 0 | 171 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5)
for i in range(5)
if max <= price[5] - price[i]:
print max |
s364609890 | p02258 | u119456964 | 1452148985 | Python | Python | py | Runtime Error | 0 | 0 | 173 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5):
for i in range(5):
if max <= price[5] - price[i]:
print max |
s114696264 | p02258 | u119456964 | 1452148991 | Python | Python | py | Runtime Error | 0 | 0 | 173 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5):
for j in range(5):
if max <= price[5] - price[i]:
print max |
s744732699 | p02258 | u119456964 | 1452149008 | Python | Python | py | Runtime Error | 0 | 0 | 171 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5)
for j in range(5)
if max <= price[5] - price[i]:
print max |
s901997911 | p02258 | u119456964 | 1452149019 | Python | Python | py | Runtime Error | 0 | 0 | 147 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5)
if max <= price[5] - price[i]:
print max |
s253310905 | p02258 | u119456964 | 1452149034 | Python | Python | py | Runtime Error | 0 | 0 | 148 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5):
if max <= price[5] - price[i]:
print max |
s895923267 | p02258 | u119456964 | 1452149055 | Python | Python | py | Runtime Error | 0 | 0 | 148 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5]
for i in range(5):
if max <= price[5] - price[i]:
print max |
s925153266 | p02258 | u119456964 | 1452149113 | Python | Python | py | Runtime Error | 0 | 0 | 212 | max = 0
i = 0
j = 0
k = 0
n_max = 0
??
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6):
????????for j in range(6):
????????????????if max <= price[j] - price[i]:
????????????????????????print max |
s035932228 | p02258 | u119456964 | 1452149124 | Python | Python | py | Runtime Error | 0 | 0 | 200 | max = 0
i = 0
j = 0
k = 0
n_max = 0
??
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6):
????for j in range(6):
????????????if max <= price[j] - price[i]:
????????????????????print max |
s992869542 | p02258 | u119456964 | 1452149141 | Python | Python | py | Runtime Error | 0 | 0 | 198 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6):
????for j in range(6):
????????????if max <= price[j] - price[i]:
????????????????????print max |
s391660404 | p02258 | u119456964 | 1452149152 | Python | Python | py | Runtime Error | 0 | 0 | 204 | max = 0
i = 0
j = 0
k = 0
n_max = 0
n_max = int(raw_input())
price = [1,2,3,4,5,6]
for i in range(6):
???? for j in range(6):
???????????? if max <= price[j] - price[i]:
???????????????????? print max |
s713102335 | p02258 | u038005340 | 1452229267 | Python | Python | py | Runtime Error | 0 | 0 | 244 | n = raw_input()
n = int(n)
minv = raw_input()
minv = iny(minv)
maxv = -1000000000
for j in range(n-1):
num = raw_input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print maxv |
s054173399 | p02258 | u038005340 | 1452229306 | Python | Python | py | Runtime Error | 0 | 0 | 244 | n = raw_input()
n = int(n)
minv = raw_input()
minv = iny(minv)
maxv = -1000000000
for j in range(n-1):
num = raw_input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print maxv |
s268850060 | p02258 | u038005340 | 1452229360 | Python | Python | py | Runtime Error | 0 | 0 | 244 | n = raw_input()
n = int(n)
minv = raw_input()
minv = iny(minv)
maxv = -1000000000
for j in range(n-1):
num = raw_input()
num = int(num)
diff = num - minv
if maxv < diff:
maxv = diff
if num < minv:
minv = num
print maxv |
s665395457 | p02258 | u824216249 | 1452253600 | Python | Python | py | Runtime Error | 20 | 6444 | 209 | n = int(input())
R = []
for i in range(n):
R.append(input())
Max = R[2] - R[1]
for i in range(n):
for j in range(i+1,n):
if R[j] - R[i] > Max : Max = R[j] - R[i]
print Max |
s865773182 | p02258 | u824216249 | 1452253686 | Python | Python | py | Runtime Error | 20 | 6472 | 204 | n = int(input())
R = []
for i in range(n):
R.append(input())
Max = R[2] - R[1]
for i in range(n):
for j in range(i+1,n):
if R[j] - R[i] > Max : Max = R[j] - R[i]
print Max |
s892144422 | p02258 | u069446126 | 1452346159 | Python | Python | py | Runtime Error | 0 | 0 | 222 | N = int(raw_input())
R = []
for i in range(N)
R.append(int(raw_input()))
max = R[1] - R[0]
for i in range(N - 1)
for j in range(i)
dif = R[i+1] - R[j]
if dif > max:
max = dif
print max |
s944908705 | p02258 | u069446126 | 1452346514 | Python | Python | py | Runtime Error | 0 | 0 | 224 | N = int(raw_input())
R = []
for i in range(N):
R[i] = (int(raw_input()))
max = R[1] - R[0]
for i in range(N - 1):
for j in range(i):
dif = R[i+1] - R[j]
if dif > max:
max = dif
print max |
s298840662 | p02258 | u069446126 | 1452353654 | Python | Python | py | Runtime Error | 0 | 0 | 289 | N = int(raw_input())
max = 0
min = 0
for i in range(N):
R.append(int(raw_input()))
min = R[0]
max = R[1]
dif = R[1] - R[0]
for i in range(N - 1):
if R[i+1] > max:
max = R[i+1]
dif = max - min
if R[i] < min:
min = R[i]
dif = max - min
print dif |
s314834027 | p02258 | u069446126 | 1452354767 | Python | Python | py | Runtime Error | 0 | 0 | 213 | N = int(raw_input())
min = int(raw_input())
max = int(raw_input())
dif = max - min
for i in range(N):
R = int(raw_input())
if R - min > dif:
dif = R - min
if R < min:
min = R
print dif |
s937060056 | p02258 | u970436839 | 1452434057 | Python | Python | py | Runtime Error | 0 | 0 | 146 | n = input()
maximum = 0
minimum = 0
for i in range(n):
tmp = imput()
maximum = max(maximum, tmp)
minimum = min(minimum, tmp)
print maximum |
s214099045 | p02258 | u970436839 | 1452434179 | Python | Python | py | Runtime Error | 0 | 0 | 154 | n = input()
maximum = 0
minimum = 0
for i in range(n):
tmp = imput()
maximum = max(maximum, tmp)
minimum = min(minimum, tmp)
print maximum-minimum |
s184043681 | p02258 | u970436839 | 1452434790 | Python | Python | py | Runtime Error | 0 | 0 | 147 | n = input()
maxi = 0
mini = 10**9
for i in range(n):
tmp = input()
maxi = max(maxi, tmp)
mini = min(mini, tmp)
ans = maxi - min
print ans |
s360241611 | p02258 | u834416077 | 1452486479 | Python | Python | py | Runtime Error | 0 | 0 | 238 | n = int(raw_input())
maxv = int(raw_input())
minv = int(raw_input())
maxv = -10**9
for j in range(0,n-1):
nums = int(raw_input())
deff = nums - minv
if maxv < deff:
maxv = deff
if minv > nums:
minv = nums
print maxv |
s099678855 | p02258 | u834416077 | 1452486753 | Python | Python | py | Runtime Error | 0 | 0 | 218 | n = int(raw_input())
maxv = int(raw_input())
minv = int(raw_input())
maxv = -10**9
for j in range(0,n-1):
nums = int(raw_input())
diff = nums - minv
maxv = max(maxv,diff)
minv = min(minv,nums)
print maxv |
s298491224 | p02258 | u834416077 | 1452486808 | Python | Python | py | Runtime Error | 0 | 0 | 194 | n = int(raw_input())
minv = int(raw_input())
maxv = -10**9
for j in range(0,n-1):
nums = int(raw_input())
diff = nums - minv
maxv = max(maxv,diff)
minv = min(minv,nums)
print maxv |
s946257136 | p02258 | u834416077 | 1452487181 | Python | Python | py | Runtime Error | 0 | 0 | 186 | n = int(raw_input())
maxv = -10**9
minv = 10**9
for j in range(0,n-1):
nums = int(raw_input())
diff = nums - minv
maxv = max(maxv,diff)
minv = min(minv,nums)
print maxv |
s521001139 | p02258 | u834416077 | 1452487317 | Python | Python | py | Runtime Error | 0 | 0 | 184 | n = int(raw_input())
maxv = -10**9
minv = 10**9
for j in range(n-1):
nums = int(raw_input())
diff = nums - minv
maxv = max(maxv,diff)
minv = min(minv,nums)
print maxv |
s576671826 | p02258 | u724923896 | 1452487339 | Python | Python | py | Runtime Error | 0 | 0 | 125 | n = input()
maxv = -10**9
minv = R[]
for i in range(n-1):
maxv = max(maxv, R[i]-minv)
minv = min(minv, R[i])
print maxv |
s105255124 | p02258 | u834416077 | 1452487468 | Python | Python | py | Runtime Error | 0 | 0 | 184 | n = int(raw_input())
maxv = -10**9
minv = 10**9
for j in range(n-1):
nums = int(raw_input())
diff = nums - minv
maxv = max(maxv,diff)
minv = min(minv,nums)
print maxv |
s225803449 | p02258 | u724923896 | 1452490261 | Python | Python | py | Runtime Error | 0 | 0 | 139 | n = input()
max = -10**9
min = R[]
for i in range(n-1):
if max <= R[i] - min:
max = R[i] - min
if R[i] <= min:
min = R[i]
print max |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.