Pagini recente » Cod sursa (job #1873388) | Cod sursa (job #2179109) | Cod sursa (job #2774072) | Cod sursa (job #390467) | Cod sursa (job #2428457)
#include <cstdio>
#include <vector>
using namespace std;
#define maxsize 50005
int n, m, x, y;
vector<int> gr[maxsize];
int c[maxsize], deg[maxsize], lg[maxsize];
void sort()
{
int u, v;
int l = 0;
for(int i = 1; i <= n; ++i)
if(deg[i] == 0)
c[++l] = i;
for(int i = 1; i <= n; ++i)
{
u = c[i];
for(int j = 0; j < lg[u]; ++j)
{
v = gr[u][j];
--deg[v];
if(deg[v] == 0)
c[++l] = v;
}
}
}
int main()
{
freopen("sortaret.in", "r", stdin);
freopen("sortaret.out", "w", stdout);
scanf("%d %d", &n, &m);
for(int i = 0; i < m; ++i)
{
scanf("%d %d", &x, &y);
gr[x].push_back(y);
++deg[y];
}
for(int i = 1; i <= n; ++i)
lg[i] = gr[i].size();
sort();
for(int i = 1; i <= n; ++i)
printf("%d ", c[i]);
return 0;
}