Story of Matrix
CodeChefOpen on judge ↗
"$Happy$ $Diwali$" an awesome story by Nykterstein, today he wanted to tell you guys this awesome story, but he knew you guys would be annoyed reading the story rather than the problem. So, he decided to tell the awesome story only if you solve this problem. Consider a Matrix $M$ of size $N$x$N$ where $M[i][j]$ represents the element in $i$-th row and $j$-th column, with $1$ based indexing.
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