poj2954 - Triangle

                                 想看更多的解题报告:http://blog.csdn.net/wangjian8006/article/details/7870410
                                  转载请注明出处：http://blog.csdn.net/wangjian8006

题目大意：给出三个点的坐标，问在这三个点坐标里面的整数坐标点有多少个（不包含边上的）
解题思路：将这个坐标系看做网格，用皮克定理：里面点的个数=(面积-边上点的个数）/2+1

 

/*
Memory 148K
Time   16MS
*/
#include <stdio.h>

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

Point p[4];
long long area;

long long gcd(long long a,long long b){
    if(b==0) return a;
    else return gcd(b,a%b);
}

long long abst(long long x){
    if(x<0) return -x;
    else return x;
}

long long OnEdge(long long n){
    long long i,ret=0;
    for(i=0;i<n;i++)
    ret+=gcd(abst(p[i].x-p[(i+1)%n].x),abst(p[i].y-p[(i+1)%n].y));
    return ret;
}

long long InSide(long long n){
    return (abst(area)-OnEdge(n))/2 +1;
}

long long chaji(Point a1,Point b1,Point a2,Point b2){
    long long x1=b1.x-a1.x;
    long long y1=b1.y-a1.y;
    long long x2=b2.x-a2.x;
    long long y2=b2.y-a2.y;
    return x1*y2-x2*y1;
}

int main(){
    long long i;
    while(scanf("%lld%lld%lld%lld%lld%lld",&p[0].x,&p[0].y,&p[1].x,&p[1].y,&p[2].x,&p[2].y)){
        for(i=0;i<3;i++)
                if(p[i].x!=0 || p[i].y!=0) break;
                if(i==3) break;
                area=chaji(p[0],p[1],p[0],p[2]);
                if(!area) {printf("0\n");continue;}
                printf("%lld\n",InSide(3));
    }
    return 0;
}