TZOJ 5103 Electric Fence

描述：

In this problem, "lattice points" in the plane are points with integer coordinates.

In order to contain his cows, Farmer John constructs a triangular electric fence by stringing a "hot" wire from the origin (0,0) to a lattice point [n,m] (0<=n<32,000, 0<m<32,000), then to a lattice point on the positive x axis [p,0] (0<p<32,000), and then back to the origin (0,0).

A cow can be placed at each lattice point within the fence without touching the fence (very thin cows). Cows can not be placed on lattice points that the fence touches. How many cows can a given fence hold?

输入

The single input line contains three space-separated integers that denote n, m, and p.

输出

A single line with a single integer that represents the number of cows the specified fence can hold.

题意：其实就是让你求一个格点三角形的内点数。

思路：使用皮克定理（格点多边形面积=内点数+边界点数/2+1) 

由于其三角形的两个点都在x轴上，面积很好求；通过求出边界点数，即可得到答案；

边界点数通过gcd（|x1-x2|,|y1-y2|),原理：由于该图形为格点三角形，三个点都处于格点上，通过gcd可以求出线段x,y的最大公因数，即每条线段最多可以被均分成几整份，端点都在格点上，分出来的每份也都在端点上。（如果只求一条线段的边界点数，是需要gcd+1的，因为有一个端点没被计算进去，但是在形成多边形的情况下，未被加上的断点会成为另一条边的起点进行计算，

#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
using namespace std;
typedef long long ll;
int n,m,p,s;
int  gcd(int a,int b)
{
	if(b==0) return a;
	return gcd(b,a%b);
}
int main()
{
 	IOS;
 	cin>>n>>m>>p;
	s=p*m/2;
	cout<<s-(gcd(abs(n-p),m)+gcd(n,m)+p)/2+1<<endl;
    return 0;
}

直接计算每条边的gcd即可）