NYOJ 708 ones

OJ题目 ：http://acm.nyist.net/JudgeOnline/problem.php?pid=708

描述

Given a positive integer N (0<=N<=10000), you are to find an expression equals to N using only 1,+,*,(,). 1 should not appear continuously, i.e. 11+1 is not allowed.

输入

There are multiple test cases. Each case contains only one line containing a integer N

输出

For each case, output the minimal number of 1s you need to get N.

样例输入

2
10

样例输出

2
7

状态转换方程：a[n]=min(a[k]+a[n-k], a[t]+a[n/t])

int main()
{
    int n,ans;
    int dp[10002];
    memset(dp,0,sizeof(dp));
    dp[1] = 1;
    int b,e;
    for(int i = 2;i <= 10000;i++)
    {
        b = 1;
        e = i - 1;
        int m = i;
        while(b <= e)
        {
            m = Min(m , dp[b] + dp[e]);
            b++;
            e--;
        }
        b = 2;
        e = i/2;
        while(b <= e)
        {
            if(i%b == 0)
            {
                e = i/b;
                m = Min(m,dp[b] + dp[e]);
            }

            b++;
        }
        dp[i] = m;
    }
    while(scanf("%d",&n) != EOF)
    {
        printf("%d\n",dp[n]);
    }
    return 0;
}