【HDOJ】2526 浪漫手机

字符串大水题。

 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 105

 typedef struct {
     char s[];
     char ch;
 } pattern_t;

 char line[][MAXN];
 pattern_t pat[];
 int t, n;

 int comp(const void *a, const void *b) {
     pattern_t *p = (pattern_t *)a;
     pattern_t *q = (pattern_t *)b;

     return strcmp(p->s, q->s);
 }

 int main() {
     int m;
     int i, j, k;
     int v;

 #ifndef ONLINE_JUDGE
     freopen("data.in", "r", stdin);
     freopen("data.out", "w", stdout);
 #endif

     scanf("%d", &t);
     while (t--) {
         scanf("%d", &m);
         for (i=; i<; ++i)
             scanf("%s %c", pat[i].s, &pat[i].ch);
         scanf("%s", line[]+);

         qsort(pat, , sizeof(pattern_t), comp);
         line[][] = line[][] = '';
         k = ;
         n = strlen(line[]+);
         while (m--) {
             line[k][n+] = '\0';
             printf("%s\n", line[k]+);
             line[k][n+] = '';
             j = !k;
             for (i=; i<=n; ++i) {
                 v = ((line[k][i-]-'')<<) + ((line[k][i]-'')<<) + (line[k][i+]-'');
                 line[j][i] = pat[v].ch;
             }
             k = j;
         }
     }

     return ;
 }