Pagini recente » Cod sursa (job #1871176) | Cod sursa (job #1112034) | Cod sursa (job #490963) | Cod sursa (job #1592225) | Cod sursa (job #2981385)
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;
#define MAXN 16010
int N, M, viz[MAXN], deg[MAXN];
vector<int> G[MAXN];
void solve_and_write(void)
{
int i, j, k;
for (i = 1; i <= N; i++)
{
for (j = 1; j <= N; j++)
if (!viz[j] && deg[j] == 0)
{
viz[j] = 1, printf("%d ", j);
for (k = 0; k < G[j].size(); k++)
deg[G[j][k]]--;
break;
}
}
}
void read_data(void)
{
int i, a, b;
scanf("%d %d\n", &N, &M);
for (i = 1; i <= M; i++)
scanf("%d %d", &a, &b), G[a].pb(b), deg[b]++;
}
int main(void)
{
freopen("sortaret.in", "rt", stdin);
freopen("sortaret.out", "wt", stdout);
read_data();
solve_and_write();
return 0;
}