C - One-stroke Path (atcoder.jp)
给定n个点,m条无向边,问有多少条不同的路径能遍历所有点
#include <iostream>
#include <vector>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
#include <queue>
#include <set>
#include <stack>
#include <algorithm>
#define x first
#define y second
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b; -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<bool> VB;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =10+ 10 ,M = N * 2 ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8,DNF = 1e18;
const int mod = 1e9 + 7 ,base= 20010;
const LL LNF=(LL) INF * INF;
bool g[N][N],st[N];
int n,m;
// v 当前点
int dfs(int v)
{
bool f = 1 ; // 判断是否全部点都到了
fu(i,1,n)if(!st[i]) f = 0 ;
if(f) return 1;
int ans=0 ;
fu(i,1,n )
{
if(!g[v][i] or st[i]) continue;
// 当前点和 下一点没边 或 下一个点已经用过了
st[i] = 1;
ans += dfs(i);
st[i] = 0;
}
return ans;
}
void solve()
{
cin >> n >> m ;
int a,b;
fu(i,1,m)
{
cin >> a >> b;
g[a][b] = g[b][a] = 1 ;
}
st[1] = 1 ;
cout << dfs(1) << endl;
}
signed main()
{
// freopen("1.txt","r",stdin);
// #define int long long
// init(N-1);
ios
// cout << fixed<<setprecision(2);
int t=1;
// cin>>t;
int now = 1;
while(t -- )
{
// cout<<"Case ";
// cout<<"Case #";
// cout<<"Scenario #";
// cout<< now ++ <<": ";
// cout<< now ++ <<": \n";
solve();
}
return 0;
}