Codeforces 644A Parliament of Berland 【水题】

题目链接：Codeforces 644A Parliament of Berland

题意：用$n$个数填$a*b$矩阵，要求奇数不能相邻，偶数不能相邻。

交替填就好了。
$AC$代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <stack>
#define PI acos(-1.0)
#define CLR(a, b) memset(a, (b), sizeof(a))
#define fi first
#define se second
#define ll o<<1
#define rr o<<1|1
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
const int MAXN = 1e7 + 1;
const int pN = 1e6;// <= 10^7
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
void getmax(int &a, int b) {a = max(a, b); }
void getmin(int &a, int b) {a = min(a, b); }
void add(LL &x, LL y) { x += y; x %= MOD; }
int Map[110][110];
int main()
{
    int n, a, b; cin >> n >> a >> b;
    if(a * b < n) {
        cout << -1 << endl;
        return 0;
    }
    CLR(Map, 0); int row = 1, cul = 1;
    for(int i = 1; i <= n; i++) {
        Map[row][cul] = i;
        if(row & 1) {
            cul++;
            if(cul > b) {
                row++;
                cul = b;
            }
        }
        else {
            cul--;
            if(cul <= 0) {
                row++;
                cul = 1;
            }
        }
    }
    for(int i = 1; i <= a; i++) {
        for(int j = 1; j <= b; j++) {
            if(j > 1) cout << ' ';
            cout << Map[i][j];
        }
        cout << endl;
    }
    return 0;
}