Python/dynamic_programming/integer_partition.py

38 lines
1.1 KiB
Python
Raw Normal View History

2019-10-05 05:14:13 +00:00
"""
The number of partitions of a number n into at least k parts equals the number of
partitions into exactly k parts plus the number of partitions into at least k-1 parts.
Subtracting 1 from each part of a partition of n into k parts gives a partition of n-k
into k parts. These two facts together are used for this algorithm.
2019-10-05 05:14:13 +00:00
"""
def partition(m: int) -> int:
memo: list[list[int]] = [[0 for _ in range(m)] for _ in range(m + 1)]
2019-10-05 05:14:13 +00:00
for i in range(m + 1):
memo[i][0] = 1
for n in range(m + 1):
for k in range(1, m):
memo[n][k] += memo[n][k - 1]
if n - k > 0:
memo[n][k] += memo[n - k - 1][k]
2018-03-22 13:33:54 +00:00
2019-10-05 05:14:13 +00:00
return memo[m][m - 1]
2018-03-22 13:33:54 +00:00
2019-10-05 05:14:13 +00:00
if __name__ == "__main__":
import sys
2018-03-22 13:33:54 +00:00
2019-10-05 05:14:13 +00:00
if len(sys.argv) == 1:
try:
n = int(input("Enter a number: ").strip())
print(partition(n))
except ValueError:
print("Please enter a number.")
else:
try:
n = int(sys.argv[1])
print(partition(n))
except ValueError:
print("Please pass a number.")