Fun with fibo

CodeChefOpen on judge ↗

The fibonacci series is defined as : F1 = 1 F2 = 1 F3 = 2 F4 = 3 F5 = 5 F6 = 8 . . . . Given an array A of size N, you must print the GCD(FA[1], FA[2], FA[3], .... FA[N]) % (10^9 + 7). Input The first line contains an integer N. Next line has N space separated integers A1, A2, A3... AN denoting the array. Output For each test case, print the value of GCD in a new line Constraints - 1 ≤ 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