Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int a[200][200],b[200][200],n;
- int left()
- {
- int i,j;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- {
- b[n-j+1][i]=a[i][j];
- }
- return 0;
- }
- int right()
- {
- int i,j;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- {
- b[j][n-i+1]=a[i][j];
- }
- return 0;
- }
- int nshift(int x,int dir)
- {
- int i,j,u;
- x%=4;
- if(!dir)
- for(u=1;u<=x;u++)
- {
- left();
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- {
- a[i][j]=b[i][j];
- }
- }
- else
- for(u=1;u<=x;u++)
- {
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- {
- a[i][j]=b[i][j];
- }
- right();
- }
- return 0;
- }
- int main()
- {
- ifstream fin ("hmm.in");
- ofstream fout ("hmm.out");
- int i,j,nr,t;
- fin>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++)
- {
- fin>>a[i][j];
- }
- fin>>nr;
- fin>>t; ///nr=de cate ori rotim si t directia 0->stanga 1->dreapta
- nshift(nr,t);
- for(i=1;i<=n;i++)
- {
- for(j=1;j<=n;j++)
- {
- fout<<b[i][j]<<' ';
- }
- fout<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement