Cod sursa(job #1370990)
| Utilizator | Data | 3 martie 2015 18:30:19 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include<fstream>
#include<iostream>
using namespace std;
bool t[5000][5000],r[50000];
unsigned a,b,n,m;
ofstream g("sortaret.out");
void megy(int j)
{
unsigned int i;
for(i=1;i<=n;i++)
{
if(t[i][j]&&r[i]==0)
{
megy(i);
}
}
r[j]=1;
g<<j<<" ";
}
int main()
{
ifstream f("sortaret.in");
unsigned int i;
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>a>>b;
t[a][b]=1;
}
for(i=1;i<=n;i++)
{
if(r[i]==0)
{
megy(i);
}
}
f.close();
g.close();
return 0;
}
