Problem Description
Michael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise.
At first the robot is in cell 1. Then Michael uses a remote control to send m commands to the robot. A command will make the robot walk some distance. Unfortunately the direction part on the remote control is broken, so for every command the robot will chose a direction(clockwise or anticlockwise) randomly with equal possibility, and then walk w cells forward.
Michael wants to know the possibility of the robot stopping in the cell that cell number >= l and <= r after m commands.
![](https://i-blog.csdnimg.cn/blog_migrate/4a8bcbc060fdf4f3aaa2d9f5b0a837bb.jpeg)
At first the robot is in cell 1. Then Michael uses a remote control to send m commands to the robot. A command will make the robot walk some distance. Unfortunately the direction part on the remote control is broken, so for every command the robot will chose a direction(clockwise or anticlockwise) randomly with equal possibility, and then walk w cells forward.
Michael wants to know the possibility of the robot stopping in the cell that cell number >= l and <= r after m commands.
Input
There are multiple test cases.
Each test case contains several lines.
The first line contains four integers: above mentioned n(1≤n≤200) ,m(0≤m≤1,000,000),l,r(1≤l≤r≤n).
Then m lines follow, each representing a command. A command is a integer w(1≤w≤100) representing the cell length the robot will walk for this command.
The input end with n=0,m=0,l=0,r=0. You should not process this test case.
Each test case contains several lines.
The first line contains four integers: above mentioned n(1≤n≤200) ,m(0≤m≤1,000,000),l,r(1≤l≤r≤n).
Then m lines follow, each representing a command. A command is a integer w(1≤w≤100) representing the cell length the robot will walk for this command.
The input end with n=0,m=0,l=0,r=0. You should not process this test case.
Output
For each test case in the input, you should output a line with the expected possibility. Output should be round to 4 digits after decimal points.
Sample Input
3 1 1 2 1 5 2 4 4 1 2 0 0 0 0
Sample Output
0.50000.2500
#include<cstdio> #include<iostream> #include<cstring> #include<algorithm> using namespace std; const int maxn=210; int n,m,l,r,w; double f[2][maxn],*t,*now; int main() { while (cin>>n>>m>>l>>r,n+m+l+r) { memset(f,0,sizeof(f)); f[0][1]=1; t=f[0]; now=f[1]; for (int i=1;i<=m;i++) { scanf("%d",&w); for (int j=1;j<=n;j++) { int x=j-w,y=j+w; if (x<1) x+=n; if (y>n) y-=n; now[j]=(t[x]+t[y])/2; } swap(t,now); } double ans=0; for (int i=l;i<=r;i++) ans+=t[i]; printf("%.4lf\n",ans); } return 0; }