欧拉回路 - 随笔分类 - ERKE

poj2337欧拉回路要求输出路径

摘要：CatenymsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8368Accepted: 2202DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms:dog.gopher gopher.rat ra. 阅读全文

posted @ 2013-08-15 00:43 ERKE 阅读(256) 评论(0) 推荐(0)

hdu1116有向图判断欧拉通路判断

摘要：Play on WordsTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4263Accepted Submission(s): 1384 Problem DescriptionSome of the secret doors contain a very interesting word puzzle. The team of archaeologists has to solve it to open that doors. Becau 阅读全文

posted @ 2013-08-14 17:20 ERKE 阅读(739) 评论(0) 推荐(0)

hdu3018欧拉回路题

摘要：Ant TripTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1107Accepted Submission(s): 404 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 t 阅读全文

posted @ 2013-08-14 15:58 ERKE 阅读(168) 评论(0) 推荐(0)

hdu1878判断欧拉回路

摘要：欧拉回路Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8186Accepted Submission(s): 2926 Problem Description欧拉回路是指不令笔离开纸面，可画过图中每条边仅一次，且可以回到起点的一条回路。现给定一个图，问是否存在欧拉回路？Input测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是节点数N ( 1 2 #include 3 #include 4 #include 5 ... 阅读全文

posted @ 2013-08-14 15:14 ERKE 阅读(179) 评论(0) 推荐(0)

随笔分类 - 欧拉回路