Pagini recente » Cod sursa (job #1938620) | Cod sursa (job #3168129) | Cod sursa (job #2835712) | Cod sursa (job #1267024) | Cod sursa (job #1367200)
#include <fstream>
#include <vector>
using namespace std;
#define dim 50009
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> muchii[dim];
vector <int> lista;
int n,m,x,y,viz[dim];
void dfs(int k){
viz[k]=1;
for(int i=muchii[k].size()-1;i>=0;i--) if(viz[muchii[k][i]]==0) dfs(muchii[k][i]);
lista.push_back(k);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++){
f>>x>>y;
muchii[x].push_back(y);
}
for(int i=1;i<=n;i++){ if(viz[i]==0) dfs(i);}
for(int i=lista.size()-1;i>=0;i--) g<< lista[i]<<" ";
f.close();g.close();
return 0;
}