Cod sursa(job #2708327)
Utilizator | Data | 18 februarie 2021 16:37:46 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int a[101][101],x1,y,n,m,x,v[101],nr;
bool sel[101];
void df(int x)
{
int i;
sel[x]=true;
for(int i=1;i<=n;i++)
if(a[x][i]==1&&!sel[i])
df(i);
v[++nr]=x;
}
int main()
{f>>n>>m;
for(int i=1;i<=m;i++)
f>>x1>>y,a[x1][y]=1;
for(int i=1;i<=n;i++)
if(sel[i]==false)
df(i);
for(int i=n;i>=1;i--)
g<<v[i]<<" ";
return 0;
}