【HDOJ】3242 List Operations

注意以下数据：
[] ++ []
[] -- [1,2]
[1,2] ++ []
[] ++ [1]
[2] ++ []
[2,3] -- []
结果是
[]
[]
[1,2]
[1]
[2]
[2,3]

 /* 3242 */
 #include <cstdio>
 #include <cstring>
 #include <cstdlib>

 #define MAXN 205

 typedef struct {
     char s[];
     bool f;
 } word_t;

 word_t words[][MAXN];
 int n[], len[];
 char src[][MAXN];
 char op[];

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

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

     while (scanf("%s", src[])!=EOF && (src[][]!='.')) {
         scanf("%s %s", op, src[]);
         n[] = n[] = ;
         for (i=; i<; ++i) {
             k = ;
             for (j=; src[i][j]; ++j) {
                 if (src[i][j]==',' || src[i][j]==']') {
                     if (src[i][j-] != '[') {
                         words[i][n[i]].s[k] = '\0';
                         words[i][n[i]].f = true;
                         n[i]++;
                         k = ;
                     }
                 } else {
                     words[i][n[i]].s[k++] = src[i][j];
                 }
             }
             len[i] = j;
         }

         if (op[] == '+') {
             src[][len[]-] = '\0';
             printf("%s", src[]);
             if (n[] == ) {
                 printf("]\n");
             } else {
                 if (n[] == )
                     printf("%s\n", src[]+);
                 else
                     printf(",%s\n", src[]+);
             }
         } else {
             for (j=; j<n[]; ++j) {
                 for (i=; i<n[]; ++i)  {
                     if (words[][i].f && strcmp(words[][i].s, words[][j].s)==) {
                         words[][i].f = false;
                         break;
                     }
                 }
             }
             printf("[");
             i = ;
             while (i < n[]) {
                 if (words[][i].f)
                     break;
                 ++i;
             }
             if (i < n[]) {
                 printf("%s", words[][i].s);
                 ++i;
                 while (i < n[]) {
                     if (words[][i].f)
                         printf(",%s", words[][i].s);
                     ++i;
                 }
             }
             printf("]\n");
         }
     }

     return ;
 }