The Counting Problem - POJ 2282 数位dp

最新推荐文章于 2018-02-07 11:06:48 发布

提比-我有特殊的AC技巧

最新推荐文章于 2018-02-07 11:06:48 发布

阅读量574

点赞数

分类专栏： dp动态规划和递推 POJ

本文链接：https://blog.csdn.net/u014733623/article/details/38950143

版权

dp动态规划和递推同时被 2 个专栏收录

281 篇文章 1 订阅

订阅专栏

POJ

206 篇文章 0 订阅

订阅专栏

The Counting Problem

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 3450		Accepted: 1838

Description

Given two integers a and b, we write the numbers between a and b, inclusive, in a list. Your task is to calculate the number of occurrences of each digit. For example, if a = 1024 and b = 1032, the list will be
1024 1025 1026 1027 1028 1029 1030 1031 1032
there are ten 0's in the list, ten 1's, seven 2's, three 3's, and etc.

Input

The input consists of up to 500 lines. Each line contains two numbers a and b where 0 < a, b < 100000000. The input is terminated by a line `0 0', which is not considered as part of the input.

Output

For each pair of input, output a line containing ten numbers separated by single spaces. The first number is the number of occurrences of the digit 0, the second is the number of occurrences of the digit 1, etc.

Sample Input

Sample Output

1 2 1 1 1 1 1 1 1 1
85 185 185 185 190 96 96 96 95 93
40 40 40 93 136 82 40 40 40 40
115 666 215 215 214 205 205 154 105 106
16 113 19 20 114 20 20 19 19 16
107 105 100 101 101 197 200 200 200 200
413 1133 503 503 503 502 502 417 402 412
196 512 186 104 87 93 97 97 142 196
398 1375 398 398 405 499 499 495 488 471
294 1256 296 296 296 296 287 286 286 247

题意：求l到r的区间内所有数0-1的数字的个数。

思路：数位dp，具体实现看代码。

AC代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
typedef long long ll;
//dp[i][j]表示i位数中j的个数，dp0[i]表示i位数中合法的0的个数
ll dp[10][10],dp0[10],pow[15];
int num[15],len,n;
ll dfs(int pos,int N,int f)//f表示是否前面全是0，只对求0的个数有影响
{ if(pos<=0)
   return 0;
  ll ans=0;
  int i,j,k,m=num[pos];
  if(f==0)
  { ans+=m*dp[pos-1][N];
    if(N<m)
     ans+=pow[pos-1];
    else if(N==m)
     ans+=n%pow[pos-1]+1;
    ans+=dfs(pos-1,N,0);
  }
  else
  { ans+=(m-1)*dp[pos-1][N];
    ans+=dfs(pos-1,N,0);
    ans+=dp0[pos-1];
  }
  return ans;
}
ll solve(int p,int N)
{ if(p<=0)
   return 0;
  int i,j,k;
  len=0;n=p;
  while(p)
  { num[++len]=p%10;
    p/=10;
  }
  if(N==0)
   return dfs(len,N,1);
  else
   return dfs(len,N,0);
}
int main()
{ int i,j,k,l,r;
  pow[0]=1;
  for(i=1;i<=9;i++)
   pow[i]=pow[i-1]*10;
  for(i=1;i<=9;i++)
   for(j=0;j<=9;j++)
    dp[i][j]=dp[i-1][j]*10+pow[i-1];
  for(i=1;i<=9;i++)
   dp0[i]=9*dp[i-1][0]+dp0[i-1];
  while(~scanf("%d%d",&l,&r) && l+r)
  { if(l>r)
     swap(l,r);
    printf("%I64d",solve(r,0)-solve(l-1,0));
    for(i=1;i<=9;i++)
     printf(" %I64d",solve(r,i)-solve(l-1,i));
    printf("\n");
  }
}