diff --git a/.gitignore b/.gitignore
index ad46b30..500f3f6 100644
--- a/.gitignore
+++ b/.gitignore
@@ -59,3 +59,6 @@ typings/
 
 # next.js build output
 .next
+
+# for cpp
+a.out
diff --git a/190624/2580-sudoku.cpp b/190624/2580-sudoku.cpp
new file mode 100644
index 0000000..3e575f0
--- /dev/null
+++ b/190624/2580-sudoku.cpp
@@ -0,0 +1,54 @@
+#include <iostream>
+#include <map>
+
+int b[9][9];
+
+using namespace std;
+
+vector<int> findNums(int i,int j) {
+	//map <int, bool> nums;
+	//checkv(i, nums);
+	//checkh(j, nums);
+	//checkbox(i,j, nums);
+}
+
+bool find = false;
+
+void fillNums(int i, int j) {
+	if (find) return;
+	if (i == 9 && j == 9 && b[i][j] != 0) {
+		find = true;
+		return;
+	}
+
+	int jn = j < 9 ? j + 1: j;
+	int in = jn == j && i < 9; i + 1: i;
+
+	if (b[i][j] == 0) {
+		vector <int> nums = findNums(i,j);
+		if (nums.size() == 0) return;
+		for (auto n: nums) {
+			board[i][j] = n;
+			fillNums(in, jn);
+		}
+	}
+	return;
+}
+
+int main() {
+	char c;
+	for (int i = 0; i < 9; i++) {
+		for (int j = 0; j < 9; j++) {
+			cin >> c;
+			b[i][j] = c - '0';
+		}
+	}
+	fillNums(0,0);
+	for (int i = 0; i < 9; i++) {
+		for (int j = 0; j < 9; j++) {
+			cout << b[i][j] << " ";
+		}
+		cout << "\n";
+	}
+	return 0;
+}
diff --git a/190624/input.txt b/190624/input.txt
new file mode 100644
index 0000000..2ea6910
--- /dev/null
+++ b/190624/input.txt
@@ -0,0 +1,9 @@
+0 3 5 4 6 9 2 7 8
+7 8 2 1 0 5 6 0 9
+0 6 0 2 7 8 1 3 5
+3 2 1 0 4 6 8 9 7
+8 0 4 9 1 3 5 0 6
+5 9 6 8 2 0 4 1 3
+9 1 7 6 5 2 0 8 0
+6 0 3 7 0 1 9 5 2
+2 5 8 3 9 4 7 6 0
diff --git a/200204/60057-Solution.java b/200204/60057-Solution.java
new file mode 100644
index 0000000..aec7a94
--- /dev/null
+++ b/200204/60057-Solution.java
@@ -0,0 +1,56 @@
+//programmers 60057 카카오 공채 문자열 압축
+//어렵진 않은데 시간이 오래 걸렸다.
+
+import java.util.List;
+import java.util.ArrayList;
+
+class Solution {
+    
+    private List<String> cutString(String origin, int size) {
+        List<String> ret = new ArrayList<>();
+        for (int i = 0; i < origin.length(); i += size) {
+            int e = (i + size) > origin.length() ? origin.length(): i + size;
+            String str = origin.substring(i, e);
+            ret.add(str);
+        }
+        return ret;
+    }
+
+    private String findCompressString(String str, int size) {
+        List<String> slist = cutString(str, size);
+
+        int count = 0;
+        StringBuffer newStr = new StringBuffer();
+
+        String prev = slist.get(0);
+        newStr.append(prev);
+        int repeat = 1;
+        for (int i = 1; i < slist.size(); i++) {
+            String curr = slist.get(i);
+            if(curr.equals(prev)) {
+                repeat++;
+            } else {
+                if (repeat != 1) {
+                    newStr.append(Integer.toString(repeat));
+                    repeat = 1;
+                }
+                newStr.append(curr);
+                prev = curr;
+            }
+        }
+
+        if (repeat != 1) {
+            newStr.append(Integer.toString(repeat));
+        }
+        return newStr.toString();
+    }
+    
+    public int solution(String s) {
+       int ans = s.length();
+        for(int i = 1; i < s.length(); i++) {
+            ans = Math.min(ans, findCompressString(s, i).length());
+        }
+        return ans;
+    }
+}
+