Pagini recente » Cod sursa (job #1202229) | Cod sursa (job #525624) | Cod sursa (job #3256001) | Cod sursa (job #3255737) | Cod sursa (job #1086821)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
//
fstream in("sortaret.in",ios::in),out("sortaret.out",ios::out);
const int N=50001;
int n,v[N];
vector<int> a[N];
void dfs(int p){
v[p]=-1;
out<<p<<' ';
for(int i=0 ; i<a[p].size() ; i++){
v[a[p][i]]--;
if(v[a[p][i]]==0)
dfs(a[p][i]);
}
}
int main()
{
int x,y;
in>>n>>y;
for(int i=1 ; i<=n ; i++){
in>>x>>y;
v[y]++;
a[x].push_back(y);
}
int i=1;
while(v[i]){
i++;
}
dfs(i);
return 0;
}