Pagini recente » Cod sursa (job #3252282) | Cod sursa (job #3257689) | Cod sursa (job #3215571) | Cod sursa (job #2661758) | Cod sursa (job #1379911)
#include <cstdio>
#include <vector>
#include <stack>
#define NMAX 50005
using namespace std;
int N, M;
bool viz[NMAX];
vector <int> G[NMAX];
stack <int> sol;
void citire()
{
int a, b;
scanf("%d %d", &N, &M);
for (int i = 1; i <= M; ++i)
{
scanf("%d %d", &a, &b);
G[a].push_back(b);
}
}
void DFS(int nod)
{
vector <int> :: iterator it;
viz[nod] = true;
for (it = G[nod].begin(); it != G[nod].end(); ++it)
if (viz[*it] == false)
DFS(*it);
sol.push(nod);
}
void afisare()
{
while (sol.empty() == false)
{
printf("%d ", sol.top());
sol.pop();
}
}
int main()
{
freopen("sortaret.in", "r", stdin);
freopen("sortaret.out", "w", stdout);
citire();
for (int i = 1; i <= N; ++i)
{
if (viz[i] == false)
DFS(i);
}
afisare();
return 0;
}