[Luogu2593] [ZJOI2006]超级麻将

题目地址 ：https://www.luogu.org/problemnew/show/P2593。

---

无脑DP（虽说是抄的额）

---

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
inline int read() {
    int res=;char ch=getchar();
    while(!isdigit(ch))ch=getchar();
    while(isdigit(ch)) res=(res<<)+(res<<)+(ch^), ch=getchar();
    return res;
}
#define reg register

int T;
int a[];
int f[][][][];

int main()
{
    T = read();
    while(T--)
    {
        for (reg int i =  ; i <=  ; i ++) a[i] = read();
        memset(f, , sizeof f);
        f[][][][] = ;
        for (reg int i =  ; i <=  ; i ++)
        {
            for (reg int j =  ; j <= a[i-] ; j ++)
            {
                for (reg int k =  ; k <= a[i] ; k ++)
                {
                    if (k >= ) f[i][j][k][] |= f[i][j][k-][];
                    if (k >= ) f[i][j][k][] |= f[i][j][k-][], f[i][j][k][] |= f[i][j][k-][];
                    if (k >= ) f[i][j][k][] |= f[i][j][k-][], f[i][j][k][] |= f[i][j][k-][];
                    if (j >= k and a[i-] >= k) f[i][j][k][] |= f[i-][a[i-]-k][j-k][], f[i][j][k][] |= f[i-][a[i-]-k][j-k][];
                }
            }
        }
        printf(f[][a[]][a[]][] ? "Yes\n" : "No\n");
    }
    return ;
}