poj 2506 Tiling(大数+递推)

递推公式 s[i] = s[i-2]*2 + s[i-1]

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cmath>

using namespace std;

int s[255][100];
void fun()
{
    s[0][0] = 1;//一定要加上，否则wa
    s[1][0] = 1;
    s[2][0] = 3;
    int temp = 0, i, j;
    for(i = 3;i <= 250;i++){
        for(j = 0;j < 100;j++){
            temp += (s[i-2][j])*2 + s[i-1][j];
            s[i][j] = temp%10;
            temp /=10;
        }
    }
}
int main()
{
    fun();
    int n;
    int i;
    while(cin >> n){
        for(i = 99;i >= 0;i--){
            if(s[n][i] != 0)
                break;
        }
        for(;i>=0;i--){
            cout << s[n][i];
        }
        cout << endl;
    }

    return 0;
}