Cod sursa(job #828766)
Utilizator | Data | 4 decembrie 2012 13:18:20 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,x,y,i,j,c[10000],a[10000][100],nr,k,m;
int main()
{
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
a[x][0]++;
a[x][a[x][0]]=y;
c[y]++;
}
nr++;
while(n!=k && nr!=0)
{
nr=0;
for(i=1;i<=n;i++)
{
if(c[i]==0)
{
fout<<i<<' ';
for(j=1;j<=a[i][0];j++)
c[a[i][j]]--;
c[i]=-1;
k++;
nr++;
}
}
}
return 0;
}