给出一个 $n$ 个点，$m$ 条边的无向图，求图的割点。
输入格式
第一行输入两个正整数 $n, m$。
下面 $m$ 行每行输入两个正整数 $x,y$ 表示 $x$ 到 $y$ 有一条边。
输出格式
输出一行，包含若干个整数，按照节点编号从小到大输出节点，用空格隔开。
样例数据
样例输入
6 7
1 2
1 3
1 4
2 5
3 5
4 5
5 6样例输出
1
5子任务
对于全部数据，$1 \leq n \leq 10^5$, $1 \leq m \leq 10^6$.
QOJ.ac
QOJ
Time Limit: 0.5 s
Memory Limit: 512 MB
Total points: 100
#996. 割点
Statistics
The problem was used in the following contests:
Discussions
About Discussions
The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.
This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.
Open Discussions 0
No discussions in this category.
Issues
About Issues
If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.
Guidelines:
- This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
- Do not submit duplicated issues.
- Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.