Chook_lxk的博客

点击打开题目链接 Hard problem Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 497Accepted Submission(s): 326 Problem Description c

点击打开题目链接 Spreading the WealthDescriptionA Communist regime is trying to redistribute wealth in a village. They have have decided to sit everyone around a circular table. First, everyone has converted

点击打开题目链接 The Little Girl who Picks Mushrooms Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 2885Accepted Submission(s): 937

点击打开题目链接 N friends go to the local super market together. The probability of their buying something from themarket is p1, p2, p3, . . . , pN respectively. After their marketing is finished you are gi

统计数字问题 问题描述： 给出n,遍历1~n,统计每个数字的出现次数，没有前导0(1 <= n <= 1e9)。 思路： 数据范围太大，所以不能暴力。 一个n位数，从n个0到n个9一共10^n个数。在这n个数中，0~9出现次数相同(加上前导0)，设为f(n). 当n = 1时， f(n) = 1; 当n > 1时，f(n) = 10 * f(n-1) + 10^(n...