Skip to content

Commit c3a51c6

Browse files
authored
[20250722] BOJ / G5 / 캠프 준비 / 설진영
1 parent f4e38f9 commit c3a51c6

File tree

1 file changed

+48
-0
lines changed

1 file changed

+48
-0
lines changed
Lines changed: 48 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,48 @@
1+
```java
2+
import java.io.*;
3+
import java.util.*;
4+
5+
public class Main {
6+
public static void main(String[] args) throws IOException {
7+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
8+
StringTokenizer st = new StringTokenizer(br.readLine());
9+
10+
int n = Integer.parseInt(st.nextToken());
11+
int l = Integer.parseInt(st.nextToken());
12+
int r = Integer.parseInt(st.nextToken());
13+
int x = Integer.parseInt(st.nextToken());
14+
15+
int[] a = new int[n];
16+
st = new StringTokenizer(br.readLine());
17+
for (int i = 0; i < n; i++) {
18+
a[i] = Integer.parseInt(st.nextToken());
19+
}
20+
21+
Arrays.sort(a);
22+
23+
int answer = 0;
24+
25+
for (int mask = 1; mask < (1 << n); mask++) {
26+
if (Integer.bitCount(mask) < 2) continue;
27+
28+
int sum = 0;
29+
int min = Integer.MAX_VALUE;
30+
int max = Integer.MIN_VALUE;
31+
32+
for (int i = 0; i < n; i++) {
33+
if ((mask & (1 << i)) != 0) {
34+
sum += a[i];
35+
min = Math.min(min, a[i]);
36+
max = Math.max(max, a[i]);
37+
}
38+
}
39+
40+
if (sum >= l && sum <= r && max - min >= x) {
41+
answer++;
42+
}
43+
}
44+
45+
System.out.println(answer);
46+
}
47+
}
48+
```

0 commit comments

Comments
 (0)