Problem

Source: Romanian TST 1979 Day 1 P5

Tags: combinatorics, counting



In how many ways can we fill the cells of a $m\times n$ board with $+1$ and $-1$ such that the product of numbers on each line and on each column are all equal to $-1$?