Pagini recente » Cod sursa (job #2367288) | Cod sursa (job #417558) | Cod sursa (job #613615) | Monitorul de evaluare | Cod sursa (job #755378)
Cod sursa(job #755378)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
vector<int> lis[100001],rez;
int n,m;
void read();
void solve();
void write();
int main()
{
read();
solve();
write();
f.close();g.close();
return 0;
}
void read()
{
f>>n>>m;
for (int i=1;i<=m;i++)
{
int l,c;f>>l>>c;
lis[l].push_back(c);
lis[c].push_back(l);
}
}
void solve()
{
int p=1;
while (!lis[p].empty())
{
int aux=lis[p][0];lis[p].erase(lis[p].begin());
vector<int>::iterator it=lis[aux].begin();
for (;it<lis[aux].end();it++)
if (lis[aux][*it-1]==p)
{
lis[aux].erase(it);
break;
}
rez.push_back(p);
p=aux;
}
rez.push_back(p);
}
void write()
{
for (int i=0;i<rez.size();i++)
g<<rez[i]<<' ';
g<<'\n';
}