infoarena

#include<stdio.h>
int a[101][101],i,j,n,m,en,o,dif;
char b[101][101];
int main()
{
	freopen("spirala.in","r",stdin);
	freopen("spirala.out","w",stdout);
	scanf("%d %d",&n,&m);
	for (i=1;i<=n;i++)
		for (j=1;j<=m;j++)
			scanf("%d",&a[i][j]);
	dif=a[1][1]-a[1][2];
	for (en=n*m,o=0; ; )
	{
		for (i=1+o;i<m-o;++i)
		{
			b[1+o][i]=b[1+o][i+1]='1';
			if (a[1+o][i]-a[1+o][i+1]!=dif&&i+1<=m)
			{
				printf("NU\n%d %d\n",a[1+o][i],a[1+o][i+1]);
				return 0;
			}
			--en;
		}
		if (en<2) break;
		for (j=1+o;j<m-o;++j)
		{
			b[j][m-o]=b[j+1][m-o]='1';
			if (a[j][m-o]-a[j+1][m-o]!=dif&&j+1<=n)
			{
				printf("NU\n%d %d\n",a[j][m-o],a[j+1][m-o]);
				return 0;
			}
			--en;
		}
		if (en<2) break;
		for (i=m-o;i>1+o;--i)
		{
			b[n-o][i]=b[n-o][i-1]='1';
			if (a[n-o][i]-a[n-o][i-1]!=dif&&i-1>1+o)
			{
				printf("NU\n%d %d\n",a[n-o][i],a[n-o][i-1]);
				return 0;
			}
			--en;
		}
		if (en<2) break;
		for (j=n-o;j>1+o;--j)
		{
			b[j][1+o]=b[j-1][1+o]='1';
			if (a[j][1+o]-a[j-1][1+o]!=dif&&j-1>1+o)
			{
				printf("NU\n%d %d\n",a[j][1+o],a[j-1][1+o]);
				return 0;
			}
			--en;
		}
		if (en<2) break;
			++o;
	}
	for (i=1;i<=n;i++)
		for (j=1;j<=m;j++)
			if (b[i][j]==0)
			{
				printf("DA\n%d\n",a[i][j]);
				return 0;
			}
}

#include <iostream>
#include <fstream>
using namespace std;
int a[100][100], a2[100][100],v[10001];
int main()
{
ifstream g("spirala.in");
ofstream h("spirala.out");
int n, m, x=1, r,ind=1;
g>>n;
g>>m;
for(int i=1;i<=n;i++)
for(int j=1;j<=m;j++)
g>>a[i][j];
r=a[1][2]-a[1][1];
for(int k=0;k<=(n*m)/2;k++)
{
for(int i=1+k;i<=m-k;i++) {int l=k+1; if(!a2[l][i]) 
{v[x]=a[l][i];x++; a2[l][i]=1;}}
for(int j=2+k;j<=n-k;j++) {int l=m-k; if(!a2[j][l]) 
{v[x]=a[j][l];x++; a2[j][l]=1;}}
for(int i=m-1-k;i>=1+k;i--) {int l=n-k; if(!a2[l][i]) 
{v[x]=a[l][i];x++; a2[l][i]=1;}}
for(int j=n-1-k;j>=2+k;j--) {int l=k+1; if(!a2[j][l]) 
{v[x]=a[j][l];x++; a2[j][l]=1;}}
}
x--;
for(int i=1;i<x;i++)
if(v[i]+r!=v[i+1]){ ind=0; h<<"NU\n"<<v[i]<<" "<<v[i+1];break;}
if (ind) h<<"DA\n"<<v[x];
return 0;
}

#include <fstream>
#include <iostream>
using namespace std;
ifstream f("spirala.in");
ofstream g("spirala.out");
 
int n,m;
long C[100001];
int c=1;
long A[1500][1500];
bool checked[101][101]; /// In cazul in care elementele au fost parcurese, acestea nu vor mai fi adaugate in vectorul C
long a,b; /// Elementele care nu indeplinesc progresia
 
bool Verificare(){
 
    bool ok=1;
    long dif;
 
    dif=C[2]-C[1];
    for (int i=3;i<c && ok;i++)
        if (C[i]-C[i-1]!=dif){
            ok=0;
            a=C[i];
            b=C[i-1];
        }
 
    return ok;
}
 
void Matrice (short int x1,short int y1,short int x2,short int y2){
 
    while (x1<=x2+1 && y1<=y2+1){
 
        for (short int i=y1;i<=y2;i++){
            if (!checked[x1][i]){
                C[c]=A[x1][i];
                c++;
                checked[x1][i]=1;
            }
        }
        for (short int i=x1+1;i<x2;i++){
            if (!checked[i][y2]){
                C[c]=A[i][y2];
                c++;
                checked[i][y2]=1;
            }
        }
        for (short int i=y2;i>=y1;i--){
            if (!checked[x2][i]){
                C[c]=A[x2][i];
                c++;
                checked[x2][i]=1;
            }
        }
        for (short int i=x2-1;i>x1;i--){
            if (!checked[i][y1]){
                C[c]=A[i][y1];
                c++;
                checked[i][y1]=1;
            }
        }
 
        x1++;
        y1++;
        x2--;
        y2--;
    }
}
 
int main(){
 
    f>>n>>m;
    for (short int i=1;i<=n;i++)
        for (short int j=1;j<=m;j++)
            f>>A[i][j];
    f.close();
 
    Matrice(1,1,n,m);
 
    if (Verificare()){
        g<<"DA\n";
        g<<C[c-1];
    }
    else{
        g<<"NU\n";
        g<<a<<"\n"<<b;
    }
 
    for (int i=1;i<c;i++)
        cout<<C[i]<<endl;
 
    g.close();
 
    return 0;
}