PHONELST - Phone List

Phone List

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.

Example

Input:
2
3
911
97625999
91125426
5
113
12340
123440
12345
98346

Output:
NO
YES

Added by:Andres Galvis
Date:2009-03-08
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Nordic Collegiate Programming Contest 2007

hide comments
2018-09-13 16:27:44 Yauhen
Ac in 1 go using ONLY sorting (not trie....).
2018-08-14 11:30:37
Similar Problem on Hackerrank "no prefix set".

2018-07-01 07:16:35
invested so many hours to learn try then ac in a go ! Emotional moment for me :')
2018-06-17 14:14:04
Finally got accepted after few WA !! My first Trie. :P
2018-05-31 12:27:50
Simple Trie
2018-05-21 19:40:19
My First Using Tries !
2018-02-28 17:22:56
Nice problem for beginners

Last edit: 2018-03-05 16:22:36
2018-01-11 19:41:17
Good problem for implementing Trie...
2017-12-10 13:26:54
You don't need to use trie for this question . It can be done using stl maps .
2017-10-02 05:55:00
Trie data structure, little painful to implement in C though , overall was fine.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.