题目链接
题意
统计区间L和R之间,0-9每个数字出现的次数。例如对于19和21之间,数字为19,20,21,其中0和9都出现了1次,1和2都出现了两次,其余数字都没有出现,也就是0次。
数据范围:
1<L,R<109
分析
题目中没有说明
L,R
的大小关系,所以读入时需要判断下。
我是按位考虑的,计算每一位上每个数字出现的次数。分为三种情况,最高位,次高位到第1位,第0位。需要特别注意在第二种情况时注意0的讨论。
Code
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
int a, b, ansa[10], ansb[10], digit[10], pw10[10];
void solve(int x, int (&ans)[10])
{
memset(ans, 0, sizeof(ans));
if (x == 0) {
ans[0] = 1;
return ;
}
// memset(ans, 0, sizeof (ans)); 一开始写在这里了,果断WA了,自己智障。。。
memset(digit, 0, sizeof (digit));
int len = 0, tmp = x;
while (tmp) {
digit[len++] = tmp % 10;
tmp /= 10;
}
for (int i = 1; i < digit[len - 1]; ++i) { ans[i] = pw10[len - 1]; }
ans[digit[len - 1]] = x % pw10[len - 1] + 1;
if (len == 1) {
ans[0] = 1;
return;
}
for (int i = len - 2; i >= 1; --i) {
int former = x / pw10[i + 1], later = x % pw10[i];
for (int j = 9, k = digit[i]; j >= 0; --j) {
if (j > k) ans[j] += former * pw10[i];
else if (j == k) { // 注意到这里的细节处理
if (j == 0) ans[j] += (former - 1) * pw10[i] + later + 1;
else ans[j] += former * pw10[i] + later + 1;
} else if (j > 0) ans[j] += (former + 1) * pw10[i];
else ans[j] += former * pw10[i];
}
}
int former = x / pw10[1];
for (int j = 9, k = digit[0]; j >= 0; --j) {
if (j > k) ans[j] += former;
else ans[j] += former + 1;
}
return ;
}
int main()
{
pw10[0] = 1;
for (int i = 1; i < 10; ++i) { pw10[i] = 10 * pw10[i - 1]; }
while (~scanf("%d%d", &a, &b) && (a || b)) {
if (a > b) swap(a, b);
solve(a - 1, ansa);
solve(b, ansb);
for (int i = 0; i < 10; ++i) {
printf("%d", ansb[i] - ansa[i]);
if (i < 9) printf(" ");
else printf("\n");
}
}
return 0;
}
然后POJ 3286 只是要求统计0的个数,而且数据范围变大了,道理其实是一样的。
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <math.h>
using namespace std;
typedef long long ll;
int digit[15];
ll a, b, pw10[15], ansa[15], ansb[15];
void solve(ll x, ll (&ans)[15])
{
memset(ans, 0, sizeof(ans));
if (x == 0) {
ans[0] = 1;
return ;
} else if (x < 0) return;
memset(digit, 0, sizeof (digit));
int len = 0;
ll tmp = x;
while (tmp) {
digit[len++] = tmp % 10;
tmp /= 10;
}
for (int i = 1; i < digit[len - 1]; ++i) { ans[i] = pw10[len - 1]; }
ans[digit[len - 1]] = x % pw10[len - 1] + 1;
if (len == 1) {
ans[0] = 1;
return;
}
for (int i = len - 2; i >= 1; --i) {
ll former = x / pw10[i + 1], later = x % pw10[i];
for (int j = 9, k = digit[i]; j >= 0; --j) {
if (j > k) ans[j] += former * pw10[i];
else if (j == k) { // 注意到这里的细节处理
if (j == 0) ans[j] += (former - 1) * pw10[i] + later + 1;
else ans[j] += former * pw10[i] + later + 1;
} else if (j > 0) ans[j] += (former + 1) * pw10[i];
else ans[j] += former * pw10[i];
}
}
ll former = x / pw10[1];
for (int j = 9, k = digit[0]; j >= 0; --j) {
if (j > k) ans[j] += former;
else ans[j] += former + 1;
}
return ;
}
int main()
{
pw10[0] = 1;
for (int i = 1; i < 12; ++i) { pw10[i] = pw10[i - 1] * 10; }
while (~scanf("%lld%lld", &a, &b) && (a != -1)) {
if (a > b) swap(a, b);
solve(a - 1, ansa);
solve(b, ansb);
printf("%lld\n", ansb[0] - ansa[0]);
}
return 0;
}