Pagini recente » Cod sursa (job #1259262) | Cod sursa (job #2360030) | Cod sursa (job #1567569) | Cod sursa (job #1630368) | Cod sursa (job #2399995)
#include <fstream>
using namespace std;
ifstream fin ("ciclueulerian.in");
ofstream fout ("ciclueulerian.out");
int A[300][300];
int n,p,nr;
void Euler(int k)
{
for(int i = 1 ; i <= n ; i ++)
if(A[k][i])
{
A[k][i]--;
A[i][k]--;
Euler(i);
}
if(nr!=p)
fout<<k<<' ';
nr++;
}
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);
return 0;
}