数位dp分为两步搞定:
1.在可表示的数的范围内,首先把数分解,同时用数组记录每一位
2.记忆化搜索,确定每个参数所代表的的意义,相邻两位之间如何变化,基本上就搞定~~
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
入门第一题:
hdu 2089 题目链接
直接贴代码
pos 是记录位数,calc()函数中已经求出,
have 是记录状态, have = 0,不具备前一位是6,have = 1 ,表示前一位是6,have = 2,表示62或4的存在;
doing 是表示是否达到上界;
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
#include <string.h>
using namespace std;
int digit[30];
int dp[30][5];
int dfs(int pos , int have , bool doing){
if(pos == -1) return have == 2;
if(!doing && dp[pos][have] != -1)
return dp[pos][have];
int ans = 0 , nhave;
int end = doing ? digit[pos] : 9;
for(int i = 0;i <= end;i ++){
if(i == 4 || have == 2) nhave = 2;
else if(i == 6)
nhave = 1;
else if(have == 1 && i == 2)
nhave = 2;
else nhave = 0;
ans += dfs(pos - 1 , nhave , doing && (i == end));
}
if(!doing) dp[pos][have] = ans;
return ans;
}
int calc(int x){
memset(dp , -1 , sizeof(dp));
int pos = 0;
while(x){
digit[pos++] = x % 10;
x = x / 10;
}
return dfs(pos - 1 , 0 , 1);
}
int main()
{
int n,m;
while(~scanf("%d %d",&n,&m)){
if(n == 0 && m == 0) break;
int ans = m - n + 1 - calc (m) + calc(n - 1);
printf("%d\n",ans);
}
return 0;
}
相同的思路,买一赠三
hoj上面的 3555 Bomb ,3652B-number, 3709 Balanced Number
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
一个整数 (AnAn-1An-2 … A2A1), 定义 F(x)=An * 2n-1+An-1 * 2n-2+… +A2 * 2+A1 * 1,求[0..B]内有多少数使得F(x)<= F(A)
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
规定含有“666”的数就是某种特别的数,给你n,求出第n个数是多少?
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
求出区间中1的个数
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
对于给定的区间,求出这个区间中满足(这个数mode这个数位和==0) 的个数
----------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------