【模拟】Cupboard and Balloons

Cupboard and Balloons

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 + rfrom 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 test(s)

input

1 1

output

3

input

1 2

output

5

input

2 1

output

2

这道题真不难，但比赛的时候wa哭了。

还是因为自己思路不清楚。

最后竟然栽在了这里：

  O

O  O

下面两个球的中点高度为L，则最后点的高度应为 L + 2 * r * sqrt(3.0) / 2 

而我一开始一直写成了 L + 2 * r  / sqrt(2.0) 

。。。

#include

#include

#include

using namespace std;

int main()

{

    int r, h;

    scanf("%d%d", &r, &h);

    int sum;

    sum = (h / r)*2;

    

    double l = (sum/2)*r;

    if (l + double(r) / 2 <= h)

    {

        l = l + double(r) / 2;

        sum = sum + 2;

    }

    else

        if (sum!=0) l = l - double(r) / 2;

    

    if (sum != 0)

    {

        l = l + double(r) * sqrt(3.0)/2;

        l = l + double(r) / 2;

        if (l <= r + h) sum++;

    }

    else sum = 1;

    printf("%d\n", sum);

    return 0;

}