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
Spacy access vocabulary
Python
0 vote166 views1 answer
Anvil get last row of data table
Python
0 vote165 views1 answer
Transform dictionary keys python
Python
3 votes187 views2 answers
Ros python subscriber
Python
219 votes595 views6 answers
Random numbers python
Python
6 votes169 views3 answers
Change current working directory python
Python
1 vote174 views1 answer
Python list .remove() in for loop breaks
Python
2 votes163 views6 answers
Update ubuntu to python 3.85
Python
3 votes177 views3 answers
Tensorflow to numpy
Python
0 vote178 views1 answer
How to use idl in python
Python