HDU1251 trie(结构体)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<algorithm>
#include<set>
#include<map>
#include<queue>
#include<vector>
#include<stack>
using namespace std;

#define ll long long 
#define mxn 502000
#define eps 1e-8

struct node {
	int val;
	node *nxt[27];
}pool[mxn];
node *root;
int sz = 0;
char s[100];
node *creat() {
	node *p = &pool[sz++];
	p -> val = 0;
	memset( p -> nxt, NULL, sizeof( p -> nxt ) );
	return p;
}
void insert() {
	int n = strlen( s );
	node *p = root;
	for( int i = 0; i < n; ++i ) {
		int u = s[i] - 'a';
		if( p -> nxt[u] == NULL )
			p -> nxt[u] = creat();
		p = p -> nxt[u];
		p -> val ++;
	}
}
int find() {
	int n = strlen( s );
	node *p = root;
	for( int i = 0; i < n; ++i ) {
		int u = s[i] - 'a';
		if( p -> nxt[u] == NULL )
			return 0;
		p = p -> nxt[u];
	}
	return p -> val;
}
int main() {
	root = creat();
	while( gets( s ) && strlen( s ) ) {
		insert();
	}
	while( gets( s ) ) 
		printf( "%d\n", find() );
	return 0;
}