FilesExpand file tree

 master

/

Q11727.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

30 lines (26 loc) · 935 Bytes

 master

/

Q11727.java

Top

File metadata and controls

• Code
• Blame

30 lines (26 loc) · 935 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

/**

* Date: 2018. 08. 09.

* Author: inhyuck | https://github.com/inhyuck

* Solution URL: https://github.com/skhucode/skhucode-inhyuck

* Title: 2 x n 타일링 2

* Problem: 2×n 크기의 직사각형을 1×2, 2×1, 2x2 타일로 채우는

* 방법의 수를 구하는 프로그램을 작성하시오.

* URL: https://www.acmicpc.net/problem/11727

*/

package io.inhyuck.dp;

import java.util.*;

public class Q11727 {

public static int[] dp;

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

int n = scanner.nextInt();

// dp[n] | 2 x n 크기의 직사각형을 채우는 방법의 수

dp = new int[n + 1];

dp[0] = 1; // dp[n] = dp[n-1] + dp[n-2] * 2 를 위한 명시적 조건

dp[1] = 1;

for (int i = 2; i <= n; i++) {

dp[i] = (dp[i - 1] + dp[i - 2] * 2) % 10007;

}

System.out.println(dp[n]);

}

}