编程介的小学生 2016-10-23 10:02 采纳率: 19.7%
浏览 1113
已采纳

算法,如何切割金字塔?

问题描述 :

Yaya and maomao have a cake. And the shape of the cake is a pyramid. As the following picture, AB=AC=AD=BC=BD=CD=N. Now they want to cut the cake to two same volume pieces as following picture. And EF is on the plane BCD and parallel to CD. GH is on the plane ACD and parallel to CD, too. Now give you the length of CE=L, and ask you to calculate the length of AG.
N Knight

输入:

Input contains multiple cases each presented on a separate line. Each line contains two integer numbers N(5<=N<=1000),L (0<=L<=N).
输出:

Input contains multiple cases each presented on a separate line. Each line contains two integer numbers N(5<=N<=1000),L (0<=L<=N).
样例输入:

1000 500
1000 200
样例输出:

500.00
Oh, my god!

  • 写回答

1条回答 默认 最新

  • threenewbee 2016-10-23 10:03
    关注
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论

报告相同问题?

悬赏问题

  • ¥15 【悬赏】canvas 椭圆形内小球边缘与小球碰撞检测
  • ¥50 Delphi5环境下图片文件怎么转换成Base64编码?
  • ¥15 将GPDO_0引|脚设首成PWM1的输出引脚 实验编程该怎么写
  • ¥50 阿里云服务器 CentOS7.9 搭建 openvpn 服务
  • ¥100 开源软件弱点处理规范
  • ¥15 excel如何根据文件名自动搜索并批量导入文件?
  • ¥15 VScode 用户代码片段图标
  • ¥15 streamingtool
  • ¥15 MATLAB图像问题
  • ¥20 树莓派5做人脸情感识别与反馈系统