zoj1073 Round and Round We Go

1. //zoj1073 Round and Round We Go
2. // Accepted 1073 C ++ 00:00.00 832K
3. #include <cstdio>
4. #include <iostream>
5. #include <string>
6. using namespace std;
7. char s[100],t[100];
8. int len;
9. void mult(int n)
10. {
11.        int i,sum[100]={0};
12.        for (i=0; i<len; ++i){
13.               sum[i] = s[i]-'0';
14.               sum[i] *= n;
15.        }
16.        for (i=len-1; i>0; --i){
17.               if (sum[i]>9){
18.                      sum[i-1] += sum[i]/10;
19.                      sum[i] %= 10;
20.               }
21.        }
22.        for (i=0; i<len; ++i)
23.               t[i] = sum[i]+'0';
24. }
25. bool cyclic()
26. {
27.        int i,j,flag[100]={0};
28.        for (i=0; i<len; ++i)
29.               for (j=0; j<len; ++j)
30.                      if (!flag[j] && s[i]==t[j]){
31.                             flag[j] = 1;
32.                             break;
33.                      }
34.        for (i=0; i<len; ++i)
35.               if (!flag[i]) return false;
36.        return true;
37. }
38. void solve()
39. {
40.        len = strlen(s);
41.        for (int n=2; n<=len; ++n){
42.               mult(n);
43.               if (!cyclic()){
44.                      cout << s << " is not cyclic" << endl;
45.                      return;
46.               }
47.        }
48.        cout << s << " is cyclic" << endl;
49. }
50. int main()
51. {
52. #ifdef ONLINE_JUDGE
53. #else
54.        freopen("1073.txt","r",stdin);
55. #endif
56.        while (cin >> s)
57.               solve();
58. #ifdef ONLINE_JUDGE
59. #else
60.        fclose(stdin);
61. #endif
62.        return 0;
63. }