Problem 44339. Recaman Sequence - II

Created by Mehmet OZC

Solve Later

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 :

Solve

Solution Stats

Last solution submitted on Sep 15, 2019

Last 200 Solutions

Problem Comments

2 Comments

2 Comments

Jakub on 7 Nov 2017

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.

Qi Zhang on 1 Jan 2018

I met the problem too. Should we use some mathematical characters of the sequence to improve our codes? I'm not quite sure.

Problem 44339. Recaman Sequence - II

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers197

Suggested Problems

More from this Author57

Tags

Problem 44339. Recaman Sequence - II

Solution Stats

Last 200 Solutions

Problem Comments

Recent Solvers197

Suggested Problems

More from this Author57

Tags

Players