Dangerous Dive

题意：给出n，m及m个数，问1~n有哪些没出现
解法：随便，我用了桶

#include <iostream>using namespace std;#include <stdio.h>int f[20000] = {0};int main() {    int cases = 0, n, m, sum, x;    while ((scanf("%d %d", &n, &m)) != EOF) {        cases++;        for (int i = 1; i <= m; i++) {            cin >> x;            f[x] = cases;        }        sum = 0;        for (int i = 1; i <= n; i++) if (f[i] != cases) {            sum++;            cout << i << " ";        }        if (sum == 0) cout << "*";        cout << endl;    }}