Pagini recente » Cod sursa (job #3225017) | Borderou de evaluare (job #931960) | Cod sursa (job #2547893) | Cod sursa (job #1309422) | Cod sursa (job #1813176)
#include <fstream>
#include <vector>
using namespace std;
ifstream in ("sortaret.in");
ofstream out("sortaret.out");
const int Max = 50010;
vector<int> v[Max];
int grad[Max], q[Max];
int main()
{
int n, m, x, y, nr = 0;
in >> n >> m;
for(int i = 1; i <= m; ++i)
{
in >> x >> y;
v[x].push_back(y);
grad[y]++;
}
for(int i = 1; i <= n; ++i)
if(grad[i] == 0)
q[++nr] = i;
for(int i = 1; i <= n; ++i)
for(vector<int>::iterator it = v[q[i]].begin(); it != v[q[i]].end(); ++it)
if(--grad[*it] == 0)
q[++nr] = *it;
for(int i = 1; i <= nr; ++i)
out << q[i] << " ";
return 0;
}