Cod sursa(job #1787400)
| Utilizator |  Ciobanu Bogdan Kln1000 |
Data | 24 octombrie 2016 17:05:32 |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.32 kb |
#include <bits/stdc++.h>
int n,m,o[50010];
std::vector<int>v[50010];
std::ifstream f("sortaret.in");
std::ofstream t("sortaret.out");
void d(int p){o[p]=1;
for(auto i:v[p])if(!o[i])d(i);
t<<p<<" ";}
main(){int x,y;
f>>n>>m;
for(int i=1;i<=m;++i)
f>>x>>y,v[y].push_back(x);
for(int i=1;i<=n;++i)
if(!o[i])d(i);
}
