From 9ad40731a709cd0da1c023482714886281aa266a Mon Sep 17 00:00:00 2001 From: Jonghwan Lee <123362165+0224LJH@users.noreply.github.com> Date: Wed, 17 Sep 2025 21:48:41 +0900 Subject: [PATCH] =?UTF-8?q?[20250917]=20BOJ=20/=20P4=20/=20=EC=98=A5?= =?UTF-8?q?=ED=86=A0=EB=81=BC=EB=8A=94=20=ED=86=B5=EC=8B=A0=EA=B5=90?= =?UTF-8?q?=EC=9C=A1=EC=9D=84=20=ED=92=80=EC=96=B4=EB=9D=BC!!=20/=20?= =?UTF-8?q?=EC=9D=B4=EC=A2=85=ED=99=98?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- ...\355\222\200\354\226\264\353\235\274!!.md" | 71 +++++++++++++++++++ 1 file changed, 71 insertions(+) create mode 100644 "0224LJH/202509/17 BOJ \354\230\245\355\206\240\353\201\274\353\212\224 \355\206\265\354\213\240\352\265\220\354\234\241\354\235\204 \355\222\200\354\226\264\353\235\274!!.md" diff --git "a/0224LJH/202509/17 BOJ \354\230\245\355\206\240\353\201\274\353\212\224 \355\206\265\354\213\240\352\265\220\354\234\241\354\235\204 \355\222\200\354\226\264\353\235\274!!.md" "b/0224LJH/202509/17 BOJ \354\230\245\355\206\240\353\201\274\353\212\224 \355\206\265\354\213\240\352\265\220\354\234\241\354\235\204 \355\222\200\354\226\264\353\235\274!!.md" new file mode 100644 index 00000000..6aa7555c --- /dev/null +++ "b/0224LJH/202509/17 BOJ \354\230\245\355\206\240\353\201\274\353\212\224 \355\206\265\354\213\240\352\265\220\354\234\241\354\235\204 \355\222\200\354\226\264\353\235\274!!.md" @@ -0,0 +1,71 @@ +```java +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.*; + +public class Main { + + static int problemCnt; + static Long ans; + static long [] arr; + + public static void main(String[] args) throws NumberFormatException, IOException { + init(); + process(); + print(); + } + + public static void init() throws NumberFormatException, IOException { + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + problemCnt = Integer.parseInt(br.readLine()); + StringTokenizer st = new StringTokenizer(br.readLine()); + ans = 1000_000_0000L; + arr = new long[problemCnt]; + for (int i = 0; i < problemCnt; i++) { + arr[i] = Long.parseLong(st.nextToken()); + } + + + + } + + public static void process() { + Long st = 1L; + Long end = 1000_000_001L; + Long mid = (st+end)/2; + + while(st < end) { + boolean result = test(mid); + + if (result) { + ans = Math.min(ans, mid); + end = mid; + } else st = mid+1; + + mid = (st+end)/2; + + } + } + + + private static boolean test(Long diff) { + long cnt = 0; + + for (int i = 0; i < problemCnt; i++) { + long result = arr[i]/diff; + if (arr[i]%diff ==0) result--; + cnt += result; + } + + if (cnt >= problemCnt) return false; + + + return true; + } + + public static void print() { + System.out.println(ans); + } +} +```