qstn:http://www.codechef.com/problems/COINS

qstn look much simpler with recurrence relation

recurrence relation

```
lli oprtn(lli n)
{
if(n<2)
return 0;
lli ans=max(n, oprtn(n/2) + oprtn(n/3) +oprtn(n/4));// recurrence relation
if(ans>n)
return ans;
else
return n;
}
it can be converted into DP easily by saving the following function
void work()
{
lli i;
learn[0]=0;
learn[1]=1;
learn[2]=2;
learn[3]=3;
for(i=4;i<=1000000000;i++)
{
learn[4]=max(i,learn[i/2]+learn[i/3]+learn[i/4]);
}
}
```

however size of array is too large(10^9) to accommodate all solution now how to tackle this problem please help