Pagini recente » Cod sursa (job #2340911) | Cod sursa (job #2666440) | Cod sursa (job #1216723) | Cod sursa (job #559805) | Cod sursa (job #2399895)
#include <fstream>
using namespace std;
ifstream fin ("ciclueuler.in");
ofstream fout ("ciclueuler.out");
int A[250][250];
int n,L[5000],p;
void Euler(int k)
{
for(int i = 1 ; i <= n ; i ++)
if(A[k][i])
{
A[k][i]--;
A[i][k]--;
Euler(i);
}
L[++p] = k;
}
int main()
{
int i,j,m,k;
fin>>n>>m;
for(k=1;k<=m;k++)
{
fin>>i>>j;
A[i][j]++;
A[j][i]++;
}
Euler(1);
for(i=1;i<p;i++)
fout<<L[i]<<' ';
fout<<'\n';
return 0;
}