| 시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
|---|---|---|---|---|---|
| 1 초 | 2048 MB | 73 | 20 | 16 | 25.806% |
You are building a new solar farm. The area in which you are allowed to build is a circular field of radius $r,ドル and the solar panels each take up a rectangular space of size $w \times h$. You must place all the panels in the same orientation of your choice in a single rectangular array (so that all of the panels combined exactly form a single rectangle). What is the maximum number of panels that you can fit in this farm?
The first line of input contains a single integer $T$ (1ドル\leq T \leq 1,000円$). This is the number of test cases.
The next $T$ lines of input each represent one test case and consist of three space-separated integers $r,ドル $w,ドル and $h$ (1ドル \leq r, w, h \leq 10^9$): the radius of the field, the width of each solar panel, and the height of each solar panel, respectively.
For each test case, print a line with a single integer: the maximum number of solar panels that can be placed in a solar farm within the circular field.
3 5 4 3 2 2 2 8 1 5
4 1 24
The diagram below illustrates one optimal layout of solar panels for each of the three test cases in Sample Input 1 (from left to right).
2 500000003 1 600000010 511374200 637192506 100000000
799999999 7
ICPC > Regionals > North America > North America Championship > North America Championship 2025 L번