From 880aff93ebd3c5a4a9e89a6d2dd364421682b697 Mon Sep 17 00:00:00 2001
From: Jonghwan Lee <123362165+0224LJH@users.noreply.github.com>
Date: Tue, 25 Nov 2025 12:09:24 +0900
Subject: [PATCH] =?UTF-8?q?[20251125]=20BOJ=20/=20P5=20/=20=ED=94=8C?=
 =?UTF-8?q?=EB=A0=88=EC=9D=B4=EB=A6=AC=EC=8A=A4=ED=8A=B8=20/=20=EC=9D=B4?=
 =?UTF-8?q?=EC=A2=85=ED=99=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...64\353\246\254\354\212\244\355\212\270.md" | 74 +++++++++++++++++++
 1 file changed, 74 insertions(+)
 create mode 100644 "0224LJH/202511/25 BOJ \355\224\214\353\240\210\354\235\264\353\246\254\354\212\244\355\212\270.md"

diff --git "a/0224LJH/202511/25 BOJ \355\224\214\353\240\210\354\235\264\353\246\254\354\212\244\355\212\270.md" "b/0224LJH/202511/25 BOJ \355\224\214\353\240\210\354\235\264\353\246\254\354\212\244\355\212\270.md"
new file mode 100644
index 00000000..a9fcf39b
--- /dev/null
+++ "b/0224LJH/202511/25 BOJ \355\224\214\353\240\210\354\235\264\353\246\254\354\212\244\355\212\270.md"	
@@ -0,0 +1,74 @@
+```java
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class Main {
+	
+	// dp[i][j]: i번째까지 k개의 숫자로 채운 경우
+	// -> dp[i]
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static long[][] dp;
+	static int songCnt, minDis, totalLen;
+	
+	static final long DIVISOR = 1_000_000_007l;
+	
+    public static void main(String[] args) throws IOException {
+
+        init();
+        process();
+    	print();
+
+    }
+    
+    private static void init() throws IOException{
+    	StringTokenizer st = new StringTokenizer(br.readLine());
+    	songCnt = Integer.parseInt(st.nextToken());
+    	minDis = Integer.parseInt(st.nextToken());
+    	totalLen = Integer.parseInt(st.nextToken());
+    	dp = new long[totalLen+1][songCnt+1];
+    	dp[1][1] = songCnt;
+    }
+    
+    private static void process() throws IOException {
+    	for (int i = 2; i <= totalLen; i++) {
+    		if (i <= minDis) {
+    			// 아직 총 길이가 간격보다 적은 경우. 
+    			// 그냥 i개의 노래로 줄세우는 것과 동일하다.
+    			dp[i][i] = (dp[i-1][i-1] * (songCnt-i+1))%DIVISOR;
+    			continue;
+    		}
+    		
+    		//적어도 minDis개 만큼의 부분배열에서는 겹치는게 없다는 것을 고려하자
+    		for (int j = 1; j <= songCnt; j++) {
+    			if (dp[i-1][j] == 0) continue;
+    			
+    			//이전에 있는 것과 동일한 것을 선택하는 경우
+    			//이 경우, curSongCnt - minDis개의 선택지가 존재하게 된다.
+    			dp[i][j] += dp[i-1][j] * (j - minDis);
+    			dp[i][j] %= DIVISOR;
+    			
+    			// 이전과 다른 것을 선택하는 경우
+    			if (j == songCnt) continue;
+    			dp[i][j+1] += dp[i-1][j] * (songCnt - j);
+    			dp[i][j+1] %= DIVISOR;
+    		}
+    	}
+    	
+    }
+    
+
+    
+    
+
+    
+    
+
+	private static void print() {
+		System.out.println(dp[totalLen][songCnt]);
+    }
+
+}
+```