poj2506 大数递推 - c++编程基础

TOP

poj2506 大数递推

2015-11-21 00:55:43 来源: 作者: 【大中小】浏览:1次

Tiling

Time Limit: 1000MS	?	Memory Limit: 65536K
Total Submissions: 8205	?	Accepted: 3974

Description

In how many ways can you tile a 2xn rectangle by 2x1 or 2x2 tiles?
Here is a sample tiling of a 2x17 rectangle.

Input

Input is a sequence of lines, each line containing an integer number 0 <= n <= 250.

Output

For each line of input, output one integer number in a separate line giving the number of possible tilings of a 2xn rectangle.

Sample Input

Sample Output

3
171
2731
845100400152152934331135470251
1071292029505993517027974728227441735014801995855195223534251

Source

The UofA Local 2000.10.14

#include
  
   
#include
   
     #include
    
      using namespace std; int main() { int a[300][200]; memset(a,0,sizeof(a)); a[0][0]=1; a[1][0]=1; a[2][0]=3; for(int i=3; i<=250; i++) { for(int j=0; j<=100; j++) { a[i][j]+=(a[i-1][j]+a[i-2][j]+a[i-2][j]); if(a[i][j]>=10) { int t=a[i][j]; a[i][j]%=10; a[i][j+1]+=t/10; } } } int n; while(cin>>n) { if(n==0) cout<<1<
     
      =0; j--) cout<
      
       ?


【大中小】【打印】【繁体】【投稿】【收藏】【推荐】【举报】【评论】【关闭】【返回顶部】
分享到:
上一篇：hihocoder 1124 : 好矩阵 dp	下一篇：HDU - 3622 Bomb Game(二分＋2-SA..

帐　　号:

密码: (新用户注册)

验证码:

表　　情:

内　　容: