HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Volumes > Array and Matrices > problem:


50496 - Falling Bricks

Guest
• Review clarifications (1)

Volume problems

• 50875 - Take m-out
• 50786 - Top Question
• 50788 - Eight Puzzle
• 50509 - Reading Book
• 50529 - Row to Table
• 50499 - Table to Row
• 50823 - Secret Number
• 50853 - Parking Place
• 50496 - Falling Bricks
• 50802 - Comparing Exams
• 50785 - Swimming Contest
• 50866 - Buy the cheapest
• 50517 - Confusion Matrix
• 50515 - Lines - Revisited
• 50999 - Overlapping Trips
• 50507 - Sequential Numbers
• 50449 - The biggest result

Feedback

If you notice incorrect translations in Contester, please let author know.

Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Question by Ibrahim Mesecan.

Falling Bricks

You want to start as a programmer in a company. They have asked you to implement a game: Falling Bricks. In this game, you have a series bricks (integers) with some bombs (negative numbers) among them.

Question: Write a program that is going to read bricks information. And then, your program will print the wall after bricks fall down.

Input specification
You will be given an integer (n) the number of bricks where 1 ≤ n ≤ 2000. Then in the following n lines, you will be given integers where zero and positive numbers represent the bricks and negative numbers represent the bombs. The first brick is the brick at the bottom and the last brick is the one at the top.

Output specification
Show first the number of bombs and then, show the bricks after removing the holes. Start showing from the top brick.

Sample Input I
6
7
-2
-5
0
-1
3
Sample Output I
3
3 0 7

Explanation:
3 bombs have been removed. Then, the remaining bricks are 3 0 and 7.



Для отправки решений необходимо выполнить вход.

www.contester.ru