Question

Write an (efficient!) Python program that, given a stick of integer length N, breaks it up into smaller

sticks of integer but all un-equal lengths. For example: For N = 10, one possibility is (1,2,3,4). However

(1,1,1,3,4) is not valid due to the repeated 1s.

How​

Answer 1

$\huge\mathcal\red {       }$