zoukankan      html  css  js  c++  java
  • The Queen's Super-circular Patio 求栏杆

    Input

    The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that follow. Each data set should be processed identically and independently.

    Each data set consists of a single line of input. It contains the data set number, K,the number, N (3 ≤ N ≤ 20), of stones in each circle and the number, M (1 ≤ M ≤ 15), of circles of stones around the central stone.

    Output

    For each data set there is a single line of output. It contains the data set number, K, followed by a single space which is then followed by the radius (in queenly feet) of the stones in the outermost ring (to 3 decimal places) which is followed by a single space which is then followed by the length (in queenly feet) of the fence (to 3 decimal places).

    Sample Input

    3
    1 3 1
    2 7 3
    3 11 5

    Sample Output

    1 6.464 79.400
    2 3.834 77.760
    3 2.916 82.481

    题意:现有一个半径为1的圆,然后给出层数和要求一层要求填充完的圆的个数,求最外层的填充圆的半径和将其围起来的栏杆周长(周长就等于前面半径对应的圆的周长加上n*直径)
    分析:
    求出r3后,如果要接着往外加层数,就利用r(n)/r(n+1)=r(n+1)/r(n+2);求出接下去的圆的半径。
     
  • 相关阅读:
    c#缓存技术(Dictionary)
    反射Reflection创建
    SQL Server手注之延时型盲注
    MySQL——事务
    MySQL——NULL值处理
    MySQL——连接的使用
    SQL server手注之报错注入
    SQL Serves手注之联合查询注入
    MySQL手注之ROOT权限处理
    MySQL——正则表达式
  • 原文地址:https://www.cnblogs.com/starve/p/11164586.html
Copyright © 2011-2022 走看看