{"problem":{"name":"14. Labyrinth-14","description":{"content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":8000,"memory_limit":524288},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF92114"},"statements":[{"statement_type":"Markdown","content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01).\n\n[samples]","is_translate":false,"language":"English"},{"statement_type":"Markdown","content":"请参见此处的问题描述：http://codeforces.com/contest/921/problem/01。\n\n[samples]","is_translate":true,"language":"Chinese"},{"statement_type":"Markdown","content":"**Definitions**  \nLet $ n \\in \\mathbb{Z} $ be the number of vertices in a complete graph.  \nLet $ m \\in \\mathbb{Z} $ be the number of edges to remove.  \n\n**Constraints**  \n1. $ 1 \\leq n \\leq 10^5 $  \n2. $ 0 \\leq m \\leq \\min\\left(\\frac{n(n-1)}{2}, 10^5\\right) $  \n\n**Objective**  \nFind the minimum number of connected components in the graph after removing exactly $ m $ edges from the complete graph $ K_n $.","is_translate":false,"language":"Formal"}],"meta":{"iden":"CF92114","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}