From 3ce5b3a18a3ba1d5093c03b44c1fa79e94d7417f Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Mon, 5 May 2025 22:39:17 +0900
Subject: [PATCH] =?UTF-8?q?[20250505]=20BOJ=20/=20G2=20/=20=EB=8F=84?=
 =?UTF-8?q?=ED=86=A0=EB=A6=AC=20=EC=88=A8=EA=B8=B0=EA=B8=B0=20/=20?=
 =?UTF-8?q?=EA=B6=8C=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...4 \354\210\250\352\270\260\352\270\260.md" | 65 +++++++++++++++++++
 1 file changed, 65 insertions(+)
 create mode 100644 "khj20006/202505/05 BOJ G2 \353\217\204\355\206\240\353\246\254 \354\210\250\352\270\260\352\270\260.md"

diff --git "a/khj20006/202505/05 BOJ G2 \353\217\204\355\206\240\353\246\254 \354\210\250\352\270\260\352\270\260.md" "b/khj20006/202505/05 BOJ G2 \353\217\204\355\206\240\353\246\254 \354\210\250\352\270\260\352\270\260.md"
new file mode 100644
index 00000000..c3487d73
--- /dev/null
+++ "b/khj20006/202505/05 BOJ G2 \353\217\204\355\206\240\353\246\254 \354\210\250\352\270\260\352\270\260.md"	
@@ -0,0 +1,65 @@
+```java
+import java.util.*;
+import java.io.*;
+
+public class Main {
+	
+	// IO field
+	static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+	static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
+	static StringTokenizer st = new StringTokenizer("");
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static String nextToken() throws Exception {
+		while(!st.hasMoreTokens()) nextLine();
+		return st.nextToken();
+	}
+	static int nextInt() throws Exception { return Integer.parseInt(nextToken()); }
+	static long nextLong() throws Exception { return Long.parseLong(nextToken()); }
+	static double nextDouble() throws Exception { return Double.parseDouble(nextToken()); }
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+	
+	static int N, K, D;
+	static int[][] rules;
+	
+	public static void main(String[] args) throws Exception {
+		
+		ready();
+		solve();
+		
+		bwEnd();
+		
+	}
+	
+	static void ready() throws Exception{
+		
+		N = nextInt();
+		K = nextInt();
+		D = nextInt();
+		rules = new int[K][3];
+		for(int i=0;i<K;i++) for(int j=0;j<3;j++) rules[i][j] = nextInt();
+				
+	}
+	
+	static void solve() throws Exception {
+		
+		int s = 1, e = N, m = (s+e)>>1;
+		while(s<e) {
+			long cnt = 0;
+			for(int[] rule : rules) {
+				int a = rule[0], b = rule[1], c = rule[2];
+				if(m < a) continue;
+				cnt += Math.min((m-a)/c + 1,  (b-a)/c + 1);
+			}
+			if(cnt < D) s = m+1;
+			else e = m;
+			m = (s+e)>>1;
+		}
+		bw.write(m + "\n");
+		
+	}
+	
+}
+```