-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA001_PRG_타겟넘버.java
43 lines (32 loc) · 1.05 KB
/
A001_PRG_타겟넘버.java
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
31
32
33
34
35
36
37
38
39
40
41
42
43
import java.io.BufferedReader;
import java.io.InputStreamReader;
// 아직 푸는 중 - dfs
public class A001_PRG_타겟넘버 {
static int[] numbers;
static int target;
static int cnt = -1;
static int answer;
public static int solution(int[] numbers, int target) {
A001_PRG_타겟넘버.numbers = numbers;
A001_PRG_타겟넘버.target = target;
dfs(-1);
return answer;
}
public static void dfs(int value) {
if (cnt == numbers.length || value == target) {
return;
}
dfs(numbers[cnt + 1] + answer);
dfs(numbers[cnt + 1] - answer);
}
public static void main(String[] args) throws Exception {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
String[] numberS = br.readLine().split(" ");
int[] numbers = new int[numberS.length];
for (int i = 0; i < numberS.length; i++) {
numbers[i] = Integer.parseInt(numberS[i]);
}
int target = Integer.parseInt(br.readLine());
System.out.println(solution(numbers, target));
}
}