Pagini recente » Cod sursa (job #2481472) | Cod sursa (job #2547897) | Cod sursa (job #894939) | Cod sursa (job #1555545) | Cod sursa (job #270060)
Cod sursa(job #270060)
#include <iostream.h>
#include <fstream.h>
#define nmax (10005)
#define nmax2 (50005)
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
long a[nmax][nmax],n,m,nr,c[nmax2];
void euler(long nod)
{long i;
for (i=1;i<=n;i++)
if (a[nod][i]!=0)
{a[nod][i]--;
a[i][nod]--;
euler(i);
}
nr++;
c[nr]=nod;
}
int main()
{long i,x,y;
fin>>n>>m;
for (i=1;i<=m;i++)
{fin>>x>>y;
a[x][y]+=1;
a[y][x]+=1;
}
euler(1);
if (nr<m || a[c[nr]][c[1]]) fout<<-1;
else
for (i=1;i<=m;i++)
fout<<c[i]<<" ";
fout.close();
return 0;
}