From 7b3e0fa8c33a3de448675331c84f948a7013c54a Mon Sep 17 00:00:00 2001
From: asqwklop12 <33236685+asqwklop12@users.noreply.github.com>
Date: Tue, 17 Feb 2026 13:07:24 +0900
Subject: [PATCH] =?UTF-8?q?=EB=8C=80=EB=B6=80=EB=B6=84=EC=9D=98=20?=
 =?UTF-8?q?=EB=B0=B0=EC=88=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../Main.java"                                | 51 +++++++++++++++++++
 1 file changed, 51 insertions(+)
 create mode 100644 "pr/\353\214\200\353\266\200\353\266\204\354\235\230 \353\260\260\354\210\230/Main.java"

diff --git "a/pr/\353\214\200\353\266\200\353\266\204\354\235\230 \353\260\260\354\210\230/Main.java" "b/pr/\353\214\200\353\266\200\353\266\204\354\235\230 \353\260\260\354\210\230/Main.java"
new file mode 100644
index 0000000..2799348
--- /dev/null
+++ "b/pr/\353\214\200\353\266\200\353\266\204\354\235\230 \353\260\260\354\210\230/Main.java"	
@@ -0,0 +1,51 @@
+import java.util.*;
+
+public class Main {
+    static int[] arr = new int[5];
+
+    static int min = Integer.MAX_VALUE;
+
+    public static void main(String[] args) {
+
+        Scanner sc = new Scanner(System.in);
+
+        for (int i = 0; i < 5; i++) {
+            arr[i] = sc.nextInt();
+        }
+
+        solve();
+
+    }
+
+    public static void solve() {
+
+        for (int i = 0; i < 5; i++) {
+            for (int j = i + 1; j < 5; j++) {
+                for (int k = j + 1; k < 5; k++) {
+                    int lcm = lcm(arr[i], arr[j], arr[k]);
+                    min = Math.min(min, lcm);
+                }
+            }
+        }
+
+        System.out.println(min);
+    }
+
+    public static int gcd(int a, int b) {
+        while (b != 0) {
+            int temp = b;
+            b = a % b;
+            a = temp;
+        }
+        return a;
+    }
+
+    public static int lcm(int a, int b) {
+        return (a * b) / gcd(a, b);
+    }
+
+    public static int lcm(int a, int b, int c) {
+        return lcm(lcm(a, b), c);
+    }
+
+}