Pagini recente » Cod sursa (job #3167168) | Cod sursa (job #2565055) | Cod sursa (job #690433) | Cod sursa (job #430770) | Cod sursa (job #1563579)
#include <iostream>
#include <vector>
#include <stdio.h>
#include <stack>
#define NMax 50005
using namespace std;
vector<int> Graf[NMax];
int N,M,x,y;
stack<int> Stiva;
bool mark[NMax];
void Read()
{
scanf("%d%d",&N,&M);
for(int i=1;i<=M;i++)
{
scanf("%d%d",&x,&y);
Graf[x].push_back(y);
}
}
void DFS(int nod)
{
mark[nod]=true;
for(vector<int>::iterator it=Graf[nod].begin();it!=Graf[nod].end();it++)
if(mark[*it]==false)
DFS(*it);
Stiva.push(nod);
}
void Write()
{
while(Stiva.empty()==false)
{
printf("%d ",Stiva.top());
Stiva.pop();
}
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
Read();
for(int i=1;i<=N;++i)
if(mark[i]==false)
{
mark[i]=1;
DFS(i);
}
Write();
}