POJ 2954 Triangle (Pick定理)

本文主要是介绍POJ 2954 Triangle (Pick定理)，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！

http://poj.org/problem?id=2954

完整代码：

/*0ms,356KB*/#include<cstdio>
#include<cstdlib>
#include<cmath>int x[4], y[4];int gcd(int a, int b)
{return b ? gcd(b, a % b) : a;
}double s()
{double ret = 0.0;for (int i = 0; i < 3; ++i) ret += x[i] * y[i + 1] - y[i] * x[i + 1];return fabs(ret) / 2.0;
}int main()
{double A;int B;while (scanf("%d%d%d%d%d%d", &x[0], &y[0], &x[1], &y[1], &x[2], &y[2]), x[0] || y[0] || x[1] || y[1] || x[2] || y[2]){x[3] = x[0], y[3] = y[0];B = 0;for (int i = 0; i < 3; i++) B += gcd(abs(x[i] - x[i + 1]), abs(y[i] - y[i + 1]));printf("%d\n", (int)s() - B / 2 + 1);}return 0;
}

这篇关于POJ 2954 Triangle (Pick定理)的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！

---