0

Matt reaches the final round of a treasure hunt. In this, he finds that as he proceeds there are flags with the number written on them at different positions. The difference between two consecutive flags can be either a or b. If he finds the number on the first flag is 0. Given three integer, first one is number of flags present, second is a and third is b. then return all the possible values for last flag for each test case. hunt({3 1 2}) = {2 3 4}

Treasure Hunt

6th Aug 2016, 6:23 PM
Sumit Tyagi
Sumit Tyagi - avatar
2 Antworten
0
We are not solving your homework. Slackers are not welcome here. Show some work first, show what you already tried.
1st Dec 2016, 11:10 AM
Seckar
Seckar - avatar
0
Itz Thee Creator
19th Nov 2017, 5:07 AM
Adrian Market