hdu 1251 [Trie]

/*Subject : Trie tree (Basic)*/
#include <iostream>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <algorithm>
#define Bug cout << "here\n";

using namespace std;
const int N = 1010;
const int sn = 26;
string s1;
string s2;
struct node {
	int num;       // to remember how many words
	bool terminal;
	node *next[sn];
	node() : num(1), terminal(false) {
		memset(next, 0, sizeof(next));
	}
};
void insert(node *root, string s) { // 建树
	node *p = root;
	int i = 0, index;
	while(s[i]) {
		index = s[i] - 'a';
		if(p->next[index] == NULL) {
			p->next[index] = new node();
		}
		else {
			p->next[index]->num++;
		}
		i++;
		p = p->next[index];
	}
	p->terminal = true;
}
int find(node *root, string s) {
	node *p = root;
	int len = s.length();
	int index = 0, cnt = 0;
	for(int i = 0; i < len; i++) {
		index = s[i] - 'a';
		if(p->next[index] != NULL) {
			if(i == len-1) {
				return p->next[index]->num;
			}
		}
		else return 0;
		p = p->next[index];
	}
	return 0;
}

int main() {
	node *root = new node();
	while(getline(cin, s1) && !s1.empty()) {
		insert(root, s1);
	}
	while(getline(cin, s2) && !s2.empty()) {
		cout << find(root, s2) << endl;
	}
	return 0;
}