Pagini recente » Cod sursa (job #1118295) | Cod sursa (job #1803677) | Cod sursa (job #554188) | Cod sursa (job #1325769) | Cod sursa (job #2682879)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
vector < pair<int, int> >v[100005];
struct muchii
{
int x, y;
}muchi[500005];
int rez[500005], w[500005], nr, grad[500005];
void dfs(int nod)
{
for(int i=0; i<v[nod].size(); i++)
if(w[v[nod][i].second]==0)
{
w[v[nod][i].second]=1;
dfs(v[nod][i].first);
}
nr++;
rez[nr]=nod;
}
int main()
{
int n, m, x, y, i=0;
fin >> n;
while(fin >> x >> y)
{
i++;
v[x].push_back(make_pair(y, i));
v[y].push_back(make_pair(x, i));
}
dfs(1);
for(int i=1; i<=nr; i++)
fout << rez[i] << " ";
//fout << rez[1];
return 0;
}