Pagini recente » Sandbox (cutiuţa cu năsip) | Cod sursa (job #1655187) | Cod sursa (job #1322509) | Cod sursa (job #969297) | Cod sursa (job #2951969)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,k,x,y,a[50003],cod[50003];
vector<int>v[50003];
void dfs(int x)
{
a[x]=1;
for(int i=0;i<v[x].size();i++)
if(!a[v[x][i]])
dfs(v[x][i]);
cod[++k]=x;
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
for(int i=1;i<=n;i++)
if(!a[i])
dfs(i);
for(int i=k;i>0;i--)
g<<cod[i]<<" ";
return 0;
}