CareerCup Number of ways to take n identical objects out of a bucket

265 篇文章 1 订阅
86 篇文章 0 订阅
We define C(n) as the number of ways to take n identical objects out of a bucket, where objects may be taken 1, 2, or 3 at a time. 

Example: C(4)=7, because you can take 4 objects in the following 7 ways: 
1,1,1,1 
2,1,1 
1,2,1 
1,1,2 
2,2 
3,1 
1,3 

Write a function for C(n) in the language of your choice.

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

It's not hard to see that C(n) has the following recursive definition (similar to the Fibonacci numbers): 
C(0)=1 
C(1)=1 
C(2)=2 
C(n)=C(n-3)+C(n-2)+C(n-1) (if n>2) 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值