Pagini recente » Cod sursa (job #2021374) | Cod sursa (job #281306) | Monitorul de evaluare | Cod sursa (job #1957789) | Cod sursa (job #447686)
Cod sursa(job #447686)
#include<stdio.h>
int db,n,m,x,y,v[5000][5000],w[5000];
int latott[50000];
int topo(int cs)
{
latott[cs]=1;
for(int i=1;i<=n;i++)
if(v[cs][i]&&latott[i]==0)
topo(i);
w[db]=cs;
db--;
return 0;
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
scanf("%d %d\n",&n,&m);
db=n;
for(int i=1;i<=m;i++);
{
scanf("%d %d\n",&x,&y);
v[x][y]=1;
}
for(int i=1;i<=n;i++)
if(latott[i]=0) topo(i);
for(int i=1;i<=n;i++)
printf("%d ",w[i]);
return 0;
}