1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40
| def ismatrice(m):
c=len(m)
h=len(m[0])
for i in range(c):
if type(m[i])!= list or len(m[i])!=h:
return False
return True and print("matrice avec",c,"colones et",h,"lignes")
#exercice 8
def sousmatrice(m,l1,l2,c1,c2):
if l1 > len(m[0]) or l2 > len(m[0]) or c1 > len(m) or c2 > len(m):
return False
elif l1 < 0 or l2 < 0 or c1 < 0 or c2 < 0:
return False
else:
P=m
for i in range(len(m)):
P[i]=m[i][l1:l2]
return P[c1:c2]
def calculmatrice(m,l1,l2,c1,c2):
n=sousmatrice(m,l1,l2,c1,c2)
S=0
for i in range(len(n)):
for j in range(len(n[0])):
S=S+n[i][j]
return S
#complexité de l'algorithme: en (l2-l1)*(c2-c1)
#exercice 9
def table_sommation(m):
S=m
for j in range(len(m)):
for i in range(len(m[0])):
S[j][i]=calculmatrice(m,0,i+1,0,j+1)
return S |
Partager