Cod sursa(job #254053)
Utilizator | Data | 6 februarie 2009 17:26:37 | |
---|---|---|---|
Problema | Grendizer | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.58 kb |
#include<stdio.h>
#define MAX_MOD 100001
long double X[MAX_MOD],Y[MAX_MOD],x,y,r,n,m;
long nr,i,j;
inline long double abs(long double x)
{
return ( (x) > 0 ? (x) : (-x) );
}
int main()
{freopen("grendizer.in","rt",stdin);
freopen("grendizer.out","wt",stdout);
scanf("%Lf %Lf",&n,&m);
for(i=1;i<=n;++i) scanf("%Lf %Lf",&X[i],&Y[i]);
for(i=1;i<=m;++i)
{scanf("%Lf %Lf %Lf",&x,&y,&r);
nr=0;
for(j=1;j<=n;++j)
if(abs(X[j]-x)+abs(Y[j]-y)==r) nr++;
printf("%ld\n",nr);
}
return 0;
}