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.

trie\trie\main.cpp
....\....\trie.vcxproj
....\....\trie.vcxproj.filters
....\trie.sdf
....\trie.sln
....\trie.v12.suo
....\trie
trie

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．