Jennie

搞出一个二维dp'还是比较显然的

#include
#include
#include
#include
#include
#include
#define int long long
using namespace std;
templateinline void read(T &x)
{
    x=0;register char c=getchar();register bool f=0;
    while(!isdigit(c))f^=c=='-',c=getchar();
    while(isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
    if(f)x=-x;
}
templateinline void print(T x)
{
    if(x<0)putchar('-'),x=-x;
    if(x>9)print(x/10);
    putchar('0'+x%10);
}
int n,m;
int f[50][50];
signed main(){
    read(n);
    read(m);
    f[0][0]=1;
    for(int i=1;i<=n;++i){
        for(int j=1;j<=n;++j){
            for(int l=0;l