dp problem.find the number of ways

Revision en2, by LegendRanger, 2024-04-18 20:41:41

You are given three coins numbered 1, 2, and 3. Your objective is to make the number n=10 using these coins, but you cannot select the same coin consecutively. For instance, combinations like 1+2+2 or 2+2+3 are not valid but 1+2+3 or 1+2+1 valid. coins can be any type of coins and n can be any number. Find the number of ways to achieve this.

Tags dp problem

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English LegendRanger 2024-04-18 20:41:41 25 Tiny change: ' not valid. co' -> ' not valid but 1+2+3 or 1+2+1 valid. co'
en1 English LegendRanger 2024-04-18 20:39:55 352 Initial revision (published)