一本通1637：荒岛野人_1637:荒岛野人-优快云博客

本文链接：https://blog.youkuaiyun.com/liu12345635/article/details/137734686

本文详细介绍了C++代码中的三个函数：flag(),check(),和check2()，它们用于处理与循环数组中元素操作和条件判断相关的逻辑。主要关注整数计算、数组操作和递归在解决特定问题中的应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <bits/stdc++.h>
using namespace std;
const int N = 20;
int n, m, t;
int c[N], p[N], l[N];
int b[N], np[N];
bool flag() {
    for (int i = 2; i <= n; i++)
        if (p[i] != p[i - 1])
            return 0;

    return 1;
}
bool check() {
    for (int i = 1; i <= n; i++)
        np[i] = c[i];

    for (int i = 1; i <= t; i++) {
        memset(b, 0, sizeof(b));

        for (int j = 1; j <= n; j++) {
            if (i > l[j])
                continue;

            np[j] = (np[j] + p[j] - 1) % m + 1;
            b[np[j]]++;

            if (b[np[j]] > 1)
                return 0;
        }
    }

    return 1;
}
bool check2() {
    for (int i = 1; i <= n; i++)
        for (int j = i + 1; j <= n; j++) {
            if (p[i] == p[j])
                continue;

            int x, y;

            if (p[i] < p[j])
                x = (c[i] - c[j] + m) % m, y = p[j] - p[i];
            else
                x = (c[j] - c[i] + m) % m, y = p[i] - p[j];

            int _ = min(l[i], l[j]);

            for (int k = 0; k <= y - 1; k++) {
                int now = x + k * m;

                if (now > y * _)
                    break;

                if (now % y == 0)
                    return 0;
            }

        }

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

    for (int i = 1; i <= n; i++) {
        scanf("%d%d%d", c + i, p + i, l + i);
        m = max(m, c[i]);
        t = max(t, l[i]);
    }
    for (;; m++) {
        if (check2()) {
            printf("%d", m);
            return 0;
        }
    }
    return 0;
}