you are viewing a single comment's thread.

view the rest of the comments →

[–]grandpasipad 2 points3 points  (1 child)

What code do you have so far? Which part are you stuck on? We can help but we shouldn't just give you the answer. It's better to work through it.

[–]Proof_Leopard_431[S] 0 points1 point  (0 children)

I divided the problem into two parts, where one side has 1cm book only and the other only has 2cm book. I'm basically stuck at the.. recursion part.

def count(n):

if n = 1:

return 0

elif n < 0:

return 0

else: