Series vs Wall
CodeChefOpen on judge ↗
Rahul Dravid may have gone into retirement but his job of facing the bouncers isn't over yet . Only this time , it is his son who is delivering them in the form of mathematical queries . One such query is finding the nth term of the series given by f(n) = f(n-2) + f(n-3) + n*2 your task is to help Dravid solve the query , given f(0)=0 , f(1)=1 , f(2)=1 Input first line denotes the number of te
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