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
hide comments
pvsmpraveen:
20160204 07:05:46
Solved with sort


m.ajaj94:
20160203 17:22:53
(Trie)ing it too many times to get AC 

nonushikhar:
20160127 20:36:01
qsort easy ac one go :) 

dokz:
20160120 05:01:23
Do not forget to clear the trie after every test :) Costed me 1 WA. 

epsilon:
20160119 15:34:55
good one :) if two number are same then data is consistent!!!! 

kartikay singh:
20160111 03:41:21
Trie'd it : 0.16s 

Advitiya:
20160109 19:45:51
trie this using stl too :P 

anshal dwivedi:
20160109 15:27:54
just "trie" it :)


sanket407:
20160106 12:11:26
got runtime error in java bcoz i was breaking off and outputting without reading ALL N inputs (ans NO can be achieved midway too). 

Andres R. Arrieche S. [UCLAve]:
20160105 20:01:31
Did 'spoj' delete source codes sent? I can't see my old submission codes :S 
Added by:  Andres Galvis 
Date:  20090308 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  Nordic Collegiate Programming Contest 2007 