Cod sursa(job #253857)
| Utilizator | Data | 6 februarie 2009 13:00:43 | |
|---|---|---|---|
| Problema | Grendizer | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Stelele Informaticii 2009, clasele 9-10, ziua 1 | Marime | 0.62 kb |
#include<stdio.h>
FILE *f=fopen("grendizer.in","r"),
*g=fopen("grendizer.out","w");
int a[100007][2];
int n,i,j,m,x,y,r,k;
int abs(int x)
{ if(x>0) return x;
return -x;
}
int man(int x,int y,int x2,int y2)
{ return abs(x-x2)+abs(y-y2);
}
int main()
{ fscanf(f,"%d %d",&n,&m);
for(i=1;i<=n;++i) fscanf(f,"%d %d",&a[i][0],&a[i][1]);
for(i=1;i<=m;++i) { k=0;
fscanf(f,"%d %d %d",&x,&y,&r);
for(j=1;j<=n;++j) if(man(x,y,a[j][0],a[j][1])==r) ++k;
fprintf(g,"%d\n",k);
}
fclose(f);
fclose(g);
return 0;
}
