Fibonacci Wars I

CodeChefOpen on judge ↗

Chef's city contains a straight line of N regions numbered 1 to N in increasing order. Fibonazi have started bombing the city at different regions. Now their bombs are weird, when Fibonazi drop a bomb of intensity d at some position x, region x suffers a damage equal to Fd, where Fd is the dth Fibonacci number (F0 = 0), regions x - 1 and x + 1 (if they exist) suffer a damage Fd - 1 and so on (re

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