POJ 1265 Area Pick定理

S = a + b/2 - 1;

#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <queue>
#include <cmath>
#include <algorithm>

using namespace std;

struct P
{
    int x,y;
} p[110];

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

int sumpe(P p)
{
    if(p.x == 0)
        return abs(p.y);
    if(p.y == 0)
        return abs(p.x);

    int a,b;
    a = abs(p.y);
    b = abs(p.x);

    return gcd(a,b);
}

float sumarea(int m)
{
    float s1 = 0,s2 = 0;
    for(int i = 0;i < m; ++i)
    {
        s1 += p[(i+1)%m].y * p[i].x;
        s2 += p[(i+1)%m].y * p[(i+2)%m].x;
    }
    return fabs(s1-s2)/2;
}

int main()
{
    int T,icase;

    int m,i,a,b;

    float s;

    scanf("%d",&T);
    for(icase = 1; icase <= T; icase++ )
    {
        scanf("%d",&m);
        for(i = 0; i < m; ++i)
        {
            scanf("%d %d",&p[i].x,&p[i].y);
        }
        //计算边上的点
        for(b = 0,i = 0; i < m; ++i)
        {
            b += sumpe(p[i]);
        }

        P t;
        t.x = 0;
        t.y = 0;

        for(i = 0;i < m; ++i)
        {
            p[i].x += t.x;
            p[i].y += t.y;
            t.x = p[i].x;
            t.y = p[i].y;
        }

        //计算面积
        s = sumarea(m);

        //pick定理计算多边形内的点
        a = s+1-b/2;

        printf("Scenario #%d:\n",icase);
        printf("%d %d %.1f\n\n",a,b,s);

    }
    return 0;
}