UVA 1225 Digit Counting(统计数位出现的次数)
来源:互联网 发布:淘宝高仿鞋子店铺名字 编辑:程序博客网 时间:2024/05/17 22:13
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.
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
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;}
- UVA 1225 Digit Counting(统计数位出现的次数)
- UVa 1225 Digit Counting(数字统计)
- UVa 1225 - Digit Counting
- UVa 1225 - Digit Counting
- UVa-1225 - Digit Counting
- UVa 1225 Digit Counting
- UVA - 1225 Digit Counting
- UVA 1225 - Digit Counting
- UVa 1225 - Digit Counting
- UVa-1225Digit Counting
- 【Uva 1225】 Digit Counting
- UVa 1225 - Digit Counting
- UVa 1225 - Digit Counting
- Uva - 1225 - Digit Counting
- Uva 1225 Digit Counting
- UVA 1225 Digit Counting
- UVa 1225 - Digit Counting
- UVa 1225 Digit Counting
- BZOJ 4553: [Tjoi2016&Heoi2016]序列
- django ajax 应用实例
- 《链表》——单向链表和双向链表(Java)
- 内容模式
- Linux_2_Navigation
- UVA 1225 Digit Counting(统计数位出现的次数)
- 【IPC通信】命名管道FIFO
- 2015ACM长春赛区网络赛 E题
- Android之ListView优化基本
- 从Eclipse转移到IntelliJ IDEA的一点心得
- 图像配准】基于灰度的模板匹配算法(一):MAD、SAD、SSD、MSD、NCC、SSDA、SATD算法
- poj 3270 Cow Sorting(置换)
- sdut 3257 Cube number
- 索尼Z2(L50t)刷CM12教程