Chota Bheem and Sequence

CodeChefOpen on judge ↗

Recently Bheem and their friends studied well known fibonacci sequence in their school. Afibonacci sequence is generated by the recursive formula: F[n]=F[n-1]+F[n-2] where n>1 and F[0]=F[1]=1. Then Bheem started playing with similar type of sequences. In this process he came up with generalized tetranacci numbers. Generalized tetranacci numbers are defined by following recurrence relation: T[n] =

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