POJ 2282 The Counting Problem

最新推荐文章于 2020-04-19 21:29:12 发布

「已注销」

最新推荐文章于 2020-04-19 21:29:12 发布

阅读量465

点赞数

分类专栏：动态规划文章标签：动态规划

本文链接：https://blog.csdn.net/Rlt1296/article/details/70213808

版权

动态规划专栏收录该内容

111 篇文章 0 订阅

订阅专栏

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

Source

Shanghai 2004

又是一道数位dp，似乎不是套路。

设：dp[i][j]表示i位数，j出现的次数。

#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int l,r,dp[13][11],a[11],sma[11],big[11];
void init()
{
	a[0]=1;
	for(int i=1;i<=9;i++)
		a[i]=10*a[i-1];
	for(int i=0;i<=9;i++)
		dp[1][i]=1;
	for(int i=1;i<=9;i++)
		for(int j=0;j<=9;j++)
			dp[i][j]=dp[i-1][j]*10+a[i-1];
}
int query(int x,int k)//在1~x中查找y出现的次数 
{
	int dig[11],len=0,ans=0,ori=x;
	while(x)
	{
		dig[++len]=x%10;
		x/=10;
	}
	if(k==0)
		for(int i=len-1;i>=1;i--)
			ans-=a[i];
	for(int i=len;i>=1;i--)
	{
		ans+=dig[i]*dp[i-1][k];
		if(dig[i]>k)
			ans+=a[i-1];
		if(dig[i]==k)
			ans+=ori%a[i-1];
	}
	return ans;
}
int main()
{
	init();
	while(~scanf("%d%d",&l,&r))
	{
		if(l==0&&r==0)
			break;
		if(l>r)
			swap(l,r);
		for(int i=0;i<=9;i++)
			big[i]=query(r+1,i);
		for(int i=0;i<=9;i++)
			sma[i]=query(l,i);
		for(int i=0;i<=9;i++)
			printf("%d%c",big[i]-sma[i],i==9?'\n':' ');
	}
	return 0;
}