Diferente pentru problema/dristor2 intre reviziile #3 si #4
Nu exista diferente intre titluri.
Diferente intre continut:
h2. Restricţii
* $1 ≤ N ≤ 14$ * $1 ≤ M ≤ 100$ * For tests worth 20 points,(1 ≤ N, M ≤ 6).
* $1 ≤ $N$ ≤ 14$ * $1 ≤ $M$ ≤ 100$ * For tests worth 20 points, 1 ≤ $N$, $M$ ≤ 6.
* For tests worth 10 more points, each of the N package hunters knows where all the secret locations are. h2. Exemplu
