/
BAEKJOON 1182
40 lines (39 loc) · 986 Bytes
/
BAEKJOON 1182
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
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
static boolean[] visit;
static int[] input;
static int N,S, ans;
public static void main(String[] args) throws Exception{
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());
S = Integer.parseInt(st.nextToken());
input = new int[N];
visit = new boolean[N];
st = new StringTokenizer(br.readLine());
for (int i = 0; i < N; i++) {
input[i] = Integer.parseInt(st.nextToken());
}
ans = S == 0? -1:0;
subset(0);
System.out.println(ans);
}
private static void subset(int index) {
if(index == N) {
int sum = 0;
for (int i = 0; i < N; i++) {
if(visit[i])
sum += input[i];
}
if(sum == S)
ans++;
return;
}
visit[index] = true;
subset(index+1);
visit[index] = false;
subset(index+1);
}
}