Начало
Рабочее место участника
| Выбрать соревнование | Задачи | Послать решение | Результаты проверки | Статистика по задачам | Вопросы и ответы | Результаты соревнования | Состояние сервера | Изменить данные | Управление командой | Помощь |
Задачи
1602. Numbers
СортировкаАвтоматы
Олимпиадные задачи на английском языке
| 04/07/2011 | Лето 2011 - дорешивание (07B) |
| 12/07/2011 | Лето 2011 - 7 (B) |
Ограничения: время – 1s/2s, память – 32MiB Ввод: input.txt или стандартный ввод Вывод: output.txt или стандартный вывод 
Послать решение Blockly Посылки Темы Где Обсудить (0)
Little Mirko wasn’t paying attention in math class, so the teacher has decided to give him a tedious
assignment to solve during the weekend.
The teacher has given him a text consisting of N lines, containing only digits and lower case letters of
the English alphabet. Mirko has to find all numbers in the text and print them out in a nondecreasing
sequence. He also has to omit any leading zeros that the numbers may have in the text.
The numbers can be uniquely determined by scanning through the text and always taking the largest
possible number, i.e. delimited only by letters or line beginnings/ends. For example, the solution of
01a2b3456cde478 is 1, 2, 478, 3456.
Since Mirko is as slow as the snail from the previous task, he has asked you to write him a program to
quickly solve his assignment, so that he can go play with Slavko as soon as possible.
The first line of input contains the integer `N` (`1\ ≤\ N\ ≤\ 100`), the number of lines of the text.
The next N lines contain the text, consisting exclusively of lowercase English letters and decimal digits.
Each line of the text is at most 100 characters long.
The output must contain `M` lines, where `M` is the number of numbers found in the provided text. Each
line must contain a single number from the text. The numbers must be arranged in a nondecreasing
sequence.
Note:
The test data will ensure that `M` will never exceed 500.
Sample Input 1
2 lo3za4 01
Sample Output 1
1 3 4
Sample Input 2
4 43silos0 zita002 le2sim 231233
Sample Output 2
0 2 2 43 231233
Sample Input 3
4 01bond 02james007 03bond 04austinpowers000
Sample Output 3
0 1 2 3 4 7
