Pagini recente » Borderou de evaluare (job #2016376) | Borderou de evaluare (job #1564631) | Borderou de evaluare (job #2008429) | Borderou de evaluare (job #2898776) | Cod sursa (job #2351960)
//#include "pch.h"
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int idx;
int f[50005];
int v[50005];
vector <int> graph[50005];
void dfs(int node)
{
f[node] = 1;
for (auto x : graph[node]) {
if (!f[x]) {
dfs(x);
}
}
v[++idx] = node;
}
int main()
{
ios::sync_with_stdio(false);
fin.tie(0); fout.tie(0);
int n, m;
fin >> n >> m;
for (int i = 1; i <= m; ++i) {
int x, y;
fin >> x >> y;
graph[x].push_back(y);
}
for (int i = 1; i <= n; ++i) {
if (!f[i]) {
dfs(i);
}
}
for (int i = n; i >= 1; --i) {
fout << v[i] << " ";
}
}