Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- using namespace std;
- int main(){
- ifstream f1("atestat.in");
- ofstream f2("atestat.out");
- int m[50][50],i,j,test=0,maxim,n,aux;
- f1>>n;
- for(i=1;i<=n;i++)
- for(j=1;j<=n;j++){
- f1>>m[i][j];
- if(j == (n-i+1)){
- if(test == 0){
- maxim=m[i][j];
- test=1;
- }
- else
- if(maxim < m[i][j])
- maxim=m[i][j];
- }
- }
- for(i=1;i<=n-1;i++)
- for(j=i+1;j<=n;j++)
- if( m[i][i] > m[j][j]){
- aux=m[i][i];
- m[i][i]=m[j][j];
- m[j][j]=aux;
- }
- f2<<maxim<<endl;
- for(i=1;i<=n;i++){
- for(j=1;j<=n;j++)
- f2<<m[i][j]<<" ";
- f2<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement