PHONELST - Phone List

no tags 

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

hide comments
vedaytas: 2015-06-25 21:05:17

nice one.my first with trie.very basic trie

SangKuan: 2015-06-24 12:24:17

easy with trie tree,but i got 3 runtiome error,due to my node array is not enough,1 compilation error,because of it too big.

sujit yadav: 2015-06-19 19:36:46

stl rocks !!! hardly 10-15 lines of code :)

Raj: 2015-05-25 17:11:00

even string class and cin/cout with sort function passes

i_am_looser: 2015-05-09 09:34:42

Wow i have done it using trie....... yippee

Abhilash: 2015-04-16 21:36:07

try using long int

Dharmesh Ruprela: 2015-04-11 08:28:33

My 150th !! :D

arp_ee: 2015-04-01 19:17:20

simple sort will work !!

Manish: 2015-03-15 08:50:02

Even simple quicksort does :/

vaibhav jain: 2015-02-22 13:43:31

Trie works !


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