OJ Board

The answer for 55 is 2, the only two possibilities are 5 and 55

Is there any tricky i/o for this problem?
I use a very simple dp which gives WA

Edit: got AC, precision issue printing the output

use long longs

In my opinion, your test case is completely insane. Problemsetters should care more about the problem statement than about making stupid input for the judge. I don't think you can be proud of making some people spent their time to get AC in this problem.

1) n Parallelogram, each with all sides equal.

2) n Parallelograms with equal area.

I got AC using the second hypothesis. So, if both are equivalent in this problem, please tell me how to dissect a hexagon in 6 rhombus with all equal sides, I don't find the solution.

Are they parellelograms or rhombus? I honestly find your post confusing

EDIT: I got AC considering Parellelograms not neccesarily Rhombus, so forget the word Rhombus! Moreover there is a test case with n <= 0, could anybody explain me why there are such stupid cases?

Does anybody know a trick to compute n from a mask of the form (1<<n)? I suppose it will speedup my program because now I have a loop to compute it

Hi! Can anybody tell me what is the expected execution time for an AC solution in the cases kindly given above? (about half of the total time for the complete input in the judge?)

Print "\n" and you'll get AC

no, in fact there are only 5 results ok
does your code output the right answer for the sample input?

Wow, great!, your solutions are more than enough for me, they completely satisfy my curiosity. In fact I remember thinking about using Pick in the contest for a second, as everybody usually does when faces a problem with lattice and figures, but I didn't know how to apply it (it was before I needed ...

Oh! This is a nice example of an easy-to-formulate and hard-to-solve problem. I tried it in the online contest and I wasted more than 2 hours, but yesterday I managed to finish it. Obviously, (see the ranklist) I used precomputation, I wrote a brute-force solution O(n^7) (can be O(n^6) if ...

Hi all!
I saw this problem was one of the most difficult in the last contest... but actually I do not know why, because I've just sent my code for problem 11121 to the problem 11119 by mistake, and it was AC!!
It seems there is not only attraction between cations and anions but between any output ...

Few people have solved this problem. I am using only backtracking with memoization, could it be enough? I keep getting WA, time: 3.3 seconds. This time would be the best in the ranklist, that's why I hesitate if my implementation has a bug or my entire approach to the problem is non-sense.

Thank you very much for the link little joey,
In fact I had only a silly mistake, so the algorithm proved to be completely correct, it is almost the same as in the second official solution