{"problem":{"name":"062. Delete Characters","description":{"content":"Given a string S and a list of characters C, print string S after removing all of the characters given in list C. The first line is the string S to be modified. The second line contains integer N, wh","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10269062"},"statements":[{"statement_type":"Markdown","content":"Given a string S and a list of characters C, print string S after removing all of the characters given in list C.\n\nThe first line is the string S to be modified. The second line contains integer N, which is the number of different characters to be deleted. The following N lines contain the characters to be deleted.\n\nA single string S after deleting all of the characters that are given to be deleted.\n\n## Input\n\nThe first line is the string S to be modified. The second line contains integer N, which is the number of different characters to be deleted. The following N lines contain the characters to be deleted.\n\n## Output\n\nA single string S after deleting all of the characters that are given to be deleted.\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ S \\in \\Sigma^* $ be the input string over alphabet $ \\Sigma $.  \nLet $ N \\in \\mathbb{Z}^+ $ be the number of characters to remove.  \nLet $ C = \\{c_1, c_2, \\dots, c_N\\} \\subseteq \\Sigma $ be the set of characters to be deleted.\n\n**Constraints**  \n1. $ N \\geq 1 $  \n2. Each $ c_i \\in \\Sigma $  \n\n**Objective**  \nCompute the string $ S' $ formed by removing all occurrences of characters in $ C $ from $ S $:  \n$$ S' = \\text{filter}_{x \\notin C}(S) $$","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF10269062","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}