You have an n × n grid of empty squares. You place a cross in all the squares, one at a time. When you place a cross in an empty square, you receive i+j points if there were i crosses in the same row and j crosses in the same column before you placed the new cross. Which are the possible total scores you can get?
It's a pity, but I can't solve this problem yet, although have already completed half of the course on algorithms. I even made more than a million playing at but this task is difficult for me. I hope that will solve it soon.
Who has any ideas?
|
|
Posted by Tom Ran
on 2020-12-08 09:11:30 |
Solution
