### PROBLEM LINKS

### DIFFICULTY

EXPLANATION

### SETTER’S SOLUTION

Can be found here.

### TESTER’S SOLUTION

Can be found here.

EXPLANATION

Can be found here.

Can be found here.

1 Like

Can anyone explain me how they come to that B(k) * t(n-k) and then to the recursion ? thanks a lot.

I m getting SIGABRT runtime error… Can anybody help me

my code is

http://www.codechef.com/viewsolution/4107952

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 2*k 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.

1 Like