Pagini recente » Cod sursa (job #746691) | Cod sursa (job #1926076) | Cod sursa (job #2074567) | Cod sursa (job #71313) | Cod sursa (job #2921156)
#include <bits/stdc++.h>
using namespace std;
long long n, m, viz[100001];
vector<int> v;
vector<int> a[50001];
void dfs(int gogu) {
viz[gogu] = 1;
for(auto i : a[gogu])
if(!viz[i])
dfs(i);
v.push_back(gogu);
}
void solutie() {
for(int i = 1; i <= n; i++)
if(!viz[i])
dfs(i);
}
int main() {
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
cin >> n >> m;
for(int i = 1; i <= m; i++) {
int x, y;
cin >> x >> y;
a[x].push_back(y);
}
solutie();
for(int i = v.size() - 1; i >= 0; i--)
cout << v[i] << ' ';
return 0;
}