Cod sursa(job #392597)
Utilizator | mihai995 mihai995 | Data | 7 februarie 2010 20:02:14 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
bool v[40000][40000],x,y;
int main()
{
int n,m,i,j;
ifstream f("sortaret.in");
ofstream o("sortaret.out");
f>>n>>m;
for (i=1;i<=n;i++)
v[i][0]=-1;
while (m--)
{
f>>x>>y;
v[y][x]=1;
}
int a=0;
while (a!=n)
for (i=1;i<=n;i++)
{
bool x=1;
for (j=1;j<=n;j++)
if (v[i][j]==1) {x=0;break;}
if (x) {o<<i<<" ";a++;for (j=1;j<=n;j++) v[j][i]=0;}
}
return 0;
}