Cod sursa(job #1650784)
| Utilizator | Data | 11 martie 2016 20:26:57 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
long long a[4500][45000],x,y,d[50000],n,ok,i,j,m;
int main()
{fin>>n>>m;
for(i=1;i<=m;i++)
{fin>>x>>y;
a[x][y]=1;
d[y]++;
}
while(ok==0)
{for(i=1;i<=n;i++)
if(d[i]==0)
{fout<<i<<' ';
d[i]=-1;
for(j=1;j<=n;j++)
if(a[i][j]==1) {a[i][j]=0;d[j]--;}
}
ok=1;
for(i=1;i<=n;i++)
if(d[i]==0) ok=0;
}
return 0;
}
