北大ACM(POJ1016-Numbers That Count)

Question：http://poj.org/problem?id=1016

问题点：水题。

 Memory: 232K        Time: 125MS
 Language: C++        Result: Accepted

 #include <iostream>
 #include <string>
 using namespace std;

 string inventory(string n)
 {
     int i;
     int t[];
     char ch[];
     memset(t,,sizeof(t));
     for(i=;i<n.length();i++)
     {
         t[n.at(i)-'']++;
     }
     n.clear();
     for(i=;i<;i++)
     {
         if(t[i]==) continue;
         sprintf_s(ch,"%d%d",t[i],i);
         n+=ch;
     }
     return n;
 }
 int main()
 {
     int i,j;
     bool flag;
     string n[];
     while(cin>>n[] && n[]!="-1")
     {
         flag = false;
         for(i=;i<;i++)
         {
             n[i] = inventory(n[i-]);
             for(j=;j<i;j++)
             {
                 if(n[i]==n[j])
                 {
                     flag = true;
                     if(i==)
                     {
                         cout<<n[]<<" is self-inventorying"<<endl;
                     }
                     else if((i-j)==)
                     {
                         cout<<n[]<<" is self-inventorying after "<<j<<" steps"<<endl;
                     }
                     else
                     {
                         cout<<n[]<<" enters an inventory loop of length "<<i-j<<endl;
                     }
                 }
             }
             if(flag) break;
         }
         if(!flag) cout<<n[]<<" can not be classified after 15 iterations"<<endl;
     }
     return ;
 }