Think:
1题意:判断三点是否可以组成一个锐角三角形
2判断公式:a^2 + b^2 > c^2 && a^2 + c^2 > b^2 && b^2 + c^2 > a^2
公式推导来自三角形余弦公式
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#define max(a, b) (a > b? a: b)
#define min(a, b) (a < b? a: b)
struct node
{
int x;
int y;
}ans[104];
int main()
{
int T, n, i, j, k, cnt;
long long aa, bb, cc;
scanf("%d", &T);
while(T--)
{
cnt = 0;
scanf("%d", &n);
for(i = 0; i < n; i++)
scanf("%d %d", &ans[i].x, &ans[i].y);
for(i = 0; i < n; i++){
for(j = i+1; j < n; j++){
for(k = j+1; k < n; k++){
aa = pow(max(ans[i].x, ans[j].x)-min(ans[i].x, ans[j].x), 2);
aa += pow(max(ans[i].y, ans[j].y)-min(ans[i].y, ans[j].y), 2);
bb = pow(max(ans[i].x, ans[k].x)-min(ans[i].x, ans[k].x), 2);
bb += pow(max(ans[i].y, ans[k].y)-min(ans[i].y, ans[k].y), 2);
cc = pow(max(ans[j].x, ans[k].x)-min(ans[j].x, ans[k].x), 2);
cc += pow(max(ans[j].y, ans[k].y)-min(ans[j].y, ans[k].y), 2);
if(aa + bb > cc && aa + cc > bb && bb + cc > aa)
cnt++;
}
}
}
printf("%d\n", cnt);
}
return 0;
}