Pagini recente » Cod sursa (job #1418856) | Cod sursa (job #2194917) | Cod sursa (job #1533602) | Cod sursa (job #3186919) | Cod sursa (job #2610521)
#include<stdio.h>
#include<vector>
using namespace std;
const int MAXN = 50001;
vector <int> g[MAXN], sol;
bool viz[MAXN];
FILE *in, *out;
void topo(int n) {
if(viz[n]) {
return;
}
viz[n] = true;
for(auto &it : g[n]) {
topo(it);
}
sol.push_back(n);
}
int main () {
in = fopen("sortaret.in", "r");
out = fopen("sortaret.out", "w");
int n, m;
fscanf(in, "%d %d", &n, &m);
for(int i = 0; i < m; i++) {
int x, y;
fscanf(in, "%d %d", &x, &y);
g[x].push_back(y);
}
fclose(in);
for(int i = 1; i <= n; i++) {
topo(i);
}
for(auto i = sol.rbegin(); i != sol.rend(); i++) {
fprintf(out, "%d ", *i);
}
fclose(out);
return 0;
}