Chef and his routes

CodeChefOpen on judge ↗

In order to conduct the event of Genesis ’17 successfully, Chef works hard to get things right. He goes from corner to corner of the college just to make sure nothing gets left behind. Consider his college as a MxN grid architecture (M being the number of rows and N being the number of columns.) The chef wants to know how many possible ways are there for him to go from the top-left corner of the c

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