Pagini recente » Cod sursa (job #1026719) | Cod sursa (job #1130583) | Cod sursa (job #831315) | Cod sursa (job #2895376) | Cod sursa (job #3199397)
#include <bits/stdc++.h>
using namespace std;
vector<int>adj[50001];
vector<int>seen(50001);
vector<int>ans;
void dfs(int x)
{
if(seen[x]==1)
{
return;
}
seen[x]=1;
for(int i=0;i<adj[x].size();i++)
{
if(seen[adj[x][i]]==0)
{
dfs(adj[x][i]);
}
}
ans.push_back(x);
}
int main()
{
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m;
cin>>n>>m;
for(int i=0;i<m;i++)
{
int a,b;
cin>>a>>b;
adj[b].push_back(a);
}
for(int i=1;i<=n;i++)
{
dfs(i);
}
for(int i=0;i<ans.size();i++)
{
cout<<ans[i]<<" ";
}
return 0;
}