Pagini recente » Cod sursa (job #2710704) | Cod sursa (job #314127) | Cod sursa (job #2553110) | Cod sursa (job #786332) | Cod sursa (job #2345127)
#include <vector>
#include <fstream>
#define NMAX 50010
using std::vector;
std::ifstream fin("sortaret.in");
std::ofstream fout("sortaret.out");
int n, m;
vector<int> ad[NMAX];
int top;
int st[NMAX];
bool vis[NMAX];
void dfs(int node) {
vis[node] = true;
for (int i = 0; i < (int) ad[node].size(); i++)
if (!vis[ad[node][i]])
dfs(ad[node][i]);
st[++top] = node;
}
int main() {
int x, y;
fin >> n >> m;
for (int i = 0; i < m; i++) {
fin >> x >> y;
ad[x].push_back(y);
}
for (int i = 1; i <= n; i++)
if (!vis[i])
dfs(i);
for (int i = top; i >= 1; i--)
fout << st[i] << ' ';
fout << '\n';
fout.close();
return 0;
}