Pagini recente » Cod sursa (job #2227900) | Cod sursa (job #2490914) | Cod sursa (job #56983) | Cod sursa (job #2142114) | Cod sursa (job #2922684)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
vector<int>v[50005];
int m,n,start,marcat[50005],k,f[50005],ans[50005];
void fill1(int i)
{
marcat[i]=1;
for(int j=0;j<v[i].size();j++)
{
if(marcat[v[i][j]]==0)
{
fill1(v[i][j]);
}
}
k++;
ans[k]=i;
}
int main()
{
cin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
cin>>x>>y;
v[x].push_back(y);
f[y]++;
}
for(int i=1;i<=n;i++)
{
if(f[i]==0)
{
fill1(i);
}
}
for(int i=k;i>=1;i--)
cout<<ans[i]<<" ";
return 0;
}