Pagini recente » Cod sursa (job #2528310) | Cod sursa (job #2478099) | Cod sursa (job #1814957) | Cod sursa (job #372682) | Cod sursa (job #2528585)
#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, nex[NMAX], q[NMAX], k;
vector<int> gr[NMAX];
vector<int> :: iterator it;
void citire() {
fin >> n >> m;
for (int i = 1; i <= m; ++i) {
int x, y;
fin >> x >> y;
gr[x].push_back(y);
nex[y]++;
}
}
void rezolvare() {
for (int i = 1; i <= n; ++i)
if (nex[i] == 0)
q[++k] = i;
for (int i = 1; i <= n; ++i) {
int x = q[i];
for (it = gr[x].begin(); it != gr[x].end(); ++it) {
nex[*it]--;
if (nex[*it] == 0)
q[++k] = *it;
}
}
}
int main(int argc, const char * argv[]) {
citire();
rezolvare();
for (int i = 1; i <= n; ++i)
fout << q[i] << " ";
}