Pagini recente » Cod sursa (job #2627958) | Rating Arnautu Cristina-Crina (crina2120) | Cod sursa (job #3269486) | Cod sursa (job #2142038) | Cod sursa (job #1481624)
# include <cstdio>
# include <cstring>
#include <vector>
using namespace std;
vector<int> v[50010];
bool use[50010];
int x,y,i,j,n,m, q[500010],p;
void dfs(int nod)
{
int i;
use[nod]=true;
for (i=0; i<v[nod].size(); i++)
if (use[v[nod][i]]==false)
{
dfs(v[nod][i]);
q[++p]=v[nod][i];
}
}
int main()
{
freopen("sortaret.in","r",stdin);
freopen("sortaret.out","w",stdout);
scanf("%d %d\n",&n, &m);
for (i=1; i<=m; i++)
{
scanf("%d %d\n",&x,&y);
v[x].push_back(y);
}
for (i=1; i<=n; i++)
if(use[i]==false)
{
dfs(i);
q[++p]=i;
}
for (i=p; i>=1; i--)
printf("%d ",q[i]);
printf("\n");
return 0;
}