Advertisement
rengetsu

ProcedurProgramavimas_2.12

Mar 12th, 2018
99
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.51 KB | None | 0 0
  1. #include<iostream>
  2. using namespace std;
  3. int main()
  4. {
  5.  int n, zz[11][11];
  6.  cin>>n;
  7.  for(int i=0;i<n;i++)
  8.  for(int j=0;j<n;j++)
  9.  cin>>zz[i][j];
  10.  int tmp;
  11.  for(int i=0;i<n/2;i++)
  12.  {
  13.  for(int j=i;j<n-1-i;j++)
  14.  {
  15.  tmp = zz[i][j];
  16.  zz[i][j] = zz[n-j-1][i];
  17.  zz[n-j-1][i] = zz[n-i-1][n-j-1];
  18.  zz[n-i-1][n-j-1] = zz[j][n-i-1];
  19.  zz[j][n-i-1] = tmp;
  20.  }
  21.  }
  22. for(int kk=0;kk<n;kk++)
  23. {
  24.     for(int dd=0;dd<n;dd++)
  25.     {
  26.         cout<<zz[kk][dd];
  27.         if(dd<n-1){cout<<" ";}
  28.     }
  29. cout<<endl;
  30. }
  31. return 0;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement