Gym 100952 H. Special Palindrome

http://codeforces.com/gym/100952/problem/H

H. Special Palindrome

time limit per test

1 second

memory limit per test

64 megabytes

input

standard input

output

standard output

A sequence of positive and non-zero integers called palindromic if it can be read the same forward and backward, for example:

15 2 6 4 6 2 15

20 3 1 1 3 20

We have a special kind of palindromic sequences, let's call it a special palindrome.

A palindromic sequence is a special palindrome if its values don't decrease up to the middle value, and of course they don't increase from the middle to the end.

The sequences above is NOT special, while the following sequences are:

1 2 3 3 7 8 7 3 3 2 1

2 10 2

1 4 13 13 4 1

Let's define the function F(N), which represents the number of special sequences that the sum of their values is N.

For example F(7) = 5 which are : (7), (1 5 1), (2 3 2), (1 1 3 1 1), (1 1 1 1 1 1 1)

Your job is to write a program that compute the Value F(N) for given N's.

Input

The Input consists of a sequence of lines, each line contains a positive none zero integer N less than or equal to 250. The last line contains 0 which indicates the end of the input.

Output

Print one line for each given number N, which it the value F(N).

Examples

Input

1
3
7
10
0

Output

1
2
5
17
 
动态规划题目，动态规划不是很懂，此代码是参考大牛的代码敲得，自己过时是打表过的。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <vector>
#include <algorithm>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define PI 3.141592653589793238462
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
ll dp[][];
ll vis[],n;
void init()
{
    dp[][]=dp[][]=dp[][]=;
    dp[][]=dp[][]=dp[][]=;
    vis[]=;vis[]=vis[]=;
    for(int i=;i<=;i++)
    {
        ll ans=;
        for(int j=;j<=i/;j++)
        {
            if(j==) dp[i][j]=vis[i-];
            else
            {
                ll pos=i-j*;
                if(pos==) dp[i][j]=;
                else
                {
                    ll cnt=;
                    for(int k=j;k<=pos;k++)
                    {
                        cnt+=dp[pos][k];
                    }
                    dp[i][j]=cnt;
                }
            }
            ans+=dp[i][j];
        }
        dp[i][i]=;
        ans+=;
        vis[i]=ans;
    }
}
int main()
{
    init();
    while(scanf("%lld",&n) && n)
    {
        printf("%lld\n",vis[n]);
    }
    return ;
}

再来一个打表代码

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
#include <vector>
#include <algorithm>
using namespace std;
#define lowbit(x) (x&(-x))
#define max(x,y) (x>y?x:y)
#define min(x,y) (x<y?x:y)
#define MAX 100000000000000000
#define MOD 1000000007
#define PI 3.141592653589793238462
#define INF 0x3f3f3f3f3f
#define mem(a) (memset(a,0,sizeof(a)))
typedef long long ll;
ll n;
ll vis[]={,,,,,,,,,,,,,,,,,,,,,
    ,,,,,,,,,,,,,,,,,,,,,,,,
    ,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,,,,,,
,,,,,,,,,,,,,,
,,,,,,,,,,,
,,,,,,,,,,,
,,,,,,,,,,,,,,
,,,,,,,,,
,,,,,,,,
,,,,,,,,,,,,,
,,,,,,,,,
,,,,,,,,,,,,,
,,,,,,,,,,,
,,,,,,,,,,,
,,,,,,,,,
,,,,,,,,};
int main()
{
    while(scanf("%lld",&n) && n)
    {
        cout<<vis[n-]<<endl;
    }
    return ;
}