Pagini recente » Cod sursa (job #2128608) | Cod sursa (job #2876213) | Cod sursa (job #3171939) | Cod sursa (job #2607682) | Cod sursa (job #764230)
Cod sursa(job #764230)
#include <stdio.h>
#include <set>
#include <vector>
using namespace std;
set<int> v[50050];
vector<int> rez;
int n, m;
void citire() {
int a, b;
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++) {
scanf("%d%d", &a, &b);
v[b].insert(a);
}
}
void rezolva() {
int i, j;
bool done;
bool vazut[50050];
for (i = 1; i <= n; i++) {
vazut[i] = false;
}
done = false;
int nr = 0;
while (done == false) {
done = true;
for (i = 1; i <= n; i++) {
if ((!vazut[i]) && v[i].empty()) {
for (j = 1; j <= n; j++) {
v[j].erase(i);
}
done = false;
vazut[i] = true;
rez.push_back(i);
}
}
nr++;
}
}
void afisare() {
while (!rez.empty()) {
printf("%d ", rez.front());
rez.erase(rez.begin());
}
}
int main()
{
freopen("sortaret.in", "r", stdin);
freopen("sortaret.out", "w", stdout);
citire();
rezolva();
afisare();
}