add comments
This commit is contained in:
@@ -29,6 +29,9 @@ func nextPartition(k int, vals []*big.Int) {
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
Partitions computes the number of ways to add to n with k or fewer terms.
|
||||
*/
|
||||
func Partitions(n, k int) *big.Int {
|
||||
if n < 0 {
|
||||
return big.NewInt(0)
|
||||
|
||||
Reference in New Issue
Block a user