Pagini recente » Cod sursa (job #762251) | Cod sursa (job #1567513) | Cod sursa (job #1411907) | Cod sursa (job #2795674) | Cod sursa (job #1863674)
#include <fstream>
using namespace std;
ifstream f("biconex.in");
ofstream g("biconex.out");
int a[5000][5000];
int i,n,m,x,y,viz[100],k,maxi;
int main()
{ f>>n>>m;
int j;
j=1;
for(i=1;i<=m;i++)
{ f>>x>>y;
if(viz[x]==0 and viz[y]==0)
{ a[j][++k]=x;
viz[x]=1;
}
else
if(viz[x]==0 and viz[y]==1)
{ a[j][++k]=x;
viz[x]=1;
j++;
if(k>=maxi)
maxi=k;
k=0;
}
else
{ if(viz[x]==1 and viz[y]==0)
a[j][++k]=y;
viz[y]=1;
j++;
if(k>=maxi)
maxi=k;
k=0;
}
}
g<<maxi;
g<<endl;
/*for(int j=1;j<=n;j++)
g<<viz[j]<<" ";*/
for (i=1;i<=j;i++)
{for(int r=1;r<=maxi;r++)
if(a[i][r]!=0)
g<<a[i][r]<<" ";
g<<endl;
}
}