competitive-programming/solved-uva/10305.cpp at master · the-redback/competitive-programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/**
 *                                   ____
 *       ____ ___  ____ ________  __/ __/
 *      / __ `__ \/ __ `/ ___/ / / / /_
 *     / / / / / / /_/ / /  / /_/ / __/
 *    /_/ /_/ /_/\__,_/_/   \__,_/_/
 *
 *    @link : https://the-redback.com
 */
#include <bits/stdc++.h>
using namespace std;

#define inf       10000000
#define mem(a, b) memset(a, b, sizeof(a))
#define NN        110
int a[NN + 7];
vector<int> edge[NN + 7];
vector<int> v;

void get(int n) {
    int i, j, k, l, mn, in;

    while (v.size() < n) {
        mn = inf;
        for (i = 1; i <= n; i++)
            if (a[i] < mn) mn = a[i], in = i;
        v.push_back(in);
        a[in] = inf;
        for (i = 0; i < edge[in].size(); i++) a[edge[in][i]]--;
    }
    for (i = 0; i < v.size(); i++) {
        if (i != 0) cout << " ";
        cout << v[i];
    }
    cout << "\n";
    for (i = 0; i <= n; i++) edge[i].clear();
    v.clear();
    return;
}

int main() {
    // freopen("C:\\Users\\Maruf Tuhin\\Desktop\\in.txt","r",stdin);
    ios_base::sync_with_stdio(false);
    int i, j, k, l, n, r, c, u, v, w;
    int tc, t = 1, x = -1, m;
    // scanf("%d",&tc);
    while (cin >> n >> m) {
        if (n == 0 && m == 0) return 0;
        mem(a, 0);
        while (m--) {
            cin >> k >> l;
            a[l]++;
            edge[k].push_back(l);
        }
        get(n);
    }
    return 0;
}