多边形面积 以及统计在边上的点和多边形内部的点（1265）Pick 定理

area=I+E/2-1(I为内部格数，E为边上的点数） 边上格点数 = gcd(abs(x),abs(y))-1;

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#define N 1003
using namespace std;
struct point{
	int x,y;
	point (int X=0,int Y=0) {
		x=X,y=Y;
	}
}a[N];
int n;
typedef point vector;
vector operator -(vector a,vector b)
{
	return vector (a.x-b.x,a.y-b.y);
}
int cross(vector a,vector b)
{
	return a.x*b.y-a.y*b.x;
}
int main()
{
//	freopen("a.in","r",stdin);
	int T; scanf("%d",&T);
	int t=0;
	while (T--){
		t++;
		scanf("%d",&n);
		a[0].x=0; a[0].y=0;
		int count=0;
		for (int i=1;i<=n;i++) {
			int x,y; scanf("%d%d",&x,&y);
			count+=__gcd(abs(x),abs(y));
			a[i].x=a[i-1].x+x; a[i].y=a[i-1].y+y;
		}
		a[n+1]=a[1];
		int area=0;
		for (int i=2;i<=n;i++)
		 area+=cross(a[i]-a[1],a[i+1]-a[1]);
		area=abs(area);
		int size=(area+2-count)/2;
		printf("Scenario #%d:\n",t);
		if (area%2)  printf("%d %d %d.5\n",size,count,area/2);
		else printf("%d %d %d.0\n",size,count,area/2);
		printf("\n");
	}
}