def f(L):
assert(len(L) > 0)
i = -1
for j in range(len(L)-1, -1, -1):
if L[j] <= L[i]:
i = j
return i
def g(L):
assert(len(L) > 0)
return ___________________
L.index(min(L))
def f(L):
result = True
for v in range(len(L)):
result = result and (v in L)
return result
def g(L):
return ___________________ == list(range(len(L)))
sorted(L)
def f(L):
assert(0 <= v <= 9 for v in L)
result = 0
for v in L:
result = 10 * result + v
return result
def g(L):
assert(0 <= v <= 9 for v in L)
M = [str(v) for v in L]
return ___________________
int(''.join(M))
def f(L, M):
assert(len(L) == len(M))
N = [ ]
for i in range(len(L)):
N.append((L[i], M[i]))
for x, y in N:
if x % y != 0:
return False
return True
def g(L, M):
assert(len(L) == len(M))
return ___________________
sum([L[i] % M[i] for i in range(len(L))]) == 0
def f(L):
x = sum(L[:2])
for i in range(2, len(L)):
if L[i] != x:
return False
x += L[i]
return True
def g(L):
return False not in [ ___________________ for i in range(2, len(L))]
Here are two possible solutions:
L[i] == sum(L[:i])L[i] == sum(L[:2]) * 2**(i-2)