HiHo 1014 Trie树

Trie树模板

#include
using namespace std;
struct Trie
{
    int word[100020<<2][26];
    int ex[100020<<2];
    int sz;
    Trie()
    {
        sz=1;
        memset(word,0,sizeof(word));
        memset(ex,0,sizeof(ex));
    }
    void insert(char *s)
    {
        int u=0;
        int c;
        int len=strlen(s);
        for(int i=0;i