Pagini recente » Cod sursa (job #1751341) | Cod sursa (job #927630) | Cod sursa (job #634833) | Cod sursa (job #819226) | Cod sursa (job #2092691)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
const int nmax=50000;
vector<int>v[nmax+5];
vector<int>sol;
int cat[nmax+5];
bool viz[nmax+5];
void dfs(int nod)
{
sol.push_back(nod);
viz[nod]=1;
for(int i=0;i<v[nod].size();i++)
if(viz[v[nod][i]]==0)
dfs(v[nod][i]);
}
int n,m,a,b;
int nod;
int main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin>>a>>b;
v[a].push_back(b);
cat[b]++;
}
for(int i=1;i<=n;i++)
if(cat[i]==0)
{
dfs(i);
}
for(int i=0;i<sol.size();i++)
cout<<sol[i]<<" ";
return 0;
}
/**
**/