CCF-GESP 2025 年 9 月 C++ 三级真题深度解析 | 极客日志

CCF-GESP 2025 年 9 月 C++ 三级真题深度解析 | 极客日志

#include <bits/stdc++.h>
using namespace std;

int n, arr[105];

int main() {
    cin >> n;
    for (int i = 0; i < n; i++) cin >> arr[i];
    
    int cnt = 0;
    while (true) {
        int maxid = 0, minn = 100;
        for (int i = 0; i < n; i++) {
            if (arr[i] >= arr[maxid]) maxid = i;
            if (arr[i] != 0 && arr[i] < minn) minn = arr[i];
        }
        
        if (arr[maxid] == 0) break;
        arr[maxid] -= minn;
        cnt++;
    }
    cout << cnt;
    return 0;
}

#include <bits/stdc++.h>
using namespace std;

int n, months[13] = {0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};

int main() {
    cin >> n;
    cout << "MON" << " " << "TUE" << " " << "WED" << " " << "THU" << " " << "FRI" << " " << "SAT" << " " << "SUN" << endl;
    
    int start = 1; // 2025 年 9 月 1 日是星期一
    if (n < 9) {
        for (int i = 8; i >= n; i--) start -= months[i];
    } else if (n > 9) {
        for (int i = 9; i < n; i++) start += months[i];
    }
    
    // 处理负数取余
    start = (start % 7 + 7) % 7;
    if (start == 0) start = 7;
    
    for (int i = 1; i < start; i++) cout << setw(3) << ' ' << " ";
    
    for (int i = 1; i <= months[n]; i++) {
        cout << setw(3) << i << " ";
        if (start % 7 == 0) cout << endl;
        start++;
    }
    return 0;
}