Cod sursa(job #253896)
| Utilizator | Data | 6 februarie 2009 13:26:02 | |
|---|---|---|---|
| Problema | Grendizer | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Stelele Informaticii 2009, clasele 9-10, ziua 1 | Marime | 0.53 kb |
#include<stdio.h>
#include<stdlib.h>
#define Nmax 100003
FILE*f=fopen("grendizer.in","r");
FILE*g=fopen("grendizer.out","w");
int x[Nmax], y[Nmax];
int n,m;
int nr(int a, int b, int r)
{
int i;
int k=0;
for(i=1;i<=n;++i)
{
if ( abs(x[i]-a) + abs(y[i]-b) == r) ++k;
}
return k;
}
int main()
{
fscanf(f,"%d%d",&n,&m);
int i,a,b,r;
for(i=1;i<=n;++i) fscanf(f,"%d%d",&x[i],&y[i]);
while(m--)
{
fscanf(f,"%d%d%d",&a,&b,&r);
fprintf(g,"%d\n",nr(a,b,r));
}
return 0;
}
