cf1208C(div1+div2)

构造好题!

题意:

• 给定一个数n, 保证n是4的倍数
• 现要求构造一个$n\times n$的矩阵, 且满足以下两个要求
  • 该矩阵的每行的异或值等于该矩阵的每列的异或值
  • 每个元素在$range(0,n^4-1)$内

数据范围: $n\le 1000$

>> face <<

前置技能: 无

Tutorial: 其实看了好久才发现能用题干所给的那个矩阵拓展, 以每个$4\times 4$的矩阵看成一块儿, 每个元素+16就能拓展出新的块儿, 就这样不停的拓展就能得到一个$n\times n$的矩阵

#include <bits/stdc++.h>

using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
int nxt()
{
    int ret;
    scanf("%d", &ret);
    return ret;
}
int a[4][4] = {8, 9, 1, 13, 3, 12, 7, 5, 0, 2, 4, 11, 6, 10, 15, 14};
int n;
int throns(int i, int j)
{
    return (i / 4) * n + j / 4;
}
signed main()
{
    n = nxt();
    n /= 4;
    _for(i, 0, 4 * n)
    {
        _for(j, 0, 4 * n)
        {
            cout << throns(i, j) * 16 + a[i % 4][j % 4] << " ";
        }
        cout << endl;
    }
}