HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Sections > Divide&Conquer and Binary Search Trees (BST) > problem:


50836 - Censored

Guest
• Review clarifications (1)

Section problems

• 50770 - Average Depth
• 50411 - Sum of the Leaves
• 50830 - Sorting BST Nodes
• 50803 - Sum of the depths in BST
• 50805 - Sum of the weights in a BST
• 50818 - Depth Limited BST
• 50836 - Censored
• 50816 - Largest Sum Path
• 50772 - The Path of a Node
• 50863 - Total Access Cost of a BST
• 50771 - BST Level Sum
• 50773 - Balanced Sum Tree
• 50722 - Scientist's problem

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.

Censored

The company you are working is very sensitive about the emails sent. They want to filter the sensitive (Censored) words from the emails.

Question: Write a program that removes the "Censored" words from a given text. Note: It's provided that the list random. However, due to the number of searches, the problem will give time limit error. You should better use Hash-Map or or BST or sort the list and use binary-search

Input specification
First, you will be given an integer: the number of blacklisted words (n) where 1 ≤ n ≤ 35,000. In the following n lines you will be given n words which contain only (uppercase or lowercase) English letters. Then starting from the next line, you will be given unknown length of text.

Output specification:
Show the words as they are, if they are not listed in the Censored list. Show **** otherwise.
Note: You may show endline after every 15 words.

Sample Input I
3
some
Company
the
The company is very
sensitive about some numbers
Sample Output I
**** **** is very sensitive about **** numbers



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

www.contester.ru