Select m elements from max elements with limits

本文介绍了一种通过递归函数解决从1到最大值中选取特定数量整数以达到固定和的方法。通过提供的VBA代码示例,展示了如何计算可能的选择方式总数。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

I have max integers between 1 and max, If I choose m of them to get a sum sums ,Suppose I have counts ways,How can I get the counts ?

I write some codes by recursion

------------------------------------

Function counts(ByVal max As Long, ByVal m As Long, ByVal sums As Long) As Long
Dim temp As Long, i As Long, j As Long
If max >= m And m = 1 Then counts = IIf(sums <= max, 1, 0)
If max >= m And m = 2 Then
For i = 1 To max - 1
For j = i + 1 To max
If i + j = sums Then counts = counts + 1
Next
Next
End If
If max >= m And m > 2 Then counts = counts(max - 1, m, sums - m) + counts(max - 1, m - 1, sums - m)
End Function

Sub xxx()
MsgBox counts(49, 6, 101)
End Sub

Return 58446

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值