LIGHT OJ-1022 - Circle in Square【浮点精度】

1022 - Circle in Square

PDF (English)

Statistics

Forum

Time Limit: 0.5 second(s)

Memory Limit: 32 MB

A circle is placed perfectly into a square. The term perfectly placed means that each side of the square is touched by the circle, but the circle doesn't have any overlapping part with the square. See the picture below.

Now you are given the radius of the circle. You have to find the area of the shaded region (blue part). Assume that pi = 2 * acos (0.0) (acos means cos inverse).

Input

Input starts with an integer T (≤ 1000), denoting the number of test cases.

Each case contains a floating point number r (0 < r ≤ 1000) denoting the radius of the circle. And you can assume that rcontains at most four digits after the decimal point.

Output

For each case, print the case number and the shaded area rounded to two places after the decimal point.

Sample Input	Output for Sample Input
3 20 30.091 87.0921	Case 1: 343.36 Case 2: 777.26 Case 3: 6511.05

Note

This problem doesn't have special judge. So, be careful about precision problems. Better to add a small value to your result to avoid precision problems. For example, add 10^-9 to your result.

题意：求上图蓝色面积；

思路：正方形面积减圆形面积，PI用acos(-1.0)表示，不能用3.14；

失误：注意上面的提示，比赛时就没看还好这道题能过，如果精度达不到没过不就白白浪费一次机会。

AC代码：

#include<cstdio>
#include<math.h>

#define PI acos(-1.0)

int main()
{
	int T,Kase=0;
	double R;
	scanf("%d",&T);
	while(T--)
	{
		scanf("%lf",&R);
		printf("Case %d: %.2lf\n",++Kase,4*R*R-PI*R*R);//这里就不加了 警告自己一下注意小错误
	}
	return 0;
}