node* root; void init() { root = new node(); } void ins(string s) { int n = s.size(); node* now = root; for (int i = 0; i < n; i++) { int to = s[i] - 'a'; if (now->nxt[to] == nullptr) now->nxt[to] = new node(); now = now->nxt[to]; } now->...