Numbers that count 1016 PKU

Description:

一个数的inventory是0-9每个数字出现多少次，例如5553141的inventory是21131435

1． 如果一个数的inventory是其本身，则称其为self-inventorying，例如31123314的inventory还是31123314

2． 一个数迭代j步求inventory之后可能是self-inventorying ，例如21221314à31321314à31123314à31123314，则21221314 is self-inventorying after 2 steps

3． 一个数inventory迭代时，可能在第j步之后，进入一个长度为看的inventory循环，例如314213241519 enters aninventory loop of length 2，314213241519à 412223241519à 314213241519：j=0，k=2

4． 一个数如果15次迭代之后没有上述性质，则ncan not be classified after 15 iterations

Solution:

#include <stdio.h>
#include <string.h>

 #define CHARSIZE 128

 void Inventory(char *in, char *out)
{
    int usedTime[10]={0};
    int i=0,k=0,p_s=0,flag=0;
    int temp[16];
    
    // memset((void*)usedTime,0,sizeof(usedTime));
     
    for (i=0; in[i]; i++)
        usedTime[in[i]-'0'] ++;
    
    for (p_s=0,i=0; i<10; i++)    
    {
        k = -1;
        flag = 0;
        while (usedTime[i])
        {
            temp[++k] = usedTime[i] % 10 + '0';
            usedTime[i] /= 10;
            flag = 1;
        }
        while (k>=0)
        {
            out[p_s++] = temp[k--];
        }
        if (flag)
            out[p_s++] = i+'0';
    }
    out[p_s++] = '\0';
}

 int main ()
{
    char inStr[16][CHARSIZE];
    int i=0,j=0;
    
    while  (scanf ("%s",inStr[0]))
    {
        if (inStr[0][0] == '-')
            break;
        
        for (i=0; i<15; i++)
        {
            Inventory(inStr[i],inStr[i+1]);
            // self-inventorying after i steps
            if (strcmp(inStr[i],inStr[i+1])==0)
            {
                //to do
                if (i)
                    printf ("%s is self-inventorying after %d steps\n",inStr[0],i);
                else
                    printf ("%s is self-inventorying\n",inStr[0]);
                break;
            }
            // for (j=0; j<i; j++)
            // 注意，必须写成下列格式才能保证minimize the length of inventory loop
            for (j=i-1; j>=0; j--)
                if (strcmp (inStr[i+1],inStr[j])==0)
                {
                    printf ("%s enters an inventory loop of length %d\n",inStr[0],i+1-j);
                    break;
                }
            if (j>=0)
                break;
        }
        if (i==15)
            printf ("%s can not be classified after 15 iterations\n",inStr[0]);
    }
    return 0;
}