[hihocoder 1181 欧拉路 二] Fleury 算法求欧拉回路
题目链接:
[hihocoder 1181 欧拉路 二]
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
//#pragma comment(linker, "/STACK:1024000000,1024000000")
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w",stdout)
#define fst first
#define snd second
//typedef __int64 LL;
typedef long long LL;
typedef pair<int, int> PII;
const int MAXN = 1e4 + 5;
const int MAXE = 5e4 + 5;
int T, N, M, K;
struct Edge {
int v, next;
Edge