Flibonakki

CodeChefOpen on judge ↗

Flibonakki series G(n) is defined as G(n) = G(n-1) + f(4n-1) , for n > 0 and G(0) = 0 f(i) is our good old Fibonacci series. Given n you need to evaluate G(n). Input First line contains number of test cases t (tOutput For each test case print the nth flibonakki number modulo 1000000007. Example Input: 2 2 4 Output: 15 714

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