OJ Board

You're Wrong. Output for cases n 0 should be 1 instead of 0.

Hi, I got WA in this problem, but I don't know if my approach is wrong. Here is it:

I consider the vector space R^3 and treat the mixtures as vectors in that space. I make a set S of linearly independant vectors, where S is formed by some of the n mixtures. Then:
If size(S) >=3 then it is always ...

Hi, what is the output for 1 and 0? Should it be "1 coconut, no solution" or "1 coconuts, no solution"?
Anyway, could anyone give the output for the following numbers?
0
1
2
3
7
253
509
65529
16777209

Thanks in advance!
Javi

I think there is a \n after the last line
Regards
Javi

Hi!
I got PE in this problem and can't fix it!
I would be very appreciate if someone can find the bug in my code
Thanks in advance!
Regards
Javi

[cpp][/cpp]

I recently discovered accidentally that, in every input of the judge, any string that contains the substring "[]" is correct. Am I right? I think that if this is correct the judge should provide more extra input to avoid such lucky incidents as mine.
Regards
Javi