1799 Yeehaa!
来源:互联网 发布:白牌照是什么意思js 编辑:程序博客网 时间:2024/06/07 11:29
Description
Background
George B. wants to be more than just a good American. He wants to make his daddy proud and become a western hero. You know, like John Wayne.
But sneaky as he is, he wants a special revolver that will allow him to shoot more often than just the usual six times. This way he can fool and kill the enemy easily (at least that’s what he thinks).
Problem
George has kidnapped … uh, I mean … “invited” you and will only let you go if you help him with the math. The piece of the revolver that contains the bullets looks like this (examples for 6 and 17 bullets):
There is a large circle with radius R and n little circles with radius r that are placed inside on the border of the large circle. George wants his bullets to be as large as possible, so there should be no space between the circles. George will decide how large the whole revolver will be and how many bullets it shall contain.Your job is, given R and n, to compute r.
Input
The first line contains the number of scenarios. For each scenario follows a line containing a real number R and an integer n, with 1 <= R <= 100 and 2 <= n <= 100.
Output
The output for every scenario begins with a line containing “Scenario #i:”, where i is the number of the scenario starting at 1. Then print the value for r, rounded to three decimal places. Terminate the output for the scenario with a blank line.
Sample Input
4
4.0 6
4.0 17
3.14159 100
42 2
Sample Output
Scenario #1:
1.333
Scenario #2:
0.621
Scenario #3:
0.096
Scenario #4:
21.000
Source
TUD Programming Contest 2004, Darmstadt, Germany
任意两个小圆圆心之间的距离是2r,将这两个小圆的圆心以及大圆圆心相连构成一个等腰三角形,顶角的角度为
#include<iostream>#include<iomanip>#include<math.h>using namespace std;#define PI 3.14159258int main(){ int sce; cin >> sce; for(int i=1;i<=sce;i++) { double R, r; int n; cin >> R >> n; r = (sin(PI / n)*R) / (1 + sin(PI / n)); cout << "Scenario #" << i << ":" << endl; cout << fixed << setprecision(3) << r << endl << endl; } return 0;}
,
- 1799 Yeehaa!
- PKU 1799 Yeehaa!
- POJ 1799 (Yeehaa!)(数学题)
- POJ 1799 Yeehaa!(计算几何)
- pku_1799 Yeehaa! 解题报告
- HOJ 1655 Yeehaa!
- POJ 1799
- hdu 1799
- hdu 1799
- hdu-1799
- hdu 1799
- hdu 1799
- ZOJ-1799
- POJ 1799
- HDU 1799
- HDU 1799
- hdu 1799 循环多少次?
- HDU 1799 循环多少次?
- 1308:数列求和
- 多表查询
- BugFree3.0.4Linux环境安装指南
- WOJ1328-WERTYU
- 浅析Oracle PL/SQL 学习--未完待续
- 1799 Yeehaa!
- 红米note4x在Android Studio 无法安装应用
- 日志
- sql 插入后返回主键id写法
- Android开发屏幕适配
- 理解
- Week Two
- typeof 探秘
- WOJ1340-Easy or Hard