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
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 :) 

anuj0503:
20160622 15:24:23
First Trie !!! AC :)


noob909:
20160619 20:00:05
first trie :D very happy ! 

Mohit Agrawal:
20160618 14:28:01
can a phone number start with '0' ? 

cosmopoliton:
20160531 05:58:02
finally trie(d) trie :). 

gastonfontenla:
20160523 09:06:11
Used Trie with recursive struct (I'm crazy)


naruto09:
20160516 18:12:51
tle with recursion.. 
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 JS NODEJS PERL 6 VB.net 
Resource:  Nordic Collegiate Programming Contest 2007 