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 vote167 views1 answer
Py array contains
Python
0 vote230 views1 answer
Enumerate in django templte
Python Django
0 vote168 views1 answer
Webdriver python get total number of tabs
Python
30 votes170 views3 answers
Python read scv
Python
-1 vote236 views3 answers
Try using .loc[row_indexer,col_indexer] = value instead
Python
1 vote199 views1 answer
Django model query add annotation field to show duplicate count
Python
36 votes201 views3 answers
Python image library
Python
3 votes218 views2 answers
Initialise a 2d array python
Python
32 votes246 views6 answers
Merge pandas
Python
0 vote169 views1 answer
Pydub get audio length in seconds
Python