Poj-3630（字典树，水题）

最新推荐文章于 2022-04-09 22:28:03 发布

KetchupZ

最新推荐文章于 2022-04-09 22:28:03 发布

阅读量818

点赞数

分类专栏： # 字典树

本文链接：https://blog.csdn.net/Dch19990825/article/details/83618876

版权

该博客讨论了一道编程竞赛题目，要求判断一组电话号码中是否存在前缀关系，即某个号码是另一个号码的前缀。博主提出了通过构建字典树来解决此问题的思路，并给出了代码实现。在实际测试中，博主发现尽管题目限制了电话号码数量的最大值，但增加额外的容量有助于通过所有测试用例。

摘要由CSDN通过智能技术生成

Given a list of phone numbers, determine if it is consistent in the sense that no number is the prefix of another. Let's say the phone catalogue listed these numbers:

Emergency 911
Alice 97 625 999
Bob 91 12 54 26

In this case, it's not possible to call Bob, because the central would direct your call to the emergency line as soon as you had dialled the first three digits of Bob's phone number. So this list would not be consistent.

Input

The first line of input gives a single integer, 1 ≤ t ≤ 40, the number of test cases. Each test case starts with n, the number of phone numbers, on a separate line, 1 ≤ n ≤ 10000. Then follows n lines with one unique phone number on each line. A phone number is a sequence of at most ten digits.

Output

For each test case, output "YES" if the list is consistent, or "NO" otherwise.

Sample Input