随笔分类 -  ACM_图论_欧拉回路

ACM_图论_欧拉回路
HDU 3018 Ant Trip
摘要：Ant TripTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1198Accepted Submission(s): 445 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 . 阅读全文

posted @ 2013-10-14 11:46 天使是一个善良的神 阅读(252) 评论(0) 推荐(0)

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

posted @ 2013-09-14 01:07 天使是一个善良的神 阅读(185) 评论(0) 推荐(0)

导航