[algogeeks] Re: coins

[Greed]

for i=1 to n
  for j=1 to n
   coins[i][j]=coins[i][j]+ max(coins[i-1][j],coins[i][j-1]);
 This is a bottom up DP. Time complexity O(n^2)



-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

[algogeeks] Re: Print 1 to n one per each line on the standard output

[Greed]

You can use setjmp ,longjmp  or goto to get desired result.
#include
#include
void print(int v)
{
int i=0;

jmp_buf env;

setjmp(env);
if(i<=v)
{
printf("%d\n",i);
++i;
longjmp(env,1);
}
}


int main()
{
int n;
scanf("%d",&n);
print(n);
}

-- 
You received this message because you are subscribed to the Google Groups 
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to 
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.