ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1967. Programmer Casino

How to prove?
Posted by bsu.mmf.team 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?
Re: How to prove?
Posted by Ilya Zvigintsev [Tomsk PU] 31 Jul 2016 20:51
Yes, there is a proof. Your e-mail, please.
Re: How to prove?
Posted by bsu.mmf.team 1 Aug 2016 20:14
pp.miroslav@gmail.com
Re: How to prove?
Posted by lxn 30 Aug 2016 11:24
Brute force answers for N = 2.. 500 is a vary good hint for this problem ). Thank you.