Pagini recente » Cod sursa (job #1622718) | Cod sursa (job #928297) | Atasamentele paginii lpaths | Cod sursa (job #1637661) | Cod sursa (job #2257858)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector <vector <int> > a;
int sol[50002], grad[50002], n, m, k;
int main()
{
cin >> n >> m;
a.resize(n + 2);
int x, y;
for(int i = 1; i <= m; i++)
{
cin >> x >> y;
grad[y]++;
a[x].push_back(y);
}
while(k < n)
for(int i = 1; i <= n; i++)
if(grad[i] == 0)
{
for(int j = 0; j < a[i].size(); j++)
grad[a[i][j]]--;
sol[++k] = i;
grad[i] = -1;
}
for(int i = 1; i <= n; i++)
cout << sol[i] << " ";
return 0;
}