HOJ Computer Transformation

题目链接

Problem Description

A binary search tree is a binary tree with root k such that any node v reachable from its left has label (v)

#include <iostream>

const int MAX =  1000 + 1;
const int LENGTH = 300 + 10;
int num[MAX][LENGTH];
int len[MAX];
using namespace std;
int Initial()
{
int i,j;
int temp;
int carry;
int digit;
num[0][0] = 0;
num[0][LENGTH] = 1;
num[1][0] = 1;
num[1][LENGTH] = 1;
len[1] = 1;
len[0] = 1;

for(i = 2; i < MAX; i++)
{
carry = 0;
for(j = 0; j < len[i - 1]; j++)
{
temp = num[i - 1][j] + 2 * num[i - 2][j] + carry;
num[i][j] = temp % 10;
carry = temp / 10;
}
while(carry){
num[i][j++] = carry % 10;
carry /= 10;
}
len[i] = j;
}

return 0;
}
int print(int n){
for(int j = len[n - 1] - 1;j >= 0;j--)
cout << num[n - 1][j];
cout << endl;

return 0;
}
int main()
{
int n;
Initial();

while(cin >> n)
print(n);

return 0;
}