Ada and Carrot

Revision en1, by Ram_Negative, 2017-12-25 09:57:51

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 ?

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English Ram_Negative 2017-12-25 09:57:51 398 Initial revision (published)