Easy One

CodeChefOpen on judge ↗

Implement a modified Fibonacci sequence using the following definition: Given terms: t[i] and t[i+1] where i belongs to (1,infinity),term t[i+2] is computed as: ti+2=ti+(ti+1)^2 Given three integers , t1, t2 , and n , compute and print the nth term of a modified Fibonacci sequence. ### Input A single line of three space-separated integers, the values of t1 , t2 , and n . ### Output int: the nth

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