Pagini recente » Cod sursa (job #3321273) | Cod sursa (job #501938) | Cod sursa (job #3353766) | Cod sursa (job #2180418) | Cod sursa (job #3315259)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("ciclueuler.in");
ofstream fout("ciclueuler.out");
multiset<int>v[100100];
int n,m,i,st;
void read()
{
fin>>n>>m;
for(i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
v[x].insert(y);
v[y].insert(x);
}
}
bool eulerian()
{
for(i=1;i<=n;i++)
if(v[i].size()%2==1)
return 0;
return 1;
}
void ciclu(int start)
{
s.push()
while()
}
int main()
{
read();
if(!eulerian())
{fout<<"-1";return 0;}
for(i=1;i<=n;i++)
if(v[i].size())
{
st=i;
break;
}
ciclu(st);
}