A7778 | A Simple Task
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Given a simple graph, output the number of simple cycles in it. A simple cycle is a cycle with no repeated vertices or edges.
输入格式
The first line of input contains two integers $n$ and $m$ ( $1<=n<=19$ , $0<=m$ ) – respectively the number of vertices and edges of the graph. Each of the subsequent $m$ lines contains two integers $a$ and $b$ , ( $1<=a,b<=n$ , $a≠b$ ) indicating that vertices $a$ and $b$ are connected by an undirected edge. There is no more than one edge connecting any pair of vertices.
输出格式
Output the number of cycles in the given graph.
输入输出样例
输入 #1
4 6 1 2 1 3 1 4 2 3 2 4 3 4
输出 #1
7
The example graph is a clique and contains four cycles of length 3 and three cycles of length 4.
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted