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
cake_is_a_lie:
20170215 16:59:27
Got 4 SIGFPEs for it (because I'm silly and can't do simple math), but the 0.01s was worth it. Could probably get 0.00s but I'm too lazy to write my own sort function. 

saurav786:
20161222 18:19:29
NO need of trie, sort the string of array lexigraphically and do a pairwise checking from top :D


rajeev_899:
20161127 08:27:59
AC in one go 

karan_batra:
20161031 11:39:46
Last edit: 20170213 16:46:11 

baadshah_:
20160917 15:33:54
Clear the Trie For Each TEST case ! Costed me 2 WA!! 

iareeb:
20160917 09:04:45
In first TRIE! AC (: Last edit: 20160917 09:06:06 

montassar0111:
20160822 03:53:30
my first problem using Trie , easy one :) 

jorker_71:
20160810 11:43:32
use trie 

mohab3333:
20160809 00:27:19
Wooooow got AC first (Trie) :P 

kshubham02:
20160708 19:23:32
Easy Trie :) 
Added by:  Andres Galvis 
Date:  20090308 
Time limit:  0.177s0.532s 
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 