NOJ [1132] Evil Wheel
来源:互联网 发布:风险矩阵法判断准则 编辑:程序博客网 时间:2024/09/21 08:18
- 问题描述
- The Demon is coming to our worlds. He's using a wheel with a thorn on the border.
The wall where the thorn through will be separated from the wall.Now you need to know the weight of the separated wall when the wheel turns a circle. You just think the thorn is on the very bottom of the wheel.
- 输入
- This problem has several cases. Input until EOF.
Each case contains 2 decimals: R and W, Indicate the radius of the wheel and the weight of unit area of the wall. (0 < R, W < 100) - 输出
- For each case, you should print the whole weight of the separated wall. Keep six decimal places.积分求面积,不懂的去看高数书
#include<stdio.h>
#define PI 3.1415926535897932384626433
int main()
{
double R,W;
while(~scanf("%lf%lf",&R,&W))
{
printf("%f\n",3*PI*R*R*W);
}
return 0;
}
0 0
- NOJ [1132] Evil Wheel
- Evil
- Evil
- wheel
- Noj
- Injected Evil
- hdu5892Resident Evil
- SPOKES WHEEL
- Timing wheel
- 关于Wheel
- NOJ 176
- NOJ 175
- NOJ 179
- NOJ 141
- NOJ 214
- NOJ 147
- NOJ 1242
- NOJ 1848
- POJ To the Max
- pdf在线转换成word官方免费版
- POJ 2777 Count Color
- NOJ [1120] Reimu\'s Teleport
- POJ Maximum sum
- NOJ [1132] Evil Wheel
- NBUT-2014暑期集训专题练习1 -> 二分法 A题
- NBUT-2014暑期集训专题练习1 -> 二分法E - E
- NBUT-2014暑期集训专题练习1 -> 二分法 J - J
- NBUT-2014暑期集训专题练习1 -> 二分法 H - H
- NBUT-2014暑期集训专题练习1 -> 二分法B - B
- NBUT-2014暑期集训专题练习1 -> 二分法L - L
- NBUT-2014暑期集训专题练习1 -> 二分法F - F
- nbut线段树专题E - Just a Hook