csu 1148 词典

快排、二分查找，对于我来说是道好题，对大牛来说，瞄一眼就跳过了。。。

# include <stdio.h>
# include <string.h>
# include <stdlib.h>

# define MAXN 100005

typedef struct {
        char s[12];
        char ss[12];
} word;

word dic[MAXN];
word key;

int cmp(const void *a, const void *b)
{  
    return strcmp((*(word *)a).ss, (*(word *)b).ss);
}

char *re_fgets(char *s1, char *s2, FILE *iop, const int ch);

int main()
{
    int n;
    word *tmp;
    
    n = 0;
    while (NULL != re_fgets(dic[n].s, dic[n].ss, stdin, ' '))
          ++n;
    qsort(dic, n, sizeof(word), cmp);
    
    while (~scanf("%s", key.ss))
    {
          tmp = bsearch(&key, dic, n, sizeof(word), cmp);
          if (tmp != NULL) printf("%s\n", (*tmp).s);
          else printf("eh\n");
    }
        
    return 0;
}

char *re_fgets(char *s1, char *s2, FILE *iop, const int ch)
{
     register int c;
     register char *cs;
     
     cs = s1;
     c = getc(iop);
     if (c == '\n' || c == EOF) return NULL;
     else *cs++ = c;
     while ((c = getc(iop)) != ch && c != EOF)
           *cs++ = c;
     *cs = '\0';
     cs = s2;
     while ((c = getc(iop)) != '\n' && c != EOF)
           *cs++ = c;
     *cs = '\0';
     return cs;
}

输入的处理有点复杂，仿照 gets()，寄存器变量看来是快。。