Pagini recente » Cod sursa (job #2568153) | Cod sursa (job #2746924) | Rating oana oana (oana1206) | Cod sursa (job #2955106) | Cod sursa (job #2855068)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciclueuler.in");
ofstream g("ciclueuler.out");
int n,m,x,y,viz[500001],ok;
vector <vector <pair<int,int>>> v(100001);
void exec (int cur,int counter)
{
// cout<<cur<<'\n';
if (counter==m)
ok=1;
if (ok==0)
{
for (int j=0; j<v[cur].size(); j++)
{
int nod=v[cur][j].second;
if (viz[nod]==0)
{
viz[nod]=1;
int save=v[cur][j].first;
exec(save,counter+1);
//if (ok==0)
//viz[nod]=0;
g<<cur<<' ';
}
}
}
else
{
//cout<<cur<<' ';
}
}
int main()
{
f>>n>>m;
for (int i=1; i<=m; i++)
{
f>>x>>y;
v[x].push_back(make_pair(y,i));
if (x!=y)
v[y].push_back(make_pair(x,i));
}
exec(1,0);
return 0;
}