Jarvis 101

CodeChefOpen on judge ↗

A team of developers want to hack a supercomputer, Jarvis which has a binary string of length $n$ as a password. The only information they have is that the binary string does not have "101" as a substring. Find the minimum number of attempts needed to ensure that the password is guessed correctly. As the answer can be large, print your answer modulo 1000000007. ___ ###Input The first li

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