2460.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

Memory:52K  Time:0MS
Language:C++  Result:Accepted

Source 

#include"stdio.h"

struct point
{
	int x,y;
}p[200010];

int n;

bool init()
{
	int i;

	if(scanf("%d",&n)!=1)return 0;
	if(n==0)return 0;
	for(i=0;i<n;i++)
		scanf("%d %d",&p[i].x,&p[i].y);

	return 1;
}

void count(int &a,int &b)
{
	int cx=p[n/2].x,cy=p[n/2].y,i;
	
	a=0,b=0;

	for(i=0;i<n;i++)
	{
		if((double)(p[i].x-cx)*(p[i].y-cy)>0)a++;
		else if((double)(p[i].x-cx)*(p[i].y-cy)<0)b++;
	}
}

int main()
{
	int a,b;
	while(init())
	{
		count(a,b);
		printf("%d %d\n",a,b);
	}
	return 0;
}