Codeforces Round 859 (Div. 4)

VIP文章闫鸿宇

已于 2023-03-20 21:37:35 修改

阅读量341

点赞数

分类专栏： Codeforces与Atcoder 文章标签： c++ 算法 c语言

于 2023-03-20 21:27:00 首次发布

本文链接：https://blog.csdn.net/m0_73935863/article/details/129675693

版权

链接

A和B是签到题，直接看代码：

Code of problem A：

#include <bits/stdc++.h>

template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

int main() {
    int t; read(t);
    while (t--) {
        int a, b, c;
        read(a), read(b), read(c);
        if (a + b == c) {
            printf("+\n");
        } else {
            printf("-\n");
        }
    }
    return 0;
}

Code of problem B：

#include <bits/stdc++.h>

template <typename T>
inline void read(T &f) {
    f = 0; T fu = 1; char c = getchar();
    while (c < '0' || c > '9') { if (c == '-') { fu = -1; } c = getchar(); }
    while (c >= '0' && c <= '9') { f = (f << 3) + (f << 1) + (c & 15); c = getchar(); }
    f *= fu;
}

void solve() {
    int n; read(n);
    std::vector<int> sum(2), a(n);
    for (int i = 0; i < n; i++) {
        read(a[i]);
        sum[a[i] & 1] += a[i];
    }
    if (sum[0] > sum[1]) {
        printf("YES\n");
    } else {
        printf("NO\n");
    }
}

int main() {
    int