SOLVING THE MYSTERY

CodeChefOpen on judge ↗

The hidden nation mystery theory stood unsolved for 280 years. Who ever proves this theory will be regarded as one of the greatest achiever of that time. A famous adventurer Portgas D.Ace managed to reduce the concept to this problem: Given a number x, how many polynomials P with coefficients in set {0,1,2,3,4,5,6,7} have: P(2)=x? Help Portgas D.Ace solve this long standing problem!

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