zoj 3866
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu
Description
Edward the confectioner is making a new batch of chocolate covered candy. Each candy center is shaped as a cylinder with radius r mm and height h mm.
The candy center needs to be covered with a uniform coat of chocolate. The uniform coat of chocolate is d mm thick.
You are asked to calcualte the volume and the surface of the chocolate covered candy.
Input
There are multiple test cases. The first line of input contains an integer T(1≤ T≤ 1000) indicating the number of test cases. For each test case:
There are three integers r, h, d in one line. (1≤ r, h, d ≤ 100)
Output
For each case, print the volume and surface area of the candy in one line. The relative error should be less than 10-8.
Sample Input
2
1 1 1
1 3 5
Sample Output
32.907950527415 51.155135338077
1141.046818749128 532.235830206285
题目描述: 抽象出来就是求一个圆柱体外面加一层厚度为d的巧克力,求包装完这个立体图形的体积和表面积。
最新文章
- WPF中父子窗口的层次关系
- 第五讲:深入hibernate的三种状态
- XCODE4.6从零开始添加视图
- *[hackerrank]Tree Covering
- 【转】patch命令
- C# 操作配置文件
- [转]C#中yield用法
- ASP.NET MVC源码分析
- POJ3259负环判定
- Raid 5数据恢复原理以及raid 5数据恢复实际操作案例
- Spring Security Oauth2系列(一)
- 前端校验插件——Validator简单使用
- Vue学习四:v-if及v-show指令使用方法
- > Raiders 项目配置
- Magic Powder - 2 (CF 670_D)
- Python2.7-copy
- NGINX高并发配置
- Backbone学习笔记 - Collection及Router篇
- 性能调优的本质、Spark资源使用原理和调优要点分析
- 2018百度之星开发者大赛-paddlepaddle学习
热门文章
- [luoguP2216] [HAOI2007]理想的正方形(二维单调队列)
- ES6__数据结构 Map
- jQuery的对象访问函数(get,index,size,each)
- msp430项目编程03
- 修改flex chart中Legend的字体样式
- Construct Binary Tree from Preorder and Inorder Traversal (DFS,参考)
- css中高度比img多出4px的问题
- hdu 5087 Revenge of LIS II ( LIS ,第二长子序列)
- POJ3264Balanced Lineup(最基础的线段树)
- linux系列之-—03 常见问题