LightOJ 1418 - Trees on My Island (Pick`s theorem)

题意：给定多边形，求多边形内整数点的个数；用pick公式。以前做过的题，还是wa了好多次，彩笔伤不起。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <stack>
#include <algorithm>
#include <cmath>
#include <map>
#define LL long long
#define DB double

using namespace std;
const int N = 10009;
struct cpoint{
    LL x,y;
    void get(){cin>>x>>y;}
};
cpoint re[N];
int n;
LL x_mult(cpoint a,cpoint b,cpoint p)
{
    return (a.x-p.x)*(b.y-p.y)-(a.y-p.y)*(b.x-p.x);
}
LL gcd(LL a,LL b)
{
    if(a==0) return b;
    return gcd(b%a,a);
}
LL Abs(LL t){return t<0?-t:t;}
LL solve()
{
    LL s =0 ;
    LL e =0 ;
    for(int i=0;i<n;i++)
    {
        s += x_mult(re[i],re[i+1],re[0]);
        e += gcd(Abs(re[i].y-re[i+1].y),Abs(re[i].x-re[i+1].x));
    }e/=2;s/=2;
    return Abs(s)+1-e;
}
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    int cas,T=1;scanf("%d",&cas);
    while(cas--)
    {
        scanf("%d",&n);
        for(int i=0;i<n;i++) re[i].get();
        re[n] = re[0];
        cout<<"Case "<<(T++)<<": "<<solve()<<endl;
    }
    return 0;
}