Does anyone else find the description highly complicated? I don't understand how the input values relate to the problem...

bayleef needs to spend time trying to get his explainations better

Can anyone tell what the excatly function f(n,d) is ?

I am not able to get problem exactely. Can any one Around Here Who tell about problem statement clear to me just explain the problem not the solution.

As my code times out, I wonder how can we be sure that the sum s(d) is finite?

For example, if I test the case b=10 and d=1, I get:

f(n,1)=n for n=0

f(n,1)=n for n=1

f(n,1)=n for n=199981

f(n,1)=n for n=199982

f(n,1)=n for n=199983

f(n,1)=n for n=199984

f(n,1)=n for n=199985

f(n,1)=n for n=199986

f(n,1)=n for n=199987

f(n,1)=n for n=199988

f(n,1)=n for n=199989

f(n,1)=n for n=199990

f(n,1)=n for n=200000

f(n,1)=n for n=200001

f(n,1)=n for n=1599981

...

f(n,1)=n for n=35199990

f(n,1)=n for n=35200000

f(n,1)=n for n=35200001

....