#include <iostream>

using namespace std;

int main()

int a[100][100],i,j,n,s=0;

cin>>n;

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

cin>>a[i][j];

if((i+1==j) || (i-1==j))

s=s+a[i][j];

cout<<s;

return 0;

#include <iostream>

using namespace std;

int main()

int a[100][100],i,j,n,max=-1000,c=0;

cin>>n;

for(i=1;i<=n;i++)
 for(j=1;j<=n;j++)

{cin>>a[i][j];

if(a[i][j]>max)

max=a[i][j];}

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

if(a[i][j]==max)

c=c+1;

cout<<c;

return 0;

#include <iostream>

using namespace std;

int main()

int a[100][100],i,j,m,n,c=0,p=0;

cin>>n>>m;

for(i=1;i<=n;i++)

for(j=1;j<=m;j++)

cin>>a[i][j];

for(i=1;i<=n;i++)

{c=0;

for(j=2;j<=m;j++)

if(a[i][1]==a[i][j])
 c=c+1;

if(c==m-1)

p=p+1;}

cout<<p;

return 0;

#include <iostream>

using namespace std;

int main()

int a[100][100],i,j,n;

cin>>n;

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

a[i][j]=i+j;

for(i=1;i<=n;i++)

{for(j=1;j<=n;j++)

cout<<a[i][j]<<" ";

cout<<endl;

return 0;
}

#include <iostream>

using namespace std;

int main()

int a[100][100],i,j,n,c=0,ma;

cin>>n;

for(i=1;i<=n;i++)

for(j=1;j<=n;j++)

{cin>>a[i][j];

if((i==j)&& (a[i][j]>0))

c=c+1;

ma=a[i][j]/c;

cout<<ma;

else

cout<<"NU EXISTA";

return 0;

#include <iostream>
using namespace std;

int main()

int a[100][100],m,n,i,j,c=0,p=1,k;

cin>>n>>m>>k;

for(i=1;i<=n;i++)

for(j=1;j<=m;j++)

cin>>a[i][j];

for(j=1;j<=m;j++)

{c=0;

for(i=1;i<=n;i++)

if(a[i][j]==k)

c=c+1;

if(c!=0)

p=p*j;}

cout<<j;

return 0;

#include <iostream>

using namespace std;

int main()

int a[100][100],n,m,j,i,p;

cin>>n>>m;

for(i=1;i<=n;i++)

{p=n-i+1;

for(j=1;j<=m;j++)

a[i][j]=p+(j-1)*n;}

for(i=1;i<=n;i++)

{for(j=1;j<=m;j++)

cout<<a[i][j]<<" " ;

cout<<endl;}

return 0;

#include <iostream>

using namespace std;

int main()

int v[100],i,n,s=0;

cin>>n;

for(i=1;i<=n;i++)
 cin>>v[i];

for(i=1;i<=n;i++)

if(v[i]%2==1)

{ s=s+v[i];

break;

for(i=n;i>=1;i--)

if(v[i]%2==1)

{ s=s+v[i];

break;}

cout<<s;

return 0;

#include <iostream>

using namespace std;

int main()

int v[100],i,n,c=0,p[100], max=0,k=0;

cin>>n;

for(i=1;i<=n;i++)

{cin>>v[i];

if(v[i]==0)
c=c+1;

else

{k=k+1;

p[k]=c;

c=0;

}}

for(i=1;i<=k;i++)

if(p[i]>max)

max=p[i];

cout<<max;

return 0;

#include <iostream>

using namespace std;

int main()

{int v[100],i,n,c=1,p[100],k=0,max=0;

cin>>n;

for(i=1;i<=n;i++)

cin>>v[i];

for(i=2;i<=n;i++)

if(v[i-1]==v[i])

c=c+1;
else

{k=k+1;

p[k]=c;

c=1;}

for(i=1;i<=k;i++)

if(p[i]>max)

max=p[i];

cout<<max;

return 0;