Pagini recente » Cod sursa (job #2874462) | Cod sursa (job #2704369) | Cod sursa (job #1939321) | Cod sursa (job #506235) | Cod sursa (job #2310495)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("mesaj4.in");
ofstream fout("mesaj4.out");
int n, m, x, y, ss;
bool viz[100001];
vector<int>G[100001];
pair<int, int>sol[100001];
void dfs(int nod)
{
viz[nod]=1;
for(auto it:G[nod])
{
if(!viz[it])
{
sol[++ss].first=it;
sol[ss].second=nod;
dfs(it);
sol[++ss].first=nod;
sol[ss].second=it;
}
}
}
int main()
{
fin>>n>>m;
for(int i=1; i<=m; ++i)
{
fin>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
dfs(1);
bool ok=1;
for(int i=1; i<=n && ok; ++i) if(!viz[i]) ok=0;
if(!ok)
{
fout<<"-1\n";
return 0;
}
fout<<ss<<"\n";
for(int i=1; i<=ss; ++i) fout<<sol[i].first<<" "<<sol[i].second<<"\n";
return 0;
}