Pagini recente » Cod sursa (job #1396285) | Cod sursa (job #2073202) | Cod sursa (job #358484) | Cod sursa (job #2823944) | Cod sursa (job #270053)
Cod sursa(job #270053)
#include <iostream.h>
#include <fstream.h>
#define nmax (100005)
#define nmax2(500005)
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int a[1000][1000],n,m,nr,c[5000];
void euler(int nod)
{int 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()
{int 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;
}