Pagini recente » Cod sursa (job #720465) | Cod sursa (job #2386163) | Cod sursa (job #301475) | Cod sursa (job #3288526) | Cod sursa (job #253681)
Cod sursa(job #253681)
#include<fstream.h>
#include<iostream.h>
#include<math.h>
long m,n,l[100000],c[100000],lo[100000],co[100000],i,j,k,r[100000],obj;
int abs(int x)
{
if(x>=0) return x;
else
return -x;
}
int distanta(long l1, long c1, long l2, long c2)
{
long dm;
dm=abs(l1-l2)+abs(c1-c2);
return dm;
}
int main()
{int dm;
ifstream in("grendizer.in");
ofstream out("grendizer.out");
in>>n>>m;
for(i=1;i<=n;i++)
in>>l[i]>>c[i];
for(i=1;i<=m;i++)
in>>lo[i]>>co[i]>>r[i];
in.close();
for(i=1;i<=m;i++)
{
obj=0;
for(j=1;j<=n;j++)
{
dm=distanta(l[j],c[j],lo[i],co[i]);
if(dm==r[i]) obj++;
}
out<<obj<<endl;
}
return 0;
}