0-1 Sequences Kattis Problem
Difference between en1 and en2, changed 58 character(s)
[Problem Statement](https://open.kattis.com/problems/sequences)↵

[Code](https://hastebin.com/umiguvegat.cpp)↵

I tried using the logic in [this blog post](http://codeforces.net/blog/entry/48143), but I keep getting WA. My code uses the identity 0*nC0+1*nC1+2*nC2+...+n*nCn = n*2^(n-1).↵

Can someone please find the flaw in my counting method
 (or even better, provide a test case that breaks my code)?↵

Thanks in advance!

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English vamaddur 2017-11-06 06:41:13 58
en1 English vamaddur 2017-11-06 06:40:28 397 Initial revision (published)