possiblywrong

I arrived at the same solution via dynamic programming. The idea is to start with the solution for n=1 coin flips, then use that to compute n=2, 3, … all the way to 100. Here’s the code! I would love to understand the generating functions approach! It seems elegant, but I have no idea how it works.