fork download
  1. import random # matrixsortp.py
  2. n=3; m=5; a=[1,1]; b=[1,1]; с=[1]; d=[1];
  3. a=[[random.randrange(0,9) for i in range (m)] for j in range (n)]
  4. b=[[1 for i in range (m)] for j in range (n)]
  5. c=[1 for i in range (m)]
  6.  
  7. for i in range (n):
  8. for j in range (m):
  9. print ("%2d" % a[i][j], end=' ')
  10. b[i][j]=a[i][j]
  11. print()
  12. print()
  13.  
  14. for i in range (n):
  15. for j in range (m):
  16. c[j]=a[i][j]
  17. c.sort(reverse=True)
  18. for j in range (m):
  19. a[i][j]=c[j]
  20.  
  21. for i in range (n):
  22. for j in range (m):
  23. print ("%2d" % a[i][j], end=' ')
  24. print()
  25. print()
  26.  
  27. for i in range (n):
  28. for j in range (m):
  29. print ("%2d" % b[i][j], end=' ')
  30. print()
  31. print()
  32.  
  33. for j in range(m):
  34. stolb = sorted([b[i][j] for i in range(n)])
  35. for i in range(n):
  36. b[i][j] = stolb[n-i-1]
  37.  
  38. for i in range (n):
  39. for j in range (m):
  40. print ("%2d" % b[i][j], end=' ')
  41. print()
  42.  
Success #stdin #stdout 0.1s 14284KB
stdin
Standard input is empty
stdout
 6  1  2  4  1 
 2  5  3  2  5 
 8  5  5  0  5 

 6  4  2  1  1 
 5  5  3  2  2 
 8  5  5  5  0 

 6  1  2  4  1 
 2  5  3  2  5 
 8  5  5  0  5 

 8  5  5  4  5 
 6  5  3  2  5 
 2  1  2  0  1