Hi, I am just a beginner with C++. Someone pls help me to get a C/C++ program for the below question.
1. A yard of length 100m with reflector at starting point and ending point.
2. There are 6 jumpers standing at 1m,2m,3m,4m,5m,6m respectively.
3. We know the jumping length of 2nd,3rd,4th,5th and 6th jumpers(ex: if 2nd jumpers jumping length is 5, then he can reach 7th meter in first jump(bcoz he starts from 2nd meter and respectively for all other jumpers). When any 2 or all the jumpers reach the same position after 1st or certain jumps they must be eliminated.
4. Each jumper needs to complete 100 jumps during which hen they reach reflector after 10th meter of the yard, they will fallback to 100 which will consume one jump and move back and fro after reaching reflectors at both end and will stop at a certain position after 100th jump without any collision.
5. All jumpers jumps simultaneously.
6. From the above, we need to find the minimum jumping length of the 1st jumper without any collision.