Pagini recente » Cod sursa (job #1848761) | Cod sursa (job #1037124) | Cod sursa (job #1666226) | Cod sursa (job #2495215) | Cod sursa (job #2137162)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int nmax=50000;
int stiva[nmax+5],vf,use[nmax+5];
vector<int>v[nmax+5];
int n,m;
void dfs(int nod)
{
use[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(use[v[nod][i]]==0)
dfs(v[nod][i]);
stiva[++vf]=nod;
}
int main()
{
cin>>n>>m;
while(m--)
{
int a,b;
cin>>a>>b;
v[a].push_back(b);
}
for(int i=1;i<=n;i++)
if(use[i]==0)
dfs(i);
for(int i=vf;i>=1;i--)
cout<<stiva[i]<<" ";
return 0;
}
/**
**/