Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static void main(String[] args) {
- Scanner sc = new Scanner(System.in);
- int n = sc.nextInt();
- // memo[i][j] - broj na nacini da se postavat i+1 plocka taka sto poslednata plocka e vo boja j
- //j=0 crvena, j=1 sina, j=2 zolta, j=3 bela
- int [][] memo = new int[n][4];
- // 1 plocka moze da se postavi na 1 nacin
- memo[0][0] = memo[0][1] = memo[0][2] = memo[0][3] = 1;
- for(int i = 1;i<n;i++){
- // za ovie tri ne gi zemame vo predvid prethodnite so ista boja t.e
- // za memo[i][j] ne ja zemame memo[i-1][j] vo predvid
- memo[i][0] = memo[i-1][1] + memo[i-1][2] + memo[i-1][3];
- memo[i][1] = memo[i-1][0] + memo[i-1][2] + memo[i-1][3];
- memo[i][2] = memo[i-1][0] + memo[i-1][1] + memo[i-1][3];
- // samo za belata moze i prethodnata da bila bela
- memo[i][3] = memo[i-1][0] + memo[i-1][1] + memo[i-1][2] + memo[i-1][3];
- }
- //konecniot rezultat e sumata od posledniot red vo matricata
- int sum = 0;
- for(int i =0;i<4;i++){
- sum+= memo[n-1][i];
- }
- System.out.println(sum);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement