OJ Board

hey all
all of the discussions in this thread are about BigInteger and a bottom up approach
However, it can be solved using top down approach as my function below

#define nNum 4
int val[nNum] = {1, 1, 2, 3};
BigInteger count(int ind, int rem)
{
if(rem == 0)
return one;

if(ind == nNum || rem ...

Your code doesn't match first case of sample. http://ideone.com/riv1Zf
appreciate your help
that was really unfair
it was just a difference in compiling the printf() function
with this little edit it works fine with the judge
mark++;
printf("Twin Towers #%d\nNumber of Tiles : %d\n\n", mark, doit ...

isn't this a straight LCS !?
can any one help with my code
i already had it tested with no bugs

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <assert.h>
#include <memory.h>
#include <set>
#include <map>
#include <list>
#include <string>
#include ...