From c8d5426404d7dc849c82c9230ab8815bbf23d38f Mon Sep 17 00:00:00 2001
From: sukangpunch <popora99@naver.com>
Date: Mon, 5 Jan 2026 13:29:31 +0900
Subject: [PATCH 1/2] =?UTF-8?q?[Week01]=20BOJ=5F10828:=20=EC=8A=A4?=
 =?UTF-8?q?=ED=83=9D?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../sukangpunch.java"                         | 71 +++++++++++++++++++
 1 file changed, 71 insertions(+)
 create mode 100644 "weekly/week01/BOJ_10828_\354\212\244\355\203\235/sukangpunch.java"

diff --git "a/weekly/week01/BOJ_10828_\354\212\244\355\203\235/sukangpunch.java" "b/weekly/week01/BOJ_10828_\354\212\244\355\203\235/sukangpunch.java"
new file mode 100644
index 0000000..5124740
--- /dev/null
+++ "b/weekly/week01/BOJ_10828_\354\212\244\355\203\235/sukangpunch.java"
@@ -0,0 +1,71 @@
+package stduy.week01;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+
+// 스택
+public class BOJ_10828 {
+    static class MyStack{
+        int [] st;
+        int top;
+
+        public MyStack(int size){
+            this.st = new int[size];
+            this.top = -1;
+        }
+
+        public void push(int x){
+            st[++top] = x;
+        }
+
+        public int pop(){
+            if(top == -1){
+                return -1;
+            }
+
+            return st[top--];
+        }
+
+        public int size(){
+            return top + 1;
+        }
+
+        public int empty(){
+            if(top == -1){
+                return 1;
+            }
+
+            return 0;
+        }
+
+        public int top(){
+            if(top == -1){
+                return -1;
+            }
+
+            return st[top];
+        }
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        int N = Integer.parseInt(br.readLine());
+
+        MyStack stack = new MyStack(N);
+        for (int i = 0; i < N; i++) {
+            String []s = br.readLine().split(" ");
+
+            switch(s[0]){
+                case "push": stack.push(Integer.parseInt(s[1])); break;
+                case "pop": sb.append(stack.pop()).append("\n"); break;
+                case "size": sb.append(stack.size()).append("\n"); break;
+                case "empty": sb.append(stack.empty()).append("\n"); break;
+                case "top": sb.append(stack.top()).append("\n"); break;
+            }
+        }
+        System.out.println(sb);
+    }
+}

From 3cfe09e06490319777ebacdb3a09f07e6f1461ea Mon Sep 17 00:00:00 2001
From: sukangpunch <popora99@naver.com>
Date: Mon, 5 Jan 2026 13:55:03 +0900
Subject: [PATCH 2/2] =?UTF-8?q?[Week01]=20BOJ=5F1920:=20=EC=88=98=20?=
 =?UTF-8?q?=EC=B0=BE=EA=B8=B0?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 .../sukangpunch.java"                         | 53 +++++++++++++++++++
 1 file changed, 53 insertions(+)
 create mode 100644 "weekly/week01/BOJ_1920_\354\210\230 \354\260\276\352\270\260/sukangpunch.java"

diff --git "a/weekly/week01/BOJ_1920_\354\210\230 \354\260\276\352\270\260/sukangpunch.java" "b/weekly/week01/BOJ_1920_\354\210\230 \354\260\276\352\270\260/sukangpunch.java"
new file mode 100644
index 0000000..7a32e13
--- /dev/null
+++ "b/weekly/week01/BOJ_1920_\354\210\230 \354\260\276\352\270\260/sukangpunch.java"	
@@ -0,0 +1,53 @@
+package stduy.week01;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+
+public class BOJ_1920 {
+
+    static int [] A;
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
+        StringBuilder sb = new StringBuilder();
+
+        int N = Integer.parseInt(br.readLine());
+        String [] s = br.readLine().split(" ");
+        A = new int[N];
+        for(int i=0;i<N;i++){
+            A[i] = Integer.parseInt(s[i]);
+        }
+        Arrays.sort(A);
+
+        int M = Integer.parseInt(br.readLine());
+        s = br.readLine().split(" ");
+
+        for(int i=0;i<M;i++){
+            int num = Integer.parseInt(s[i]);
+            int result = findNumByBinarySearch(0, N - 1, num);
+            sb.append(result).append("\n");
+        }
+
+        System.out.println(sb);
+
+    }
+
+    private static int findNumByBinarySearch(int start, int end, int target) {
+        if(start > end){
+            return 0;
+        }
+
+        int mid = (start + end) / 2;
+
+        if(A[mid] == target){
+            return 1;
+        }else if(A[mid] > target){
+            return findNumByBinarySearch(start, mid - 1, target);
+        }else{
+            return findNumByBinarySearch(mid + 1, end, target);
+        }
+    }
+
+}