"We want $p(100) - 1$, where $p(n)$ is the [partition function](https://w.wiki/EoNj). We subtract 1 because $p(n)$ counts $n$ by itself as a partition of $n$, but we only want partitions composed of two or more numbers.\n",
"Alternatively, if we think of this problem like [problem 31](https://projecteuler.net/problem=31) - just with coins of every possible denomination instead of only a few - we can adapt any of our approaches to that problem, where we construct a generating function."
"This work is licensed under the [Creative Commons Attribution-ShareAlike 4.0 International license](https://creativecommons.org/licenses/by-sa/4.0/) and the [BSD Zero Clause license](https://spdx.org/licenses/0BSD.html)."