Pagini recente » Cod sursa (job #1636274) | Cod sursa (job #1357015) | Diferente pentru problema/hidden_points intre reviziile 20 si 21 | Cod sursa (job #117829) | Cod sursa (job #253766)
Cod sursa(job #253766)
#include<fstream.h>
#include<math.h>
long long int n,m,h[100001][2],i,x,y,r,boom;
int main()
{
ifstream in("grendizer.in");
ofstream out("grendizer.out");
in>>n>>m;
for(i=1;i<=n;i++)
in>>h[i][0]>>h[i][1];
while(m)
{
in>>x>>y>>r;
boom=0;
for(i=1;i<=n;i++)
if(abs(x-h[i][0])+abs(y-h[i][1])==r) boom++;
out<<boom<<'\n';
m--;
}
return 0;
}