Sita Mata and Time Machine
CodeChefOpen on judge ↗
Sita Mata was explaining about a Time Machine to Lord Hanuman, which had $n$ Time States. The Time Machine was basically described by a $n$ x $n$ Matrix. - For Example: $n$ = $3$, and the corresponding Matrix is: [ [ 0 1 2 ] [ 0 0 1 ] [ 1 2 0 ] ] - The First Row [0 1 2] describes the Time State-$1$. Also, it states that there is $1/3$ probability of going from Time State-$1$ to Time State-$2$ an
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.
Sign in to chat with the tutor and save your progress.
Sign in to start