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
jorker_71:
2016-08-10 11:43:32
use trie |
|
mohab3333:
2016-08-09 00:27:19
Wooooow got AC first (Trie) :P |
|
kshubham02:
2016-07-08 19:23:32
Easy Trie :) |
|
anuj0503:
2016-06-22 15:24:23
First Trie !!! AC :)
|
|
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)
|
|
naruto09:
2016-05-16 18:12:51
tle with recursion.. |
|
abhigupta4:
2016-02-28 20:34:51
Sorted the strings. Solution AC. |
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 |