Pagini recente » Cod sursa (job #2718733) | Cod sursa (job #3147095) | Cod sursa (job #1324827) | Cod sursa (job #135855) | Cod sursa (job #1954050)
#include<cstdio>
#include<vector>
using namespace std;
const int MAX=50005;
vector <int> g[MAX];
int sol[MAX];
bool viz[MAX];
int num;
void dfs(int u)
{
viz[u]=1;
for(int j=0; j<g[u].size(); ++j)
{
if(!viz[g[u][j]])
dfs(g[u][j]);
}
sol[++num]=u;
}
void sortaret(int n)
{
for(int i=1; i<=n; i++)
if(!viz[i])
dfs(i);
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
int n,m;
scanf("%d%d",&n,&m);
for(int i=1; i<=m; ++i)
{
int x,y;
scanf("%d%d",&x,&y);
g[x].push_back(y);
}
sortaret(n);
for(int i=1; i<=n; ++i)
printf("%d ",sol[i]);
return 0;
}