#include<iostream>
using namespace std;
typedef long long ll;
const int N=52;
//边界:前x个月,a[i]=0,b[i]=1
//递推关系式:x+1月开始递推,a[i]=b[i-x]*y,b[i]=b[i-1]+a[i-2]
ll a[N]/*卵*/, b[N]/*成虫*/;
int main()
{
int x, y, z;//一次产y个卵
cin >> x >> y >> z;
for (int i = 1; i <= x; i++) {
a[i] = 0; b[i] = 1;
}
for (int i = x + 1; i <= z + 1; i++) {
a[i] = b[i - x] * y;
b[i] = b[i - 1] + a[i - 2];
}
cout << b[z + 1] << endl;
return 0;
}
昆虫繁殖问题
最新推荐文章于 2024-07-25 20:22:48 发布