Lamps Grid#1301
You have a rectangular table with a grid of lamps ( rows and columns). Each lamp can be in one of two states: ON or OFF. Under each column, there is a switch. Flipping a switch toggles the state of all lamps in that column (ON becomes OFF and vice versa).
A row is considered lit if all lamps in that row are ON. You must perform exactly flips. The flips do not have to be on distinct switches; any switch may be flipped any number of times. Your task is to find the maximum number of rows that can be lit after exactly flips.
The first line contains three integers: , (1 \leq L, W \leq 50), and (0 \leq K \leq 1000). Each of the next lines contains characters '0' or '1', describing the state of the lamps in the grid. The -th character of the -th line is '1' if the lamp in row , column is initially ON, and '0' otherwise.
Print the maximum number of rows that can be lit after exactly flips.
Example 1