n=1 : 1
n=2 : 00 / 11
n=3 : 001 / 100 / 111
n=4 : 0000 / 0011 / 1100 / 1001 / 1111
n=5 : 00001 / 00100 / 10000 / 00111 / 10011 / 11001 / 11100 / 11111
...
|
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
|
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.IOException;
import java.util.Arrays;
public class Main{
public static void main(String[] args) throws IOException{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = Integer.parseInt(br.readLine());
int[] arr = new int[n+2];
Arrays.fill(arr, 987654321);
arr[1]=1;
arr[2]=2;
if(n>=3){
for(int i=3; i<=n; i++){
arr[i]=arr[i-1]+arr[i-2];
arr[i]%=15746;
}
}
System.out.println(arr[n]);
}
}
|
cs |
'백준 2 > DP' 카테고리의 다른 글
| [백준 1149] RGB거리 (Java) (0) | 2021.01.13 |
|---|---|
| [백준 9461] 파도반 수열 (Java) (0) | 2021.01.13 |
| [백준 9251] LCS (Java) (0) | 2020.12.16 |
| [백준 14501] 퇴사 (C++/Python) (0) | 2020.12.07 |
| [백준 9095] 1,2,3 더하기 (0) | 2020.12.07 |