Cod sursa(job #254669)
Utilizator | Data | 7 februarie 2009 13:40:10 | |
---|---|---|---|
Problema | Kdrum | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Stelele Informaticii 2009, clasele 9-10, ziua 2 | Marime | 0.48 kb |
#include<stdio.h>
#include<math.h>
long d1,d2,n,m,k,x,y,i,j,x2,y2,dist,a[101][101];
int main()
{
freopen("kdrum.in","r",stdin);
freopen("kdrum.out","w",stdout);
scanf("%ld%ld%ld",&n,&m,&k);
scanf("%ld%ld%ld%ld",&x,&y,&x2,&y2);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
scanf("%ld",&a[i][j]);
d1=x2-x;
d2=y2-y;
dist=fabs(d1)+1+fabs(d2);
printf("%ld",dist);
return 0;
}