Cod sursa(job #253852)
Utilizator | Antoanela Siminiuc antoanela | Data | 6 februarie 2009 12:56:58 |
---|---|---|---|
Problema | Grendizer | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Stelele Informaticii 2009, clasele 9-10, ziua 1 | Marime | 0.84 kb |
#include <cstdio>
#define lm 100010
int n,m,x,y,r, a[lm], b[lm];
int main()
{
freopen("grendizer.in","r",stdin);
freopen("grendizer.out","w",stdout);
scanf("%d %d", &n,&m);
int i,j,k1,k2,cont;
for (i=1; i<=n; i++) scanf("%d %d",&a[i],&b[i]);
for (i=1; i<=m; i++)
{
scanf("%d %d %d",&x,&y,&r);
cont=0;
for (j=1; j<=n; j++)
{
k1=x-a[j];
if (k1<0) k1=-k1;
k2=y-b[j];
if (k2<0) k2=-k2;
if (k1+k2==r) cont++;
}
printf("%d\n",cont);
}
fclose(stdin);
fclose(stdout);
return 0;
}