Pagini recente » Cod sursa (job #1414059) | Cod sursa (job #1495418) | Cod sursa (job #2299784) | Cod sursa (job #2868008) | Cod sursa (job #2206029)
#include <stdio.h>
#include <vector>
using namespace std;
FILE *f,*g;
int n,m,q;
int deg[100002],been[500002],sol[500002];
vector <pair<int, int> > v[100002];
void read()
{
fscanf(f,"%d %d",&n,&m);
int k=0;
for(int i=1;i<=m;i++)
{
int x,y;
fscanf(f,"%d %d",&x,&y);
v[x].push_back({y, i});
v[y].push_back({x, i});
deg[x]++;
deg[y]++;
}
}
void euler(int nod)
{
int w, p;
while(v[nod].size()>0)
{
w=v[nod].back().first;
p=v[nod].back().second;
if(!been[p])
{
been[p]=1;
v[nod].pop_back();
euler(w);
}
else
v[nod].pop_back();
}
sol[++q]=nod;
}
int main()
{
f=fopen("ciclueuler.in","r");
g=fopen("ciclueuler.out","w");
read();
for(int i=1; i<=n; i++)
if(deg[i]%2==1)
return 0;
euler(1);
for(int i=1;i<q;i++)
fprintf(g,"%d ",sol[i]);
return 0;
}