POJ 2954 Triangle(pick定理，边上整点数)

RT。。

#include <cmath>
#include <cstdio>
#include <cstring>
#include <utility>
using namespace std;

const double eps = 1e-8;
int sgn(double x)
{
    if(fabs(x) < eps)return 0;
    if(x < 0)return -1;
    else return 1;
}
struct Point
{
    int x,y;
    Point(){}
    Point(double _x,double _y)
    {
        x = _x;y = _y;
    }
    //向量
    Point operator -(const Point &b)const
    {
        return Point(x - b.x,y - b.y);
    }
    //叉积
    int operator ^(const Point &b)const
    {
        return x*b.y - y*b.x;
    }
    //点积
    int operator *(const Point &b)const
    {
        return x*b.x + y*b.y;
    }
};
struct Line
{
    Point s,e;
    Line(){}
    Line(Point _s,Point _e)
    {
        s = _s;e = _e;
    }
    //两直线相交求交点
    //第一个值为0表示直线重合，为1表示平行，为0表示相交,为2是相交
    //只有第一个值为2时，交点才有意义
    pair<int,Point> operator &(const Line &b)const
    {
        Point res = s;
        if(sgn((s-e)^(b.s-b.e)) == 0)
        {
            if(sgn((s-b.e)^(b.s-b.e)) == 0)
                return make_pair(0,res);//重合
            else return make_pair(1,res);//平行
        }
        double t = ((s-b.s)^(b.s-b.e))/((s-e)^(b.s-b.e));
        res.x += (e.x-s.x)*t;
        res.y += (e.y-s.y)*t;
        return make_pair(2,res);
    }
};

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

int main()
{
    Point tri[3];
    while (~scanf("%d%d%d%d%d%d", &tri[0].x, &tri[0].y, &tri[1].x, &tri[1].y, &tri[2].x, &tri[2].y)) {
        bool all = true;
        for (int i = 0; i < 3; i++) {
            if (tri[i].x != 0 || tri[i].y != 0) {
                all = false;
                break;
            }
        }
        if (all)
            break;
        int ans = 0;
        for (int i = 0; i < 3; i++)
            ans += tri[i] ^ tri[(i+1)%3];
        if (ans < 0) ans *= -1;
        ans += 2;
        for (int i = 0; i < 3; i++)
            ans -= gcd(abs(tri[(i+1)%3].x - tri[i].x), abs(tri[(i+1)%3].y - tri[i].y));
        printf("%d\n", ans / 2);
    }

    return 0;
}