Cod sursa(job #2529290)
Utilizator | David Turturean DavidTurtureanC | Data | 23 ianuarie 2020 11:00:15 |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <bits/stdc++.h>
using namespace std;
int n,m; bool vizitat[50010]; vector <int> adia[50010];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void dfs(int varf){ vizitat[varf]=1;
for(int it : adia[varf]) if(!vizitat[it])dfs(it);
fout<<varf<<" ";}
int main(){ int x,y; fin>>n>>m;
while(fin>>x>>y) adia[y].push_back(x);
for(int i=1;i<=n;++i) if(!vizitat[i])dfs(i);
}