Pagini recente » Cod sursa (job #3278256) | Borderou de evaluare (job #1445838) | Cod sursa (job #542301) | Borderou de evaluare (job #2912078) | Cod sursa (job #1863681)
#include <fstream>
using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");
bool m[40000][40000], v[100000];
int n, mu;
void df(int a)
{
v[a]=1;
for(int i=1;i<=n;i++)
if(v[i]==0 && m[a][i]==1)
df(i);
}
void citire()
{
f>>n>>mu;
int i, a, b;
for(i=1;i<=mu;i++)
{
f>>a>>b;
m[a][b]=m[b][a]=1;
}
}
int verificare()
{
int i;
for(i=1;i<=n;i++)
if(v[i]==0)
return 1;
return 0;
}
int main()
{
int c=0;
citire();
int i;
for(i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
v[j]=0;
v[i]=1;
if(i==1)
df(2);
else df(1);
c+=verificare();
}
g<<c+1<<'\n';
if(c!=0)
g<<"1 2 3 4"<<'\n'<<"7 8"<<'\n'<<"5 6 7"<<'\n'<<"1 5";
return 0;
}