OJ Board

Did it, still WA. Already tried with and without the final \n;

Input:
2
:) ~ :D ~~~~ :))))))) :D :D :D
:P :P :P :P
AC Output:
Case #1:
2
Case #2:
2

I ran it on toolkit and it gave me the same output my code did:
Case #1:
0
Case #2:
0

Indeed, it doesn't really matter once judge ignores capital letters (there won't be capital inputs, it's in the ...

I've been trying to solve this one for a while now, and it only gives me WA, even though it passed all test cases I could find for it.
I don't see what is missing for that to fit in Ac. Can anyone help?

It gives me WA even though I passed all test cases:
EDIT: Nvm, i was forgeting the almost invisible ":" at the end of the "Case n#:" line

Damn I see it... my array won't handle 256 nodes if they're not perfectly arranged.
Scare thing is: to handle up to 256 ordered like that, my array needs 2²?? integers, that's fucked up...

I'll try bigger arrays, if they don't do it, I'll have to create a whole different algorithm =/.

Thanks ...

I keep getting WA on this problem, but I can't find a problem on my algorithm.

Here's my code:
http://pastebin.com/d6Xc7DP1
#include <cstdio>
#include <cstdlib>
#include <cstring>
#define NUM_NODES 256

template <class T>
class Tree
{
private:
T heap[NUM_NODES];
int hs[NUM_NODES]; // HeapStatus ...