Hi everybody this is prick
I have just cleared round 1 of code4bill
I think we should help each other in round 2
what do u say?
On 1/25/06, prick [EMAIL PROTECTED] wrote:
Hi everybody this is prick
I have just cleared round 1 of code4bill
I think we should help each other in round 2
what do u say?
... that now I understand why Microsoft software is as we know ...
if this is the way that they use to hire primary
Well,
Here's a solution :
Create an array of cumulative sums i.e. cs[i] = sum of elements from
index 0 to i
Now, find the maximum cumulative sum index say 'y'. We can exclude
elements after index 'y' since they do not contribute positively to the
cumulative sum.
Also, let 'x' be the minimum
int steps_combi(int steps)
{
if(steps==1)
return 1;
if(steps==2)
return 2;
// can take single step or double step
return (steps_combi(steps-1) + steps_combi(steps-2));
}
Today in a data structures class we went over blob recursion. What we
went over is actually described on this page (different school though):
http://www.bowdoin.edu/~ltoma/teaching/cs107/fall05/Labs/lab9.html
I understand how the recursion works, but I'm more interested in
determing the exact
