Scily 1011. Lenny's Lucky Lotto

#include <iostream>
#include <memory.h>
#include<stdio.h>
using namespace std;
long N,m;
long long dp[11][2001];
int main()
{
    memset(dp,0,sizeof(dp));
    /*init the array*/
    for( int j = 1; j<=2000 ; j++ )
    {
        dp[1][j] = j;
    }
    for( int i = 2 ; i<=10 ; i++ )
    {
        for( int j = 1; j<=2000 ; j++ )
        {
            dp[i][j] = dp[i][j-1] + dp[i-1][j/2];
        }
        
    }

    
    long nr;
    scanf("%d",&nr);
    for(long i=1;i<=nr;i++)
    {
        scanf("%d%d",&N,&m);
        printf("Case %d: n = %d, m = %d, # lists = %lld\n",i,N,m,dp[N][m]);
    }
    return 0;
}