Advertisement
rengetsu

ProcedurProgramavimas_2.13

Mar 12th, 2018
96
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.41 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int main()
  4. {
  5. int q, f[11][11],z=0,a=1,didz=-1000001;
  6. cin>>q;
  7. for(int i=0;i<q;i++)
  8. {
  9.     for(int j=0;j<q;j++)
  10.     {
  11.         cin>>f[i][j];
  12.         if(j!=z && j>q-a)
  13.         {
  14.             if(f[i][j]>didz)
  15.             {
  16.             didz=f[i][j];
  17.             }
  18.         }
  19.     }
  20. z+=1;
  21. a+=1;
  22. }
  23. if(didz==-1000001){cout<<"Ne"<<endl;}else{cout<<didz<<endl;}
  24. return 0;
  25. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement