Pagini recente » Cod sursa (job #2362435) | Cod sursa (job #889241) | Cod sursa (job #2496185) | Cod sursa (job #1312014) | Cod sursa (job #1427764)
#include<fstream>
#include<vector>
#include<iostream>
using namespace std;
ifstream f("mesaj4.in");
ofstream g("mesaj4.out");
int const NMax = 100005;
vector <int> G[NMax];
int use[NMax];
int n, m;
void citire()
{
int i, x, y;
f>>n>>m;
for(i=1; i<=m; i++){
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
void DFSF(int nod, int father)
{
use[nod] = 1;
int vecin, i;
for(i=0; i<G[nod].size(); i++){
vecin = G[nod][i];
if(!use[vecin])
DFSF(vecin, nod);
}
if(father)
g<<nod<<" "<<father<<"\n";
}
void DFSN(int nod)
{
use[nod] = 1;
int vecin, i;
for(i=0; i<G[nod].size(); i++){
vecin = G[nod][i];
if(!use[vecin]){
g<<nod<<" "<<vecin<<"\n";
DFSN(vecin);
}
}
}
int main()
{
citire();
g<<2*n - 2<<"\n";
DFSF(1, 0);
for(int i=1; i<=n; i++)
use[i] = 0;
DFSN(1);
return 0;
}