Cod sursa(job #2912026)
Utilizator | Data | 6 iulie 2022 17:27:34 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream t("sortaret.out");
int i,n,x,y,m;
bool o[50001];
vector<int> v[50001];
void d(int p)
{
o[p]=1;
for(auto j:v[p])
if(!o[j])
d(j);
t<<p<<' ';
}
int main()
{
for(f>>n>>m;m--;f>>x>>y,v[y].push_back(x));
for(i=1;i<=n;++i)
if(!o[i])
d(i);
return 0;
}