НачалоПодразделы
Другие разделы
| Тренировка 1 |
| Тренировка 3 |
| Тренировка 4 |
| Тренировка 5 |
Дата и время
16/11/2024 23:23:22
Тренировка 2
A. Phone List B. Cuckoo Hashing C.Optimal Parking D. Copying DNA E. Circle of Debt F. Full Tank? G. Nested Dolls H. Shopaholic I. Moogle
A. Phone List
СортировкаОлимпиадные задачи на английском языке
| 04/02/2008 | Зима 2008 дорешивание (2A) |
| 05/02/2008 | Тренировка (задачи Nordic CPC 2007) (A) |
Ограничения: время – 1s/2s, память – 64MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
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 specifications
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 specifications
For each test case, output "YES" if the list is consistent, or "NO" otherwise.
Sample input
2 3 911 97625999 91125426 5 113 12340 123440 12345 98346
Output for sample input
NO YES
