Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Second - easy without import solution in Clear category for Weak Point by albataev
def weak_point(matrix):
M=matrix
sum_strok = [sum(M[index_stroka]) for index_stroka in range (len(M))]
sum_stolb = [sum([stroka[i] for stroka in M]) for i in range(0,len(M[0]))]
min_strok = sum_strok.index(min(sum_strok))
min_stolb = sum_stolb.index(min(sum_stolb))
return min_strok, min_stolb
#return 0, 0 # [0, 0]
if __name__ == '__main__':
#These "asserts" using only for self-checking and not necessary for auto-testing
assert isinstance(weak_point([[1]]), (list, tuple)), "The result should be a list or a tuple"
assert list(weak_point([[7, 2, 7, 2, 8],
[2, 9, 4, 1, 7],
[3, 8, 6, 2, 4],
[2, 5, 2, 9, 1],
[6, 6, 5, 4, 5]])) == [3, 3], "Example"
assert list(weak_point([[7, 2, 4, 2, 8],
[2, 8, 1, 1, 7],
[3, 8, 6, 2, 4],
[2, 5, 2, 9, 1],
[6, 6, 5, 4, 5]])) == [1, 2], "Two weak point"
assert list(weak_point([[1, 1, 1],
[1, 1, 1],
[1, 1, 1]])) == [0, 0], "Top left"
May 19, 2016
