Pagini recente » Cod sursa (job #162743) | Cod sursa (job #2367079) | Monitorul de evaluare | Cod sursa (job #1796786) | Cod sursa (job #2079725)
#include <fstream>
#include <vector>
#define MaxN 50005
using namespace std;
int N, M, x, y;
vector<int> G[MaxN];
int t[MaxN], j=0;
void Read()
{
ifstream f("sortaret.in");
f>>N>>M;
for (int i=1;i<=N;i++)
G[i].push_back(0);
for (int i=0;i<M;i++)
{
f>>x>>y;
G[x].push_back(y);
G[x][0]++;
}
}
void DFS(int x)
{
for (int i=1;i<=G[x][0];i++)
DFS(G[x][i]);
t[j++]=x;
}
void Write()
{
ofstream g("sortaret.out");
for (int i=N-1;i>=0;i--)
g<<t[i]<<' ';
}
int main()
{
Read();
DFS(1);
Write();
}