Pagini recente » Cod sursa (job #1135594) | Cod sursa (job #1079293) | Cod sursa (job #841190) | Cod sursa (job #2343868) | Cod sursa (job #2960390)
#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
const int dim = 5e4 + 5;
vector<int> v[dim];
set<int> s;
int grad[dim];
int main()
{
int n , m;
cin >> n >> m;
while(m--)
{
int x , y;
cin >> x >> y;
v[x].push_back(y);
grad[y]++;
}
for(int i = 1 ; i <= n ; ++i)
if(grad[i] == 0)
s.insert(i);
while(!s.empty())
{
int a = *s.begin();
s.erase(s.begin());
cout << a <<' ';
for(int i = 0 ; i < v[a].size() ; ++i)
{
grad[v[a][i]]--;
if(grad[v[a][i]] == 0)
s.insert(v[a][i]);
}
}
}