Discussion @ 1967. Programmer Casino @ Timus Online Judge

bsu.mmf.team How to prove? [3] // Problem 1967. Programmer Casino 29 Jul 2016 20:29

I've just brute-forced answers for N = 2...500 and found the trick.
But how to prove it is always correct or, at least, for the given binary sequences?

Ilya Zvigintsev [Tomsk PU] Re: How to prove? [1] // Problem 1967. Programmer Casino 31 Jul 2016 20:51

Yes, there is a proof. Your e-mail, please.

bsu.mmf.team Re: How to prove? // Problem 1967. Programmer Casino 1 Aug 2016 20:14

pp.miroslav@gmail.com

lxn Re: How to prove? // Problem 1967. Programmer Casino 30 Aug 2016 11:24

Brute force answers for N = 2.. 500 is a vary good hint for this problem ). Thank you.

Discussion of Problem 1967. Programmer Casino