K-Fibonacci

CodeChefOpen on judge ↗

Chongaman thinks of Fibonacci in a different way than others, he calls it $K-FIBBONACCI$. Here is how it works: You are given $K$ and $N$, and $K integers$. We have to find $Nth$ term of the K-Fibonacci series. The nth term is the addition of the previous $K$ integers. Please see the input and output for more clarification. ###Input: We have two lines of input - The first line wi

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