Pagini recente » Cod sursa (job #100883) | Cod sursa (job #2823808) | Cod sursa (job #1507427) | Cod sursa (job #1507953) | Cod sursa (job #1870448)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector <int> v[50010];
int n,m,i,use[50010],postordine[50010],nr;
void dfs(int x)
{
use[x]=1;
for (int i=0; i<v[x].size(); i++)
if (!use[v[x][i]])
dfs(v[x][i]);
postordine[++nr]=x;
}
int main()
{
fin >> n >> m;
for (i=1; i<=m; i++)
{
int a,b;
fin >> a >> b;
v[a].push_back(b);
}
for (i=1; i<=n; i++)
if (!use[i])
dfs(i);
for (i=n; i; i--)
fout << postordine[i] << ' ';
fout << '\n';
}