Downloads

代码说明：

  借鉴别人，欧拉回路，测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是节点数N ( 1 < N < 1000 )和边数M；随后的M行对应M条边，每行给出一对正整数，分别是该条边直接连通的两个节点的编号（节点从1到N编号）。当N为0时输入结束。(Referring to others, Euler circuit, test input contains several test cases. The first line of each test case gives two positive integers, namely the number of nodes N (1 < N < 1000) and the number of edges M; the subsequent M lines correspond to M edges, and each line gives a pair of positive integers, which are the number of the two nodes directly connected to the edge (node numbers from 1 to N). When N is 0, the input ends.)

文件列表：

3.1.o, 2747 , 2019-05-22
3.1.cpp, 943 , 2019-05-22
3.1.exe, 1048956 , 2019-05-22