Description: Trie tree implementation
input
Input the first act a positive integer n, said the dictionary size, followed by N lines, each line of a word (not guaranteed is English words, there may be a Martian words Oh), words consist of no more than 10 lowercase letters, may the same word, this should be regarded as different words. The next act a positive integer m, said the number of small Hi query, then m lines, each line of a string, the string consists of no more than 10 lowercase letters of the alphabet, said a small Hi of a query.
In 20 of the data in the m< 10, N, dictionary of the alphabet size < 2.
In 60 of the data in the m< 1000, N, dictionary of the alphabet size < 5.
In 100 of the data in the m< 100000, N, dictionary of the alphabet size < 26.
According to the amount of data by ranking Oh ~
output
For each of the small Hi query, the output of an integer Ans, which is a small Hi in the dictionary given the string as the prefix of the number of words.
To Search:
File list (Check if you may need any files):
trie\trie\main.cpp
....\....\trie.vcxproj
....\....\trie.vcxproj.filters
....\trie.sdf
....\trie.sln
....\trie.v12.suo
....\trie
trie
Download