Electric Fence(皮克定理)

题目：5103:Electric Fence (tzcoder.cn)

描述：

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.

样例输入：

7 5 10

样例输出：

20

思路：

本题需要用到皮克定理。

皮克定理：一个计算点阵中顶点在格点上的多边形面积公式，该公式可以表示为S=a+b/2-1。

a是多边形内部的整点数，b是多边形边上的整点数，本题底边在x轴上，面积可用底边*高，也可用海伦公式(S=(a+b+c)/2)。

所以a=S-b/2+1。

而b的个数可以用gcd求出。

AC代码

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int gcd(int a,int b)
{
	if(b==0)
	{
		return a;
	}
	return gcd(b,a%b);
}
int main()
{
    int n,m,p;
	cin>>n>>m>>p;
	cout<<(p*m-gcd(abs(n-p),m)-gcd(n,m)-p+2)/2;
    return 0;
}