Pagini recente » Cod sursa (job #364184) | Cod sursa (job #1339054) | Cod sursa (job #986550) | Cod sursa (job #2826576) | Cod sursa (job #1378582)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> G[50005];
vector <bool> viz;
vector <int> stiva;
void dfs(int nod)
{int i;
for(i=0;i<G[nod].size();i++)
if(viz[G[nod][i]]==0)
{
viz[G[nod][i]]=1;
dfs(G[nod][i]);
}
stiva.push_back(nod);
}
int main()
{int i,x,y, n,m;
f>>n>>m;
viz.assign(n+1, false);
for(i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
for(i=n-1;i>=0;i--)
g<<stiva[i]<<' ';
return 0;}