The King’s Ups and Downs

#include <iostream>
#include <cmath>
#include <math.h>
#include <vector>
#include <cstdio>
#include <cstring>

#include <algorithm>
#define ll long long
using namespace std;
ll dp[25][2];
ll sum[25];
ll C(ll x,ll y)
{
    ll ans = 1;
    if(x < y)
         return 0;
    else if(x == y || y ==0)
         return 1;
    else{
        for(ll i=x;i>=(x-y+1);--i){
            ans *= i;
        }
        while(y){
            ans /= y--;
        }
        return ans;
    }
}
void f()
{
    sum[1] = 1;
    sum[2] = 2;
    dp[0][0] = dp[0][1] = 1;
    dp[1][0] = dp[1][1] = 1;
    dp[2][0] = dp[2][1] = 1;

    for(int i=3;i<=20;i++)
    {
        for(int j=0;j<i;j++)
        {
            sum[i] += dp[j][0]*dp[i-j-1][1]*C(i-1,j);
        }
        dp[i][0] = dp[i][1] = sum[i]/2;
    }
}

int main()
{
    memset(dp,0,sizeof(dp));
    memset(sum,0,sizeof(sum));
    f();
    int n,m,p;
    cin>>n;
    while(n--)
    {
        cin>>m>>p;
        cout<<m<<" "<<sum[p]<<endl;
    }
    return 0;
}