UVA - 1225 Digit Counting

UVA - 1225 Digit Counting

题目大意。输入一个数 N 求 1～N 中 各有多少个0～9 的数字

解题思路：数组拼太长了，循环简单方便快捷，取模神器

int main() {
    int cc;
    scanf("%d", &cc);
    while (cc--) {
        int a[10] = { 0 };
        int n;
        int m;
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
        {
            m = i;//i的话一直是1
            while (m) {

                a[m % 10]++;
                m /= 10;

            }
        }
        int first = 1;
        for (int i = 0; i<10; i++)
        {
            if (first)first = 0;
            else
                printf(" ");
            printf("%d", a[i]);
        }
        printf("\n");
    }
    return 0;
}

---