Pagini recente » Cod sursa (job #803855) | Cod sursa (job #2102257) | Cod sursa (job #801459) | Cod sursa (job #1146528) | Cod sursa (job #2790693)
#include <bits/stdc++.h>
using namespace std;
vector <int> v[50001];
queue <int> q;
int deg[50000];
int main()
{
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n, m;
cin >> n >> m;
for ( int i = 1; i <= m; i ++ )
{
int a, b;
cin >> a >> b;
v[a].push_back(b);
deg[b] ++;
}
for ( int i = 1; i <= n; i ++)
{
if(deg[i] == 0)
{
q.push(i);
}
}
for ( int i = 1; i <= n; i++)
{
if(deg[i] == 0)
{
for(auto x: v[i])
{
deg[x]--;
if(deg[x] == 0)
{
q.push(x);
}
}
}
}
for ( int x = q.front() ; x<=q.back();x ++)
{
cout << x << " ";
}
return 0;
}