Cod sursa(job #153361)
Utilizator | Data | 10 martie 2008 14:32:55 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
{sortare antropologica}
var v,c,c1,c2,l:array[1..100000]of longint;
n,i,j,k,p,m:longint;
begin
read(n,m);
for i:=1 to m do
begin
read(c1[i],c2[i]);
c[c1[i]]:=c[c1[i]]+1;
end;
p:=n+1;
for i:=1 to n do
if c[i]=0 then begin p:=p-1;
l[p]:=i;
end;
for i:=1 to m do
begin
c[c1[i]]:=c[c1[i]]-1;
if c[c1[i]]=0 then begin p:=p-1;
l[p]:=c1[i];
end;
end;
for i:=1 to n do
write(l[i],' ');
end.