시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
15 초 (추가 시간 없음) | 1024 MB | 1 | 1 | 1 | 100.000% |
Jemma is competing in a robotics competition. The challenge for today is to build a robot that can navigate around a hole in the arena.
The arena is a grid of squares containing W columns (numbered 1 to W from left to right) and H rows (numbered 1 to H from top to bottom). The square in the x-th column and y-th row is denoted (x, y). The robot begins in the top left square (1,1) and must navigate to the bottom right square (W, H).
A rectangular subgrid of squares has been cut out of the grid. More specifically, all the squares that are in the rectangle with top-left square (L, U) and bottom-right square (R, D) have been removed.
Jemma did not have much time to program her robot, so it follows a very simple algorithm:
Jemma passes the challenge if her robot avoids falling into the hole and makes it to the square (W, H). What is the probability she passes the challenge?
The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of a single line containing W, H, L, U, R and D.
For each test case, output one line containing Case #x: y
, where x
is the test case number (starting from 1) and y
is a real number between 0 and 1 inclusive, the probability that Jemma passes the challenge.
y
will be considered correct if it is within an absolute or relative error of 10-5 of the correct answer.
4 3 3 2 2 2 2 5 3 1 2 4 2 1 10 1 3 1 5 6 4 1 3 3 4
Case #1: 0.5 Case #2: 0.0625 Case #3: 0.0 Case #4: 0.3125
Contest > Google > Kick Start > Google Kick Start 2020 > Round B D번