BluePink
XHost
Gazduire site-uri web
nelimitata ca spatiu si trafic lunar la doar 15 eur / an.
Inregistrare domenii
.ro .com .net .org .info .biz .com.ro .org.ro la preturi preferentiale. Pentru oferta detaliata accesati site-ul
BluePink
Home
Pr. Celor "N" Dame
Pr. "Saritura Calului"
Pr. Labirintului
Pr. Bilei
Contact
Site Map
Problema Bilei
Enunt
Algoritm
Reprezentare Solutie
Program C++
Program C++
#include<iostream.h>;
#include<math.h>
int sol[100][3], t[10][10], m ,n,i, j,lin, col;
void tipar(int k)
{
cout<<" solutie"<<endl;
for(i=1;i<=k-1;i++)
cout<<sol[i][1]<<" ";
cout<<sol[i][2]<<endl;
}
void back(int k, int lin, int col)
{
if (lin==0 || lin==m+1 || col==0 || col==n+1)
tipar (k);
else
{
sol[k][0]=0;
sol[k][1]=lin;
sol[k][2]=col;
while (sol[k][0]<4)
{
sol[k][0]++;
switch (sol[k][0])
{
case 1:
if (l[lin-1][col] < t[lin][col])
back(k+1, lin-1, col);
break;
case 2:
if (l[lin][col+1] < t[lin][col])
back(k+1, lin, col+1);
break;
case 3:
if (l[lin+1][col] < t[lin][col])
back(k+1, lin+1, col);
break;
case 4:
if (l[lin][col-1] < t[lin][col])
back(k+1, lin, col-1);
break;
}
}
}
}
if(k==n+1)
main()
{
cout<<"m="; cin>>m;
cout<<"n="; cin>>n;
for(i=1;i<=m;i++)
for(j=1;j<=n;j++)
{
cout<<"t["<<i<<"" , "<<j<<"]=";
cin>>t[i][j];
}
cout<<"lin=";
cin>>lin;
cout<<"col=";
cin>>col;
back(1,lin,col);
}