Pagini recente » Cod sursa (job #1988682) | Cod sursa (job #1235787) | Cod sursa (job #2602930) | Borderou de evaluare (job #2013487) | Cod sursa (job #408194)
Cod sursa(job #408194)
#include <fstream.h>
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x,y,i,a[10001][10001],postordine[50001],viz[50001],nr;
void DFS(int x)
{
int i;
viz[x]=1;
for(i=1;i<=a[x][0];i++)
if(!viz[a[x][i]])
DFS(a[x][i]);
postordine[++nr]=x;
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x][0]++;
a[x][a[x][0]]=y;
}
f.close();
for(i=1;i<=n;i++)
if(!viz[i])
DFS(i);
for(i=n;i>=1;i--)
g<<postordine[i]<<' ';
g<<'\n';
g.close();
return 0;
}