向量叉积,水过。
注意读入lf,千万别想我写了个llf.....
#include<stdio.h>
#include<iostream>
#include<math.h>
using namespace std;
const int MAXN = 1001;
const double e = 1e-10;
int N;
struct point
{
double x , y;
point(double a = 0,double b = 0):
x(a),y(b){}
point operator| (const point &V) const
{
return point(x-V.x,y-V.y);
}
double operator& (const point &V) const
{
return (double)(x*V.y-y*V.x);
}
double operator^ (const point &V) const
{
return sqrt((double)((x-V.x)*(x-V.x)+(y-V.y)*(y-V.y)));
}
};
struct point G[MAXN];
struct point station ;
double R;
int ans = 0 ;
void init()
{
int i;
scanf("%d",&N);
ans = 0;
for (i=1;i<=N;i++)
scanf("%lf %lf",&G[i].x,&G[i].y);
}
void work()
{
int i,j;
int tmp = 0;
for (i=1;i<=N;i++)
{
tmp = 0;
for (j=1;j<=N;j++)
if ((station^G[j])<=R&&((G[i]|station)&(G[j]|station))>=0)
tmp ++;
ans = max(tmp,ans);
}
}
void put()
{
printf("%d\n",ans);
}
void groups()
{
while(scanf("%lf %lf %lf",&station.x,&station.y,&R)!=EOF&&R>0)
{
init();
work();
put();
}
}
int main()
{
freopen("transmit.in","r",stdin);
freopen("transmit.out","w",stdout);
groups();
return 0;
}