From 20febdf402f5a462811fa3ded60375c3df2a5d14 Mon Sep 17 00:00:00 2001
From: oncsr <khj20006@naver.com>
Date: Thu, 13 Feb 2025 09:04:46 +0900
Subject: [PATCH] =?UTF-8?q?[20250213]=20BOJ=20/=20G5=20/=20=EC=8B=9C?=
 =?UTF-8?q?=EC=B2=A0=EC=9D=B4=EA=B0=80=20=EC=82=AC=EB=9E=91=ED=95=9C=20GCD?=
 =?UTF-8?q?=20/=20=EA=B6=8C=ED=98=81=EC=A4=80?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 ...54\202\254\353\236\221\355\225\234 GCD.md" | 66 +++++++++++++++++++
 1 file changed, 66 insertions(+)
 create mode 100644 "khj20006/202502/13 BOJ G5 \354\213\234\354\262\240\354\235\264\352\260\200 \354\202\254\353\236\221\355\225\234 GCD.md"

diff --git "a/khj20006/202502/13 BOJ G5 \354\213\234\354\262\240\354\235\264\352\260\200 \354\202\254\353\236\221\355\225\234 GCD.md" "b/khj20006/202502/13 BOJ G5 \354\213\234\354\262\240\354\235\264\352\260\200 \354\202\254\353\236\221\355\225\234 GCD.md"
new file mode 100644
index 00000000..0d7f7fc4
--- /dev/null
+++ "b/khj20006/202502/13 BOJ G5 \354\213\234\354\262\240\354\235\264\352\260\200 \354\202\254\353\236\221\355\225\234 GCD.md"	
@@ -0,0 +1,66 @@
+```java
+
+import java.util.*;
+import java.io.*;
+
+
+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;
+
+	static void nextLine() throws Exception {st = new StringTokenizer(br.readLine());}
+	static int nextInt() {return Integer.parseInt(st.nextToken());}
+	static long nextLong() {return Long.parseLong(st.nextToken());}
+	static void bwEnd() throws Exception {bw.flush();bw.close();}
+	
+	// Additional field
+	static long[] A;
+	static int N;
+	
+	public static void main(String[] args) throws Exception {
+		
+		ready();
+		solve();
+	
+		bwEnd();
+	}
+	
+	static void ready() throws Exception{
+		
+		N = Integer.parseInt(br.readLine());
+		A = new long[N];
+		nextLine();
+		for(int i=0;i<N;i++) A[i] = nextLong();
+
+	}
+	
+	static void solve() throws Exception{
+
+		bw.write(find(0,N-1) + "\n");
+		
+	}
+	
+	static long find(int s, int e) {
+		if(s == e) return A[s];
+		int m=(s+e-1)/2;
+		long left = A[s], right = A[e];
+		for(int i=s+1;i<=m;i++) left = gcd(left, A[i]);
+		for(int i=m+1;i<e;i++) right = gcd(right, A[i]);
+		return Math.max(left + find(m+1,e), right + find(s,m));
+	}
+	
+	static long gcd(long a, long b) {
+		if(a < b) {
+			long temp = a;
+			a = b;
+			b = temp;
+		}
+		return a%b!=0 ? gcd(b,a%b) : b;
+	}
+	
+}
+
+```