ACM十题.docx

Numbers That CountTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 15325Accepted: 5002DescriptionKroneckers Knumbers is a little company that manufactures plastic digits for use in signs (theater marquees, gas station price displays, and so on). The owner and sole employee, Klyde Kronecker, keeps track of how many digits of each type he has used by maintaining an inventory book. For instance, if he has just made a sign containing the telephone number 5553141, hell write down the number 5553141 in one column of his book, and in the next column hell list how many of each digit he used: two 1s, one 3, one 4, and three 5s. (Digits that dont get used dont appear in the inventory.) He writes the inventory in condensed form, like this: The other day, Klyde filled an order for the numberand was amazed to discover that the inventory of this number is the same as the number---it has three 1s, one 2, three 3s, and one 4! He calls this an example of a self-inventorying number, and now he wants to find out which numbers are self-inventorying, or lead to a self-inventorying number through iterated application of the inventorying operation described below. You have been hired to help him in his investigations. Given any non-negative integer n, its inventory is another integer consisting of a concatenation of integers c1 d1 c2 d2 ... ck dk , where each ci and di is an unsigned integer, every ci is positive, the di satisfy 0=d1d2...dk=9, and, for each digit d that appears anywhere in n, d equals di for some i and d occurs exactly ci times in the decimal representation of n. For instance, to compute the inventory of 5553141 we set c1 = 2, d1 = 1, c2 = 1, d2 = 3, etc., giving The number 1000000000000 has inventory 12011 (twelve 0s, one 1). An integer n is called self-inventorying if n equals its inventory. It is called self-inventorying after j steps (j=1) if j is the smallest number such that the value of the j-th iterative application of the inv