Pagini recente » Cod sursa (job #1814229) | Cod sursa (job #113787) | Cod sursa (job #332743) | Cod sursa (job #332739) | Cod sursa (job #1365013)
#include <iostream>
#include<fstream>
#include<vector>
#define mx 100000
using namespace std;
ifstream fin("ctc.in");
ofstream gout("ctc.out");
int n,m,suc[mx],nrc;
vector<int> v[mx],sol[mx], v2[mx];
void citire()
{
int i,x,y;
fin>>n>>m;
for(i=0;i<m;++i)
{
fin>>x>>y;
v[x].push_back(y);
v2[y].push_back(x);
}
}
void scnod(int nod)//toate nodurile care pot porni din nodul nod
{
suc[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(suc[v[nod][i]]==0)
scnod(v[nod][i]);
}
void prednod(int nod)//toate vf la care se ajunge la nod
{
suc[nod]=2;
for(int i=0;i<v2[nod].size();i++)
if(suc[v2[nod][i]]==1)
prednod(v2[nod][i]);
}
int main()
{
int i,j;
citire();
for(int i=1;i<=n;i++)
if(suc[i]!=2 && suc[i]!=-1)
{
scnod(i);
prednod(i);
nrc++;
for(j=1;j<=n;j++)
{
if(suc[j]==2)
sol[nrc].push_back(j);
}
for(int j=1;j<=n;j++)
{
if(suc[j]==1)
suc[j]=0;
if(suc[j]==2)
suc[j]=-1;
}
}
gout<<nrc<<'\n';
for(i=1;i<=nrc;i++)
{
for(j=0;j<sol[i].size();j++)
//if(su//c[j]==i)
gout<<sol[i][j]<<" ";
gout<<'\n';
}
return 0;
}