Pagini recente » Cod sursa (job #1368431) | Cod sursa (job #2413725) | Cod sursa (job #1010589) | Cod sursa (job #564876) | Cod sursa (job #1744466)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("spirala.in");
ofstream fout("spirala.out");
long long v[101][101],a[10201];
int main()
{
long long nrlin,nrcol,i,j,is,js,ij,jj,t,d,ok;
fin>>nrlin>>nrcol;
for(i=1;i<=nrlin;i++)
for(j=1;j<=nrcol;j++)
fin>>v[i][j];
t=0;
is=1;
js=1;
ij=nrlin;
jj=nrcol;
while(t<nrlin*nrcol)
{
for(j=js;j<=jj;j++)
{
if(t<nrlin*nrcol)
{
t++;
a[t]=v[is][j];
}
}
for(i=is+1;i<=ij;i++)
{
if(t<nrlin*nrcol)
{
t++;
a[t]=v[i][jj];
}
}
for(j=jj-1;j>=js;j--)
{
if(t<nrlin*nrcol)
{t++;
a[t]=v[ij][j];
}
}
for(i=ij-1;i>is;i--)
{
if(t<nrlin*nrcol)
{
t++;
a[t]=v[i][js];
}
}
is++;
js++;
ij--;
jj--;
}
d=a[1]-a[2];
for(i=1;i<=t;i++)
cout<<a[i]<<" ";
ok=1;
i=1;
while(ok==1 && i<t)
{
if((a[i]-a[i+1])!=d)
ok=0;
i++;
}
i--;
if(ok==1)
{
fout<<"DA"<<endl;
fout<<a[t];
}
else
{
fout<<"NU"<<endl;
fout<<a[i]<<" "<<a[i+1];
}
return 0;
}