题目链接:http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=26854
数位DP专题:http://blog.csdn.net/chy20142109/article/details/50930004
题意:在[A,B]范围内,数出所有数中含0的个数。
思路:直接递推dp[i][j] = ∑dp[i-1][k] k∈[0,9] + (j==0)?10^(i-1):0;
dp[i][j]表示以j开头的i位数中一共含有多少个0。
统计的时候因受到前导零影响,此时应该分三种情况进行统计。
1、长度小于m位数范围内
枚举位数i = 1~m-1
枚举最高位j = 1~9(不能是0)
ans+=dp[i][j]
2、长度等于m,并且最高位 < digit[m]
只要最高位小于digit[m],那么后面的位上填的数就不会受到限制
枚举最高位j = 1~digit[m]-1
ans+=dp[m][j]
3、长度等于m时,剩下的没有考虑进去的数
枚举位数i = m-1~1
枚举第i位的数j = 0~digit[i]-1 ans+=dp[i][j]
还要单独考虑如果digit[i]为0的话,那么就要额外加上k次,k = x-∑(digit[j]*10^(j-1))j>=i
也就是说前面的数位已经固定了,后面几位从全部0开始到上限情况还有多少种取值方式,也就是第i位出现0的次数。
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)
#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod %100000007
LL dp[20][10];
LL m,n;
LL ten[20];
int T;
void init()
{
LL temp;
ten[0] = 1;
rep(i,1,18) ten[i] = 10*ten[i-1];
Clean(dp,0);
dp[1][0] = 1;
rep(i,2,19)
{
temp = 0;
rep(j,0,9) temp += dp[i-1][j];
rep(j,0,9)
{
dp[i][j] = temp;
if ( !j ) dp[i][j]+=ten[i-1];
}
}
}
LL cal(LL x)
{
int digit[20];
int len = 0;
if ( x == -1 ) return 0;
Clean(digit,0);
LL temp = x;
while( x )
{
digit[++len] = x % 10;
x /= 10;
}
LL ans = 1;
rep(i,1,len-1)
{
rep(j,1,9) ans += dp[i][j];
}
rep(i,1,digit[len]-1) ans += dp[len][i];
temp-=digit[len]*ten[len-1];
Rrep(i,len-1,1)
{
temp-=digit[i]*ten[i-1];
if ( !digit[i] ) ans+=temp+1;
rep(j,0,digit[i]-1) ans+=dp[i][j];
}
return ans;
}
int main()
{
cin>>T;
init();
LL x,y;
rep(kase,1,T)
{
scanf("%lld %lld",&x,&y);
printf("Case %d: %lld\n",kase,cal(y)-cal(x-1));
}
return 0;
}
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <stack>
#include <map>
#include <set>
#include <vector>
#include <sstream>
#include <queue>
#include <utility>
using namespace std;
#define rep(i,j,k) for (int i=j;i<=k;i++)
#define Rrep(i,j,k) for (int i=j;i>=k;i--)
#define Clean(x,y) memset(x,y,sizeof(x))
#define LL long long
#define ULL unsigned long long
#define inf 0x7fffffff
#define mod 100000007
LL dp[35][35][2]; //dp[i][j][k]表示到还剩下i位,前面出现了j个零,k表示前面是否出现了非0数(前面是否全是前导0)
int bit[35];
LL dfs( int len , int tot , bool flag , bool first )
{
if ( len == 0 ) return tot;
if ( !flag && dp[len][tot][first] != -1 ) return dp[len][tot][first];
LL ans = 0;
int ed = flag?bit[len]:9;
rep(i,0,ed)
ans += dfs( len - 1 , tot + ( first && i==0) , flag && i == ed , first || i != 0 );
if ( !flag ) dp[len][tot][first] = ans;
return ans;
}
LL cal( LL n )
{
if ( n < 0 ) return 0;
if ( n == 0 ) return 1;
int len = 0;
while(n) bit[++len] = n % 10 , n /= 10;
return dfs( len , 0 , 1 , 0 )+1;
}
int main()
{
int t;
LL L,R;
cin>>t;
Clean(dp,-1);
rep(cas,1,t)
{
scanf("%lld %lld",&L,&R);
printf("Case %d: %lld\n",cas,cal(R)-cal(L-1));
}
return 0;
}