Cod sursa(job #2776358)
| Utilizator | Data | 19 septembrie 2021 14:28:55 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include<bits/stdc++.h>
using namespace std;
int i,j,n,m,o[50010];
vector<int>v[50010];
ifstream f("sortaret.in");
ofstream t("sortaret.out");
void d(int p)
{
o[p]=1;
for(int j:v[p])
if(!o[j])
d(j);
t<<p<<" ";
}
int main()
{
int x,y;
f>>n>>m;
for(i=1;i<=m;++i)
f>>x>>y,v[y].push_back(x);
for(i=1;i<=n;++i)
if(!o[i])
d(i);
return 0;
}
