FZU - 2110 Star（几何）

题目大意：给出n个点的坐标（整数），选3个点组成三角形问能形成多少个锐角三角形

解析：直接暴力枚举，3个for循环，如果能构成锐角三角形的条件是，假设三条边为a,b,c，且c为最大边如果 a^2+b^2 > c^2这满足锐角三角形

#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
const int N = 105;
const int INF = 0x3f3f3f3f;
struct Point{
	double x,y;
}p[N];
int n;
double dis(Point a,Point b) {
	return sqrt( (a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
bool judge(Point a,Point b,Point c) {
	double d[3];
	d[0] = dis(a,b);
	d[1] = dis(b,c);
	d[2] = dis(a,c);
	double maxd = -INF;
	for(int i = 0; i < 3; i++) {
		if(maxd < d[i]) {
			maxd = d[i];
		}
	}
	if(2*maxd*maxd - (d[0]*d[0] + d[1]*d[1] + d[2]*d[2]) < 0) {
		return true;
	}else {
		return false;
	}
}
int main() {
	int T;
	scanf("%d",&T);
	while(T--) {
		scanf("%d",&n);
		for(int i = 0; i < n; i++) {
			scanf("%lf%lf",&p[i].x,&p[i].y);
		}
		int cnt = 0;
		for(int i = 0; i < n; i++) {
			for(int j = i + 1; j < n; j++) {
				for(int k = j + 1; k < n; k++) {
					if(judge(p[i],p[j],p[k])) {
						cnt++;
					}
				}
			}
		}
		printf("%d\n",cnt);
	}
	return 0;
}