joj1026

1026: The Staircases

---

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	1709	572	Standard

One curious child has a set of N little bricks. 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 from input numbers N and writes to output numbers Q - amount of different staircases that can be built from exactly N bricks.

Input

Numbers N, one on each line. You can assume N is between 3 and 500, both inclusive. A number 0 indicates the end of input.

Output

Numbers Q, one on each line.

Sample Input

3
5
0

Sample Output

1
2

---

Submit / Problem List / Status / Discuss

Problem Set with Online Judge System Version 3.12
Jilin University

Developed by skywind, SIYEE

 

 

 

 

 

#include<cstdio>
#include<iostream>
long long  f[501][501];
int main()
{
    for(int i=1;i<=500;i++)
    {
        for(int j=1;j<=(i-1)/2;j++)
        {
            f[i][j]=1;
        }
    }
    for(int i=1;i<=500;i++)
    {
        for(int j=1;j<=(i-1)/2;j++)
        {
            int k;
            for(int k=j+1;k<=(i-j-1)/2;k++)
            {
                f[i][j]+=f[i-j][k];
            }
        }
    }
    int n;
    while(scanf("%d",&n),n)
    {
        long long  sum=0;
        for(int i=1;i<=(n-1)/2;i++)sum+=f[n][i];
        //printf("%lld\n",sum);
        std::cout<<sum<<std::endl;
    }
    return 0;
}