题目:http://www.lightoj.com/volume_showproblem.php?problem=1072
题意:给一个半径为R的大圆,里面有n个小圆,把这些小圆放置成和大圆均内切且相邻两个小圆相切的形式,问每个小圆的半径是多少
思路:首先小圆肯定放置的和大圆内切,二分枚举小圆半径,然后求出大圆圆心到小圆圆心的距离(设为len),那么相邻两小圆的圆心距,两条len边构成一个三角形,且圆心距对的角可以求出角度,即2*PI / n,根据余弦定理求出圆心距,根据圆心距判断两小圆是否相切,直到相切为止
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const double eps = 1e-8, PI = acos(-1);
int cas;
int main()
{
int t;
double R, n;
scanf("%d", &t);
while(t--)
{
scanf("%lf%lf", &R, &n);
double l = eps, r = R;
while(fabs(l-r) > eps)
{
double mid = (l + r) / 2;
double len = R - mid;
double a = sqrt(len*len + len*len - 2*len*len*cos(2*PI / n));//圆心距
if(a > mid * 2) l = mid;//两小圆相离
else r = mid;
}
printf("Case %d: %f\n", ++cas, l);
}
return 0;
}