注：错误代码都是用我的码风写的

1

int min(int a, int b) {
    if (a < b) return b;
    else return b;
}

2

for (int i = 1; i <= n; i++) {
    for (int i = 1; i <= m; i++) {

    }
}

3

void build(int l, int r, int p) {
    if (l == r) {
        b[p] = a[l];
    }
    int m = (l + r) >> 1;
    build(l, m, ls(p));
    build(m + 1, r, ls(p));
    pd(p);
}

4

1
2
3

int mian() {
    // 曾经常犯，现在不怎么犯了
}

5

int a, b, c;
int main() {
    scanf("%d%d%d", a, b, c);
}

6

int find(int x) {
    if (fa[x] = x) return x;
    else return fa[x] = find(fa[x]);
}

7

1
2
3

int main() {
    printf("%d", &a);
}

8

int main() {
    for (int i = n; i <= 1; i--) {
        /* */
    }
}

9

char n;
int main() {
    scanf("%d", &n);
}

10

void dfs(int u) {
    for (int i = head[u]; i; i++) {
        //
    }
}

11

//建图时
int x, y, z;
int main() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i <= n; i++) {
        scanf("%d%d%d", &x, &y, &z);
        add(x, y, z);
        add(y, x, z);
    }
}

12

//树剖求LCA时
inline int LCA(int x, int y) {
    while (top[x] != top[y]) {
        if (dep[top[x]] < dep[top[y]]) std::swap(x, y);
        x = fa[x];
    }
    if (dep[x] > dep[y]) std::swap(x, y);
    return x;
}

13

//向Trie中插入字符串
void insert(char *s) {
    int p = 0;
    for (int i = 0; s[i]; i++) {
        int k = s[i] - 'a';
        if (!tr[i][k]) tr[i][k] = ++tot;
        p = tr[i][k];
    }
    ed[p]++;
}

14

// 整除分块
for (int l = 1, r; l <= n; l++) {
    //
}

15

//求凸包
for (int i = 3; i <= n; i++) {
    if (top > 1 && crossp(st[top], p[i], st[top - 1]) <= 0) top--;
    st[++top] = p[i];
}

16

1 2	std::sort(a + 1, a + 1, cmp); //注：这是在造数据是遇到的

17

//并查集合并
scanf("%d%d", &x, &y);
int _x = find(x);
int _y = find(y);
fa[_y] = x;