[Problem Statement](https://open.kattis.com/problems/sequences)↵
↵
[Code](https://hastebin.com/umiguvegat.cpp)↵
↵
I tried using the logic in [this blog post](http://mirror.codeforces.com/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!
↵
[Code](https://hastebin.com/umiguvegat.cpp)↵
↵
I tried using the logic in [this blog post](http://mirror.codeforces.com/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!
