Binary Table minimize operations

Правка en1, от SPyofgame, 2020-11-19 05:53:50

Is there an algorithm other than brute-force to find minimum number of operations in these problem ? (Easy Version: Div 2, Div 1 / Hard Version: Div 2, [Div 1](https://codeforces.me/contest /1439/problem/A2))

I am wondering if I can use Gauss-Elimination (mod 2) or Greedy-DP to solve in somehow

Solutions without minimizing

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en13 Английский SPyofgame 2020-11-22 13:16:03 8
en12 Английский SPyofgame 2020-11-22 13:14:57 7588 Tiny change: 'cdot k + 4, k \in \mathbb{N}$, we need' -> 'cdot k + 4 (k \in \mathbb{N})$, we need'
en11 Английский SPyofgame 2020-11-21 12:04:30 2936
en10 Английский SPyofgame 2020-11-21 11:12:55 1977
en9 Английский SPyofgame 2020-11-19 15:23:51 60
en8 Английский SPyofgame 2020-11-19 12:31:41 184
en7 Английский SPyofgame 2020-11-19 12:25:20 461
en6 Английский SPyofgame 2020-11-19 12:22:08 4568
en5 Английский SPyofgame 2020-11-19 11:17:33 169 Tiny change: 'om/contest\n/1439/prob' -> 'om/contest/1439/prob'
en4 Английский SPyofgame 2020-11-19 05:59:56 6
en3 Английский SPyofgame 2020-11-19 05:59:11 532 Tiny change: ' and $1$\n\nYou can ' -> ' and $1$\nYou can '
en2 Английский SPyofgame 2020-11-19 05:56:22 552 Tiny change: 'th comment)">\n\n<sp' -> 'th comments)">\n\n<sp'
en1 Английский SPyofgame 2020-11-19 05:53:50 16258 Initial revision (published)