From 618069f79c46258ac30cc16f1d26db27f3af0d12 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=EA=B0=95=EC=8B=A0=EC=A7=80?=
 <101992179+ksinji@users.noreply.github.com>
Date: Tue, 16 Dec 2025 16:42:04 +0900
Subject: [PATCH] =?UTF-8?q?[20251216]=20BOJ=20/=20G5=20/=20=EC=BA=A0?=
 =?UTF-8?q?=ED=94=84=20=EC=A4=80=EB=B9=84=20/=20=EA=B0=95=EC=8B=A0?=
 =?UTF-8?q?=EC=A7=80?=
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" | 45 +++++++++++++++++++
 1 file changed, 45 insertions(+)
 create mode 100644 "ksinji/202512/16 BOJ \354\272\240\355\224\204 \354\244\200\353\271\204.md"

diff --git "a/ksinji/202512/16 BOJ \354\272\240\355\224\204 \354\244\200\353\271\204.md" "b/ksinji/202512/16 BOJ \354\272\240\355\224\204 \354\244\200\353\271\204.md"
new file mode 100644
index 00000000..79fc6df6
--- /dev/null
+++ "b/ksinji/202512/16 BOJ \354\272\240\355\224\204 \354\244\200\353\271\204.md"	
@@ -0,0 +1,45 @@
+```java
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    static int n, l, r, y;
+    static int[] a;
+    static int ans = 0;
+
+    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());
+        l = Integer.parseInt(st.nextToken());
+        r = Integer.parseInt(st.nextToken());
+        y = Integer.parseInt(st.nextToken());
+
+        a = new int[n];
+        st = new StringTokenizer(br.readLine());
+        for (int i = 0; i < n; i++) a[i] = Integer.parseInt(st.nextToken());
+
+        dfs(0, 0, 0, 0, 0);
+        System.out.println(ans);
+    }
+    
+    static void dfs(int idx, int cnt, int sum, int mn, int mx) {
+        if (sum > r) return;
+
+        if (idx == n) {
+            if (cnt >= 2 && sum >= l && sum <= r && (mx - mn) >= y) ans++;
+            return;
+        }
+
+        dfs(idx + 1, cnt, sum, mn, mx);
+
+        int v = a[idx];
+        if (cnt == 0) {
+            dfs(idx + 1, 1, sum + v, v, v);
+        } else {
+            dfs(idx + 1, cnt + 1, sum + v, Math.min(mn, v), Math.max(mx, v));
+        }
+    }
+}
+```