URAL1017Staircases DP

E - Staircases

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Submit  Status  Practice  URAL 1017

Description

One curious child has a set of  N little bricks (5 ≤  N ≤ 500). From these bricks he builds different staircases. Staircase consists of steps of different sizes in a strictly descending order. It is not allowed for staircase to have steps equal sizes. Every staircase consists of at least two steps and each step contains at least one brick. Picture gives examples of staircase for  N=11 and  N=5:

Your task is to write a program that reads the number  N and writes the only number  Q — amount of different staircases that can be built from exactly  N bricks.

Input

Number  N

Output

Number  Q

Sample Input

input	output
212	995645335

告诉n块，然后按严格递增的顺序排列，问有多少种不同形态的排列方式。

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>

using namespace std;
typedef long long ll;

ll dp[505][505];//表示当前共i个块，最后一个高度为j 
int n;
ll q;

int main()
{
	while(~scanf("%d",&n))
	{
		memset(dp,0,sizeof dp);
		dp[1][1]=1;
		
		for(int i=2;i<=n;i++)
		{
			for(int j=2;j<=i;j++)
			{
				dp[i][j]=dp[i-1][j-1]+dp[i-j][j-1];
			}
		}
		//分两种情况
		//1.上次共i-1块，最高的那个是j-1块，那么在最高的上加一块到达目前i块最高j块的状态，如果多加几块是可能出现重复的
		//2.上次共i-j块，最高的为j-1块,然后在最后面又加了一条高度为j的块。 

		ll ans=0;
		for(int i=0;i<n;i++) ans+=dp[n][i];
		printf("%I64d\n",ans);
		
	}
	
    return 0;
}