这题可以用数学几何来处理,即用极角相减就可以得出三角形一个角对应的圆心角,然后枚举是为了处理精度的问题。
当然也是可以用ACM计算几何来做,就是求出三角形的外界圆圆心和半径,然后求出圆心角,然后用gcd求出公约数,
用2*pi除以公约数即可以得出边数,注意四舍五入,另外注意实数的gcd用fmod;
贴出前一种做法的代码;
#include<cstdio>
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<map>
#include<set>
#include<cmath>
#include<cstring>
#include<cctype>
using namespace std;
#define LL long long
const double pi=4*atan2(1,0);
const double eps=1e-6;
int dcmp(double x)
{
if(fabs(x)<eps)
return 0;
return x>0?1:-1;
}
double angle(double x1,double y1,double x2,double y2,double x3,double y3)
{
double angle=fabs(atan2(y2-y1,x2-x1)-atan2(y3-y1,x3-x1));
if(dcmp(angle-pi/2)>0)
return angle-pi/2;
else
return angle;
}
int main()
{
double x1, x2, x3, y1, y2, y3;
while(cin>>x1>>y1>>x2>>y2>>x3>>y3){
double ang1=angle(x1,y1,x2,y2,x3,y3);
double ang2=angle(x2,y2,x3,y3,x1,y1);
double ang3=angle(x3,y3,x1,y1,x2,y2);
double cc1=ang1*2/pi,cc2=ang2*2/pi,cc3=ang3*2/pi;
// cout<<cc1<<' '<<cc2<<' '<<cc3<<' '<<endl;
int i;
for(i=3;i<=1000;i++)
if(dcmp(i*cc1-round(i*cc1))==0&&dcmp(i*cc2-round(i*cc2))==0)
break;
cout<<i<<endl;
}
return 0;
}