https://www.luogu.com.cn/problem/P3879
思路
直接用trie树模板
代码
#include <cstdio>
#include <iostream>
#include <string>
#include <cstring>
using namespace std;
class Trie {
private:
bool isEnd;
Trie *next[26];
public:
/** Initialize your data structure here. */
Trie() {
isEnd = false;
memset(next, 0, sizeof(next));
}
/** Inserts a word into the trie. */
void insert(string word) {
Trie *node = this;
for (int i = 0; i < word.length()<