Cod sursa(job #2399971)
| Utilizator | Data | 8 aprilie 2019 11:08:15 | |
|---|---|---|---|
| Problema | Ciclu Eulerian | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#define NMAX 1005
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
int n, m, nr;
int A[NMAX][NMAX], sol[NMAX];
void dfs(int x);
void citire();
int main()
{
citire();
dfs(1);
for(int i=1; i<nr; i++) fout<<sol[i]<<' ';
return 0;
}
void citire()
{
int x, y;
fin>>n>>m;
for (int i=1; i<=m; i++)
{
fin>>x>>y;
A[x][y]++;
A[y][x]++;
}
}
void dfs(int x)
{
for (int i=1; i<=n; i++)
if (A[x][i])
{
A[x][i]--;
A[i][x]--;
dfs(i);
}
sol[++nr] = x;
}
