SDKD 2016 Summer Single Contest #03.C
2016-07-08 18:21
190 查看
Description
A girl named Xenia has a cupboard that looks like an arc from ahead. The arc is made of a semicircle with radius r (the cupboard’s top) and two walls of height h (the cupboard’s sides). The cupboard’s depth is r, that is, it looks like a rectangle with base r and height h + r from the sides. The figure below shows what the cupboard looks like (the front view is on the left, the side view is on the right).
Xenia got lots of balloons for her birthday. The girl hates the mess, so she wants to store the balloons in the cupboard. Luckily, each balloon is a sphere with radius . Help Xenia calculate the maximum number of balloons she can put in her cupboard.
You can say that a balloon is in the cupboard if you can’t see any part of the balloon on the left or right view. The balloons in the cupboard can touch each other. It is not allowed to squeeze the balloons or deform them in any way. You can assume that the cupboard’s walls are negligibly thin.
Input
The single line contains two integers r, h(1 ≤ r, h ≤ 107).
Output
Print a single integer — the maximum number of balloons Xenia can put in the cupboard.
Sample Input
Input
1 1
Output
3
Input
1 2
Output
5
Input
2 1
Output
2
题目:
这题他喵的就是一数学题;
根据数据想想,
现在就要分析h
A girl named Xenia has a cupboard that looks like an arc from ahead. The arc is made of a semicircle with radius r (the cupboard’s top) and two walls of height h (the cupboard’s sides). The cupboard’s depth is r, that is, it looks like a rectangle with base r and height h + r from the sides. The figure below shows what the cupboard looks like (the front view is on the left, the side view is on the right).
Xenia got lots of balloons for her birthday. The girl hates the mess, so she wants to store the balloons in the cupboard. Luckily, each balloon is a sphere with radius . Help Xenia calculate the maximum number of balloons she can put in her cupboard.
You can say that a balloon is in the cupboard if you can’t see any part of the balloon on the left or right view. The balloons in the cupboard can touch each other. It is not allowed to squeeze the balloons or deform them in any way. You can assume that the cupboard’s walls are negligibly thin.
Input
The single line contains two integers r, h(1 ≤ r, h ≤ 107).
Output
Print a single integer — the maximum number of balloons Xenia can put in the cupboard.
Sample Input
Input
1 1
Output
3
Input
1 2
Output
5
Input
2 1
Output
2
题目:
这题他喵的就是一数学题;
根据数据想想,
现在就要分析h
#include <iostream> #include <cstdio> #include <cstring> #include <string> #include <cmath> #include <algorithm> using namespace std; const int maxn = 1000 + 10; int main() { double r, h; scanf("%lf%lf", &r, &h); long long num = 0; num += int(h/r)* 2; h -= int(num / 2) * r; if(2 * h >= r * sqrt(3)) num += 3; else { if(h * 2.0 >= r) num += 2; else num += 1; } printf("%lld", num); return 0; }
相关文章推荐
- 简单的四则运算
- 数的奇偶性
- ACMer博客瀑布流分析
- ACM程序设计大赛题目分类
- 计算字符串最后一个单词长度
- ACM网址
- 1272 小希的迷宫
- 1272 小希的迷宫
- hdu 1250 大数相加并用数组储存
- 矩阵的乘法操作
- 蚂蚁爬行问题
- 蚂蚁爬行问题
- 求两个数的最大公约数【ACM基础题】
- 打印出二进制中所有1的位置
- 杭电题目---一只小蜜蜂
- HDOJ 1002 A + B Problem II (Big Numbers Addition)
- 初学ACM - 半数集(Half Set)问题 NOJ 1010 / FOJ 1207
- 初学ACM - 组合数学基础题目PKU 1833
- POJ ACM 1002
- POJ 2635 The Embarrassed Cryptographe