Pagini recente » Cod sursa (job #191045) | Cod sursa (job #1846398) | Cod sursa (job #596416) | Cod sursa (job #191052) | Cod sursa (job #1329563)
#include <fstream>
#include <vector>
#define NMax 50005
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> G[NMax],Sol;
int N,M,Use[NMax];
void Read()
{
int x,y;
f>>N>>M;
for(int i=1;i<=M;i++)
{
f>>x>>y;
G[x].push_back(y);
}
}
void DFS(int Nod)
{
int Vecin;
Use[Nod]=1;
for(unsigned int i=0;i<G[Nod].size();i++)
{
Vecin=G[Nod][i];
if(!Use[Vecin])
DFS(Vecin);
}
Sol.push_back(Nod);
}
void Print()
{
for(int i=Sol.size()-1;i>=0;i--)
g<<Sol[i]<<" ";
}
int main()
{
Read();
for(int i=1;i<=N;i++)
if(!Use[i])
DFS(i);
Print();
return 0;
}