Pagini recente » Cod sursa (job #1859321) | Cod sursa (job #614918) | Diferente pentru implica-te/arhiva-educationala intre reviziile 25 si 26 | Cod sursa (job #1376650) | Cod sursa (job #2088656)
#include <fstream>
#include <queue>
#include <iostream>
using namespace std;
ifstream fin("kdrum.in");
ofstream fout("kdrum.out");
int n,m,k,a[55][55],px,py,fx,fy;
int d1[4]= {1,0,-1,0};
int d2[4]= {0,1,0,-1};
queue<int> Cx,Cy,Cv,Cq;
int CMMDC(int x,int y)
{
int r;
while(y)
{
r=x%y;
x=y;
y=r;
}
return x;
}
int main()
{
int i,j,cx,cy,cv,cq;
fin>>n>>m>>k;
fin>>px>>py>>fx>>fy;
for(i=1; i<=n; i++)
for(j=1; j<=m; j++)
fin>>a[i][j];
Cx.push(px);
Cy.push(py);
Cv.push(CMMDC(k,a[px][py]));
Cq.push(1);
while(Cx.front()!=fx||Cy.front()!=fy||Cv.front()%k!=0)
{
cx=Cx.front();
cy=Cy.front();
cv=Cv.front();
cq=Cq.front();
Cx.pop();
Cy.pop();
Cv.pop();
Cq.pop();
for(i=0; i<4; i++)
{
if(cx+d1[i]>=1&&cx+d1[i]<=n&&cy+d2[i]>=1&&cy+d2[i]<=m)
{
Cq.push(cq+1);
Cx.push(cx+d1[i]);
Cy.push(cy+d2[i]);
Cv.push(cv*CMMDC(k/cv,a[cx+d1[i]][cy+d2[i]]));
}
}
}
fout<<Cq.front();
}