Pagini recente » Cod sursa (job #875808) | Cod sursa (job #1565901) | Cod sursa (job #2886663) | Cod sursa (job #2956436) | Cod sursa (job #3040275)
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream cin("retea.in");
ofstream cout("retea.out");
vector<int>v[105];
bool viz[105];
int n, m, x, y, ct, d[105];
pair<int,int>muchii[10000];
int main()
{
cin >> n >> m;
for ( int i = 1; i <= m; i++ )
{
cin >> x >> y;
muchii[i].first = x;
muchii[i].second = y;
}
for ( int i = 1; i <= n; i++ )
{
d[i] = -1;
}
queue<int>q;
for ( int i = 1; i <= n; i++ )
{
for ( auto y:v[i] )
{
cout << y << " ";
}
cout << "\n";
}
for ( int j = 1; j <= n; j++ )
{
for ( int i = 1; i <= m; i++ )
{
if ( muchii[i].first != j && muchii[i].second != j )
{
v[muchii[i].first].push_back(muchii[i].second);
v[muchii[i].second].push_back(muchii[i].first);
}
}
for ( int i = 1; i <= n; i++ )
{
if ( viz[i] == 0 )
{
ct++;
d[i] = 0;
q.push(i);
viz[i] = 1;
while ( q.empty() != 0 )
{
int varf = q.front();
q.pop();
for ( auto y:v[varf] )
{
if ( d[y] != -1 )
{
q.push(y);
d[y] = d[varf] + 1;
viz[y] = 1;
}
}
}
}
for ( int i = 1; i <= n; i++ )
{
d[i] = -1;
}
}
if ( ct == 1 )
{
cout << 0 << " ";
}
else
{
cout << 1 << " ";
}
for ( int i = 1; i <= n; i++ )
{
v[i].clear();
viz[i] = 0;
}
ct = 0;
}
}