Problem link: https://uva.onlinejudge.org/external/121/p12143.pdf

I got a solution here : http://mypaper.pchome.com.tw/zerojudge/post/1325083499

But I failed to understand how the problem is reduced to gaussian elimination. Can anybody explain please? If there are any other ideas please feel free to share.

Thanks for you help.

Can someone please provide links where I can practice integration related problem? If you have any suggestion please feel free to suggest. Thanks in advance.

Given a number in base -2 in binary form. return negative of that number in base -2 in binary form. Given [1,0,0,1,1,1] => return [1,1,0,1,0,1,1]. [1,0,0,1,1,1] = -23 (from left) , neg(-23) = 23 in base -2, 23 is [1,1,0,1,0,1,1]. Length of the given array <= 10^5

Any idea? Thanks in advance.

sub1: http://mirror.codeforces.com/contest/512/submission/9696765 sub2: http://mirror.codeforces.com/contest/512/submission/9696746

Difference between above two code in line 24. in AC submission I wrote ar[111] where n=100. In another submission I wrote ar[33]. But the second verdict is WA. Why that happen?