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. d=[1 for i in range (n)]
  7.  
  8. for i in range (n):
  9. for j in range (m):
  10. print ("%2d" % a[i][j], end=' ')
  11. b[i][j]=a[i][j]
  12. print()
  13. print()
  14.  
  15. for i in range (n):
  16. for j in range (m):
  17. c[j]=a[i][j]
  18. c.sort(reverse=True)
  19. for j in range (m):
  20. a[i][j]=c[j]
  21.  
  22. for i in range (n):
  23. for j in range (m):
  24. print ("%2d" % a[i][j], end=' ')
  25. print()
  26. print()
  27.  
  28. for i in range (n):
  29. for j in range (m):
  30. print ("%2d" % b[i][j], end=' ')
  31. print()
  32. print()
  33.  
  34. for j in range (m):
  35. for i in range (n):
  36. d[i]=b[i][j]
  37. d.sort(reverse=True)
  38. for i in range (n):
  39. b[i][j]=d[i]
  40.  
  41. for i in range (n):
  42. for j in range (m):
  43. print ("%2d" % b[i][j], end=' ')
  44. print()
  45.  
Success #stdin #stdout 0.09s 14256KB
stdin
Standard input is empty
stdout
 1  3  1  2  0 
 2  0  5  4  1 
 6  8  2  8  4 

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

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

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