Problem

Source: Romania EGMO TST 2020 Day 3 P2

Tags: combinatorics, romania, Chessboard



Let $n$ be a positive integer. In how many ways can we mark cells on an $n\times n$ board such that no two rows and no two columns have the same number of marked cells? Selim Bahadir, Turkey