Pagini recente » Cod sursa (job #2983860) | Cod sursa (job #695645) | Cod sursa (job #2665575) | Cod sursa (job #2184237) | Cod sursa (job #1961670)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,i,j,m,nod,x,y;
bool viz[50005];
vector<int> v[50005];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0; i<v[nod].size(); ++i)
{
if(viz[v[nod][i]]==0)
dfs(v[nod][i]);
}
v[n+1].push_back(nod);
}
int main()
{
cin>>n>>m;
for(i=1; i<=m; ++i)
{
cin>>x>>y;
v[y].push_back(x);
}
for(i=1; i<=n; ++i)
{
if(viz[i]==0)
{
dfs(i);
}
}
for(i=0;i<v[n+1].size();++i)
{
cout<<v[n+1][i]<<" ";
}
return 0;
}