Cod sursa(job #861294)

Utilizator PhantomAssasinAlex Gordon PhantomAssasin Data 21 ianuarie 2013 11:38:57
Problema Ciclu Eulerian Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <fstream>
using namespace std;

ifstream fin("file.in");
ofstream fout("file.out");

int a[100][100], t[100], s[100], n, m;

void DF(int nod)
{
    s[nod] = 1;
    for( int i=1; i<=n; i++)
        if( a[nod][i] == 1 && s[i] == 0)
        {
                t[i] = nod;
                DF(i);
        }
}
void DF_E(int nod)
{
    fout<<nod<<" ";
    for( int i=1; i<=n; i++)
        if(a[nod][i])
            if( t[nod] !=1 && t[i] != nod)
            {
                a[nod][i] = a[i][nod] = 0;
                DF_E(i);
            }
    for( int i=1; i<=n; i++)
        if(a[nod][i])
        {
            a[i][nod] = a[nod][i] = 0;
            DF_E(i);
        }
}
int main()
{
    int x, y;
    fin>>n;
    while(fin>>x>>y)
    {
        a[x][y] = a[y][x] = 1;
    }
    DF(1);
    DF_E(1);
    return 0;
}