- 博客(4)
- 收藏
- 关注
RSS订阅原创 Select m elements from max elements with limits
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---------------------------
2006-10-27 21:22:00
1126
转载 科场的胜者
诗云： 人生凡事有前期，尤是功名难强为。 多少英雄埋没杀，只因莫与指途迷。 有个该中了，撞着人来帮村的。湖广有个举人姓何，在京师中会试，偶入酒肆，见一伙青衣大帽人在肆中饮酒。听他说话半文半俗，看他气质假斯文带些光棍腔。何举人另在一座，自斟自酌。这些人见他独自一个寂寞，便来邀他同坐。何举人不辞，就便随和欢畅。这些人道
2006-10-24 15:38:00
1093
原创 Great Common Divisor & Least Common Multiple（最大公约数和最小公倍数）
Function ZDGYS(ByVal m As Long, ByVal n As Long) As Long Great Common DivisorZDGYS = mWhile n > 0m = ZDGYS Mod nZDGYS = nn = mWendEnd FunctionFunction ZXGBS(ByVal m As Long, ByVal n As Long) As
2006-10-19 23:16:00
1288
1
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人