Pagini recente » Cod sursa (job #2673097) | Cod sursa (job #1555161) | Cod sursa (job #1314611) | Cod sursa (job #2121757) | Cod sursa (job #3262399)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
long long n, m, a[10002][10002],
v[100002], p[100002], o;
void citire()
{
fin>>n>>m;
long long x, y;
for(long long i=1; i<=m; i++)
{
fin>>x>>y;
a[x][y]++; v[x]++;
a[y][x]++; v[y]++;
}
}
bool verif()
{
for(long long i=1; i<=n; i++)
if(v[i]==0 || v[i]%2==1)
return 0;
return 1;
}
void euler(int k)
{
for(int i=1; i<=n; i++)
if(a[k][i]>0){
a[k][i]--;
a[i][k]--;
euler(i);
}
p[++o]=k;
}
int main()
{
citire();
if(!verif()) fout<<-1;
else euler(1);
for(int i=1; i<o; i++)
fout<<p[i]<<" ";
}