???Finding the Radius for an Inserted Circle
来源:互联网 发布:淘宝宝贝详情页面尺寸 编辑:程序博客网 时间:2024/05/31 06:21
Three circles Ca, Cb, and Cc, all with radius R and tangent to each other, are located in two-dimensional space as shown in Figure 1. A smaller circle C1 with radius R1 (R1<R) is then inserted into the blank area bounded by Ca, Cb, and Cc so that C1 is tangent to the three outer circles, Ca, Cb, and Cc. Now, we keep inserting a number of smaller and smaller circles Ck (2≤k≤N) with the corresponding radius Rk into the blank area bounded by Ca, Cc and Ck−1 (2≤k≤N), so that every time when the insertion occurs, the inserted circle Ck is always tangent to the three outer circles Ca, Cc and Ck−1, as shown in Figure 1
Figure 1.
(Left) Inserting a smaller circle C1 into a blank area bounded by the circle Ca, Cb and Cc.
(Right) An enlarged view of inserting a smaller and smaller circle Ck into a blank area bounded by Ca, Cc and Ck−1 (2≤k≤N), so that the inserted circle Ck is always tangent to the three outer circles, Ca, Cc, and Ck−1.
Now, given the parameters R and k, please write a program to calculate the value of Rk, i.e., the radius of the k−th inserted circle. Please note that since the value of Rk may not be an integer, you only need to report the integer part of Rk. For example, if you find that Rk = 1259.8998 for some k, then the answer you should report is 1259.
Another example, if Rk = 39.1029 for some k, then the answer you should report is 39.
Assume that the total number of the inserted circles is no more than 10, i.e., N≤10. Furthermore, you may assume π=3.14159. The range of each parameter is as below:
1≤k≤N, and 104≤R≤107.
Input Format
Contains l+3 lines.
Line 1: l ----------------- the number of test cases, l is an integer.
Line 2: R ---------------- R is a an integer followed by a decimal point,then followed by a digit.
Line 3: k ---------------- test case #1, k is an integer.
…
Line i+2: k ----------------- test case # i.
…
Line l+2: k ------------ test case #l.
Line l+3: −1 ---------- a constant −1 representing the end of the input file.
Output Format
Contains l lines.
Line 1: k Rk ----------------output for the value of k and Rk at the test case #1, each of which should be separated by a blank.
…
Line i: k Rk ----------------output for k and the value of Rk at the test case # i, each of which should be separated by a blank.
Line l: k Rk ----------------output for k and the value ofRk at the test case # l, each of which should be separated by a blank.
样例输入
1152973.61-1
样例输出
1 23665
题目来源
2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- ???Finding the Radius for an Inserted Circle
- Finding the Radius for an Inserted Circle 笛卡尔定理
- hdu 6158 The Designer && 计蒜客 Finding the Radius for an Inserted Circle 笛卡尔定理应用
- 2017 ACM-ICPC南宁网络赛: G. Finding the Radius for an Inserted Circle
- hdu 6158 The Designer && 计蒜客 Finding the Radius for an Inserted Circle 笛卡尔定理应用+韦达定理
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 G. Finding the Radius for an Inserted Circle
- Finding the Radius for an Inserted Circle--2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- Finding the Radius for an Inserted Circle 公式/几何 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 G. Finding the Radius for an Inserted Circle
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛: G. Finding the Radius for an Inserted Circle(笛卡尔定理)
- 2017 ACM-ICPC 亚洲区(南宁赛区)网络赛 G. Finding the Radius for an Inserted Circle(计算几何,二分)
- How to calculate the SVG Path for an arc (of a circle)
- Finding the factors of an integer
- Finding the Filter DLL for a File
- Finding the mosting accessed Table/Region on an HBase
- Check for cyclic list (count the length of circle)
- Finding the Longest Nondecreasing Subsequence of A Given Sequence:An analysis of dynamic programming
- Finding the most accessed Table/Region on an HBase Region Server
- Struts单、多个文件的上传
- navicate 远程连接 数据库
- ajax请求的三种语法
- GDB调试
- java8 笔记
- ???Finding the Radius for an Inserted Circle
- heap和stack有什么区别?
- GIT
- Android----INSTALL_FAILED_USER_RESTRICTED错误
- JZOJ 5379. 【NOIP2017提高A组模拟9.21】Victor爱数字
- 欧几里德算法 & 扩展欧几里德算法 & 求解丢番图方程
- final、finally和finalize的区别
- JavaScript学习笔记-01类型
- 计蒜客: 最大的快乐指数(树形DP)