Fibonacci Powers
CodeChefOpen on judge ↗
The Fibonacci numbers are a set defined by the relation Fn = Fn-1 + Fn-2 with the initial values F1 = 1 and F2 = 2. Given integers n and m, find nFm mod 1,000,000,009. Input The first line of the test case contains an integer T, the number of testcases. Each of the following T lines contains two integers separated by a single space, N and m. Output For each test case, print a single int
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.
Sign in to chat with the tutor and save your progress.
Sign in to start