B-I-T-S

CodeChefOpen on judge ↗

Bose Integrated Technical System (B I T S) recently created a NFA machine. The aim of this machine is to count no of values from 0 to given number N. satisfying following grammar rule: Let's says I be some number b/w 0 and N(inclusive): rule is if N^I = N+I then I is accepted. As CEO of B.I.T.S, Mr. Raghu is occupied with other works, he asks you for help to build this machine. NOTE: Here N

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