Dimitri places the maximum possible number of Rooks on a $100\times 100$ chessboard in such a way that there's no two Rooks that attack each other. How many squares are under attack?

Note: A Rook does not attack the square on which it is.

Your answer seems reasonable.
Find out if you're right!