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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s510723091 | p02233 | u811733736 | 1480477447 | Python | Python3 | py | Runtime Error | 20 | 7540 | 661 | class Fibonacci(object):
memo = [1, 1]
def get_nth(self, n):
if n <= len(Fibonacci.memo):
return Fibonacci.memo[n]
# print('fib({0}) not found'.format(n))
for i in range(len(Fibonacci.memo), n+1):
result = Fibonacci.memo[i-1] + Fibonacci.memo[i-2]
Fibonacci.memo.append(result)
# print('fib({0})={1} append'.format(i, result))
return Fibonacci.memo[n]
if __name__ == '__main__':
# ??????????????\???
num = int(input())
# ?????£??????????????°????¨????
f = Fibonacci()
result = f.get_nth(num)
# ???????????????
print('{0}'.format(result)) |
s040877879 | p02233 | u246756871 | 1483696736 | Python | Python3 | py | Runtime Error | 0 | 0 | 173 | n = int(input())
def fib(n):
if n < 2:
return 1
else:
a, b, c = 1, 1 0
for x in range(n):
c = a+b
a = b
b = c
return a
print(fib(n)) |
s132201365 | p02233 | u246756871 | 1483696758 | Python | Python3 | py | Runtime Error | 0 | 0 | 173 | n = int(input())
def fib(n):
if n < 2:
return 1
else:
a, b, c = 1, 1 0
for x in range(n):
c = a+b
a = b
b = c
return a
print(fib(n)) |
s501937986 | p02233 | u112247126 | 1487895621 | Python | Python3 | py | Runtime Error | 0 | 0 | 111 | n = int(input())
first = 1
second = 1
for i in range(n):
second, first = first + second, second
return val |
s596779236 | p02233 | u112247126 | 1487895660 | Python | Python3 | py | Runtime Error | 0 | 0 | 111 | n = int(input())
first = 1
second = 1
for i in range(n):
second, first = first + second, second
print(val) |
s484436498 | p02233 | u813534019 | 1490168717 | Python | Python | py | Runtime Error | 0 | 0 | 155 | def fibo(f1, f2, count):
if count == 2:
return f1 + f2
return fibo(f2, f1+f2, count-1)
n = int(raw_input())
print fibo(1, 1, n) |
s682831257 | p02233 | u300946041 | 1491374137 | Python | Python3 | py | Runtime Error | 20 | 7544 | 249 | # -*- coding: utf-8 -*-
def main(n):
lst = []
lst.append(1)
lst.append(1)
for i in range(2, n + 1):
lst[i] = lst[i - 1] + lst[i - 2]
return lst[n]
if __name__ == '__main__':
n = int(input())
print(main(n)) |
s330261781 | p02233 | u690870779 | 1491545629 | Python | Python | py | Runtime Error | 0 | 0 | 120 | def fib(n):
if n == 0 || n == 1:
return 1
return fib(n-1) + fib(n-2)
n=int(raw_input())
print fib(n) |
s533839253 | p02233 | u418774997 | 1494120052 | Python | Python3 | py | Runtime Error | 0 | 0 | 111 | #coding: UTF-8
s = input()
h = s/3600
s = s%3600
m = s/60
s = s%60
print str(h) + ":" + str(m) + ":" + str(s) |
s632435880 | p02233 | u370086573 | 1494578850 | Python | Python3 | py | Runtime Error | 0 | 0 | 222 | def fibonacci(n):
if n == 0 or n == 1:
F[n] = 1
return F[n]
if F[n] is not None:
return F[n]
F[n] = fibonacci(n - 1) + fibonacci(n - 2)
return F[n]
n = int(input())
F = [None] * n |
s899000897 | p02233 | u370086573 | 1494578888 | Python | Python3 | py | Runtime Error | 0 | 0 | 242 | def fibonacci(n):
if n == 0 or n == 1:
F[n] = 1
return F[n]
if F[n] is not None:
return F[n]
F[n] = fibonacci(n - 1) + fibonacci(n - 2)
return F[n]
n = int(input())
F = [None] * n
print(fibonacci(n)) |
s678126739 | p02233 | u352522848 | 1494771359 | Python | Python | py | Runtime Error | 10 | 6276 | 180 | _fib = [1, 1]
def fib(n):
if len(_fib) > n:
return _fib[n]
else:
_fib[n] = fib[n-1] + fib[n-2]
return _fib[n]
_n = int(raw_input())
print(fib(_n)) |
s983311811 | p02233 | u352522848 | 1494771428 | Python | Python | py | Runtime Error | 10 | 6256 | 180 | _fib = [1, 1]
def fib(n):
if len(_fib) > n:
return _fib[n]
else:
_fib[n] = fib(n-1) + fib(n-2)
return _fib[n]
_n = int(raw_input())
print(fib(_n)) |
s982374337 | p02233 | u352522848 | 1494771763 | Python | Python | py | Runtime Error | 10 | 6344 | 174 | _fib = [None] * 44
_fib[0] = 1
_fib[1] = 1
def fib(n):
if _fib[n] is None:
_fib[n] = fib(n-1) + fib(n-2)
return _fib[n]
_n = int(raw_input())
print(fib(_n)) |
s239443503 | p02233 | u603049633 | 1496473081 | Python | Python3 | py | Runtime Error | 0 | 0 | 188 | def makeFibonacci(n):
F = [None]*n
F[0] = 1
F[1] = 1
for i in range(2, n):
F[i] = F[i-1] + F[i - 2]
return str(F[n-1])
n = int(input())
print(makeFibonacci(n)) |
s743246137 | p02233 | u297730027 | 1496717478 | Python | Python | py | Runtime Error | 10 | 6352 | 229 | def dynamic(n):
if n == 0 or n == 1:
return 1
if F[n] != 0:
return F[n]
F[n] = dynamic(n - 1) + dynamic(n - 2)
return F[n]
if __name__ == '__main__':
n = int(raw_input())
print(dynamic(n)) |
s559981471 | p02233 | u216229195 | 1496759213 | Python | Python3 | py | Runtime Error | 20 | 7576 | 293 | F = {}
def fib(n):
global F
if n < 0:
print("error")
exit()
if n < 2:
F[n] = 1
return F[n]
# F[n] = fib(n-1) + fib(n-2)
F[n] = F(n-1) + F(n-2)
return F[n]
n = int(input())
print(fib(n))
#n = int(input())
#print(fib(n))
#fib(44)
#for i in range(5+1):
# print(F[i]) |
s293042280 | p02233 | u216229195 | 1496759305 | Python | Python3 | py | Runtime Error | 20 | 7628 | 293 | F = {}
def fib(n):
global F
if n < 0:
print("error")
exit()
if n < 2:
F[n] = 1
return F[n]
# F[n] = fib(n-1) + fib(n-2)
F[n] = F[n-1] + F[n-2]
return F[n]
n = int(input())
print(fib(n))
#n = int(input())
#print(fib(n))
#fib(44)
#for i in range(5+1):
# print(F[i]) |
s206648596 | p02233 | u216229195 | 1496759449 | Python | Python3 | py | Runtime Error | 0 | 0 | 311 | F = {}
def fib(n):
global F
if n < 0:
print("error")
exit()
if n < 2:
F[n] = 1
return F[n]
F[n] = fib(n-1) + fib(n-2)
# F[n] = F[n-1] + F[n-2]
return F[n]
n = int(input())
print(fib(n))
#n = int(input())
#print(fib(n))
#fib(44)
#for i in range(44+1):
3 print(fib(i))
# print(F[i]) |
s291156433 | p02233 | u834139744 | 1497249300 | Python | Python3 | py | Runtime Error | 0 | 0 | 186 | #!/usr/bin/python
n = int(input())
def fib(n):
l = [0] * (n+1)
l[0] = 1
l[1] = 1
for i in range(2, n+1):
l[i] = l[i-1] + l[i-2]
return l[i]
print(fib(n)) |
s664663418 | p02233 | u834139744 | 1497249426 | Python | Python3 | py | Runtime Error | 0 | 0 | 186 | #!/usr/bin/python
n = int(input())
def fib(n):
l = [0] * (n+1)
l[0] = 1
l[1] = 1
for i in range(2, n+1):
l[i] = l[i-1] + l[i-2]
return l[i]
print(fib(n)) |
s152340368 | p02233 | u834139744 | 1497249623 | Python | Python3 | py | Runtime Error | 0 | 0 | 186 | #!/usr/bin/python
n = int(input())
def fib(n):
l = [0] * (n+1)
l[0] = 1
l[1] = 1
for i in range(2, n+1):
l[i] = l[i-1] + l[i-2]
return l[i]
print(fib(n)) |
s811718563 | p02233 | u834139744 | 1497249694 | Python | Python3 | py | Runtime Error | 0 | 0 | 190 | #!/usr/bin/python
n = int(input())
def fib(n):
l = list()
l.append(1)
l.append(1)
for i in range(2, n+1):
l.append(l[i-1] + l[i-2])
return l[i]
print(fib(n)) |
s372536912 | p02233 | u539803218 | 1499300343 | Python | Python3 | py | Runtime Error | 0 | 0 | 116 | import numpy as np
def f(n):
m = np.matrix('1 1 ; 1 0') ** n
return m.item(0)
print(f(int(input()))) |
s172454310 | p02233 | u539803218 | 1499300403 | Python | Python3 | py | Runtime Error | 0 | 0 | 108 | import numpy as np
def f(n):
m = np.matrix('1 1 ; 1 0') ** n
return m.item(0)
print(f(int(input()))) |
s073059631 | p02233 | u539803218 | 1499300467 | Python | Python3 | py | Runtime Error | 0 | 0 | 115 | import numpy as np
def f(n):
m = np.matrix('1 1 ; 1 0') ** n
return m.item(0)
print(f(int(input())),end="") |
s422208293 | p02233 | u539803218 | 1499301006 | Python | Python | py | Runtime Error | 0 | 0 | 108 | import numpy as np
def f(n):
m = np.matrix('1 1 ; 1 0') ** n
return m.item(0)
print(f(int(input()))) |
s290315354 | p02233 | u350064373 | 1507454127 | Python | Python3 | py | Runtime Error | 0 | 0 | 101 | n = int(input())
print(round((pow((1+math.sqrt(5))/2,n) - pow((1-math.sqrt(5))/2,n)) / math.sqrt(5))) |
s500394521 | p02233 | u027634846 | 1508502708 | Python | Python3 | py | Runtime Error | 0 | 0 | 376 | def fib(a, b, fiboli):
if len(fiboli) < n:
fiboli.append(fiboli[-1] + fiboli[-2])
fib(fiboli[-1], fiboli[-1] + fiboli[-2], fiboli)
else:
print(fiboli[-1])
print(fiboli)
n = int(input())3
if n != 0 and n != 1:
fibo_list = []
fibo_list.append(n - 1)
fibo_list.append(n - 2)
fib(n - 1, n - 2, fibo_list)
else:
print(1) |
s799506020 | p02233 | u024715419 | 1510121150 | Python | Python3 | py | Runtime Error | 0 | 0 | 137 | def fibonacci(n)
if n == 0 or n == 1:
return 1
return fibonacci(n - 2) + fibonacci(n - 1)
print(fibonacci(int(input()))) |
s281612446 | p02233 | u626266743 | 1511268913 | Python | Python3 | py | Runtime Error | 20 | 7556 | 95 | n = int(input())
fib = [1, 1]
for i in range(n):
fib[i] = fib[i-1] + fib[i-2]
print(fib[n]) |
s521322112 | p02233 | u424457654 | 1511279503 | Python | Python3 | py | Runtime Error | 0 | 0 | 121 | n = int(input())
F = [1, 1] + [0] * [44 + 1]
for i in range(2, n + 1):
fib[i] = fib[i - 1] + fib[i - 2]
print(fib[n]) |
s314749749 | p02233 | u424457654 | 1511279581 | Python | Python3 | py | Runtime Error | 0 | 0 | 129 | n = int(input())
F = [1, 1] + [0 for i in range(44)]
for i in range(2, n + 1):
fib[i] = fib[i - 1] + fib[i - 2]
print(fib[n]) |
s047689823 | p02233 | u146816547 | 1515769587 | Python | Python | py | Runtime Error | 0 | 0 | 95 | n = int(raw_input())
dp = [1, 1]
for i in range(50):
dp += dp[-1] + dp[-2]
print dp[n]
|
s943063093 | p02233 | u869924057 | 1518087349 | Python | Python3 | py | Runtime Error | 20 | 5592 | 168 | memo = [1, 1]
def fib(n):
if (n in memo):
return memo[n]
ans = fib(n-1) + fib(n-2)
memo.append(ans)
return ans
n = int(input())
print(fib(n))
|
s977486630 | p02233 | u150984829 | 1519717265 | Python | Python3 | py | Runtime Error | 0 | 0 | 63 | f=[1,1]
for _ in[0]*43:f+=[f(-2)+f(-1)]
print(f[int(input())])
|
s482246477 | p02233 | u135421061 | 1523234924 | Python | Python | py | Runtime Error | 0 | 0 | 277 | import numpy as np
import sys
def fib(n):
if (n == 0):
return 1
elif (n == 1):
return 1
else :
return fib(n - 1) + fib(n - 2)
if __name__ == "__main__":
n = input("input number: ")
n = int(n)
#print(type(n))
print(fib(n))
|
s072555360 | p02233 | u135421061 | 1523241121 | Python | Python | py | Runtime Error | 0 | 0 | 357 | import numpy as np
import sys
n = 45
f = [-1 for i in range(45)]
def fib(n):
global f
if (n == 0):
return 1
elif (n == 1):
return 1
elif(f[n] == -1):
f[n] = fib(n - 1) + fib(n - 2)
return f[n]
if __name__ == "__main__":
n = input("input number: ")
n = int(n)
#print(type(n))
print(fib(n))
|
s735468035 | p02233 | u135421061 | 1523242120 | Python | Python3 | py | Runtime Error | 0 | 0 | 315 | import numpy as np
import sys
f = [-1 for i in range(45)]
f[0] = f[1] = 1
def fib(n):
global f
for i in range(2,n+1):
f[i] = f[i - 1] + f[i - 2]
#print(i,f[i])
return f[n]
if __name__ == "__main__":
n = input("input number: ")
n = int(n)
#print(type(n))
print(fib(n))
|
s157570608 | p02234 | u800534567 | 1540466778 | Python | Python3 | py | Runtime Error | 0 | 0 | 661 | import sys, itertools
n = int(sys.stdin.readline())
MM = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
amin = 0
m = MM[0][:]
for i in range(n-1):
amin += m[0]*m[1]*MM[i+1][1]
m[1]=MM[i+1][1]
for t in itertools.permutations(range(n-1), n-2):
mm=[m[:] for m in MM]
o = list(t)
ans=0
for _ in range(n-2):
i = o.pop(0)
ans += mm[i][0]*mm[i+1][1]*mm[i][1]
if ans>amin: break
mm[i][1] = mm[i+1][1]
mm.pop(i+1)
for j in range(len(o)):
if o[j]>i: o[j] -=1
else:
ans += mm[0][0]*mm[0][1]*mm[1][1]
if amin>ans: amin=ans
print(amin)
|
s002008558 | p02234 | u800534567 | 1540466808 | Python | Python3 | py | Runtime Error | 0 | 0 | 661 | import sys, itertools
n = int(sys.stdin.readline())
MM = [list(map(int, sys.stdin.readline().split())) for _ in range(n)]
amin = 0
m = MM[0][:]
for i in range(n-1):
amin += m[0]*m[1]*MM[i+1][1]
m[1]=MM[i+1][1]
for t in itertools.permutations(range(n-1), n-2):
mm=[m[:] for m in MM]
o = list(t)
ans=0
for _ in range(n-2):
i = o.pop(0)
ans += mm[i][0]*mm[i+1][1]*mm[i][1]
if ans>amin: break
mm[i][1] = mm[i+1][1]
mm.pop(i+1)
for j in range(len(o)):
if o[j]>i: o[j] -=1
else:
ans += mm[0][0]*mm[0][1]*mm[1][1]
if amin>ans: amin=ans
print(amin)
|
s100560966 | p02234 | u874332113 | 1558962702 | Python | Python3 | py | Runtime Error | 0 | 0 | 1689 | import sys
sys.setrecursionlimit(10**7)
debug = False
import numpy as np
def dprint(*objects):
if debug == True:
print(*objects)
# n = int(input())
# a, b = map(int, input().split())
# int_list = list(map(int, input().split()))
# l = list(input().split())
def solve():
n = int(input())
mat_list = []
for i in range(n):
mat_list.append(list(map(int, input().split())))
dprint(mat_list)
# 掛け始めのidxと掛け終わりのidxをi, jとし、計算回数を持つメモ
memo = np.zeros(shape=(n, n))
def calc(start, end):
dprint("*", start, end)
# 1つの行列なら0
if end == start:
return 0
# メモがあれば返す
if memo[start][end] != 0:
return memo[start][end]
# 2つの行列なら、答えを計算しメモ追記
if end - start == 1:
cost = mat_list[start][0] * mat_list[start][1] * mat_list[end][1]
memo[start][end] = cost
dprint(start, end, cost)
return cost
# 3つ以上なら、再帰
min_cost = -1
if end - start >= 2:
for right_start in range(start+1, end+1):
left = calc(start, right_start-1)
right = calc(right_start, end)
cost = left + right + mat_list[start][0] * mat_list[right_start][0] * mat_list[end][1]
if min_cost == -1 or min_cost > cost:
min_cost = cost
dprint(start, end, right_start, min_cost, cost)
memo[start][end] = min_cost
return min_cost
ans = calc(0, n-1)
dprint(memo)
print(int(ans))
solve()
|
s265511106 | p02234 | u874332113 | 1558962741 | Python | Python3 | py | Runtime Error | 0 | 0 | 1689 | import sys
sys.setrecursionlimit(10**7)
debug = False
import numpy as np
def dprint(*objects):
if debug == True:
print(*objects)
# n = int(input())
# a, b = map(int, input().split())
# int_list = list(map(int, input().split()))
# l = list(input().split())
def solve():
n = int(input())
mat_list = []
for i in range(n):
mat_list.append(list(map(int, input().split())))
dprint(mat_list)
# 掛け始めのidxと掛け終わりのidxをi, jとし、計算回数を持つメモ
memo = np.zeros(shape=(n, n))
def calc(start, end):
dprint("*", start, end)
# 1つの行列なら0
if end == start:
return 0
# メモがあれば返す
if memo[start][end] != 0:
return memo[start][end]
# 2つの行列なら、答えを計算しメモ追記
if end - start == 1:
cost = mat_list[start][0] * mat_list[start][1] * mat_list[end][1]
memo[start][end] = cost
dprint(start, end, cost)
return cost
# 3つ以上なら、再帰
min_cost = -1
if end - start >= 2:
for right_start in range(start+1, end+1):
left = calc(start, right_start-1)
right = calc(right_start, end)
cost = left + right + mat_list[start][0] * mat_list[right_start][0] * mat_list[end][1]
if min_cost == -1 or min_cost > cost:
min_cost = cost
dprint(start, end, right_start, min_cost, cost)
memo[start][end] = min_cost
return min_cost
ans = calc(0, n-1)
dprint(memo)
print(int(ans))
solve()
|
s452349318 | p02234 | u567380442 | 1422189521 | Python | Python3 | py | Runtime Error | 0 | 0 | 671 | import itertools
n = int(input())
rc = [list(map(int, input().split())) for _ in range(n)]
rc_min = rc.index(min(rc))
def calc(rc):
total = 0
for i, irc in enumerate(rc):
if i ==0:
r, c = irc
else:
total += r * c * irc[1]
c = irc[1]
return r, c, total
def reverse_calc(rc):
total = 0
for i, irc in enumerate(rc[::-1]):
if i ==0:
r, c = irc
else:
total += r * c * irc[0]
r = irc[0]
return r, c, total
total = 0
r1, c1, ret = reverse_calc(rc[:rc_min])
total += ret
r2, c2, ret =calc(rc[rc_min:])
total += ret
total += r1 * c1 * c2
print(total) |
s731987915 | p02234 | u233232390 | 1453255642 | Python | Python | py | Runtime Error | 0 | 0 | 498 | def solve():
a = raw_input()
n = len(a)
cost = [[0 for i in range(n)] for j in range(n)]
for length in range(2, n+1):
for i in range(0, n-length+1):
k = i+length-1
def f(i,j,k):
return cost[i][j-1]+cost[j][k]+M[i][0]*M[j-1][1]*M[k][1]
cost[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return cost[0][n-1]
n = raw_input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print solve(M) |
s364617476 | p02234 | u233232390 | 1453255685 | Python | Python | py | Runtime Error | 0 | 0 | 494 | def solve():
a = raw_input()
n = len(a)
cost = [[0 for i in range(n)] for j in range(n)]
for length in range(2, n+1):
for i in range(0, n-length+1):
k = i+length-1
def f(i,j,k):
return cost[i][j-1]+cost[j][k]+M[i][0]*M[j-1][1]*M[k][1]
cost[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return cost[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print solve(M) |
s490803157 | p02234 | u233232390 | 1453255828 | Python | Python | py | Runtime Error | 0 | 0 | 493 | def solve():
a = raw_input()
n = len(a)
cost = [[0 for i in range(n)] for j in range(n)]
for length in range(2, n+1):
for i in range(0, n-length+1):
k = i+length-1
def f(i,j,k):
return cost[i][j-1]+cost[j][k]+M[i][0]*M[j-1][1]*M[k][1]
cost[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return cost[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print solve() |
s119459620 | p02234 | u233232390 | 1453256216 | Python | Python | py | Runtime Error | 0 | 0 | 473 | def solve(a):
n = len(a)
cost = [[0 for i in range(n)] for j in range(n)]
for length in range(2, n+1):
for i in range(0, n-length+1):
k = i+length-1
def f(i,j,k):
return cost[i][j-1]+cost[j][k]+M[i][0]*M[j-1][1]*M[k][1]
cost[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return cost[0][n-1]
n = raw_input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print solve(M) |
s281710325 | p02234 | u970436839 | 1453301039 | Python | Python | py | Runtime Error | 0 | 0 | 402 | def mcm(M):
n = len(M)
m = [[0 for i in range(n)] for j in range(n)]
for l in range(2, n):
for i in range(1, n-l+1):
j = i + l - 1
def cost(i, k ,j):
return m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1]
m[i][j] = min(cost(i, k, j) for k in range(i, j-1))
return m[0][n-1]
n = input()
for i in range(n):
M.append(map(int, raw_input().split()))
print mcm(M) |
s041117830 | p02234 | u970436839 | 1453301206 | Python | Python | py | Runtime Error | 0 | 0 | 406 | def mcm(M):
n = len(M)
m = [[0 for i in range(n+1)] for j in range(n+1)]
for l in range(2, n):
for i in range(1, n-l+1):
j = i + l - 1
def cost(i, k ,j):
return m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1]
m[i][j] = min(cost(i, k, j) for k in range(i, j-1))
return m[0][n-1]
n = input()
for i in range(n):
M.append(map(int, raw_input().split()))
print mcm(M) |
s712370258 | p02234 | u047737909 | 1453346965 | Python | Python | py | Runtime Error | 0 | 0 | 357 | def edit_distance(d)
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(0,n+1+long):
k=i+long-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print solve(M) |
s319454312 | p02234 | u047737909 | 1453347109 | Python | Python | py | Runtime Error | 0 | 0 | 355 | def edit_distance(d)
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print solve(M) |
s652424125 | p02234 | u047737909 | 1453347203 | Python | Python | py | Runtime Error | 0 | 0 | 366 | def edit_distance(d)
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distance (M) |
s732583856 | p02234 | u047737909 | 1453347318 | Python | Python | py | Runtime Error | 0 | 0 | 364 | def edit_distance(d)
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distance(M) |
s599172980 | p02234 | u047737909 | 1453347416 | Python | Python | py | Runtime Error | 0 | 0 | 398 | def edit_distance(d)
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(2, n+1):
for long in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distance(M) |
s807284866 | p02234 | u047737909 | 1453347457 | Python | Python | py | Runtime Error | 0 | 0 | 399 | def edit_distance(d):
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(2, n+1):
for long in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distance(M) |
s656567526 | p02234 | u047737909 | 1453347610 | Python | Python | py | Runtime Error | 0 | 0 | 397 | def edit_distance(d):
n =len(d)
A=[[0 for i in range(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distance(M) |
s172070327 | p02234 | u047737909 | 1453347731 | Python | Python | py | Runtime Error | 0 | 0 | 396 | def edit_distance(d):
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distance(M) |
s510893633 | p02234 | u047737909 | 1453347855 | Python | Python | py | Runtime Error | 0 | 0 | 396 | def edit_distance(d):
n =len(d)
A=[[0 for i inrange(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0,n+1-long):
k=i-1+long
def f(i,j,k):
return A[i][j-1]+A[j][k]+]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distance(M) |
s540940405 | p02234 | u047737909 | 1453348134 | Python | Python | py | Runtime Error | 0 | 0 | 401 | def edit_distance(a):
n = len(a)
A = [[0 for i in range(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0, n-long+1):
k = i+long-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M)
|
s755915500 | p02234 | u047737909 | 1453348269 | Python | Python | py | Runtime Error | 0 | 0 | 401 | def edit_distance(a):
n = len(a)
A = [[0 for i in range(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0, n-long+1):
k = i+long-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M)
|
s107111770 | p02234 | u047737909 | 1453348478 | Python | Python | py | Runtime Error | 0 | 0 | 401 | def edit_distance(a):
n = len(a)
A = [[0 for i in range(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0, n-long+1):
k = i+long-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M)
|
s017369103 | p02234 | u047737909 | 1453348508 | Python | Python | py | Runtime Error | 0 | 0 | 399 | def edit_distance(a):
n = len(a)
A = [[0 for i in range(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0, n-long+1):
k = i+long-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M) |
s675002534 | p02234 | u047737909 | 1453348551 | Python | Python | py | Runtime Error | 0 | 0 | 401 | def edit_distance(M):
n = len(M)
A = [[0 for i in range(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0, n-long+1):
k = i+long-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M)
|
s508014252 | p02234 | u047737909 | 1453348830 | Python | Python | py | Runtime Error | 0 | 0 | 401 | def edit_distance(M):
n = len(M)
A = [[0 for i in range(n)] for j in range(n)]
for long in range(2, n+1):
for i in range(0, n-long+1):
k = i+long-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M)
|
s939358768 | p02234 | u047737909 | 1453348915 | Python | Python | py | Runtime Error | 0 | 0 | 390 | def edit_distance(M):
n = len(M)
A = [[0 for i in range(n)] for j in range(n)]
for l in range(2, n+1):
for i in range(0, n-l+1):
k = i+l-1
def f(i,j,k):
return A[i][j-1]+A[j][k]+M[i][0]*M[j-1][1]*M[k][1]
A[i][k] = min([f(i,j,k) for j in range(i+1,k+1)])
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M) |
s230479609 | p02234 | u047737909 | 1453349094 | Python | Python | py | Runtime Error | 0 | 0 | 384 | def edit_distance(M):
n = len(M)
A = [[0 for i in range(n)] for j in range(n)]
for l in range(2, n+1):
for i in range(0, n-l+1):
k = i+l-1
def f(i,j,k):
return A[i][j]+A[j+1][k] + M[i][0]*M[j][1]*M[k][1]
A[i][k] = min(f(i,j,k) for j in range(i,k))
return A[0][n-1]
n = input()
M = []
for i in range(n):
M.append(map(int, raw_input().split()))
print edit_distace(M) |
s257926865 | p02234 | u038005340 | 1453693913 | Python | Python | py | Runtime Error | 10 | 6296 | 368 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [ [ 0 for i in range(n) ] for j in range(n) ]
for i in xrange(n):
M.append( map ( int , raw_input().split() ) )
for l in xrange( 2,n+1 ):
for i in xrange( 0,n-l+1 ):
j = i + l - 1
m[i][j] = min( cost( i,k,j ) for k in xrange( i,j ) )
print m[0][n-1] |
s537826704 | p02234 | u038005340 | 1453693941 | Python | Python | py | Runtime Error | 0 | 0 | 378 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [ [ 0 for i in range(n) ] for j in range(n) ]
for i in xrange(n):
M.append( map ( int , raw_input().split() ) )
n = len(p)
for l in xrange( 2,n+1 ):
for i in xrange( 0,n-l+1 ):
j = i + l - 1
m[i][j] = min( cost( i,k,j ) for k in xrange( i,j ) )
print m[0][n-1] |
s459427975 | p02234 | u038005340 | 1453693989 | Python | Python | py | Runtime Error | 10 | 6464 | 364 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [ [ 0 for i in range(n) ] for j in range(n) ]
for i in xrange(n):
M.append( map ( int , raw_input().split() ) )
for l in range( 2,n+1 ):
for i in range( 0,n-l+1 ):
j = i + l - 1
m[i][j] = min( cost( i,k,j ) for k in range( i,j ) )
print m[0][n-1] |
s781964232 | p02234 | u038005340 | 1453694055 | Python | Python | py | Runtime Error | 0 | 0 | 384 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [ [ 0 for i in range(n) ] for j in range(n) ]
for i in range(n):
M.append( map ( int , raw_input().split() ) )
p_long = len(p)
for l in range( 2,n+1 ):
for i in range( 0,n-l+1 ):
j = i + l - 1
m[i][j] = min( cost( i,k,j ) for k in range( i,j ) )
print m[0][p_long-1] |
s881467639 | p02234 | u038005340 | 1453694112 | Python | Python | py | Runtime Error | 10 | 6280 | 384 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [ [ 0 for i in range(n) ] for j in range(n) ]
for i in range(n):
M.append( map ( int , raw_input().split() ) )
M_long = len(M)
for l in range( 2,n+1 ):
for i in range( 0,n-l+1 ):
j = i + l - 1
m[i][j] = min( cost( i,k,j ) for k in range( i,j ) )
print m[0][M_long-1] |
s480744302 | p02234 | u038005340 | 1453694207 | Python | Python | py | Runtime Error | 10 | 6420 | 394 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [ [ 0 for i in range(n) ] for j in range(n) ]
for i in range(n):
M.append( map ( int , raw_input().split() ) )
M_long = len(M)
for x in range( 2,M_long+1 ):
for i in range( 0,M_long-x+1 ):
j = i + x - 1
m[i][j] = min( cost( i,k,j ) for k in range( i,j ) )
print m[0][M_long-1] |
s995122272 | p02234 | u038005340 | 1453694251 | Python | Python | py | Runtime Error | 10 | 6380 | 394 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [ [ 0 for i in range(n) ] for j in range(n) ]
for i in range(n):
M.append( map ( int , raw_input().split() ) )
M_long = len(M)
for x in range( 2,M_long+1 ):
for i in range( 0,M_long-x+1 ):
j = i + x - 1
m[i][j] = min( cost( i,k,j ) for k in range( i,j ) )
print m[0][M_long-1] |
s922752014 | p02234 | u724923896 | 1453694362 | Python | Python | py | Runtime Error | 0 | 0 | 392 | n = input()
def scalar(n):
for i in range(0, len(n)):
for j in range(0, len(n)):
m[i][j] = 0
for l in range(2, len(n)):
for i in range(0, len(n)):
j = i + l - 1
m[i][j] = min(m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1] for k in range(i, j))
print m[0][len(n)-1]
for i in range(n):
M.append(map(int, raw_input().split()))
scalar(M)
|
s908966864 | p02234 | u724923896 | 1453694460 | Python | Python | py | Runtime Error | 0 | 0 | 372 | n = input()
def scalar(n):
m = [[for i in range(0, len(n))] for j in range(0, len(n))]
for l in range(2, len(n)):
for i in range(0, len(n)):
j = i + l - 1
m[i][j] = min(m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1] for k in range(i, j))
print m[0][len(n)-1]
for i in range(n):
M.append(map(int, raw_input().split()))
scalar(M)
|
s147417039 | p02234 | u724923896 | 1453694559 | Python | Python | py | Runtime Error | 0 | 0 | 370 | n = input()
def scalar(n):
m = [[0 for i in range(len(n))] for j in range(len(n))]
for l in range(2, len(n)):
for i in range(0, len(n)):
j = i + l - 1
m[i][j] = min(m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1] for k in range(i, j))
print m[0][len(n)-1]
for i in range(n):
M.append(map(int, raw_input().split()))
scalar(M) |
s847634876 | p02234 | u038005340 | 1453694599 | Python | Python | py | Runtime Error | 10 | 6272 | 388 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [[ 0 for i in range(n) ] for j in range(n) ]
for i in range(n):
M.append( map (int, raw_input().split() ) )
M_long = len(M)
for l in range( 2,M_long+1 ):
for i in range( 0,M_long-l+1 ):
j = i+l-1
m[i][j] = min( cost( i,k,j ) for k in range( i,j ) )
print m[0][M_long-1] |
s052228338 | p02234 | u038005340 | 1453694608 | Python | Python | py | Runtime Error | 10 | 6328 | 388 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [[ 0 for i in range(n) ] for j in range(n) ]
for i in range(n):
M.append( map (int, raw_input().split() ) )
M_long = len(M)
for l in range( 2,M_long+1 ):
for i in range( 0,M_long-l+1 ):
j = i+l-1
m[i][j] = min( cost( i,k,j ) for k in range( i,j ) )
print m[0][M_long-1] |
s201732545 | p02234 | u724923896 | 1453694652 | Python | Python | py | Runtime Error | 0 | 0 | 428 | n = input()
??????
def scalar(n):
??????m = [[0 for i in range(len(n))] for j in range(len(n))]
??????
??????for l in range(2, len(n)+1):
????????????for i in range(0, len(n)-l+1):
??????????????????j = i + l - 1
??????????????????m[i][j] = min(m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1] for k in range(i, j))
??????
??????print m[0][len(n)-1]
??????
for i in range(n):
??????M.append(map(int, raw_input().split()))
scalar(M) |
s172079576 | p02234 | u038005340 | 1453694698 | Python | Python | py | Runtime Error | 10 | 6308 | 394 | def cost( i,k,j ):
return m[i][k] + m[k+1][j] + p[i][0] * p[k][1] * p[j][1]
n = input()
M = []
m = [[ 0 for i in xrange(n) ] for j in xrange(n) ]
for i in xrange(n):
M.append( map (int, raw_input().split() ) )
M_long = len(M)
for l in xrange( 2,M_long+1 ):
for i in xrange( 0,M_long-l+1 ):
j = i+l-1
m[i][j] = min( cost( i,k,j ) for k in xrange( i,j ) )
print m[0][M_long-1] |
s246899079 | p02234 | u724923896 | 1453694718 | Python | Python | py | Runtime Error | 0 | 0 | 368 | n = input()
def scalar(n):
m = [[0 for i in range(len(n))] for j in range(len(n))]
for l in range(2, len(n)+1):
for i in range(0, len(n)-l+1):
j = i + l - 1
m[i][j] = min(m[i][k] + m[k+1][j] + M[i][0]*M[k][1]*M[j][1] for k in range(i, j))
print m[0][len(n)-1]
for i in range(n):
M.append(map(int, raw_input().split()))
scalar(M) |
s596156070 | p02234 | u619765879 | 1453810859 | Python | Python | py | Runtime Error | 0 | 0 | 440 | n = input()
r = [0 for row in range(100)]
c = [0 for row in range(100)]
m = [[0 for col in range(n)] for row in range(n)]
for i in range(n-1):
p[i], p[i+1] = map(int, raw_input().split())
for l in range(2, n):
for i in range(n-1):
j = i + l - 1
m[i][j] = 100000000000
for k in range(j-1):
if m[i][j]>m[i][k]+m[i][k]+m[k+1][j]+p[i-1]*p[k]*[j]:
m[i][j] = m[i][k]+m[i][k]+m[k+1][j]+p[i-1]*p[k]*[j]
print m[1][n] |
s359658913 | p02234 | u824204304 | 1453814864 | Python | Python | py | Runtime Error | 0 | 0 | 395 | n = int(raw_input())
p = [0 for i in xrange(1, 101)]
m = [0 for i in xrange(1, 101)] for j in range(1, 101)
for i in xrange(1, n+1):
p[n-1],p[n] = map(int, raw_input.split())
for k in xrange(2, n+1):
for i in range(1, n-k+2):
j = i+k-1
m[i][j] = float("inf")
for l in range(i,j):
m[i][j] = min(m[i][j], m[i][l]+m[l+1][j]+p[i-1]*p[l]*p[j])
print m[1][n] |
s057931288 | p02234 | u824204304 | 1453814898 | Python | Python | py | Runtime Error | 0 | 0 | 395 | n = int(raw_input())
p = [0 for i in xrange(0, 101)]
m = [0 for i in xrange(0, 101)] for j in range(0, 101)
for i in xrange(1, n+1):
p[n-1],p[n] = map(int, raw_input.split())
for k in xrange(2, n+1):
for i in range(1, n-k+2):
j = i+k-1
m[i][j] = float("inf")
for l in range(i,j):
m[i][j] = min(m[i][j], m[i][l]+m[l+1][j]+p[i-1]*p[l]*p[j])
print m[1][n] |
s337416891 | p02234 | u824204304 | 1453814915 | Python | Python | py | Runtime Error | 0 | 0 | 391 | n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [0 for i in range(0, 101)] for j in range(0, 101)
for i in range(1, n+1):
p[n-1],p[n] = map(int, raw_input.split())
for k in range(2, n+1):
for i in range(1, n-k+2):
j = i+k-1
m[i][j] = float("inf")
for l in range(i,j):
m[i][j] = min(m[i][j], m[i][l]+m[l+1][j]+p[i-1]*p[l]*p[j])
print m[1][n] |
s129779318 | p02234 | u803327846 | 1453817071 | Python | Python | py | Runtime Error | 0 | 0 | 320 | n = input()
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s344233768 | p02234 | u803327846 | 1453817130 | Python | Python | py | Runtime Error | 0 | 0 | 324 | n = input()
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s682760523 | p02234 | u803327846 | 1453817254 | Python | Python | py | Runtime Error | 10 | 6284 | 409 | n = input()
p = [0 for raw in range(101)]
m = [[0 for col in range(n+1)] for row in range(n+1)]
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s461942501 | p02234 | u803327846 | 1453817505 | Python | Python | py | Runtime Error | 10 | 6372 | 399 | n = input()
p = [0 for raw in range(101)]
m = [[0 for col in range(n+1)] for row in range(n+1)]
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s116938058 | p02234 | u393769849 | 1453817510 | Python | Python | py | Runtime Error | 0 | 0 | 424 | n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [[0 for i in range(0, 101)] for j in range(0, 101)
for i in range(1, n + 1):
p[i-1], p[i] = map(int, raw_input().split())
for l in range(2, n + 1):
for i in range(1, n - l + 2):
j = i + l - 1
m[i][j] = float("inf")
for k in range(i, j):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * p[j])
print m[1][n] |
s002894461 | p02234 | u803327846 | 1453817554 | Python | Python | py | Runtime Error | 10 | 6288 | 399 | n = input()
p = [0 for raw in range(101)]
m = [[0 for col in range(n+1)] for row in range(n+1)]
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s199031862 | p02234 | u393769849 | 1453817630 | Python | Python | py | Runtime Error | 0 | 0 | 424 | n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [[0 for i in range(0, 101)] for j in range(0, 101)
for i in range(1, n + 1):
p[i-1], p[i] = map(int, raw_input().split())
for l in range(2, n + 1):
for i in range(1, n - l + 2):
j = i + l - 1
m[i][j] = float("inf")
for k in range(i, j):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * p[j])
print m[1][n] |
s251855046 | p02234 | u803327846 | 1453817800 | Python | Python | py | Runtime Error | 0 | 0 | 309 | n = input()
p = []
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s141118818 | p02234 | u393769849 | 1453818069 | Python | Python | py | Runtime Error | 0 | 0 | 424 | n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [[0 for i in range(0, 101)] for j in range(0, 101)
for i in range(1, n + 1):
p[i-1], p[i] = map(int, raw_input().split())
for l in range(2, n + 1):
for i in range(1, n - l + 2):
j = i + l - 1
m[i][j] = float("inf")
for k in range(i, j):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * p[j])
print m[1][n] |
s582317168 | p02234 | u424209323 | 1453818168 | Python | Python | py | Runtime Error | 0 | 0 | 378 | def matrix(n):
x = [[0 for i in range(n)] for j in range(n))]
for l in range(2, len(n)+1):
for i in range(0, len(n)-l+1):
j = i + l - 1
x[i][j] = min(x[i][k] + x[k+1][j] + X[i][0]*X[k][1]*X[j][1] for k in range(i, j))
print x[0][len(n)-1]
n = input()
X = []
for i in range(n):
X.append(map(int, raw_input().split()))
matrix(X) |
s879767608 | p02234 | u803327846 | 1453818305 | Python | Python | py | Runtime Error | 0 | 0 | 313 | n = int,input()
p = []
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s965270635 | p02234 | u803327846 | 1453818353 | Python | Python | py | Runtime Error | 0 | 0 | 318 | n = int(raw_input())
p = []
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s704045557 | p02234 | u803327846 | 1453818497 | Python | Python | py | Runtime Error | 0 | 0 | 324 | n = int(raw_input())
p = []
m = []
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
s044292186 | p02234 | u803327846 | 1453818616 | Python | Python | py | Runtime Error | 10 | 6452 | 397 | n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [[0 for i in range(0, 101)] for j in range(0, 101)]
for i in range(1,n+1):
m[i][i] = 0
p[i-1], p[i] = map(int, raw_input().split())
for m in range(2,n+1):
for i in range(1,n-m+1+1):
j = i + m - 1
m[i][j] = 999999999999999
for k in range(i,j-1+1):
m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1] * p[k] * p[j])
print m[1][n] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.