Pagini recente » Cod sursa (job #2755921) | Cod sursa (job #1519427) | Cod sursa (job #2523317) | Cod sursa (job #2968870) | Cod sursa (job #2927632)
#include <iostream>
#include <cstdlib>
#include <fstream>
using namespace std;
int a[101][101],n,m,succ[101],pred[101],ctc[101],nrctc;
ifstream f("ctc.in");
ofstream g("ctc.out");
void citire()
{
f>>n>>m;
int x,y;
for(int i=1; i<=m; i++)
{
f>>x>>y;
a[x][y]=1;
}
}
void DFS1(int x)
{
succ[x]=1;
for(int i=1; i<=n; i++)
if(a[x][i]==1 && succ[i]==0)
DFS1(i);
}
void DFS2(int x)
{
pred[x]=1;
for(int i=1; i<=n; i++)
if(a[i][x]==1 && pred[i]==0)
DFS2(i);
}
void componente()
{
for(int i=1; i<=n; i++)
if(ctc[i]==0)
{
DFS1(i);
DFS2(i);
nrctc++;
for(int j=1; j<=n; j++)
{
if(succ[j] && pred[j])
ctc[j]=nrctc;
succ[j]=pred[j]=0;
}
}
}
int main()
{
citire();
componente();
g<<nrctc<<endl;
for(int i=1;i<=nrctc;i++)
{ g<<i<<": ";
for(int j=1;j<=n;j++)
if(ctc[j]==i)
g<<j<<" ";
g<<endl;}
return 0;
}