超级会员免费看
本文详细介绍了ACM/ICPC丹анг2007比赛题目UVa1225——Digit Counting。题目要求计算1到N之间的所有数字中，0到9每个数字出现的次数。提供了C++和Python两种解决方案，适用于编程竞赛和算法学习。
一、Question
1. 题目描述
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.
此题要求我们把前n(n≤10000)个整数顺次写在一起：123456789101112 ··· 数一数0~9个出现多少次（输出10个整数，分别是0&
订阅专栏 解锁全文
1190
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
