poj1221

dp

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

#define maxn 252

int n;
long long f[maxn][maxn];    //f[sum][last value]
long long ans[maxn];

void init()
{
    memset(f, , sizeof(f));
    for (int i = ; i < maxn; i++)
        f[][i] = ;
    for (int i = ; i < maxn; i++)
        for (int j = ; j <= i; j++)
            f[i][j] = f[i][j - ] + f[i - j][min(j, i - j)];
    for (int i = ; i < maxn; i++)
    {
        if ((i & ) == )
            ans[i] = f[i / ][i / ];
        else
            ans[i] = ;
        for (int j = i; j >= ; j -= )
            ans[i] += f[(i - j) / ][min(j, (i - j) / )];
    }
}

int main()
{
    init();
    while (scanf("%d", &n), n)
        printf("%d %lld\n", n, ans[n]);
    return ;
}