Cod sursa(job #253657)
| Utilizator | Data | 6 februarie 2009 10:31:04 | |
|---|---|---|---|
| Problema | Grendizer | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Stelele Informaticii 2009, clasele 9-10, ziua 1 | Marime | 0.64 kb |
#include<stdio.h>
#include<math.h>
long n,m,i,j,poq,r,xi,yi,x[100001],y[100001];
int main()
{
freopen("grendizer.in","r",stdin);
freopen("grendizer.out","w",stdout);
scanf("%ld%ld",&n,&m);
for(i=1;i<=n;i++)
scanf("%ld%ld",&x[i],&y[i]);
for(i=1;i<=m;i++)
{
scanf("%ld%ld%ld",&xi,&yi,&r);
for(j=1;j<=n;j++)
if(fabs(xi-x[j])+fabs(yi-y[j])==r)
poq++;
printf("%ld\n",poq);
poq=0;
}
return 0;
}
