Cod sursa(job #2400024)
| Utilizator | Data | 8 aprilie 2019 11:38:06 | |
|---|---|---|---|
| Problema | Ciclu Eulerian | Scor | 40 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#define NMAX 1024
using namespace std;
ifstream fin ("ciclueuler.in");
ofstream fout ("ciclueuler.out");
int n, nr, m;
int A[NMAX][NMAX];
void citire();
void Euler(int);
int main()
{
citire();
Euler(1);
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 Euler(int k)
{
for(int i = 1 ; i <= n; i ++)
if(A[k][i])
{
A[k][i]--;
A[i][k]--;
Euler(i);
}
++nr;
if(nr <= m) fout<<k<<' ';
}
