Pagini recente » Cod sursa (job #3246473) | Cod sursa (job #1075515) | Cod sursa (job #535827) | Cod sursa (job #2190417) | Cod sursa (job #1849165)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("ctc.in");
ofstream g ("ctc.out");
short a[10001][10001],ll;
struct nod
{
int inf;
nod *urm;
} *l[101], *lt[101];
int n, viz[101], st[101], k;
void adaug (nod *&l, int x)
{
nod *c;
c=new nod;
c->inf=x;
c->urm=l;
l=c;
}
void DF1(int i)
{
nod *c;
viz[i]=1;
for(c=l[i]; c!=NULL; c=c->urm)
if (!viz[c->inf]) DF1(c->inf);
st[++k]=i;
}
void DF2(int i)
{
nod *c;
viz[i]=1;
for(c=lt[i]; c!=NULL; c=c->urm)
if (!viz[c->inf]) DF2(c->inf);
}
void DF22(int i)
{
nod *c;
viz[i]=1;
g<<i<<" ";
for(c=lt[i]; c!=NULL; c=c->urm)
if (!viz[c->inf]) DF22(c->inf);
}
int main()
{
int i, x, y,m,j=0;
f>>n>>m;
while (f>>x>>y)
{
adaug(l[x],y);
adaug(lt[y],x);
}
for (i=1; i<=n; i++)
if (!viz[i]) DF1(i);
memset (viz,0, sizeof(viz));
for (i=n; i>=1; i--)
if (!viz[st[i]])
{
ll++,DF2(st[i]);
}
g<<ll<<'\n';
memset(viz,0,sizeof(viz));
for (i=1; i<=n; i++)
if (!viz[i]) DF1(i);
memset (viz,0, sizeof(viz));
for (i=n; i>=1; i--)
if (!viz[st[i]])
{
DF22(st[i]);
g<<'\n';
}
return 0;
}