Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int a[101][101],n,sn=0,se=0,sv=0,ss=0;
- void citire()
- {
- cin>>n;
- for(int i=1;i<=n;i++)
- {
- for(int j=1;j<=n;j++)
- {
- cin>>a[i][j];
- }
- }
- /*void rezolvare();
- {
- ///parcurgerea zonei NORD
- for(int i=1;i<=n/2;i++)
- {
- for(int j=i+1;j<=n-i;j++)
- {
- sn+=a[i][j];
- }
- }
- ///parcurgerea zonei SUD
- for(int i=n/2+1;i<=n;i++)
- {
- for(int j=n+2-i;j<=i-1;j++)
- {
- ss+=a[i][j];
- }
- }
- ///parcurgerea zonei VEST
- for(int j=1;j<=n/2;j++)
- {
- for(int i=j+1;i<=n-j;i++)
- {
- sv+=a[i][j];
- }
- }
- ///paruregerea zonei EST
- for(int j=n/2+1;j<=n;j++)
- {
- for(int i=n+2-i;i<=j-1;i++)
- {
- se+=a[i][j];
- }
- }
- int v[5];
- v[1]=ss;
- v[2]=sn;
- v[3]=sv;
- v[4]=se;
- for(int i=1;i<=4;i++)
- {
- for(int j=i+1;j<=4;j++)
- {
- if(v[i]>v[j])
- {
- swap(v[i],v[j]);
- }
- }
- }
- for(int i=1;i<=4;i++)
- cout<<v[i]<<" ";
- }*/
- void rezolvare()///metoda 2
- {
- int sn,ss,sv,se;
- for(int i=1;i<=n;i++)
- {
- for(int j=1;j<=n;j++)
- {
- if(i<j)///deasupra diagonalei principale
- {
- if(i+j<n+1)///deasupra diagonalei secundare
- sn+=a[i][j];
- else
- {
- if(i+j>n+1)///sub diagonala principala
- {
- se+=a[i][j];
- }
- }
- }
- else
- {
- if(i>j)///sub diagonala principala
- {
- if(i+j>n+1)///sub diag sec
- ss+=a[i][j];
- else
- {
- if(i+j<n+1)
- {
- sv+=a[i][j];
- }
- }
- }
- }
- }
- }
- int v[5];
- v[1]=ss;
- v[2]=sn;
- v[3]=sv;
- v[4]=se;
- for(int i=1;i<=4;i++)
- {
- for(int j=i+1;j<=4;j++)
- {
- if(v[i]>v[j])
- {
- swap(v[i],v[j]);
- }
- }
- }
- for(int i=1;i<=4;i++)
- cout<<v[i]<<" ";
- }
- int main()
- {
- citire();
- rezolvare();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement