Pagini recente » Cod sursa (job #2868627) | ONIS 2015, Solutii Runda 1 | Cod sursa (job #472431) | Cod sursa (job #388610) | Cod sursa (job #1239044)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
#define MAX 50002
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector < int > G[MAX];
int a[MAX],h;
bool viz[MAX];
void df(int nod)
{
if(!viz[nod])
{
viz[nod]=1;
for(int i=0;i<G[nod].size();i++)
df(G[nod][i]);
a[++h]=nod;
}
}
int main()
{
int n,m,x,y;
fin>>n>>m;
while(m--){
fin>>x>>y;
G[x].push_back(y);
}
for(int i=1;i<=n;i++)
df(i);
for(int i=n;i>0;i--)
fout<<a[i]<<" ";
fin.close();
fout.close();
return 0;
}