Pagini recente » Cod sursa (job #1494416) | Cod sursa (job #3228765) | Cod sursa (job #1765772) | Cod sursa (job #2905244) | Cod sursa (job #1487647)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,x,y,i,j;
vector<int> graf[50001],rasp,rasp2;
bool fol[50001];
void dfs(int nod)
{
for(int i=0; i<graf[nod].size(); i++)
if(!fol[graf[nod][i]])
{
fol[graf[nod][i]]=true;
dfs(graf[nod][i]);
}
rasp.push_back(nod);
}
int main()
{
cin>>n>>m;
for(i=1; i<=m; i++)
{
cin>>x>>y;
graf[x].push_back(y);
}
for(i=1; i<=n; i++)
{
if(!fol[i])
{
fol[i]=true;
dfs(i);
}
}
for(i=rasp.size()-1; i>=0; i--)
cout<<rasp[i]<<" ";
}