zoukankan      html  css  js  c++  java
  • Digit Counting, ACM/ICPC Danang 2007, UVa 1225

                                                                                      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 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
    用数组来记录次数。
    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int t;
        scanf("%d", &t);
        while(t--)
        {
            int a[10], n, i;
            memset(a, 0, sizeof(a));
            scanf("%d", &n);
            for( i=1; i<=n; i++ )
            {
                if(i<10)
                 a[i]++;
                else
                {
                    int q=i;
                    while(q)
                    {
                    a[q%10]++;
                    q = q/10;
                    }
                }
            }
            for( i=0; i<9; i++ )
                printf("%d ", a[i]);
            printf("%d
    ", a[9]);
        }
        return 0;
    }
    

  • 相关阅读:
    第一次点击button, view视图出现;第二次点击button,view视图消失
    快速破解ps方法
    终端中出现While executing gem ... (Errno::EPERM) Operation not permitted
    隐藏顶部状态栏的方法
    python之dict和set
    python之循环
    python 之条件判断
    python 之列表和元组
    python 之字符串和编码
    人生第一次面试之旅
  • 原文地址:https://www.cnblogs.com/Genesis2018/p/9079925.html
Copyright © 2011-2022 走看看