From 86384c01e2ea98db1d82cb5f7860c284a1c4dd91 Mon Sep 17 00:00:00 2001 From: Ukj0ng <90972240+Ukj0ng@users.noreply.github.com> Date: Tue, 23 Dec 2025 19:32:41 +0900 Subject: [PATCH] =?UTF-8?q?[20251223]=20BOJ=20/=20G3=20/=20=EC=A4=80?= =?UTF-8?q?=EC=98=A4=EB=8A=94=20=EC=8B=AC=EC=88=A0=EC=9F=81=EC=9D=B4!!=20/?= =?UTF-8?q?=20=ED=95=9C=EC=A2=85=EC=9A=B1?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...\354\210\240\354\237\201\354\235\264!!.md" | 51 +++++++++++++++++++ 1 file changed, 51 insertions(+) create mode 100644 "Ukj0ng/202512/23 BOJ G3 \354\244\200\354\230\244\353\212\224 \354\213\254\354\210\240\354\237\201\354\235\264!!.md" diff --git "a/Ukj0ng/202512/23 BOJ G3 \354\244\200\354\230\244\353\212\224 \354\213\254\354\210\240\354\237\201\354\235\264!!.md" "b/Ukj0ng/202512/23 BOJ G3 \354\244\200\354\230\244\353\212\224 \354\213\254\354\210\240\354\237\201\354\235\264!!.md" new file mode 100644 index 00000000..a69a6e13 --- /dev/null +++ "b/Ukj0ng/202512/23 BOJ G3 \354\244\200\354\230\244\353\212\224 \354\213\254\354\210\240\354\237\201\354\235\264!!.md" @@ -0,0 +1,51 @@ +``` +import java.io.*; +import java.util.StringTokenizer; + +public class Main { + private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out)); + private static final int MOD = (int) 1e9+7; + private static int[][] dp; + private static int s; + private static String str; + + public static void main(String[] args) throws IOException { + init(); + DP(); + + bw.write(dp[str.length()][s] + "\n"); + bw.flush(); + bw.close(); + br.close(); + } + + private static void init() throws IOException { + s = Integer.parseInt(br.readLine()); + str = br.readLine(); + + dp = new int[str.length()+1][s+1]; + + dp[0][0] = 1; + for (int i = 1; i <= str.length(); i++) { + dp[i][0] = 1; + } + for (int i = 1; i <= s && i <= 25; i++) { + dp[1][i] = 1; + } + } + + private static void DP() { + for (int i = 2; i <= str.length(); i++) { + for (int j = 1; j <= s; j++) { + if (j >= 26) { + int val = (dp[i][j-1] + dp[i-1][j]) % MOD; + dp[i][j] = (val - dp[i-1][j-26] + MOD) % MOD; + } else { + dp[i][j] = (dp[i][j-1] + dp[i-1][j]) % MOD; + } + } + } + } +} +```