Problem8307--HDU4405 - Aeroplane chess

8307: HDU4405 - Aeroplane chess

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 256 MiB  Special Judge

Description

Hzz loves aeroplane chess very much. The chess map contains N+1 grids labeled from 0 to N. Hzz starts at grid 0. For each step he throws a dice(a dice have six faces with equal probability to face up and the numbers on the faces are 1,2,3,4,5,6). When Hzz is at grid i and the dice number is x, he will moves to grid i+x. Hzz finishes the game when i+x is equal to or greater than N.
There are also M flight lines on the chess map. The i-th flight line can help Hzz fly from grid $X_i$ to $Y_i$ without throwing the dice. If there is another flight line from Yi, Hzz can take the flight line continuously. It is granted that there is no two or more flight lines start from the same grid.
Please help Hzz calculate the expected dice throwing times to finish the game.


跳棋有 0~n 个格子,每个格子 X 可以摇一次色子,色子有六面 $p\ (1 \leq p \leq6)$,概率相等,可以走到 X+p 的位置,有些格子不需要摇色子就可以直接飞过去。
问从 0 出发到达 n 或超过 n 摇色子的次数的期望。

Input

There are multiple test cases.
Each test case contains several lines.
The first line contains two integers N (1≤N≤100,000) and M (0≤M≤1,000).
Then M lines follow, each line contains two integers $X_i,Y_i\ (1≤X_i<Y_i≤N)$. 
The input end with N=0, M=0.

Output

For each test case in the input, you should output a line indicating the expected dice throwing times. Output should be rounded to 4 digits after decimal point.

Sample 1 Input

2 0
8 3
2 4
4 5
7 8
0 0

Sample 1 Output

1.1667
2.3441

HINT

相同题目:HDU 4405

Source/Category

概率DP