Pagini recente » Cod sursa (job #2625287) | Cod sursa (job #2610126) | Cod sursa (job #2730264) | Cod sursa (job #1594197) | Cod sursa (job #2601793)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int grad[50005];
int sol[50005];
vector <int> lista[50005];
int main()
{
int n, m, x, y, i, nrsol = 0, j;
cin >> n >> m;
for (i = 1; i <= m; i++)
{
cin >> x >> y;
grad[y]++;
lista[x].push_back(y);
}
for (i = 1; i <= n; i++)
if (grad[i] == 0)
sol[++nrsol] = i;
i = 1;
while (nrsol < n)
{
for (j = 0; j < lista[sol[i]].size(); j++)
{
grad[lista[sol[i]][j]]--;
if (grad[lista[sol[i]][j]] == 0)
sol[++nrsol] = lista[sol[i]][j];
}
i++;
}
for (i = 1; i <= nrsol; i++)
cout << sol[i] << " ";
return 0;
}