Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- ///PARCURGEREA IN SPIRALA A MATRICEI DREPTUNGHIULARE
- #include <iostream>
- using namespace std;
- int main()
- {
- int a[100][100],n,m,i,j,k,l,c,r,min;
- cout<<"m=";
- cin>>m;
- cout<<"n=";
- cin>>n;
- for(i=1;i<=m;i++)
- for(j=1;j<=n;j++)
- {
- cout<<"a["<<i<<"]["<<j<<"]=";
- cin>>a[i][j];
- }
- for(i=1;i<=m;i++)
- {
- cout<<endl;
- for(j=1;j<=n;j++)
- cout<<a[i][j]<<' ';
- }
- cout<<endl<<endl;
- if(m<n)
- {
- min=m;
- l=1;
- }
- else
- if(n<m)
- {
- min=n;
- c=1;
- }
- r=min/2;
- for(k=1;k<=r;k++)
- {
- for(j=k;j<=n-k+1;j++)
- cout<<a[k][j]<<' ';
- for(i=k+1;i<=m-k+1;i++)
- cout<<a[i][n+1-k]<<' ';
- for(j=n-k;j>=k;j--)
- cout<<a[m+1-k][j]<<' ';
- for(i=m-k;i>=k+1;i--)
- cout<<a[i][k]<<' ';
- }
- if(min%2!=0)
- {
- if(c==1)
- for(i=r+1;i<=m-r;i++)
- cout<<a[i][(n+1)/2]<<' ';
- if(l==1)
- for(j=r+1;j<=n-r;j++)
- cout<<a[(m+1)/2][j]<<' ';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement