Pagini recente » Cod sursa (job #1327371) | Cod sursa (job #2972901) | Cod sursa (job #2551590) | Cod sursa (job #2524784) | Cod sursa (job #2258210)
#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
#define lim 100004
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> muc[lim];
stack <int> stec;
int n,m,x,y;
int viz[lim];
void dfs (int nod)
{
viz[nod]=1;
for (int i=0;i<muc[nod].size();i++)
if (viz[muc[nod][i]]==0)
{
dfs(muc[nod][i]);
}
stec.push(nod);
}
int main()
{
f>>n>>m;
for (int i=1;i<=m;i++)
{
f>>x>>y;
muc[x].push_back(y);
}
for (int i=1;i<=n;i++)
if (viz[i]==0) dfs(i);
while (!stec.empty())
{
g<<stec.top()<<" ";
stec.pop();
}
f.close();
g.close();
return 0;
}