Memories Do Not Open

不知道起什么标题了组合数的计算#include#include#define LL long long#define MAXN 2000using namespace std;int cnt;int f[MAXN][MAXN];LL c(LL m,LL n){ cnt++; return n==1?m:1.0*m/n*c(m-1,n-1);}//

Saving BeansTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6279 Accepted Submission(s): 2537Problem DescriptionAlthough winter is far

Time Limit: 5 Sec Memory Limit: 128 MBSubmit: 670 Solved: 387[Submit][Status][Discuss]Description 第二关和很出名的斐波那契数列有关，地球上的OIer都知道：F1=1, F2=2, Fi = Fi-1 + Fi-2，每一项都可以称为斐波那契数。现在给一个正整数N，它可以写成一些斐...