Pagini recente » Cod sursa (job #204572) | Cod sursa (job #1570546) | Cod sursa (job #3288968) | Cod sursa (job #2246687) | Cod sursa (job #3286591)
#include <bits/stdc++.h>
using namespace std;
//aproapeperm
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n;
int poz[205], X[20005], Y[20005], viz[20005];
vector<int> L[205];
vector<int> sol;
void Euler(int k)
{
//sol.push_back(k);
while (poz[k] < L[k].size())
{
int i = L[k][poz[k]++];
if (viz[i] == 0)
{
viz[i] = i;
Euler(X[i] + Y[i] - k);
}
}
sol.push_back(k);
}
int main()
{
int i, j, k;
fin >> n;
k = 0;
while (fin >> i >> j)
{
k++;
L[i].push_back(k);
L[j].push_back(k);
X[k] = i; Y[k] = j;
}
//sol.push_back(1);
Euler(1);
sol.pop_back();
fout << sol.size() << "\n";
for (int i : sol)
fout << i << " ";
fout << "\n";
return 0;
}