EXPLANATION
<img src=“http://www.codechef.com/download/Solutions/2011/May/ed1.jpg"width="500” height=“370”>
<img src=“http://www.codechef.com/download/Solutions/2011/May/ed2.jpg"width="350” height=“200”>
<img src=“http://www.codechef.com/download/Solutions/2011/May/ed3.jpg"width="370” height=“250”>
Can be found here.
Can be found here.
Can anyone explain me how they come to that B(k) * t(n-k) and then to the recursion ? thanks a lot.
i know that this is very late, but if you didn’t get any answer it may help you. if you go by the def of b[n] & t[n], and if you observe carefully, we can get t[n] from previous values of b[k] & t[n-k] (k<n) using the given formula, i.e., sum(b[k]t[n-k]), i.e., sum(no. of basic blocks of dim 2k times no. of config of block of dim 2*(n-k)). And then when you see observe some t[n]'s we can get the above recursion. If you still don’t get it reply me and i’ll explain it in detail.
I m getting SIGABRT runtime error… Can anybody help me
my code is
http://www.codechef.com/viewsolution/4107952
