Pagini recente » Cod sursa (job #851013) | Cod sursa (job #751805) | Cod sursa (job #1040611) | Cod sursa (job #1925323) | Cod sursa (job #2032141)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, nr, v[50002];
bool viz[50002];
vector<int> l[100002];
void dfs(int nod)
{
viz[nod]=1;
for(int j=0;j<l[nod].size();j++)
if(viz[l[nod][j]]==0)
{ dfs(l[nod][j]);
v[++nr]=l[nod][j];
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=n;i++)
{
int x, y;
f>>x>>y;
l[x].push_back(y);
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
dfs(i);
}
for(int i=1;i<=nr;i++)
g<<v[i]<<" ";
return 0;
}