Pagini recente » Cod sursa (job #2169554) | Istoria paginii runda/pre002/clasament | Cod sursa (job #862606) | Cod sursa (job #966479) | Cod sursa (job #1473364)
#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> v[50001],sorted;
void dfs(int nod)
{
viz[nod]=1;
sorted.push_back(nod);
for(int j=0;j<v[nod].size();j++)
if(viz[v[nod][j]]==0)
dfs(v[nod][j]);
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
for(i=0;i<sorted.size();i++)
g<<sorted[i]<<" ";
return 0;
}