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 vote191 views1 answer
Draw picture in python libraries
Python
0 vote240 views1 answer
TypeError: __init__(): incompatible constructor arguments. The following argument types are supported: 1. tensorflow.python._pywrap_file_io.BufferedInputStream(arg0: str, arg1: int)
Python
17 votes278 views3 answers
ImportError: No module named _tkinter, please install the python-tk package
Python
0 vote224 views1 answer
Controlliing a fill pattern in matplotlib
Python
1 vote185 views1 answer
Delete folders using python
Python
0 vote205 views1 answer
Use of numpy matrix in tkinter python 3
Python
1 vote167 views1 answer
Key down python
Python
0 vote292 views1 answer
Python Write code that asks users to enter the year they were born. Print out how many years old they will turn in 2019.
Python
5 votes255 views2 answers
Forgot django admin password
Python Django
0 vote205 views1 answer
Sns histplot nan values
Python