Star
Overpower often go to the playground with classmates. They play and chat on the playground. One day, there are a lot of stars in the sky. Suddenly, one of Overpower’s classmates ask him: “How many acute triangles whose inner angles are less than 90 degrees (regarding stars as points) can be found? Assuming all the stars are in the same plane”. Please help him to solve this problem.
The first line of the input contains an integer T (T≤10), indicating the number of test cases.
For each test case:
The first line contains one integer n (1≤n≤100), the number of stars.
The next n lines each contains two integers x and y (0≤|x|, |y|≤1,000,000) indicate the points, all the points are distinct.
For each test case, output an integer indicating the total number of different acute triangles.
1 3 0 0 10 0 5 1000
1
代码:
#include<stdio.h> #include<math.h> #include<string.h> struct zb//定义一个结构体存坐标 { double x,y; } p[1005]; int main() { int t; scanf("%d",&t); while(t--) { int n; scanf("%d",&n); for(int i=0; i<n; i++) scanf("%lf%lf",&p[i].x,&p[i].y); int ans=0; double a,b,c; for(int i=0; i<n-2; i++) { for(int j=i+1; j<n-1; j++) { for(int k=j+1; k<n; k++)//求边长平方 { a=(p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y); b=(p[j].x-p[k].x)*(p[j].x-p[k].x)+(p[j].y-p[k].y)*(p[j].y-p[k].y); c=(p[i].x-p[k].x)*(p[i].x-p[k].x)+(p[i].y-p[k].y)*(p[i].y-p[k].y); if(a+b>c&&a+c>b&&b+c>a)//任意两边平方之和大于第三边平方,则为锐角三角形 ans++; } } } printf("%d\n",ans); } return 0; }