博客详细解析了Codeforces比赛中关于组合数学的问题E. Count The Blocks，讨论了如何计算有前导零补齐的n位数中长度为i的块的数量，给出了三种情况的分析：i等于n、i小于等于n-1且在边界、i小于等于n-2且不在边界，并提供了相应的解决方案和代码实现。
E. Count The Blocks
time limit per test ：2 seconds memory limit per test ：256 megabytes
input ：standard input output ：standard output
You wrote down all integers from 0 to , padding them with leading zeroes so their lengths are exactly n. For example, if n=3 then you wrote out 000, 001, ..., 998, 999.
A block in an integer x is a consecutive segment of equal digits that cannot be extended to the left or to the right.
For example, in the integer 00027734000 there are three blocks of length 1, one block of length 2 and two blocks of length 3.
最低0.47元/天 解锁文章
170
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
