第十二届蓝桥杯第一场+第二场c++组难题整理

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 110, M = 1 << 6, K = 21, MOD = 1e9 + 7;

int n, m, k;
int f[N][M][M][K];

int get_count(int x)
{
    int res = 0;
    while (x)
    {
        res ++ ;
        x -= x & -x;
    }
    return res;
}

int main()
{
    cin >> n >> m >> k;
    f[0][0][0][0] = 1;

    int cnt = 0;
    for (int i = 1; i <= m; i ++ )
        for (int a = 0; a < 1 << n; a ++ )
            for (int b = 0; b < 1 << n; b ++ )
            {
                if (a & (b << 2) || b & (a << 2)) continue;
                for (int c = 0; c < 1 << n; c ++ )
                {
                    if (c & (b <<