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 vote267 views1 answer
PermissionError: [Errno 13] Permission denied on flask
Python
0 vote283 views1 answer
Mylist = [“hello”, “bye”,”see ya”,”later”] phrase = mylist[1]
Python
2 votes249 views2 answers
Python read requests response
Python
7 votes249 views4 answers
Pandas.get_dummies
Python
0 vote268 views1 answer
Fetch json array from mysql django
Python
1 vote285 views1 answer
Usong brave browser pyhton
Python
3 votes288 views3 answers
Flask migrate
Python Flask
0 vote241 views1 answer
;dslaoeidksamclsoeld,cmskadi934lglllfgl;llgldklkkkkjkklllloooofklllflll;=\f]p[
Python
0 vote231 views1 answer
Install python packages behind proxy
Python
0 vote262 views2 answers
How to write a python script to find the value of x at a given y value
Python