Redirecting to
NADOS

Paint House

  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, representing the number of houses.
2. In the next n rows, you are given 3 space separated numbers representing the cost of painting nth house with red or blue or green color.
3. You are required to calculate and print the minimum cost of painting all houses without painting any consecutive house with same color.
Input Format 
A number n
n1red n1blue n1green
n2red n2blue n2green
.. n number of elements
Output Format 
A number representing the minimum cost of painting all houses without painting any consecutive house with same color.
Question Video
Constraints 
1 <= n <= 1000
0 <= n1red, n1blue, .. <= 1000
Sample Input 
4
1 5 7
5 8 4
3 2 9
1 2 4
Sample Output 
8


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name