KESHOW CHALLENGES AMIT

CodeChefOpen on judge ↗

Chef Keshow and Chef Amit are taking discrete mathematics course. Today, they learnt about recurrence relation. After the class, Chef Keshow challenged Chef Amit to solve a recurrence relation. Chef Keshow gave Chef Amit a recurrence relation of the form T(n) = a T(n-1) + b T(n-2) + c T(n-3) + d where a,b,c and d are four constant positive integers and first three terms of the sequence are inp

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