Cod sursa(job #253990)
Utilizator | Data | 6 februarie 2009 13:59:48 | |
---|---|---|---|
Problema | Grendizer | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Stelele Informaticii 2009, clasele 9-10, ziua 1 | Marime | 0.53 kb |
#include<stdio.h>
#define N 100000
int n,m,v[N][3];
void citire()
{
for(int i=1;i<=n;++i)
for(int j=1;j<=2;++j)
scanf("%d",&v[i][j]);
}
void solve()
{
int x,y,neg1,r,neg2,poz1,rasp=0,poz2;
for(int i=1;i<=m;++i)
{
scanf("%d%d%d",&x,&y,&r);
for(int i=1;i<=n;++i)
if((x-v[i][1])+(y-v[i][2])<=r)
++rasp;
printf("%d\n",rasp);
rasp=0;
}
}
int main()
{
freopen("grendizer.in","r",stdin);
freopen("grendizer.out","w",stdout);
scanf("%d%d",&n,&m);
citire();
solve();
return 0;
}