Pagini recente » Cod sursa (job #2350378) | Cod sursa (job #2979132) | Cod sursa (job #2807489) | Cod sursa (job #2734345) | Cod sursa (job #1658333)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int NMAX = 50001;
vector<int> muchii[NMAX];
vector<int> t;
vector<int>::iterator it;
int n,m;
int g[NMAX];
void citire()
{
in>>n>>m;
int x,y;
for(int i=1;i<=m;i++)
{
in>>x>>y;
muchii[x].push_back(y);
g[y]++;
}
in.close();
}
void solutie()
{
t.push_back(0);
for(int i=1;i<=n;i++)
if(!g[i])
t.push_back(i);
int x;
for(int i=1;i<=n;i++)
{
x = t[i];
for(it = muchii[x].begin();it!=muchii[x].end();it++)
{
g[*it]--;
if(!g[*it])
t.push_back(*it);
}
}
}
void afisare()
{
for(it = t.begin()+1;it!=t.end();it++)
out<<*it<<" ";
}
int main()
{
citire();
solutie();
afisare();
out.close();
return 0;
}