From 5bcfdb3e0ca8893a6bbde1f522c7efa19378f6ae Mon Sep 17 00:00:00 2001
From: lkhyun <102892446+lkhyun@users.noreply.github.com>
Date: Mon, 10 Nov 2025 21:37:20 +0900
Subject: [PATCH] =?UTF-8?q?[20251110]=20BOJ=20/=20G5=20/=20=EC=BA=A0?=
 =?UTF-8?q?=ED=94=84=20=EC=A4=80=EB=B9=84=20/=20=EC=9D=B4=EA=B0=95?=
 =?UTF-8?q?=ED=98=84?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...0\355\224\204 \354\244\200\353\271\204.md" | 43 +++++++++++++++++++
 1 file changed, 43 insertions(+)
 create mode 100644 "lkhyun/202511/10 BOJ G5 \354\272\240\355\224\204 \354\244\200\353\271\204.md"

diff --git "a/lkhyun/202511/10 BOJ G5 \354\272\240\355\224\204 \354\244\200\353\271\204.md" "b/lkhyun/202511/10 BOJ G5 \354\272\240\355\224\204 \354\244\200\353\271\204.md"
new file mode 100644
index 00000000..b1c95d19
--- /dev/null
+++ "b/lkhyun/202511/10 BOJ G5 \354\272\240\355\224\204 \354\244\200\353\271\204.md"	
@@ -0,0 +1,43 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main{
+    static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+    static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+    static StringBuilder sb = new StringBuilder();
+    static StringTokenizer st;
+    static int N,L,R,X;
+    static int[] problems;
+    static int answer = 0;
+    public static void main(String[] args) throws Exception {
+        st = new StringTokenizer(br.readLine());
+        N = Integer.parseInt(st.nextToken());
+        L = Integer.parseInt(st.nextToken());
+        R = Integer.parseInt(st.nextToken());
+        X = Integer.parseInt(st.nextToken());
+
+        problems = new int[N];
+        st = new StringTokenizer(br.readLine());
+        for(int i=0; i<N;i++){
+            problems[i] = Integer.parseInt(st.nextToken());
+        }
+
+        select(0,0,Integer.MAX_VALUE,0,0);
+
+        bw.write(answer+"");
+        bw.close();
+    }
+    public static void select(int sum, int max, int min, int depth, int count){
+        if(depth == N){
+            if(L <= sum && sum <= R && (max-min) >= X && count >= 2) answer++;
+            return;
+        }
+        int newMax = Math.max(max,problems[depth]);
+        int newMin = Math.min(min,problems[depth]);
+        select(sum+problems[depth], newMax, newMin, depth+1, count+1);
+
+        select(sum, max, min, depth+1, count);
+    }
+}
+```