2102.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2102 on 2005-10-05 at 16:46:05 */ 
#include <stdio.h>
#define  MAX  200000

int sgn(long);

typedef struct {
	long x;
	long y;
} Point;

int main()
{
	Point p[MAX+1];
	long n, i, m, q;
	long on, sn;
	
	while(scanf("%ld", &n) == 1) {
		if(n == 0) {
			return 0;
		} else {
			for(i = 0; i < n; i++) {
				scanf("%ld %ld", &p[i].x, &p[i].y);
			}
			m = (n - 1) / 2;
			on = 0;
			sn = 0;
			for(i = 0; i < n; i++) {
				if(i != m) {
					p[i].x -= p[m].x;
					p[i].y -= p[m].y;
					q = sgn(p[i].x) * sgn(p[i].y);
					if(q > 0) {
						sn++;
					} else if(q < 0) {
						on++;
					}
				}
			}
			printf("%ld %ld\n", sn, on);
		}
	}
	
	return 0;
}

int sgn(long x)
{
	if(x > 0) {
		return 1;
	} else if(x < 0) {
		return -1;
	} else {
		return 0;
	}
}