Pagini recente » Cod sursa (job #400323) | Cod sursa (job #260241) | Cod sursa (job #1831651) | Cod sursa (job #1136290) | Cod sursa (job #254164)
Cod sursa(job #254164)
#include <iostream.h>
#include <fstream.h>
int mod(int a, int b)
{
if((a-b)>=0)
return a-b;
else
return b-a;
}
int main()
{
ifstream f("grendizer.in");
ofstream g("grendizer.out");
int c,i,j,n,m,x[1000000],y[1000000],xx[1000000],yy[1000000] ;
long r[1000000];
f>>n>>m;
for(i=1;i<=n;i++)
f>>x[i]>>y[i];
for(i=1;i<=m;i++)
f>>xx[i]>>yy[i]>>r[i];
for(i=1;i<=m;i++)
{
c=0;
for(j=1;j<=n;j++)
if(mod(xx[i],x[j])+mod(yy[i],y[j])==r[i])
c++;
g<<c<<"\n";
}
g.close();
}