Pagini recente » Cod sursa (job #1570058) | Cod sursa (job #2570960) | Cod sursa (job #2428191) | Cod sursa (job #1693386) | Cod sursa (job #2428449)
#include <cstdio>
using namespace std;
#define maxsize 10005
int n, m, x, y;
int gr[maxsize][maxsize];
int c[maxsize], deg[maxsize];
void sort()
{
int u;
for(int i = 1; i <= n; ++i)
if(deg[i] == 0)
c[++c[0]] = i;
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= gr[c[i]][0]; ++j)
{
u = gr[c[i]][j];
--deg[u];
if(deg[u] == 0)
c[++c[0]] = u;
}
}
int main()
{
scanf("%d %d", &n, &m);
for(int i = 0; i < m; ++i)
{
scanf("%d %d", &x, &y);
++gr[x][0];
gr[x][gr[x][0]] = y;
++deg[y];
}
sort();
for(int i = 1; i <= n; ++i)
printf("%d ", c[i]);
return 0;
}