【HDU 4734】 F(x)

Problem

http://acm.hdu.edu.cn/showproblem.php?pid=4734

Solution

还是记忆化数位DP，到现在我发现记忆化的写法就是一个大暴力的优化，记录的就是到现在接下来继续搜会有的结果，解释这样，所以在某些题目上只能多花点空间，而且数组的含义也有点区别。

CODE

/*
 * @key word:digit DP
 * @tesed on:HDU4734 31ms
 * @Author: lhq 
 * @Date: 2017-08-17 18:50:39 
 * @Last Modified by: lhq
 * @Last Modified time: 2017-08-17 18:51:01
 */
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int dp[12][10000], a[12], n, m;

int dfs(int len, int sum, bool limit)
{
    if (len == 0)
        return sum >= 0 ? 1 : 0;
    if (sum < 0)
        return 0;
    if (!limit && dp[len][sum] != -1)
        return dp[len][sum];
    int up = limit ? a[len] : 9;
    int ans = 0;
    for (int i = 0; i <= up; i++)
        ans += dfs(len - 1, sum - i * (1 << len - 1), limit && i == up);
    if (!limit)
        dp[len][sum] = ans;
    return ans;
}
int solve(int x)
{
    int len = 0, y = 0, fx = 0;
    while (x)
    {
        a[++len] = x % 10;
        x /= 10;
    }
    while (n)
    {
        fx += (n % 10) * (1 << y);
        y++, n /= 10;
    }
    return dfs(len, fx, true);
}
int main()
{
    int T;
    cin >> T;
    memset(dp, -1, sizeof(dp));
    for (int i = 1; i <= T; i++)
    {
        scanf("%lld%lld", &n, &m);
        printf("Case #%d: %d\n", i, solve(m));
    }
    return 0;
}