Take an arbitrary starting point as input and create Recaman Sequence. Then find the 1, return its index.
For example: if n = 0 (default Recaman sequence)
seq = [0 1 3 6 2];
1 is in the second place.
if n = 10;
seq = [10 9 7 4 8 3 9 2 10 1 11 22 34 21];
1 is in the 10th place
Related Challenges :
Weirdly, the code that finishes the biggest problem in 0.6 sec on my machine will not finish on the server. Is 0.6 sec too long for the server, or is it an error? I'm not clever enough to understanding this, please help.
I met the problem too. Should we use some mathematical characters of the sequence to improve our codes? I'm not quite sure.
1963 Solvers
647 Solvers
Determine the number of odd integers in a vector
320 Solvers
Simple equation: Annual salary
3407 Solvers
283 Solvers