鸿杰 的博客

斐波那契数计算公式  : f(n)=f(n-1)+f(n-2)        (n>=3) f(1)=1 f(2)=1 对于 n 比较小的情况下，下边的程序就可以实现这个功能 #include<cstdio> #define ll long long const int n=100; int main() { ll a[n]; a[2]=1;a[1]=1; ...

Tiling Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 11268 Accepted: 5223 Description In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles? Here is a sample tiling of a 2x1...