Today i tried to solve this problem

the simplified version of the problem is no ways of assigning 2 different objects in n different places. so in this problem 2 different objects are carrot and baby carrot. we are given no of places

we have to print no ways of plant this two different carrots in n places .

how to solve this ?

hi how to solve the problem change from the spoj (http://www.spoj.com/problems/TPC07/)

i read concrete mathematics chapter 7 about coin change. but i can't able to understand can anybody help me to get idea about solving this problem ?