Pagini recente » Cod sursa (job #65368) | Cod sursa (job #2575160) | Cod sursa (job #1651481) | Cod sursa (job #2699408) | Cod sursa (job #2536519)
#define NMAX 1005
#include <fstream>
using namespace std;
ifstream fin ("ctc.in");
ofstream fout ("ctc.out");
int G[NMAX][NMAX], GT[NMAX][NMAX];
int n,nr,v[NMAX],tc[NMAX][NMAX];
bool uz[NMAX];
void citire();
void postordine( int nod);
void dfs (int nod);
void afis();
int main()
{
int i;
citire();
for(i=1;i<=n;i++)
if(!uz[i])
{
uz[i]=1;
postordine(i);
}
nr=0;
for(i=n;i>0;i--)
if(uz[v[i]])
{
nr++;
dfs(v[i]);
}
afis();
return 0;
}
void citire()
{
int i,x,y,m;
fin>>n>>m;
for (i=1; i<=m;i++)
{
fin>>x>>y;
G[x][++G[x][0]]=y;
GT[y][++GT[y][0]]=x;
}
}
void postordine( int nod)
{
for(int i=1;i<=G[nod][0];i++)
if(!uz[G[nod][i]])
{
uz[G[nod][i]]=1;
postordine(G[nod][i]);
}
v[++nr]=nod;
}
void dfs (int nod)
{
int i;
uz[nod]=0;
tc[nr][++tc[nr][0]]=nod;
for (i=1; i<=GT[nod][0]; i++)
if(uz[GT[nod][i]])
dfs(GT[nod][i]);
}
void afis()
{
int i,j;
fout<<nr<<'\n';
for(i=1;i<=nr;i++)
{
for(j=1;j<=tc[i][0];j++)
fout<<tc[i][j]<<" ";
fout<<'\n';
}
}