Pagini recente » Cod sursa (job #2806258) | Cod sursa (job #809296) | Cod sursa (job #429435) | Cod sursa (job #248127) | Cod sursa (job #3238424)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n, m, x, y, d[50002], q[50002];
vector<int> v[50002];
int main()
{
cin>>n>>m;
for(int i=1; i<=m; i++)
{
cin>>x>>y;
d[y]++;
v[x].push_back(y);
}
for(int i=1; i<=n; i++)
if(d[i]==0)
q[++q[0]]=i;
for(int k=1; k<=n; k++)
{
int j=q[k];
for(auto i: v[j])
{
d[i]--;
if(d[i]==0)
q[++q[0]]=i;
}
}
for(int i=1;i<=n;i++)
cout<<q[i]<<" ";
}