Pagini recente » Cod sursa (job #2765696) | Cod sursa (job #3258682) | Cod sursa (job #2720430) | Cod sursa (job #1822121) | Cod sursa (job #2118543)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,x,y;
bool v[100001];
vector<int> a[50001];
vector<int> sol;
vector<int>::reverse_iterator rit;
void dfs(int x)
{
int i;
v[x]=1;
for(i=0 ; i<a[x].size() ; ++i)
if(v[ a[x][i] ]==0)
dfs(a[x][i]);
sol.push_back(x);
}
int main()
{
f>>n>>m;
for(i=1 ; i<=m ; ++i)
{
f>>x>>y;
a[x].push_back(y);
}
for(i=1 ; i<=n ; ++i)
if(v[i]==0)
dfs(i);
for(rit=sol.rbegin() ; rit!=sol.rend() ; ++rit)
g<<*rit<<" ";
g<<'\n';
return 0;
}