JD_Source Code for problem 1379

题目链接:http://acm.jlu.edu.cn/joj/showproblem.php?pid=1379

解题心得:

1，基本的语法不要弄错，当时做的时候，memset用错了，错因是把第二个参数传为数组的大小，第三个参数传为要设的值了，实际应该是参数二为要设的值，参数三为数组大小，并且为整型数组赋值时第二个参数只有为0或-1时才能达到预期效果。

2，在用标准库中的集合和数组时，一定要考虑清楚什么时候该清空和什么时候该设为空，否则就出现怎么都改不对的错误，我就是困在这儿的！！！

3，用visit数组统计各位数字的个数自认为是个挺好的想法，可以看作是思想的进步

1. #include <stdio.h>
2. #include <string.h>
3.  
4. char input [ 81 ];
5. char result [ 15 ] [ 81 ];
6. int visit [ 10 ];
7.  
8. void SetResult ( int i )
9. {
10. int j,k,len;
11. memset (visit, 0, sizeof (visit ) );
12. if (i == 0 )
13. {
14. len = strlen (input );
15. for (j = 0;j < len;j++ )
16. visit [input [j ] - '0' ]++;
17. }
18. else
19. {
20. len = strlen (result [i - 1 ] );
21. for (j = 0;j < len;j++ )
22. visit [result [i - 1 ] [j ] - '0' ]++;
23. }
24.  
25. k = 0;
26. for (j = 0;j < 10;j++ )
27. {
28. if (visit [j ] >= 10 )
29. {
30. int a = visit [j ] / 10;
31. int b = visit [j ] % 10;
33. result [i ] [k ] = a + '0';
34. result [i ] [k + 1 ] = b + '0';
35. result [i ] [k + 2 ] = j + '0';
37. k += 3;
38. }
39. else if (visit [j ] > 0 )
40. {
41. result [i ] [k ] = visit [j ] + '0';
42. result [i ] [k + 1 ] = j + '0';
44. k += 2;
45. }
46. }
48. }
49.  
50. bool Find ( int i,int& first )
51. {
52. if ( strcmp (result [i ],input ) == 0 )
53. {
54. first = -1;
55. return true;
56. }
57.  
58. int j;
59. for (j = 0;j < i;j++ )
60. {
61. if ( strcmp (result [j ],result [i ] ) == 0 )
62. {
63. first = j;
64. return true;
65. }
66. }
67. return false;
68. }
69.  
70. int main ( int argc, char* argv [ ] )
71. {
72. int b_num;
73. while ( scanf ( "%d",&b_num ) != EOF )
74. {
75. while (b_num-- )
76. {
77. while ( scanf ( "%s",input ) && strcmp (input, "-1" ) != 0 )
78. {
79. int i;
80. bool find = false;
81. memset (result, 0, sizeof (result ));//每次处理一个字符串都应该将result设为空
82. for (i = 0;i < 15;i++ )
83. {
84. SetResult (i );
85. if (i == 0 )
86. {
87. if ( strcmp (result [i ],input ) == 0 )
88. {
89. printf ( "%s is self-inventorying/n",input );
90. find = true;
91. break;
92. }
93. }
94. else
95. {
96. int first;
97. if (Find (i,first ) )
98. {
99. if (first == i - 1 )
100. printf ( "%s is self-inventorying after %d steps/n",input,i );
101. else
102. printf ( "%s enters an inventory loop of length %d/n",input,
103. i - first );
104. find = true;
105. break;
106. }
107. }
108. }
109. if (!find )
110. printf ( "%s can not be classified after 15 iterations/n",input );
111. }
112. printf ( "/n" );
113. }
114. }
115. return 0;
116. }