Redirecting to
NADOS

Paint Fence

  Prev   Next

Try First, Check Solution later

1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach.

1. You are given a number n and a number k in separate lines, representing the number of fences and number of colors.
2. You are required to calculate and print the number of ways in which the fences could be painted so that not more than two consecutive  fences have same colors.
Input Format 
A number n
A number k
Output Format 
A number representing the number of ways in which the fences could be painted so that not more than two fences have same colors.
Question Video
Constraints 
1 <= n <= 10
1 <= k <= 10
Sample Input 
8
3
Sample Output 
3672


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name