25 人解决，56 人已尝试。
31 份提交通过，共有 392 份提交。
6.4 EMB 奖励。
单点时限: 5.0 sec
内存限制: 256 MB
The problem is to cut the largest possible number of circles with diameter $y$ out of a stripe of length $x$ and width $y$.
The only line of input consists of two positive real numbers x and y with 9-digit precision separated by spaces. The integers may be written without decimal point.
Output a single integer: the maximum number of circles one can cut out of the stripe.
6.3 0.9 0.63 0.09 1 1
7 7 1
25 人解决，56 人已尝试。
31 份提交通过，共有 392 份提交。
6.4 EMB 奖励。
创建: 13 年前.
修改: 6 年，9 月前.
最后提交: 11 月前.
来源: N/A