Pagini recente » Cod sursa (job #260374) | Cod sursa (job #2181615) | Cod sursa (job #283803) | Cod sursa (job #2758388) | Cod sursa (job #1509606)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,x,y,i;
bool viz[50001];
vector<int>a[50001],fin;
void dfs(int nod)
{
fin.push_back(nod);
for(int j=0;j<a[nod].size();j++)
if(viz[a[nod][j]]==0)
{
viz[a[nod][j]]=1;
dfs(a[nod][j]);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
{
viz[i]=1;
dfs(i);
}
for(i=0;i<fin.size();i++)
g<<fin[i]<<" ";
return 0;
}