什么才是世界上最绝望的死法

一只Merry

2025-11-01 20:21:05

发布于：上海

16阅读

0回复

0点赞

CSP-J2 2025 T2

提交的代码：

#include <iostream>
using namespace std;

int n, m, a, t, c, r, pos = 1;

int main() {
    cin >> n >> m >> a;
    for (int i = 1; i < n * m; i++) {
        cin >> t;
        if (t > a) {
            pos++;
        }
    }
    c = pos / n + 1;
    if (pos % n == 0) {
        c--;
    }
    if (c % 2 == 0) {
        r = n - pos % n + 1;
        if (pos % n == 0) {
        	r = 1;
    	}
        cout << r << ' ' << c;
    } else {
        r = pos % n;
        if (pos % n == 0) {
            r = n;
        }
        cout << c << ' ' << r;
    }
    return 0;
}

只有 $80pts$

AC的代码

#include <iostream>
using namespace std;

int n, m, a, t, c, r, pos = 1;

int main() {
    cin >> n >> m >> a;
    for (int i = 1; i < n * m; i++) {
        cin >> t;
        if (t > a) {
            pos++;
        }
    }
    c = pos / n + 1;
    if (pos % n == 0) {
        c--;
    }
    if (c % 2 == 0) {
        r = n - pos % n + 1;
        if (pos % n == 0) {
        	r = 1;
    	}
        cout << c << ' ' << r;
    } else {
        r = pos % n;
        if (pos % n == 0) {
            r = n;
        }
        cout << c << ' ' << r;
    }
    return 0;
}