Pagini recente » Cod sursa (job #1365779) | Cod sursa (job #2143193) | Cod sursa (job #64888) | Cod sursa (job #1960082) | Cod sursa (job #2462718)
#include <bits/stdc++.h>
using namespace std;
ifstream in("mesaj4.in");
ofstream out("mesaj4.out");
const int N = 1e5+5;
bitset<N> viz;
vector<int> v[N];
pair<int,int> ans[N];
int k;
void dfs(int x)
{
viz[x] = 1;
for (int i = 0; i<v[x].size(); i++)
{
int it = v[x][i];
if (!viz[it])
{
dfs(it);
ans[++k] = {it,x};
}
}
}
int main()
{
int n,m;
in >> n >> m;
for (int i = 1; i<=m; i++)
{
int x,y;
in >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
dfs(1);
if (k!=n-1)
{
out << -1;
return 0;
}
out << 2*(n-1) << "\n";
for (int i = 1; i<=k; i++)
out << ans[i].first << " " << ans[i].second << "\n";
for (int i = k; i>=1; i--)
out << ans[i].second << " " << ans[i].first << "\n";
}