RUSLE UESTBROC

#include<iostream>
#include<fstream>
#include<cmath>
using namespace std;
int x[100],a[100],b[100],n,m;

void citire()
{ifstream f("date.in");
 f>>n>>m;
 for(int i=1;i<=m;i++)
 f>>a[i]>>b[i];
}

int sol(int k)
{int nf;
if(k!=m) return 0;
else {if(x[k]>0) nf=b[x[k]];
            else nf=a[x[k]];}
  if(nf==a[x[1]]) return 1;
  else return 0;
}

int cond(int k)
{int i,nf;
for(i=1;i<=n;i++)
  if(abs(x[i])==abs(x[k])) return 0;

  if(x[k-1]>0) nf=b[x[k-1]];
          else if(nf=b[x[k]]) return -1;
              else return 0;
}

void afisare()
{int i;
 cout<<a[x[1]]<<" ";

 for(i=1;i<=n;i++)
  if(x[i]>0) cout<<b[x[i]]<<" ";
     else cout<<a[x[i]]<<" ";
}

void back()
{int i,k;
 k=2;
 x[1]=1;

 while(k>1)
 {int gasit=0;
  while(k>1)
  {int gasit=0;
   while(gasit==0 && abs(x[k])<m)
   {x[k]=abs(x[k]) +1;
    gasit=cond(k);
    if(gasit==-1) {x[k]=-x[k];}
    if(gasit==1) x[k]--;
     else {if(sol(k)!=0) afisare(k);
          else{k++;
               x[k]=1;}}
    }
     }
      }
       }

 int conex()
 {int i,j;
  parcurgere_DF(1);
  for(i=1;i<=n;i++)
  {d=0;
   for(j=1;j<=n;j++)
   if(a[j]==i || b[j]==i)
   d++;
   if(d%1==0 || b[j]==i)
   return 0;
  }
   return 1;
 }

 int main()
 {citire();
  back();
  conex();
  pare();

 }