HDU1251-统计难题

#include <cstdio>
#include <cstring>

char s[15];

struct Trie {
int cnt;
Trie *next[26];
};

void init(Trie *rt) {
rt->cnt = 0;
for (int i = 0; i < 26; i++) {
rt->next[i] = NULL;
}
}

Trie *build() {
Trie *p = new Trie;
init(p);
return p;
}

void insert(Trie *rt, char *s, int len) {
Trie *p = rt;
for (int i = 0; i < len; i++) {
int idx = s[i] - 'a';
if (p->next[idx] == NULL) {
p->next[idx] = new Trie;
init(p->next[idx]);
}
p = p->next[idx];
p->cnt++;
}
}

int search(Trie *rt, char *s, int len) {
Trie *p = rt;
for (int i = 0; i < len; i++) {
int idx = s[i] - 'a';
if (p->next[idx] == NULL) {
return 0;
}
p = p->next[idx];
}
return p->cnt;
}

int main(int argc, char const *argv[]) {
Trie *rt = build();
while (gets(s)) {
if (s[0] == '\0') {
break;
}
insert(rt, s, strlen(s));
}
while (scanf("%s", s) == 1) {
printf("%d\n", search(rt, s, strlen(s)));
}
return 0;
}