Cod sursa(job #3155755)
Utilizator | Adelina Petre adelinapetre | Data | 9 octombrie 2023 16:54:10 |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector<int>v[50005];
vector<int>sol;
bool used[50005];
void dfs(int nod)
{
if(used[nod]==1)
return;
used[nod]=1;
for(auto it: v[nod])
dfs(it);
sol.push_back(nod);
}
int main()
{
int n,m,i,a,b;
cin>>n>>m;
for(i=1; i<=m; i++)
{
cin>>a>>b;
v[b].push_back(a);
}
for(i=1; i<=n; i++)
dfs(i);
for(auto it: sol)
cout<<it<<" ";
return 0;
}