{"raw_statement":[{"iden":"statement","content":"See the problem statement here: [http://codeforces.com/contest/921/problem/01](//codeforces.com/contest/921/problem/01)."}],"translated_statement":[{"iden":"statement","content":"请参见此处的问题描述：http://codeforces.com/contest/921/problem/01。\n\n"}],"sample_group":[],"show_order":[],"formal_statement":"**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 $.","simple_statement":null,"has_page_source":false}