Editorial for GFSSOC '14 Winter J4 - Tic Tac Moe!


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

Using brute force, check for O win, then check for X win. Output in accordance. The most difficult part of this problem is actually making the 2-D array.

Skills needed: If statements, array manipulation

Time complexity: \mathcal O(1)


Comments

There are no comments at the moment.