Pagini recente » Cod sursa (job #1373359) | Cod sursa (job #2477991) | Cod sursa (job #1637385) | Cod sursa (job #2137787) | Cod sursa (job #2277942)
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,i,x,y;
vector<pair<int,int> > v[100010];
bitset<500010> used;
vector<int> ans;
void euler(int nod)
{
for(auto it:v[nod])
if(!used[it.second])
{
used[it.second]=1;
euler(it.first);
}
ans.push_back(nod);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back({y,i});
v[y].push_back({x,i});
}
euler(1);
for(auto it:ans)
g<<it<<' ';
return 0;
}