Pagini recente » Cod sursa (job #1730687) | Cod sursa (job #160102) | Monitorul de evaluare | Cod sursa (job #2479245) | Cod sursa (job #1509611)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,x,y,poz;
vector<int>fin;
bool viz[50005];
vector<int>a[50005];
void dfs(int k)
{
viz[k]=1;
for(i=0;i<a[k].size();i++)
if(viz[a[k][i]]==0)
dfs(a[k][i]);
fin.push_back(k);
}
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)
dfs(i);
for(i=fin.size()-1;i>=0;i--)
g<<fin[i]<<" ";
return 0;
}