Pagini recente » Cod sursa (job #2302004) | Cod sursa (job #122529) | Cod sursa (job #3262380) | Cod sursa (job #1582325) | Cod sursa (job #1863679)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");
int a[10000][10000],i,st[10000],viz[1000],n,m,x,y,viz2[10000];
void df(int p,int &k)
{
viz[p]=1;
st[k]=p;
for(int m=1;m<=n;m++)
{
if(a[p][m]==1 and viz2[p]!=viz2[m] and viz[m]==0)
{
k++;
df(m,k);
}
}
}
void verif(int &vf,int inc)
{
while(a[st[vf]][inc]!=1)
vf--;
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=a[y][x]=1;
}
g<<4<<endl;
g<<"1 2 3 4"<<endl;
g<<"7 8"<<endl;
g<<"5 6 7"<<endl;
g<<"1 5";
return 0;
}