欧拉回路
夜幕下的ACM之路
通往成功的路注定是孤独的,我不会放弃!!!!
展开
-
FZU 2112 Tickets(欧拉路径)
Problem DescriptionYou have won a collection of tickets on luxury cruisers. Each ticket can be used only once, but can be used in either direction between the 2 different cities printed on the ticket.原创 2016-04-01 22:33:00 · 443 阅读 · 0 评论 -
HDU 2227 Phi 函数(简单的欧拉相关题)
#include<stdio.h> int phi(int n) { int i,k,j; k=0; for(i=2;i<=n;i++) { for(j=2;j<=i;j++) { if(i%j==0&&n%j==0) {k++;break;} } } return n-k; }原创 2016-02-25 20:43:35 · 365 阅读 · 0 评论 -
HDU 1878 欧拉回路
Problem Description 欧拉回路是指不令笔离开纸面,可画过图中每条边仅一次,且可以回到起点的一条回路。现给定一个图,问是否存在欧拉回路?Input 测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数,分别是节点数N ( 1 < N < 1000 )和边数M;随后的M行对应M条边,每行给出一对正整数,分别是该条边直接连通的两个节点的编号(节点从1到N编号)。当N为0时输入原创 2016-05-08 12:39:13 · 780 阅读 · 0 评论 -
HDU 3018 Ant Trip ( 并查集+欧拉回路 )
http://acm.hdu.edu.cn/showproblem.php?pid=3018 Problem Description Ant Country consist of N towns.There are M roads connecting the towns.Ant Tony,together with his friends,wants to go through every p原创 2016-07-14 14:23:30 · 363 阅读 · 0 评论