Pagini recente » Cod sursa (job #1748863) | Cod sursa (job #1943440) | Cod sursa (job #1885197) | Cod sursa (job #1940324) | Cod sursa (job #1783377)
#include <fstream>
using namespace std;
ifstream fin("spirala.in");
ofstream fout("spirala.out");
long long m,n,i,j,a[101][101],v[10000],k,dif,x,sol1,q;
int f(int n1, int m1,int dif1){
int sol=0;
for(int i=2;i<=m1-1;i++){
x=a[1][i];
if(a[1][i+1]-a[1][i]!=dif1&&sol==0){
fout<<"NU"<<"\n"<<a[1][i]<<" "<<a[1][i+1];
sol=1;
}
}
for(int i=2;i<=n1;i++){
x=a[i][m1];
if(a[i][m1]-a[i-1][m1]!=dif1&&sol==0){
fout<<"NU"<<"\n"<<a[i-1][m1]<<" "<<a[i][m1];
sol=1;
}
}
for(i=m1;i>=2;i--){
x=a[n1][i];
if(a[n1][i-1]-a[n1][i]!=dif1&&sol==0){
fout<<"NU"<<"\n"<<a[n1][i]<<" "<<a[n1][i-1];
sol=1;
}
}
for(i=n1;i>2;i--){
x=a[i][1];
if(a[i-1][1]-a[i][1]!=dif1&&sol==0){
fout<<"NU"<<"\n"<<a[i][1]<<" "<<a[i-1][1];
sol=1;
}
}
if(a[2][2]-a[2][1]!=dif1&&sol==0){
fout<<"NU"<<"\n"<<a[2][1]<<" "<<a[2][2];
sol=1;
}
int k=0;
int v[10000];
for(int i=2;i<=n-1;i++){
for(int j=2;j<=m-1;j++){
v[++k]=a[i][j];
}
}
k=0;
for(i=1;i<=n-2;i++){
for(int j=1;j<=m-2;j++){
a[i][j]=v[++k];
}
}
if(sol==0){
sol1=0;
}
else{
sol1=1;
}
if(n1-2>=1&&m1-2>=1&&sol==0){
f(n1-2,m1-2,dif1);
}
}
int main(){
fin>>n>>m;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
fin>>a[i][j];
}
}
dif=a[1][2]-a[1][1];
f(n,m,dif);
if(sol1==0){
fout<<"DA"<<"\n"<<;
}
return 0;
}