10912 - Simple Minded Hashing.cpp

#include <bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long LL;
const int RNG = 1000003;
const int RNGT = RNG*4;
const int MOD1 = 1e9+7;
const int MOD2 = 1e9+87;
const double pi = 2 * acos( 0.0 );

inline int _Int(){ int x; scanf( "%d", &x ); return x; }
inline LL _LLi(){ LL x; scanf( "%lld", &x ); return x; }
void pruts(){ puts( "-1" ); exit( EXIT_SUCCESS ); }

int dirX[] = { 1, 0, -1, 0, 1, -1, 1, -1 };
int dirY[] = { 0, 1, 0, -1, 1, -1, -1, 1 };
int rX[] = { 1, 1, 2, 2, -1, -1, -2, -2 };
int rY[] = { 2, -2, 1, -1, 2, -2, 1, -1 };

template < class T > T tri_Area( T x1, T y1, T x2, T y2, T x3, T y3 ){
        return abs( x1*( y2-y3 ) - y1*( x2-x3 ) + ( x2*y3-x3*y2 ) );
};
template < class T > T Distance( T x1, T y1, T x2, T y2 ){
        return sqrt( ( x1-x2 ) * ( x1-x2 ) + ( y1-y2 ) * ( y1-y2 ) );
};
template < class T > T bigMod( T n, T p, T m ){
        if( p == 0 )return 1; if( p&1 )return ( n*bigMod( n, p-1, m ) )%m; T x = bigMod( n, p/2, m ); return ( x*x )%m;
};
int Case;
int sset( int N, int pos ){ return N=N|( 1<<pos ); }
bool check( int N, int pos ){ return ( bool )( N&( 1<<pos ) ); }
int reset( int N, int pos ){ return N=N&~( 1<<pos ); }
/**************************************###########################################***************************************
***************************************##    MD. YA-SEEN ARAFAT(ThunderStroke)  ##***************************************
***************************************##    CSE, University of Asia Pacific    ##***************************************
***************************************###########################################***************************************/

int dp[ 30 ][ 355 ][ 30 ];
int dst;

int call_dp( int idx, int sum, int nth ){
        if( !idx )return sum==0;
        if( sum < 0 || nth > 26 )return 0;
        int &R = dp[ idx ][ sum ][ nth ];
        if( R != -1 )return R;
        R = 0;
        R += call_dp( idx-1, sum-nth, nth+1 )+call_dp( idx, sum, nth+1 );
        return R;
}

void Hunger(){
        int n;
        memset( dp, -1, sizeof dp );
        while( scanf( "%d %d", &n, &dst ) == 2 ){
                if( !n && !dst )break;
                int ans = 0;
                if( dst < 353 && n <= 26 )ans += call_dp( n, dst, 1 );
                printf( "Case %d: %d\n", ++Case, ans );
        }
}

int main(){
        #ifndef ONLINE_JUDGE
        //        freopen("in.txt", "r", stdin);
        //        freopen("n.txt", "w", stdout);
        #endif
//        int t = _Int();
//        for( Case = 1; Case <= t; Case++ )
        Hunger();
        return 0;
}