Pagini recente » Cod sursa (job #133523) | Cod sursa (job #623993) | Cod sursa (job #1937908) | Cod sursa (job #3273105) | Cod sursa (job #796958)
Cod sursa(job #796958)
#include <stdio.h>
#define MAX_N 20010
#define MAX_M 500010
int n,m,C[MAX_M],nc,x,y,i;
char G[MAX_N][MAX_N];
void euler(int nod)
{
int urm;
for (urm = 1;urm <= n;urm++)
if (G[nod][urm])
{
G[nod][urm] = 0;
G[urm][nod] = 0;
euler(urm);
}
C[++nc] = nod;
}
int main()
{
freopen("ciclueuler.in","r",stdin);
freopen("ciclueuler.out","w",stdout);
scanf("%d%d",&n,&m);
for(; m>0; --m)
{
scanf("%d%d",&x,&y);
G[x][y]=1;
G[y][x]=1;
}
euler(1);
for(i=1;i<=nc;++i)
printf("%d ",C[i]);
printf("\n");
return 0;
}