Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int main()
- {
- ifstream f("diagonale.in");
- ofstream g("diagonale.out");
- int m[100][100],n,p[100]={0},s[100]={0},aux;
- f>>n;
- for(int i=0; i<n; i++)
- for(int j=0; j<n; j++)
- f>>m[i][j];
- f.close();
- for(int i=0; i<n-1; i++)
- for(int j=i+1; j<n; j++)
- {
- //sortez diagonala principala
- if(m[j][j]<m[i][i])
- {
- aux=m[i][i];
- m[i][i]=m[j][j];
- m[j][j]=aux;
- }
- }
- for(int i=0; i<n-1; i++)
- for(int j=i+1; j<n; j++)
- {
- //sortez diagonala secundara
- if(m[j][n-1-j]>m[i][n-1-i])
- {
- aux=m[i][n-1-i];
- m[i][n-1-i]=m[j][n-1-j];
- m[j][n-1-j]=aux;
- }
- }
- for(int i=0; i<n; i++)
- {
- for(int j=0; j<n; j++)
- g<<m[i][j]<<" ";
- g<<endl<<endl;
- }
- g.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement