{"problem":{"name":"Don’t be cycle","description":{"content":"You are given a simple undirected graph with $N$ vertices and $M$ edges. The vertices are numbered $1$ to $N$, and the $i$\\-th edge connects vertex $A_i$ and vertex $B_i$. Let us delete zero or more e","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc288_c"},"statements":[{"statement_type":"Markdown","content":"You are given a simple undirected graph with $N$ vertices and $M$ edges. The vertices are numbered $1$ to $N$, and the $i$\\-th edge connects vertex $A_i$ and vertex $B_i$. Let us delete zero or more edges to remove cycles from the graph. Find the minimum number of edges that must be deleted for this purpose.\n\nWhat is a simple undirected graph? **A simple undirected graph** is a graph without self-loops or multi-edges whose edges have no direction.\n\nWhat is a cycle? A **cycle** in a simple undirected graph is a sequence of vertices $(v_0, v_1, \\ldots, v_{n-1})$ of length at least $3$ satisfying $v_i \\neq v_j$ if $i \\neq j$ such that for each $0 \\leq i < n$, there is an edge between $v_i$ and $v_{i+1 \\bmod n}$.\n\n## Constraints\n\n*   $1 \\leq N \\leq 2 \\times 10^5$\n*   $0 \\leq M \\leq 2 \\times 10^5$\n*   $1 \\leq A_i, B_i \\leq N$\n*   The given graph is simple.\n*   All values in the input are integers.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$ $M$\n$A_1$ $B_1$\n$A_2$ $B_2$\n$\\vdots$\n$A_M$ $B_M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc288_c","tags":[],"sample_group":[["6 7\n1 2\n1 3\n2 3\n4 2\n6 5\n4 6\n4 5","2\n\nOne way to remove cycles from the graph is to delete the two edges between vertex $1$ and vertex $2$ and between vertex $4$ and vertex $5$.  \nThere is no way to remove cycles from the graph by deleting one or fewer edges, so you should print $2$."],["4 2\n1 2\n3 4","0"],["5 3\n1 2\n1 3\n2 3","1"]],"created_at":"2026-03-03 11:01:14"}}