Pagini recente » Cod sursa (job #1388418) | Cod sursa (job #1423771) | Cod sursa (job #3202839) | Cod sursa (job #2336666) | Cod sursa (job #1502730)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> G[100001];
int i,x,y,n,m,viz[50001],poz,a[50001];
void DFS(int nod){
viz[nod]=1;
for(i=0;i<G[nod].size();i++)
if(viz[G[nod][i]]==0)
DFS(G[nod][i]);
a[++poz]=nod;}
int main()
{
f>>n>>m;
for(i=1;i<=n;i++)
{
f>>x>>y;
G[x].push_back(y);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
DFS(i);
for(i=poz;i>=1;i--)
g<<a[i]<<" ";
return 0;
}