Pagini recente » Cod sursa (job #2421478) | Cod sursa (job #3230571) | Cod sursa (job #2650559) | Cod sursa (job #769471) | Cod sursa (job #2126722)
///#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int nmax=50000;
int n,m,stiva[nmax+5],vf;
bool use[nmax+5];
vector<int>v[nmax+5];
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;
for(int i=1;i<=m;i++)
{
int a,b;
cin>>a>>b;
v[a].push_back(b);
}
for(int i=1;i<=n;i++)
if(use[i]==0)
dfs(i);
while(vf)
cout<<stiva[vf--]<<" ";
return 0;
}
/**
**/