首页 > 代码库 > hzau 1200 Choosy in Food
hzau 1200 Choosy in Food
1200: Choosy in Food
Time Limit: 1 Sec Memory Limit: 1280 MBSubmit: 32 Solved: 5
[Submit][Status][Web Board]
Description
Xiao Ming find n trees (labeled 0...n-1) which join a circle in a magical land. Each tree
is covered with ripe berries. Xiao Ming wants to find the tree whose berries are most delicious. He starts from the tree X, walks clockwise to find the target. Each time the probability of him walking k trees is Pk% . P1+P2+..+Pk = 100
Now we know the target of Xiao Ming is the tree Y. Require to know expectation of the number of the trees which Xiao Ming walk through
Input
The first parameter is T, indicates the case number.
In each case, there are four integers at the first line, N, M, X , Y (Tree labels from 0 to N-1, N < 100, M < N).
Output
The expectation of the number of trees Xiao Ming walk through. It will be reserved two decimal places. If Xiao Ming will never arrive the tree, output -1.
Sample Input
2 4 2 0 150 50 4 1 0 2 100Sample Output
4.202.00HINT
hzau 1200 Choosy in Food