poj2954

# include <stdio.h>
# include <math.h>
# include <stdlib.h>
struct node
{
    int x,y;
}a,b,c;
int gcd(int m,int n)
{
    return n==0?m:gcd(n,m%n);
}
int solve(node a,node b)
{
    int m=abs(a.x-b.x);
    int n=abs(a.y-b.y);
    if(m==0&&n==0) return 0;
    if(m==0) return n-1;
    if(n==0) return m-1;
    return gcd(m,n)-1;
}
double cross(node a,node b,node c)
{
    return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
double area(node a,node b,node c)
{
    return fabs(cross(a,b,c))/2.0;
}
int main ()
{
    while(scanf("%d%d%d%d%d%d",&a.x,&a.y,&b.x,&b.y,&c.x,&c.y)!=EOF)
    {
        if(a.x==0&&a.y==0&&b.x==0&&b.y==0&&c.x==0&&c.y==0) break;
        int cnt=3;
        cnt+=solve(a,b);
        cnt+=solve(b,c);
        cnt+=solve(a,c);
        double ans=area(a,b,c);
        printf("%d\n",(int)ans+1-cnt/2);
    }
    return 0;
}

pick定理   

给定顶点座标均是整点（或正方形格点）的简单多边形，皮克定理说明了其面积A和内部格点数目i、边上格点数目b的关系：A = i + b/2 - 1。