Merge pull request #1306 from AlgorithmWithGod/0224LJH

[20251031] BOJ / G5 / 다이어트 / 이종환

Author: JHLEE325

0224LJH/202510/31 BOJ 다이어트.md

@@ -0,0 +1,56 @@
+```java
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+
+public class Main { 
+	
+	static long diff;
+	static StringBuilder sb = new StringBuilder();
+	
+	
+    public static void main(String[] args) throws IOException {
+    	init();
+    	process();
+    	print();
+    }
+
+    private static void init() throws IOException{
+    	BufferedReader br = new BufferedReader(new InputStreamReader(System.in));;
+    	diff = Integer.parseInt(br.readLine());
+    }
+    
+    private static void process() {
+    	
+    	long pre =1l;
+        boolean isEmpty = true;
+    	for (long i = 2; i <= 500000; i++) {
+    		long num = i*i;
+    		if (num - pre > diff) break;
+    		pre = num;
+    		
+    		long target = num - diff;
+    		if (target == 0) continue;
+    		long sqrt = (long) Math.sqrt(target);
+    		if (sqrt*sqrt != target) continue;
+    		isEmpty = false;
+    		sb.append(i).append("\n");
+    		
+    		
+    		
+    	}
+    	
+    	if(isEmpty)sb.append("-1");
+
+    }
+    
+
+    
+    private static void print() {
+    	System.out.println(sb.toString());
+    }
+}
+
+
+```

0224LJH/202511/03 PGM 뒤에 있는 큰 수 찾기.md

@@ -0,0 +1,30 @@
+```java
+import java.io.*;
+import java.util.*;
+
+class Solution {
+    public int[] solution(int[] numbers) {
+        int n = numbers.length;
+        int[] answer = new int[n];
+        Stack<Integer> stack = new Stack<>();
+
+        for (int i = n - 1; i >= 0; i--) {
+            // 현재 원소보다 작거나 같은 스택의 원소들을 제거
+            while (!stack.isEmpty() && stack.peek() <= numbers[i]) {
+                stack.pop();
+            }
+            
+            if (stack.isEmpty()) {
+                answer[i] = -1;
+            } else {
+                // 스택의 맨 위가 뒷 큰수
+                answer[i] = stack.peek();
+            }
+
+            stack.push(numbers[i]);
+        }
+        
+        return answer;
+    }
+}
+```