Recursion is fun!!

CodeChefOpen on judge ↗

$Scube$ is working on a recursion, which is same as the following function. string f( int N ) { if (N == 0) return "a"; if (N == 1) return "b"; if (N == 2) return "c"; return f( N - 1 ) + f( N - 2 ) + f( N - 3 ); } But he doesn't have time to code this, so he will give you two number $N$ and $K$, find the $Kth$ character in the string returned by $f(N)$. ###Inpu

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