摘要： 要判连通性，代码：#include<iostream>#include<fstream>#include<vector>using namespace std;int in[30];int out[30];int n;int v[30];vector<int> edge[27];void dfs(int s){ v[s]=1; for(int i=0;i<edge[s].size();i++) if(v[edge[s][i]]==0) dfs(edge[s][i]);}int ok(int s){ int i; memset(v,0,siz 阅读全文

摘要： 置换。代码：#include<iostream>#include<fstream>using namespace std;int a[1001];int n;int v[1001];int gcd(long long s,long long t){ if(t==0) return s; return gcd(t,s%t);}void read(){// ifstream cin("in.txt"); int i,j,k,s; cin>>n; long long ans=1; for(i=1;i<=n;i++) cin>> 阅读全文

摘要： 简单欧拉回路。代码:#include<iostream>#include<fstream>#include<vector>using namespace std;struct e{ int data; int num;};vector<e> a[51];int v[51];int vis[2000];void solve(int s){ for(int i=0;i<a[s].size();i++) { if(vis[a[s][i].num]==0) { vis[a[s][i].num]=1; solve(a[s][i].data); cou 阅读全文