课后题 3-3 水题

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了课后题 3-3 水题相关的知识,希望对你有一定的参考价值。

Digit Counting
Time Limit: 3000MS        Memory Limit: Unknown        64bit IO Format: %lld & %llu
Submit
 
Status

Description
Download as PDF
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

   给你一个数字   从1 开始到这个数字  意见 一共出现了 多少个  1 -  9   统计一下       n<10000  

 1 //  题 虽然很水  但是    这种  消去最后一个 空格的方式值得学习.
 2 #include<stdio.h>
 3 #include<string.h>
 4 void cmp();
 5 int a[10000][10];
 6 int main()
 7 {
 8     int i,j,m,n,q,b,c,t;
 9     scanf("%d",&t);
10     cmp();
11     while(t--)
12     {
13         scanf("%d",&n);
14         for(i=0;i<9;i++)
15             printf("%d ",a[n][i]);
16         printf("%d\n",a[n][9]);
17     }
18 }
19 void cmp()
20 {
21     memset(a,0,sizeof(a));
22     for(int i=1;i<10000;i++)
23     {
24         for(int j=1;j<=i;j++)
25         {
26             if(j<10)
27                 a[i][j]++;
28             else
29                 if(j<100)
30             {
31                 a[i][j/10]++;
32                 a[i][j%10]++;
33             }
34             else
35                 if(j<1000)
36             {
37                 a[i][j/100]++;
38                 a[i][j%10]++;
39                 a[i][(j-(j/100)*100-j%10)/10]++;
40             }
41             else
42             {
43                 a[i][j/1000]++;
44                 a[i][j/100-(j/1000)*10]++;
45                 a[i][(j%100-j%10)/10]++;
46                 a[i][j%10]++;
47             }
48         }
49     }
50 }

 

以上是关于课后题 3-3 水题的主要内容,如果未能解决你的问题,请参考以下文章

课后题7

课后题168页-1

《数据库系统概论(第5版)》课后习答案 王珊萨师煊编著版 课后题解析 高等教育出版社出版 答

课后题--------求分子量-----Molar mass------

课后题

课后题