Pagini recente » Cod sursa (job #2285559) | Cod sursa (job #1355773) | Cod sursa (job #1611356) | Cod sursa (job #2987492) | Cod sursa (job #2788474)
#include <iostream>
#include <fstream>
#include <vector>
const int N = 50005;
std::ifstream in("sortaret.in");
std::ofstream cout("sortaret.out");
std::vector<int> v[N], top;
bool viz[N];
void dfs(int i)
{
viz[i] = true;
for (auto vec : v[i])
{
if (!viz[vec])
{
dfs(vec);
}
}
top.push_back(i);
}
int main()
{
int n, m;
in >> n >> m;
while (m--)
{
int x, y;
in >> x >> y;
v[x].push_back(y);
}
in.close();
for (int i = 1; i <= n; ++i)
{
if (!viz[i])
dfs(i);
}
for (int i = top.size() - 1; i >= 0; --i)
{
cout << top[i] << " ";
}
cout.close();
return 0;
}