Secret Treasure

CodeChefOpen on judge ↗

The treasure box is in front of you , but the problem is that it is locked with N locks .Each lock has some number written over it , say i . To get the treasure you have to find the keys of all the locks.. The clue is in the series 1 , 1 , 1 , 1 , 1 , 9 , 17 , 25 , 57 , 113 , and so on. You have to find the ith number of the above series (mod 10^9+7). Input First Line contains the number of lock

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI