标签：des   style   class   blog   code   http   

题目连接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=247&page=show_problem&problem=3666

1225 - Digit Counting

Time limit: 3.000 seconds

Trung is bored with his mathematics homeworks. He takes a piece of chalk and starts writing a sequence of consecutive integers starting with 1 to N (1 < N < 10000) . After that, he counts the number of times each digit (0 to 9) appears in the sequence. For example, with N = 13 , the sequence is:

12345678910111213

In this sequence, 0 appears once, 1 appears 6 times, 2 appears 2 times, 3 appears 3 times, and each digit from 4 to 9 appears once. After playing for a while, Trung gets bored again. He now wants to write a program to do this for him. Your task is to help him with writing this program.

Input 

The input file consists of several data sets. The first line of the input file contains the number of data sets which is a positive integer and is not bigger than 20. The following lines describe the data sets.

For each test case, there is one single line containing the number N .

Output 

For each test case, write sequentially in one line the number of digit 0, 1,...9 separated by a space.

Sample Input 

2 
3 
13

Sample Output 

0 1 1 1 0 0 0 0 0 0 
1 6 2 2 1 1 1 1 1 1

题目大意：输入一个数N，然后会 123456789……N 这么一个数，算出其中0~9数字出现的个数。
解题思路：题目不难，字符串处理就能轻松解决。主意输出不要有多的空格就ok。

 1 #include <iostream>
 2 #include <cstring>
 3 #include <cstdio>
 4 #include <cctype>
 5 #include <algorithm>
 6 #include <numeric>
 7 #include <string>
 8 #include <sstream>
 9 using namespace std;
10 
11 int main() {
12     int l, maxx_int; cin >> l;
13     string maxx_str;
14     int tab[10];
15     while(l--) {
16         cin >> maxx_int;
17         memset(tab, 0, sizeof(tab));
18         for(int i = 1; i <= maxx_int; i++) {
19             stringstream ss;
20             ss << i; ss >> maxx_str;
21             for(int j = 0; j < maxx_str.size(); j++) {
22                 tab[maxx_str[j] - ‘0‘] ++;
23             }
24         }
25         for(int i = 0; i < 10; i++) {
26             if(i == 0) {
27                 cout << tab[i];
28             } else {
29 
30                 cout << " " << tab[i];
31             }
32         }
33         cout << endl;
34         //cout << maxx_str << endl;
35     }
36     return 0;
37 }

AC代码

UVa1587.Digit Counting,布布扣,bubuko.com

UVa1587.Digit Counting

标签：des   style   class   blog   code   http   

原文地址：http://www.cnblogs.com/Destiny-Gem/p/3795060.html