欧拉图
凌晨四点的洛杉矶fly
这个作者很懒,什么都没留下…
展开
-
poj1386 判断欧拉通路
DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Because there is no other way to open the doors, the puzzle...原创 2018-12-02 20:10:14 · 115 阅读 · 0 评论 -
欧拉图 HDU 3018
题意: Problem DescriptionAnt Country consist of N towns.There are M roads connecting the towns.Ant Tony,together with his friends,wants to go through every part of the country. They intend to vi...原创 2018-12-02 21:54:50 · 145 阅读 · 0 评论 -
欧拉图
详解--------->请点这里 无向欧拉图(半欧拉图)逆序打印欧拉回路或通路代码:#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=100+5; //无向图打印欧拉路径或回路//输入保证是一个n顶点,m条边的...原创 2018-11-30 21:02:34 · 224 阅读 · 0 评论 -
POJ 2337 欧拉图的巧妙运用
题意: 给你一组N个单词,现在要你输出这样一组单词序列。该序列包含了所有N个单词,且该序列中的前一个单词的最后一个字母与后一个单词的第一个字母相同。如果存在多个这种首尾相连的序列,就输出字典序最小的那个即可。代码:#include<cstdio>#include<cstring>#include<algorithm>using ...原创 2018-11-30 21:57:50 · 236 阅读 · 0 评论 -
poj2513 欧拉图+字典树
You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch a...原创 2019-02-24 19:20:48 · 148 阅读 · 0 评论 -
poj1041
Little Johnny has got a new car. He decided to drive around the town to visit his friends. Johnny wanted to visit all his friends, but there was many of them. In each street he had one friend. He star...原创 2019-02-24 20:56:00 · 295 阅读 · 0 评论 -
poj2230欧拉图输出轨迹。
现在有N个农场和M条路,要求你走过这M条路每条2次且这两次是反向的.要你输出从1号农场走到完所有M条路两次之后回到1号农场的点的轨迹.保证这种轨迹存在.其中点(农场)从1开始编号到N.#include<cstdio>#include<cstring>using namespace std;const int maxm=50000+10;const int m...原创 2019-02-24 20:57:45 · 167 阅读 · 0 评论