[D1] Title: 간단한 N 의 약수, Time: 78 ms, Memory: 24,704 KB -BaekjoonHub

Author: shimhun99

SWEA/D1/1933. 간단한 N 의 약수/README.md

@@ -0,0 +1,15 @@
+# [D1] 간단한 N 의 약수 - 1933 
+
+[문제 링크](https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PhcWaAKIDFAUq) 
+
+### 성능 요약
+
+메모리: 24,704 KB, 시간: 78 ms, 코드길이: 711 Bytes
+
+### 제출 일자
+
+2025-09-25 15:00
+
+
+
+> 출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SWEA/D1/1933. 간단한 N 의 약수/간단한 N 의 약수.java

@@ -0,0 +1,31 @@
+import java.io.*;
+import java.util.*;
+
+class Solution
+{
+	public static void main(String args[]) throws Exception
+	{
+		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        int N = Integer.parseInt(br.readLine());
+        
+        if(N==1){
+        	System.out.println("1");
+        }
+        
+        List<Integer> list = new ArrayList<>();
+        
+        for(int i=1; i<=N/2; i++){
+            if(N%i==0){
+            	list.add(i);
+            }
+        }
+        
+        list.add(N);
+        //Collections.sort(list);
+        StringBuilder sb = new StringBuilder();
+         for(int ele : list){
+         	sb.append(ele + " ");
+         }
+        System.out.println(sb);
+    }
+}