UVA 1225 Digit Counting(统计数位出现的次数)
2016-05-20 20:05
471 查看
Digit Counting
Description Trung is bored with his mathematics homeworks. He takes a piece of chalk and starts writing a sequence of consecutive integers starting with 1 toN(1 < N < 10000) . After that, he counts the number of times each digit (0 to 9) appears in the sequence. For example, withN = 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. InputThe 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 . OutputFor each test case, write sequentially in one line the number of digit 0, 1,...9 separated by a space.Sample |
题意:
把前n(n<=10000)个整数顺次写在一起,如n=15时,123456789101112131415
计算0-9各出现了多少次(输出10个数,分别是数字0-9出现的次数)
以前就写了代码,不过那是网上的代码,不是很懂,现在看到了一份容易理解的代码,就记录下来.
以前博客链接:http://blog.csdn.net/hurmishine/article/details/50880092
AC代码:
#include <iostream> #include <cstring> using namespace std; int main() { int a[15]; int t,n; cin>>t; while(t--) { memset(a,0,sizeof(a)); cin>>n; for(int i=1;i<=n;i++) { int t=i; while(t) { int num=t%10; a[num]++; t/=10; } } for(int i=0;i<10;i++) { if(i) cout<<" "; cout<<a[i]; } cout<<endl; } return 0; }
相关文章推荐
- 【白书之路】1225 - Digit Counting 数字统计
- 纹理特征描述子——LBP
- Android学习记录(十五) --界面随谈。
- Codeforces Round #350 (Div. 2) E. Correct Bracket Sequence Editor【模拟+链表】
- QQ输入法评价
- Android之ListView优化进阶
- 毕业前夕
- 《编程珠玑》第二章三个问题A---查找40亿个32位整数中缺失的某个整数
- 控制器View的加载 && 创建
- MySQL入门--插入记录的时候NULL与NOT NULL
- 线性表的静态单链表存储结构
- PowerDesigner 反向工程生成ER图步骤
- 实现strcpy的功能【不可以使用strcyp函数】
- Python os.popen()方法的用法
- 《链表》——单向链表和双向链表(Java)
- android开发步步为营之104:文字加阴影效果和描边效果的实现
- lightoj 1421 - Wavio Sequence LIS变形
- Max Factor (hdu_2710) 素数筛选
- 快速理解C#中的委托与事件
- 从开始到结束,手把手教你使用busybox构建类嵌入式Linux系统