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
anuj0503: 2016-06-22 15:24:23

First Trie !!! AC :)
0.07 sec

noob909: 2016-06-19 20:00:05

first trie :D very happy !

Mohit Agrawal: 2016-06-18 14:28:01

can a phone number start with '0' ?

cosmopoliton: 2016-05-31 05:58:02

finally trie(d) trie :).

gastonfontenla: 2016-05-23 09:06:11

Used Trie with recursive struct (I'm crazy)
0.07 sec, 47M

Test Case:

2
5
1
12
123
1234
12345
5
12345
1234
123
12
1

Last edit: 2016-05-23 09:07:03
naruto09: 2016-05-16 18:12:51

tle with recursion..

abhigupta4: 2016-02-28 20:34:51

Sorted the strings. Solution AC.

pvsmpraveen: 2016-02-04 07:05:46

Solved with sort
Will try to Trie it ;)

m.ajaj94: 2016-02-03 17:22:53

(Trie)ing it too many times to get AC

nonushikhar: 2016-01-27 20:36:01

qsort easy ac one go :)


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