I'm stuck on MLE at a 3 month old problem, I feel I should complete that, Please take a look and help me out 1981C - Turtle and an Incomplete Sequence My code : 264590950 PS: My code is a bit complex, but my idea is very similar to the one given in the editorial of this contest, by traversing, x/2 2x and 2x+1, until I reach my required value, also adhering to constraints
can step number be equal to n? i mean n==step