1016 Numbers That Count

校内练习赛的时候做的,题目很长,要细心看规则

直接模拟即可

1. //4452572_AC_157MS_924K
2. /**********************************************************************
3. *       Online Judge   : POJ
4. *       Problem Title  : Numbers That Count
5. *       ID             : 1016
6. *       Date           : 12/4/2008
7. *       Time           : 14:38:9
8. *       Computer Name  : EVERLASTING-PC
9. ***********************************************************************/
10. #include<iostream>
11. #include<string>
12. #include<sstream>
13. using namespace std;
15. int t,step,i;
16. string his[18];
17. string s;
18. int c[10];
19. stringstream ss;
20. bool found;
22. int main()
23. {
24.     {
25.         while(cin>>s&&s!="-1")
26.         {
27.             found=false;
28.             his[0]=s;
29.             step=0;
30.             while(1)
31.             {
32.                 step++;
33.                 memset(c,0,sizeof(c));
34.                 s=his[step-1];
35.                 for(i=0;i<s.length();++i)
36.                 {
37.                     c[s[i]-48]++;
38.                 }
39.                 ss.clear();
40.                 for(i=0;i<10;++i)
41.                 {
42.                     if(c[i]!=0)
43.                     {
44.                         ss<<c[i]<<i;
45.                     }
46.                 }
47.                 ss>>s;
48.                 if(his[0]==s)
49.                 {
50.                     if(step==1)
51.                     {
52.                         cout<<his[0]<<" is self-inventorying/n";
53.                         found=true;
54.                     }
55.                 }
56.                 else if(his[step-1]==s)
57.                 {   cout<<his[0]<<" is self-inventorying after "<<step-1<<" steps/n";
58.                 found=true;
59.                 }
60.                 else
61.                     for(i=step-1;i>=0;--i)
62.                     {
63.                         if(his[i]==s)
64.                         {
65.                             cout<<his[0]<<" enters an inventory loop of length "<<step-i<<endl;
67.                             found=true;
68.                             break;
69.                         }
70.                     }
71.                     if(found)
72.                     {
73.                         break;
74.                     }
75.                     his[step]=s;
76.                     if(step==15)
77.                     {
78.                         break;
79.                     }
80.             }
81.             if(!found)
82.             {
83.                 cout<<his[0]<<" can not be classified after 15 iterations/n";
84.             }
85.         }
86.     }
87.     return 0;
88. }