1 #include <bits/stdc++.h>
 2 using namespace std;
 3
 4 const int maxn = 100 + 10;
 5
 6 string d[maxn][maxn];
 7 char s[maxn],t[maxn];
 8
 9
10
11 int f[maxn];
12
13 string ToString(int x)
14 {
15     string ans = "";
16     while(x)
17     {
18         ans +=(char)('0'+(x%10));
19         x/=10;
20     }
21     reverse(ans.begin(),ans.end());
22     return ans;
23 }
24
25 void getFail(char* s)
26 {
27     int len = strlen(s);
28     f[0] = f[1] = 0;
29     for(int i=1; i<len; i++)
30     {
31         int j = f[i];
32         while(j&&s[i]!=s[j])
33             j = f[j];
34         f[i+1] = s[i]==s[j] ? j+1:0;
35     }
36 }
37
38 int main()
39 {
40     while(scanf("%s",s)!=EOF)
41     {
42         int len = strlen(s);
43         for(int i=0; i<len; i++)
44             d[i][i] = string("")+s[i];
45
46
47         for(int l=2; l<=len; l++)
48         {
49             for(int i=0; i + l - 1 < len; i++)
50             {
51                 int j = i + l - 1;
52                 d[i][j] = "";
53                 for(int k=i; k<=j; k++)
54                 {
55                     d[i][j] +=s[k];
56                     t[k-i] = s[k];
57                 }
58
59                 t[j-i+1] = 0;
60                 getFail(t);
61                 if(l%(l-f[l])==0)   //自身是重复的
62                 {
63                     int cycle = l - f[l];
64                     string t = "";
65                     t = ToString(l/cycle);
66                     t+='(';
67                     t+=d[i][i+cycle-1];
68                     t+=')';
69                     if(t.length()<d[i][j].length()) d[i][j] = t;
70                 }
71
72                 for(int k=i; k<j; k++)
73                 {
74                     if(d[i][k].length()+d[k+1][j].length()<d[i][j].length())
75                     {
76                         d[i][j] = d[i][k] + d[k+1][j];
77                     }
78                 }
79             }
80         }
81         cout<<d[0][len-1]<<endl;
82     }
83     return 0;
84 }