Gym Freak

CodeChefOpen on judge ↗

Saurav is a Gym Freak and he has an N day plan. He may or may not go to the gym on any day. He is very lazy and do not want to go to the gym for more than one consecutive day. Given number of days N , print the number of ways N day plan can be completed. Note that it is possible to not to go to the gym any day at all and still complete the plan. Input The first line contains T, the number of

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