Queries
CodeChefOpen on judge ↗
Edward Elric has learnt new Alchemy technique, if he uses this technique on 1x1 block with power f[i] then height on this block increases by f[i],also his power in ith move depends on powers of his previous three moves i.e. f[i] = x*f[i-1] + y*f[i-2] + z*f[i-3] here x,y,z are some constant and if he uses technique for first, second, third time then his power will be f1,f2,f3. To test Edward's pow
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