ZOJ 1163The Staircases

DP，用公式f(N, h) = f(N-h, h-1) + f(N, h-1)

//1163The Staircases
#include <iostream>
#include <stdio.h>
#define FILE_DEBUG
//#define _C_LAN_

#ifdef FILE_DEBUG
#include <fstream>
#endif

using namespace std;
int main(int argc, char *argv[])
{
#ifdef FILE_DEBUG
	ifstream fin;
	fin.open("input.txt");
	cin.rdbuf(fin.rdbuf()); // assign file's streambuf to cin
#ifdef _C_LAN_
	freopen("input.txt", "r", stdin);
#endif
#endif
#ifdef FILE_DEBUG
	ofstream fout;
	fout.open("output.txt");
	cout.rdbuf(fout.rdbuf()); // assign file's streambuf to cout
#ifdef _C_LAN_
	freopen("output.txt", "w", stdout);
#endif
#endif

      int brick_sum;
      long long stair_sum[510][510];
      for (int i = 0; i <= 500; i ++)
      {
          for (int j = 0; j <= 500; j ++)
          {
              if (i == 0)
              {
                    stair_sum[i][j] = 1;
                    continue;
              }
              if (j == 0)
              {
                    stair_sum[i][j] = 0;
                    continue;
              }
              if(i >= j)
              {
                 stair_sum[i][j] = stair_sum[i-j][j-1] + stair_sum[i][j-1];
              }
              else
              {
                stair_sum[i][j] = stair_sum[i][j-1];
              }
          }
      }
      while (cin >> brick_sum && brick_sum > 0)
      {
            cout << stair_sum[brick_sum][brick_sum] - 1 << endl;
      }
      return 0;
}