Cod sursa(job #431525)

Utilizator btamasyaBorsos Tamas btamasya Data 1 aprilie 2010 09:18:48
Problema Kdrum Scor 0
Compilator cpp Status done
Runda Arhiva de probleme Marime 0.95 kb
#include<iostream.h>
#include<fstream.h>
int a[53][53],x2,y2,max=0;
void bizz (int i,int j, int s)
{
	int b;
	if ((a[i][j]==0)||(a[i][j]==-1)||((i==x2)&&(j==y2)))
	{
		if ((i==x2)&&(j==y2)) if (s>max) max=s;
	}
	else 
	{
		b=a[i][j];
		a[i][j]=0;
		bizz (i+1,j,s+1);
		bizz (i-1,j,s+1);
		bizz (i,j+1,s+1);
		bizz (i,j-1,s+1);
		a[i][j]=b;
	}
}
void nezz (int i,int j,int k,int s)
{
	int b;
	if ((a[i][j]==0)||(a[i][j]==(-1)));
	else 
	{
		if (k%a[i][j]==0) k=k/a[i][j];
		b=a[i][j];
		a[i][j]=0;
		{if (k==1) bizz(i,j,s);}
		nezz (i+1,j,k,s+1);
		nezz (i-1,j,k,s+1);
		nezz (i,j+1,k,s+1);
		nezz (i,j-1,k,s+1);
		a[i][j]=b;
	}
}
int main()
{
	int x1,y1,i,j,n,m,k;
	fstream f,g,;
	f.open("kdrum.in",ios::in);
	g.open("kdrum.out",ios::out);
	f>>n>>m>>k;
	f>>x1>>y1>>x2>>y2;
	for (i=0;i<n+2;i++)
		for (j=0;j<m+2;j++)
			a[i][j]=-1;
	for (i=1;i<=n;i++)
		for (j=1;j<=m;j++)
			f>>a[i][j];
	nezz (x1,y1,k,1);
	g<<max;
}