Pagini recente » Cod sursa (job #1809101) | Cod sursa (job #2875320) | Cod sursa (job #3190579) | Cod sursa (job #305899) | Cod sursa (job #2532899)
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n,m,x,y,g[50005];
vector<int> v[50005];
queue<int> q;
void st()
{
for(int i=1;i<=n;i++)
{
if(g[i]==0)
{
out<<i<<" ";
q.push(i);
}
}
while(!q.empty())
{
int x=q.front();
q.pop();
for(auto it:v[x])
{
g[it]--;
if(g[it]==0)
{
out<<it<<" ";
q.push(it);
}
}
}
}
int main()
{
in>>n>>m;
for(int i=1;i<=m;i++)
{
in>>x>>y;
v[x].push_back(y);
}
st();
return 0;
}