weixin_36306051的博客

有一头母牛，它每年年初生一头小母牛。每头小母牛从第四个年头开始，每年年初也生一头小母牛。请编程实现在第n年的时候，共有多少头母牛？f(1) = f(2) =f(3) = 1;f(n) = f(n - 1) + f(n - 3); (n >= 4)#includeusing namespace std;int main(){int n,i,j;

有一楼梯共M级，刚开始时你在第一级，若每次只能跨上一级或二级，要走上第M级，共有多少种走法？#includeusing namespace std;int main(){int s[41];int n,x,i;cin>>n;s[1]=s[2]=1;for(i=3;is[i]=s[i-1]+s[i-2];while(n>0){cin>>x;

斐波拉契数列：f(1)=f(2)=1f(n)=f(n - 1)+f(n - 2) (n >= 3)

转载自 http://www.clanfei.com/2012/04/402.html不容易系列之(3)—— LELE的RPG难题Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15209 Accepted Submissio

骨牌铺方格Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 50488    Accepted Submission(s): 24360Problem Description在2×n的一个长方形方格中,用一个1

转载自 http://www.cnblogs.com/epodongfeng/p/3679523.html题目：折线分割平面Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15632    Accepted