#include <bits/stdc++.h>

 using namespace std;

 const int maxn = ;

 int id[], letter[maxn];

 char in[];

 int main()

 {

     //freopen("in.txt", "r", stdin);

     while(scanf("%s", in) ==  && in[] != '#')

     {

         int n = ;

         for(char ch = 'A'; ch <= 'Z'; ++ch)

             if(strchr(in, ch) != NULL)

             {

                 id[ch] = n;

                 letter[n++] = ch;

             }

         int l = strlen(in), p = , q = ;

         vector<int> u, v;

         for(;;)

         {

             while(p < l && in[p] != ':') p++;

             if(p == l) break;

             while(q < l && in[q] != ';') q++;

             for(int i = p+; i < q; ++i)

             {

                 u.push_back(id[in[p-]]);

                 v.push_back(id[in[i]]);

             }

             p++; q++;

         }

         int P[maxn], bestP[maxn], pos[maxn], ans = n;

         for(int i = ; i < n; ++i) P[i] = i;

         do

         {

             for(int i = ; i < n; ++i) pos[P[i]] = i;

             int bandwidth = ;

             for(int i = ; i < u.size(); ++i) bandwidth = max(bandwidth, abs(pos[u[i]] - pos[v[i]]));

             if(bandwidth < ans)

             {

                 ans = bandwidth;

                 memcpy(bestP, P, sizeof(P));

             }

         }while(next_permutation(P, P+n));

         for(int i = ; i < n; ++i) printf("%c ", letter[bestP[i]]);

         printf("-> %d\n", ans);

     }

     return ;

 }

 代码君