「HDU 1251」统计难题

#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define MAX 100005
using namespace std;
struct TRIE {
    int son[26];
    int num;
};
TRIE trie[MAX];
string str;
int tot;
inline void build_trie() {
    int position = 0;
    for (int i = 0; i < str.length(); i++) {
        if (!trie[position].son[str[i] - 'a'])
            trie[position].son[str[i] - 'a'] = ++tot;
        position = trie[position].son[str[i] - 'a'];
        trie[position].num++;
    }
}

inline int get_ans() {
    int position = 0;
    for (int i = 0; i < str.length(); i++) {
        if (!trie[position].son[str[i] - 'a']) return 0;
        position = trie[position].son[str[i] - 'a'];
    }
    return trie[position].num;
}
int main(int argc, char const *argv[]) {
    /* code */
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    while (getline(cin, str) && str[0] != '\0') build_trie();
    while (cin >> str) cout << get_ans() << "\n";
    return 0;
}