Pagini recente » Cod sursa (job #1284748) | Cod sursa (job #1823568) | Cod sursa (job #1148238) | Cod sursa (job #1578026) | Cod sursa (job #1808156)
#include <fstream>
#include <vector>
#include <deque>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int> v[100010];
deque<int> q;
int i,n,m,x,y,q1,w[100010],viz[100010];
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
w[y]++;
}
for(i=1;i<=n;i++)
if(w[i]==0)
q.push_back(i);
while(q.size())
{
g<<q.back()<<' ';viz[q.back()]=1;
for(auto it:v[q.back()])
{
w[it]--;
if(w[it]==0)
q.push_front(it);
}
q.pop_back();
}
for(i=1;i<=n;i++)
if(viz[i]==0)
g<<i<<' ';
return 0;
}