MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / partition

Function partition

project_euler/problem_76/sol1.py:22–33  ·  view source on GitHub ↗
(m)

Source from the content-addressed store, hash-verified

20 xrange = range #Python 3
21
22def partition(m):
23 memo = [[0 for _ in xrange(m)] for _ in xrange(m+1)]
24 for i in xrange(m+1):
25 memo[i][0] = 1
26
27 for n in xrange(m+1):
28 for k in xrange(1, m):
29 memo[n][k] += memo[n][k-1]
30 if n > k:
31 memo[n][k] += memo[n-k-1][k]
32
33 return (memo[m][m-1] - 1)
34
35print(partition(100))

Callers 1

sol1.pyFile · 0.70

Calls

no outgoing calls

Tested by

no test coverage detected