Open the context
Choose the project folder and name the files or behavior involved.
Workflows
Coding workflows · Integer partition counts
03
A concrete starting point
Count unordered partitions of an integer from zero through 300 into positive parts. Check the single empty partition of zero and repeated parts, rejecting negative, fractional and Boolean inputs.
Define the change
Describe the input, expected output and boundaries that must stay intact.
Inspect the work
Review the proposed edits and any commands before relying on their result.
Check the outcome
Compare actual behavior with the expected result. If a check fails, investigate it before applying more changes.
Integer partition counts
A concrete starting point
def partition_count(number):
if type(number) is not int or not 0 <= number <= 300:
raise ValueError("integer 0 through 300")
ways = [1] + [0]*number
for part in range(1, number+1):
for total in range(part, number+1):
ways[total] += ways[total-part]
return ways[number]The example is a starting point for a real project, not a claim that generated code is already tested. Adjust paths, dependencies and expected behavior to match your application.
