Tree recursive function

>>> def count_partitions(n, m):
        """Count the ways to partition n using parts up to m."""
        if n == 0:
            return 1
        elif n < 0:
            return 0
        elif m == 0:
            return 0
        else:
            return count_partitions(n-m, m) + count_partitions(n, m-1)

Source: composingprograms.com

Similar codes

0 vote183 views1 answer
Select first row of every group pandas
Python
3 votes149 views2 answers
Python replace values in a matrix
Python
0 vote178 views1 answer
Ubuntu 20.10 python 3.8
Python
17 votes199 views4 answers
How to install python 3.6 ubuntu
Python
0 vote177 views1 answer
Seaborn heatmap text labels
Python
0 vote167 views9 answers
Django recapcha
Python
0 vote210 views1 answer
Duplicate a list with lowercase in python
Python
97 votes186 views6 answers
Python time.sleep
Python
1 vote188 views1 answer
Import pycocotools._mask as _mask error Expected 80, got 88
Python
0 vote168 views1 answer
Pdfkit supress output
Python