题目大意：给定一个区间，求该区间内0 ~ 9出现的次数，多次询问，以0 0结束询问

测试用例：

输入：
1 10
44 497
346 542
1199 1748
1496 1403
1004 503
1714 190
1317 854
1976 494
1001 1960
0 0

输出：

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

 

#include <iostream>
#include <vector>
using namespace std;int get(vector<int>& num, int l, int r) {int res = 0;for(int i = l; i >= r; i--) res = res * 10 + num[i];return res;
}int power10(int k) {int res = 1;while(k--)res *= 10;return res;
}int count(int n, int x) {if(!n)  return 0;vector<int> num;while(n) {num.push_back(n % 10);n /= 10;}n = num.size();int res = 0;for(int i = n - 1 - !x; ~i; i--) {if(i < n - 1) {res += get(num, n - 1, i + 1) * power10(i);if(!x)  res -= power10(i);}if(num[i] == x) res += get(num, i - 1, 0) + 1;else if(num[i] > x)    res += power10(i);}return res;
}int main() {int a, b;while(cin >> a >> b, a || b) {if(a > b)   swap(a, b);for(int i = 0; i <= 9; i++)cout << count(b, i) - count(a - 1, i) << " ";cout << endl;}return 0;
}