Advertisement
Guest User

Untitled

a guest
Dec 9th, 2019
97
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.17 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. void cit(int &n, int &m, int a[11][11])
  6. {
  7. int i, j;
  8. cout<<"m = ";
  9. cin>>m;
  10. cout<<"n = ";
  11. cin>>n;
  12. for(i=1; i<=m; i++)
  13. {
  14. for(j=1; j<=n; j++)
  15. cin>>a[i][j];
  16. }
  17. }
  18.  
  19. void afis(int n, int m, int a[11][11])
  20. {
  21. int i, j;
  22. for(i=1; i<=m; i++)
  23. {
  24. for(j=1; j<=n; j++)
  25. cout<<a[i][j]<<" ";
  26. cout<<endl;
  27. }
  28. }
  29.  
  30. void sortare(int n, int m, int a[11][11], int y)
  31. {
  32. int i, k;
  33. for(i=1; i<=m-1; i++)
  34. for(k=i+1; k<=m; k++)
  35. if(a[i][y]<a[k][y])
  36. {
  37. a[i][y]=a[i][y]+a[k][y];
  38. a[k][y]=a[i][y]-a[k][y];
  39. a[i][y]=a[i][y]-a[k][y];
  40. }
  41. }
  42.  
  43. void interschimbare(int n, int m, int a[11][11])
  44. {
  45. int i, j, aux;
  46. for(i=1; i<=m/2; i++)
  47. for(j=1; j<=n; j++)
  48. {
  49. aux=a[i][j];
  50. a[i][j]=a[m+1-i][j];
  51. a[m+1-i][j]=aux;
  52. }
  53. }
  54.  
  55. int main()
  56. {
  57. int n, m, a[11][11];
  58. cit(n, m, a);
  59. cout<<endl;
  60. afis(n, m, a);
  61. cout<<endl;
  62. interschimbare(n, m, a);
  63. afis(n, m, a);
  64. return 0;
  65. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement