diff --git a/.DS_Store b/.DS_Store
new file mode 100644
index 0000000..65f8be3
Binary files /dev/null and b/.DS_Store differ
diff --git a/.gitignore b/.gitignore
index 020f12a..9b9e7f3 100644
--- a/.gitignore
+++ b/.gitignore
@@ -1 +1,3 @@
 notjustmoney/*.exe
+.idea/*
+*.iml
\ No newline at end of file
diff --git a/jochanmin/20201226/2104.txt b/9mean/20220109/12896.txt
similarity index 100%
rename from jochanmin/20201226/2104.txt
rename to 9mean/20220109/12896.txt
diff --git a/9mean/20220123/11509.txt b/9mean/20220123/11509.txt
new file mode 100644
index 0000000..2a56062
--- /dev/null
+++ b/9mean/20220123/11509.txt
@@ -0,0 +1,10 @@
+n=int(input())
+h=list(map(int, input().split()))
+arrow=[0]*(n+1)
+for i in range(n):
+    if arrow[h[i]]:
+        arrow[h[i]]-=1
+        arrow[h[i]-1]+=1
+    else:
+        arrow[h[i]-1]+=1
+print(sum(arrow))
\ No newline at end of file
diff --git a/9mean/20220123/14950.txt b/9mean/20220123/14950.txt
new file mode 100644
index 0000000..3553b75
--- /dev/null
+++ b/9mean/20220123/14950.txt
@@ -0,0 +1,31 @@
+import heapq
+
+n, m, t = map(int, input().split())
+parent = [i for i in range(n+1)]
+pq = []
+
+def find(x):
+    if parent[x] == x:
+        return x
+    parent[x] = find(parent[x])
+    return parent[x]
+
+def union(x, y):
+    parent[find(y)] = find(x)
+    find(y)
+
+for i in range(m):
+    a, b, c = map(int, input().split())
+    heapq.heappush(pq, (c, a, b))
+
+ans = 0
+i = 0
+
+while pq:
+    c, a, b = map(int, heapq.heappop(pq))
+    if find(a) != find(b):
+        union(a,b)
+        ans += c + i*t
+        i+=1
+
+print(ans)
\ No newline at end of file
diff --git a/9mean/20220123/4096.txt b/9mean/20220123/4096.txt
new file mode 100644
index 0000000..823ed0e
--- /dev/null
+++ b/9mean/20220123/4096.txt
@@ -0,0 +1,25 @@
+def findPel(s):
+	e=len(s)//2
+	cnt=0
+	for i in range(e):
+		if s[i]==s[len(s)-i-1]:
+			cnt+=1
+	if cnt==e:
+		return 1
+	else:
+		return 0
+			
+while True:
+	a=input()
+	aLen=len(a)
+	res=0
+	if a=='0':
+		break
+	else:
+		while findPel(a)!=1:
+			res+=1
+			a=str(int(a)+1)
+			a=(aLen-len(a))*'0'+a
+		else:
+			print(res)
+	
\ No newline at end of file
diff --git a/9mean/20220306/9375.py b/9mean/20220306/9375.py
new file mode 100644
index 0000000..90219df
--- /dev/null
+++ b/9mean/20220306/9375.py
@@ -0,0 +1,14 @@
+t = int(input())
+for i in range(t):
+    n = int(input())
+    weardict = {}
+    for j in range(n):
+        wear = list(input().split())
+        if wear[1] in weardict:
+            weardict[wear[1]].append(wear[0])
+        else:
+            weardict[wear[1]] = [wear[0]]
+    cnt = 1
+    for k in weardict:
+        cnt = cnt * (len(weardict[k]) + 1)
+    print(cnt - 1)
diff --git a/9mean/20220313/11568.py b/9mean/20220313/11568.py
new file mode 100644
index 0000000..ffb9f02
--- /dev/null
+++ b/9mean/20220313/11568.py
@@ -0,0 +1,26 @@
+global lis
+
+
+def binarySearch(l, r, x):
+    while l <= r:
+        mid = (l + r) // 2
+        if lis[mid] < x:
+            l = mid + 1
+        else:
+            r = mid - 1
+    return r
+
+
+n = int(input())
+card = list(map(int, input().split()))
+lis = []
+lis.append(card[0])
+j = 0
+for i in range(1, n):
+    if lis[j] < card[i]:
+        lis.append(card[i])
+        j += 1
+    else:
+        idx = binarySearch(0, j, card[i])
+        lis[idx] = card[i]
+print(len(lis))
\ No newline at end of file
diff --git a/9mean/20220313/14595.py b/9mean/20220313/14595.py
new file mode 100644
index 0000000..46348ca
--- /dev/null
+++ b/9mean/20220313/14595.py
@@ -0,0 +1,16 @@
+n = int(input())
+m = int(input())
+right = 0
+cnt = 0
+attackList = []
+for i in range(m):
+    x, y = map(int, input().split())
+    attackList.append((x, y))
+attackList.sort()
+for x, y in attackList:
+    if right < x:
+        cnt += x - right
+    if right < y:
+        right = y
+cnt += n - right
+print(cnt)
diff --git a/9mean/20220313/15644.py b/9mean/20220313/15644.py
new file mode 100644
index 0000000..e139896
--- /dev/null
+++ b/9mean/20220313/15644.py
@@ -0,0 +1,23 @@
+# 엔과 엠 (10)
+n, m = map(int, input().split(' '))
+number = list(map(int, input().split(' ')))
+number.sort()
+array = []
+result = []
+
+
+def solve(level, index):
+    if level == m:
+        a = ' '.join(map(str, array))
+        if a not in result:
+            result.append(a)
+            print(a)
+        return
+
+    for i in range(index, n):  #핵심 부분
+        array.append(number[i])
+        solve(level + 1, i + 1)
+        array.pop()
+
+
+solve(0, 0)
diff --git a/9mean/20220313/1864.py b/9mean/20220313/1864.py
new file mode 100644
index 0000000..8349f57
--- /dev/null
+++ b/9mean/20220313/1864.py
@@ -0,0 +1,22 @@
+numDict = {
+    "-": 0,
+    '\\': 1,
+    "(": 2,
+    "@": 3,
+    "?": 4,
+    ">": 5,
+    "&": 6,
+    "%": 7,
+    "/": -1
+}
+while (1):
+    a = list(input())
+    if a[0] == '#':
+        break
+    a.reverse()
+    k = 1
+    res = 0
+    for x in a:
+        res += numDict[x] * k
+        k *= 8
+    print(res)
diff --git a/9mean/20220320/11279.py b/9mean/20220320/11279.py
new file mode 100644
index 0000000..5f5e04f
--- /dev/null
+++ b/9mean/20220320/11279.py
@@ -0,0 +1,14 @@
+import heapq as hq
+import sys
+
+n = int(input())
+heap = []
+for i in range(n):
+    num = int(sys.stdin.readline())
+    if num == 0:
+        if len(heap) >= 1:
+            print(-1 * hq.heappop(heap))
+        else:
+            print(0)
+    else:
+        hq.heappush(heap, (-num))
diff --git a/9mean/20220320/19539.py b/9mean/20220320/19539.py
new file mode 100644
index 0000000..e02c83e
--- /dev/null
+++ b/9mean/20220320/19539.py
@@ -0,0 +1,14 @@
+n = int(input())
+tree = list(map(int, input().split()))
+flag = 0
+sum2 = 0
+sum1 = sum(tree)
+for x in tree:
+    sum2 += x // 2
+if sum1 % 3 == 0:
+    if sum2 >= sum1 // 3:
+        print("YES")
+    else:
+        print("NO")
+else:
+    print("NO")
diff --git a/9mean/20220320/20154.py b/9mean/20220320/20154.py
new file mode 100644
index 0000000..942ffca
--- /dev/null
+++ b/9mean/20220320/20154.py
@@ -0,0 +1,37 @@
+s = input()
+table = {
+    'A': 3,
+    'B': 2,
+    'C': 1,
+    'D': 2,
+    'E': 3,
+    'F': 3,
+    'G': 3,
+    'H': 3,
+    'I': 1,
+    'J': 1,
+    'K': 3,
+    'L': 1,
+    'M': 3,
+    'N': 3,
+    'O': 1,
+    'P': 2,
+    'Q': 2,
+    'R': 2,
+    'S': 1,
+    'T': 2,
+    'U': 1,
+    'V': 1,
+    'W': 2,
+    'X': 2,
+    'Y': 2,
+    'Z': 1
+}
+res = 0
+for x in s:
+    res += table[x]
+    res = res % 10
+if res % 2 == 0:
+    print("You're the winner?")
+else:
+    print("I'm a winner!")
\ No newline at end of file
diff --git a/9mean/20220320/5624.py b/9mean/20220320/5624.py
new file mode 100644
index 0000000..10dee73
--- /dev/null
+++ b/9mean/20220320/5624.py
@@ -0,0 +1,12 @@
+n = int(input())
+numList = list(map(int, input().split()))
+visited = [0] * 400001
+cnt = 0
+for i in range(n):
+    for j in range(i):
+        if visited[numList[i] - numList[j] + 200000] == 1:
+            cnt += 1
+            break
+    for j in range(i + 1):
+        visited[numList[i] + numList[j] + 200000] = 1
+print(cnt)
diff --git a/README.md b/README.md
index bdd6dc9..ba581a9 100644
--- a/README.md
+++ b/README.md
@@ -1,6 +1,246 @@
 # Problem-Solving List
 *****************************************************************************
 
+### 2022/9/18~2022/9/24
+* A : [BOJ_2800](https://www.acmicpc.net/problem/2800) **괄호 제거**
+* B : [BOJ_2616](https://www.acmicpc.net/problem/2616) **소형기관차**
+* C : [BOJ_21756](https://www.acmicpc.net/problem/21756) **지우개**
+* D : [BOJ_9046](https://www.acmicpc.net/problem/9046) **복호화**
+
+*****************************************************************************
+
+### 2022/9/11~2022/9/17
+* A : [BOJ_1744](https://www.acmicpc.net/problem/1744) **수 묶기**
+* B : [BOJ_19947](https://www.acmicpc.net/problem/19947) **투자의 귀재 배주형**
+* C : [BOJ_14699](https://www.acmicpc.net/problem/14699) **관악산 등산**
+* D : [BOJ_2178](https://www.acmicpc.net/problem/2178) **미로 탐색**
+
+*****************************************************************************
+
+### 2022/9/4~2022/9/10
+* A : [BOJ_18234](https://www.acmicpc.net/problem/18234) **당근 훔쳐 먹기**
+* B : [BOJ_20442](https://www.acmicpc.net/problem/20442) **ㅋㅋ루ㅋㅋ**
+* C : [BOJ_20300](https://www.acmicpc.net/problem/20300) **서강근육맨**
+* D : [BOJ_1990](https://www.acmicpc.net/problem/1990) **소수인팰린드롬**
+
+*****************************************************************************
+
+### 2022/8/28~2022/9/3
+* A : [BOJ_15661](https://www.acmicpc.net/problem/15661) **링크와 스타트**
+* B : [BOJ_1758](https://www.acmicpc.net/problem/1758) **알바생 강호**
+* C : [BOJ_14567](https://www.acmicpc.net/problem/14567) **선수과목 (Prerequisite)**
+* D : [BOJ_1316](https://www.acmicpc.net/problem/1316) **그룹 단어 체커**
+
+*****************************************************************************
+
+### 2022/8/21~2022/8/27
+* A : [BOJ_3085](https://www.acmicpc.net/problem/3085) **사탕 게임**
+* B : [BOJ_2961](https://www.acmicpc.net/problem/2961) **도영이가 만든 맛있는 음식**
+* C : [BOJ_17837](https://www.acmicpc.net/problem/17837) **새로운 게임 2**
+* D : [BOJ_2529](https://www.acmicpc.net/problem/2529) **부등호**
+
+*****************************************************************************
+
+### 2022/8/14~2022/8/20
+* A : [BOJ_2839](https://www.acmicpc.net/problem/2839) **설탕 배달**
+* B : [BOJ_15666](https://www.acmicpc.net/problem/15666) **N과 M (12)**
+* C : [BOJ_1012](https://www.acmicpc.net/problem/1012) **유기농 배추**
+* D : [BOJ_1695](https://www.acmicpc.net/problem/1695) **팰린드롬 만들기**
+
+*****************************************************************************
+
+### 2022/8/7~2022/8/13
+* A : [BOJ_17845](https://www.acmicpc.net/problem/17845) **수강 과목**
+* B : [BOJ_18513](https://www.acmicpc.net/problem/18513) **샘터**
+* C : [BOJ_20115](https://www.acmicpc.net/problem/20115) **에너지 드링크**
+* D : [BOJ_14620](https://www.acmicpc.net/problem/14620) **꽃길**
+
+*****************************************************************************
+
+### 2022/7/31~2022/8/6
+* A : [BOJ_17779](https://www.acmicpc.net/problem/17779) **게리맨더링 2**
+* B : [BOJ_10942](https://www.acmicpc.net/problem/10942) **팰린드롬?**
+* C : [BOJ_14600](https://www.acmicpc.net/problem/14600) **샤워실 바닥 깔기 (Small)**
+* D : [BOJ_1110](https://www.acmicpc.net/problem/1110) **더하기 사이클**
+
+*****************************************************************************
+
+### 2022/7/24~2022/7/30
+* A : [BOJ_5766](https://www.acmicpc.net/problem/5766) **할아버지는 유명해!**
+* B : [BOJ_4097](https://www.acmicpc.net/problem/4097) **수익**
+* C : [BOJ_17135](https://www.acmicpc.net/problem/17135) **캐슬 디펜스**
+* D : [BOJ_2058](https://www.acmicpc.net/problem/2058) **원자의 에너지**
+
+*****************************************************************************
+
+### 2022/6/12~2022/6/18
+* A : [BOJ_9536](https://www.acmicpc.net/problem/9536) **여우는 어떻게 울지?**
+* B : [BOJ_11653](https://www.acmicpc.net/problem/11653) **소인수분해**
+* C : [BOJ_14400](https://www.acmicpc.net/problem/14400) **편의점 2**
+* D : [BOJ_20438](https://www.acmicpc.net/problem/20438) **출석체크**
+
+*****************************************************************************
+
+### 2022/6/5~2022/6/11
+* A : [BOJ_2665](https://www.acmicpc.net/problem/2665) **미로만들기**
+* B : [BOJ_21925](https://www.acmicpc.net/problem/21925) **짝수 팰린드롬**
+* C : [BOJ_14476](https://www.acmicpc.net/problem/14476) **최대공약수 하나 빼기**
+* D : [BOJ_1633](https://www.acmicpc.net/problem/1633) **최고의 팀 만들기**
+
+*****************************************************************************
+
+### 2022/5/29~2022/6/4
+* A : [BOJ_5534](https://www.acmicpc.net/problem/5534) **간판**
+* B : [BOJ_16562](https://www.acmicpc.net/problem/16562) **친구비**
+* C : [BOJ_5597](https://www.acmicpc.net/problem/5597) **과제 안 내신 분..?**
+* D : [BOJ_5547](https://www.acmicpc.net/problem/5547) **일루미네이션**
+
+*****************************************************************************
+
+### 2022/5/22~2022/5/28
+* A : [BOJ_1059](https://www.acmicpc.net/problem/1059) **좋은 구간**
+* B : [BOJ_18353](https://www.acmicpc.net/problem/18353) **병사 배치하기**
+* C : [BOJ_22946](https://www.acmicpc.net/problem/22946) **원 이동하기 1**
+* D : [BOJ_9934](https://www.acmicpc.net/problem/9934) **완전 이진 트리**
+
+*****************************************************************************
+
+### 2022/5/15~2022/5/21
+* A : [BOJ_20207](https://www.acmicpc.net/problem/20207) **달력**
+* B : [BOJ_2157](https://www.acmicpc.net/problem/2157) **여행**
+* C : [BOJ_9095](https://www.acmicpc.net/problem/9095) **1, 2, 3 더하기**
+* D : [BOJ_4659](https://www.acmicpc.net/problem/4659) **비밀번호 발음하기**
+
+*****************************************************************************
+
+### 2022/5/8~2022/5/14
+* A : [BOJ_12919](https://www.acmicpc.net/problem/12919) **A와 B 2**
+* B : [BOJ_18258](https://www.acmicpc.net/problem/18258) **큐 2**
+* C : [BOJ_20182](https://www.acmicpc.net/problem/20182) **골목 대장 호석 - 효율성 1**
+* D : [BOJ_7453](https://www.acmicpc.net/problem/7453) **합이 0인 네 정수**
+
+*****************************************************************************
+
+### 2022/5/1~2022/5/7
+* A : [BOJ_10988](https://www.acmicpc.net/problem/10988) **팰린드롬인지 확인하기**
+* B : [BOJ_15721](https://www.acmicpc.net/problem/15721) **번데기**
+* C : [BOJ_6603](https://www.acmicpc.net/problem/6603) **로또**
+* D : [BOJ_20183](https://www.acmicpc.net/problem/20183) **골목 대장 호석 - 효율성 2**
+
+*****************************************************************************
+
+### 2022/4/24~2022/4/30
+* A : [BOJ_11365](https://www.acmicpc.net/problem/11365) **!밀비 급일**
+* B : [BOJ_10809](https://www.acmicpc.net/problem/10809) **알파벳 찾기**
+* C : [BOJ_10971](https://www.acmicpc.net/problem/10971) **외판원 순회 2**
+* D : [BOJ_2458](https://www.acmicpc.net/problem/2458) **키 순서**
+
+*****************************************************************************
+
+### 2022/4/17~2022/4/23
+* A : [BOJ_7562](https://www.acmicpc.net/problem/7562) **나이트의 이동**
+* B : [BOJ_15779](https://www.acmicpc.net/problem/15779) **Zigzag**
+* C : [BOJ_2406](https://www.acmicpc.net/problem/2406) **안정적인 네트워크**
+* D : [BOJ_1747](https://www.acmicpc.net/problem/1747) **소수&팰린드롬**
+
+*****************************************************************************
+
+### 2022/4/10~2022/4/16
+* A : [BOJ_2753](https://www.acmicpc.net/problem/2753) **윤년**
+* B : [BOJ_18116](https://www.acmicpc.net/problem/18116) **로봇 조립**
+* C : [BOJ_20922](https://www.acmicpc.net/problem/20922) **겹치는 건 싫어**
+* D : [BOJ_1072](https://www.acmicpc.net/problem/1072) **게임**
+
+*****************************************************************************
+
+### 2022/4/3~2022/4/9
+* A : [BOJ_1699](https://www.acmicpc.net/problem/1699) **제곱수의 합**
+* B : [BOJ_15686](https://www.acmicpc.net/problem/15686) **치킨 배달**
+* C : [BOJ_1493](https://www.acmicpc.net/problem/1493) **박스 채우기**
+* D : [BOJ_17490](https://www.acmicpc.net/problem/17490) **일감호에 다리 놓기**
+
+*****************************************************************************
+
+### 2022/3/27~2022/4/2
+* A : [BOJ_2422](https://www.acmicpc.net/problem/2422) **한윤정이 이탈리아에 가서 아이스크림을 사먹는데**
+* B : [BOJ_3980](https://www.acmicpc.net/problem/3980) **선발 명단**
+* C : [BOJ_17085](https://www.acmicpc.net/problem/17085) **십자가 2개 놓기**
+* D : [BOJ_3151](https://www.acmicpc.net/problem/3151) **합이 0**
+
+*****************************************************************************
+
+### 2022/3/20~2022/3/26
+* A : [BOJ_1978](https://www.acmicpc.net/problem/1978) **소수 찾기**
+* B : [BOJ_5052](https://www.acmicpc.net/problem/5052) **전화번호 목록**
+* C : [BOJ_22943](https://www.acmicpc.net/problem/22943) **수**
+* D : [BOJ_8980](https://www.acmicpc.net/problem/8980) **택배**
+
+*****************************************************************************
+
+### 2022/3/13~2022/3/19
+* A : [BOJ_20154](https://www.acmicpc.net/problem/20154) **이 구역의 승자는 누구야?!**
+* B : [BOJ_5624](https://www.acmicpc.net/problem/5624) **좋은 수**
+* C : [BOJ_11279](https://www.acmicpc.net/problem/11279) **최대 힙**
+* D : [BOJ_19539](https://www.acmicpc.net/problem/19539) **사과나무**
+
+*****************************************************************************
+
+### 2022/3/6~2022/3/12
+* A : [BOJ_1864](https://www.acmicpc.net/problem/1864) **문어 숫자**
+* B : [BOJ_15664](https://www.acmicpc.net/problem/15664) **N과 M (10)**
+* C : [BOJ_14595](https://www.acmicpc.net/problem/14595) **동방 프로젝트 (Large)**
+* D : [BOJ_11568](https://www.acmicpc.net/problem/11568) **민균이의 계략**
+
+*****************************************************************************
+
+### 2022/2/27~2022/3/5
+* A : [BOJ_9375](https://www.acmicpc.net/problem/9375) **패션왕 신해빈**
+* B : [BOJ_11722](https://www.acmicpc.net/problem/11722) **가장 긴 감소하는 부분 수열**
+* C : [BOJ_2798](https://www.acmicpc.net/problem/2798) **블랙잭**
+* D : [BOJ_9342](https://www.acmicpc.net/problem/9342) **염색체**
+
+*****************************************************************************
+
+### 2022/2/20~2022/2/26
+* A : [BOJ_17212](https://www.acmicpc.net/problem/17212) **달나라 토끼를 위한 구매대금 지불 도우미**
+* B : [BOJ_7682](https://www.acmicpc.net/problem/7682) **틱택토**
+* C : [BOJ_1874](https://www.acmicpc.net/problem/1874) **스택 수열**
+* D : [BOJ_20056](https://www.acmicpc.net/problem/20056) **마법사 상어와 파이어볼**
+
+*****************************************************************************
+
+### 2022/2/13~2022/2/19
+* A : [BOJ_1577](https://www.acmicpc.net/problem/1577) **도로의 개수**
+* B : [BOJ_4095](https://www.acmicpc.net/problem/4095) **최대 정사각형**
+* C : [BOJ_2644](https://www.acmicpc.net/problem/2644) **촌수계산**
+* D : [BOJ_14284](https://www.acmicpc.net/problem/14284) **간선 이어가기 2**
+
+*****************************************************************************
+
+### 2022/2/6~2022/2/12
+* A : [BOJ_17610](https://www.acmicpc.net/problem/17610) **양팔저울**
+* B : [BOJ_3187](https://www.acmicpc.net/problem/3187) **양치기 꿍**
+* C : [BOJ_14391](https://www.acmicpc.net/problem/14391) **종이 조각**
+* D : [BOJ_2504](https://www.acmicpc.net/problem/2504) **괄호의 값**
+
+*****************************************************************************
+
+### 2022/1/30~2022/2/5
+* A : [BOJ_4690](https://www.acmicpc.net/problem/4690) **완전 세제곱**
+* B : [BOJ_15900](https://www.acmicpc.net/problem/15900) **나무 탈출**
+* C : [BOJ_16437](https://www.acmicpc.net/problem/16437) **양 구출 작전**
+* D : [BOJ_2887](https://www.acmicpc.net/problem/2887) **행성 터널**
+
+*****************************************************************************
+
+### 2022/1/23~2022/1/29
+* A : [BOJ_20162](https://www.acmicpc.net/problem/20162) **간식 파티**
+* B : [BOJ_2374](https://www.acmicpc.net/problem/2374) **같은 수로 만들기**
+* C : [BOJ_1719](https://www.acmicpc.net/problem/1719) **택배**
+* D : [BOJ_2204](https://www.acmicpc.net/problem/2204) **도비의 난독증 테스트**
+
+*****************************************************************************
+
 ### 2022/1/16~2022/1/22
 * A : [BOJ_14950](https://www.acmicpc.net/problem/14950) **정복자**
 * B : [BOJ_11509](https://www.acmicpc.net/problem/11509) **풍선 맞추기**
diff --git a/hyeon-uk/2022/0116~0122/P11509.java b/hyeon-uk/2022/0116~0122/P11509.java
new file mode 100644
index 0000000..66fd1ef
--- /dev/null
+++ b/hyeon-uk/2022/0116~0122/P11509.java
@@ -0,0 +1,23 @@
+import java.awt.*;
+import java.util.*;
+
+public class P11509 {
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+
+        int n=sc.nextInt();
+        int[] h=new int[1000001];
+        int cnt=0;
+        for(int i=0;i<n;i++){
+            int data=sc.nextInt();
+            if(h[data]==0){
+                cnt++;
+            }
+            else{
+                h[data]--;
+            }
+            if(data-1>0) h[data-1]++;
+        }
+        System.out.println(cnt);
+    }
+}
\ No newline at end of file
diff --git a/hyeon-uk/2022/0116~0122/P14950.java b/hyeon-uk/2022/0116~0122/P14950.java
new file mode 100644
index 0000000..e057a35
--- /dev/null
+++ b/hyeon-uk/2022/0116~0122/P14950.java
@@ -0,0 +1,57 @@
+P11509import java.util.*;
+class Road implements Comparable<Road>{
+    int from,to,cost;
+
+    public Road(int from,int to, int cost) {
+        this.from=from;
+        this.to=to;
+        this.cost = cost;
+    }
+
+    @Override
+    public int compareTo(Road r){
+        return this.cost-r.cost;
+    }
+}
+public class P14950 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int n, m, t;
+
+        n = sc.nextInt();
+        m = sc.nextInt();
+        t = sc.nextInt();
+
+        boolean visited[] = new boolean[n + 1];
+        ArrayList<ArrayList<Road>> road = new ArrayList<>();
+        for (int i = 0; i <= n; i++) road.add(new ArrayList<Road>());
+        for (int i = 0; i < m; i++) {
+            int u = sc.nextInt();
+            int v = sc.nextInt();
+            int cost = sc.nextInt();
+            road.get(u).add(new Road(u, v, cost));
+            road.get(v).add(new Road(v, u, cost));
+        }
+
+        PriorityQueue<Road> pq = new PriorityQueue<>();
+
+        int sum = 0;
+        int gap = 0;
+
+        pq.addAll(road.get(1));
+        visited[1] = true;
+
+        while (!pq.isEmpty()) {
+            Road r = pq.poll();
+
+            if (!visited[r.to]) {
+                if (visited[r.from] && visited[r.to]) continue;
+                visited[r.from] = visited[r.to] = true;
+                pq.addAll(road.get(r.to));
+                sum += (r.cost + gap);
+                gap += t;
+            }
+        }
+        System.out.println(sum);
+    }
+}
diff --git a/hyeon-uk/2022/0116~0122/P21922.java b/hyeon-uk/2022/0116~0122/P21922.java
new file mode 100644
index 0000000..cc1515b
--- /dev/null
+++ b/hyeon-uk/2022/0116~0122/P21922.java
@@ -0,0 +1,109 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.Scanner;
+import java.util.StringTokenizer;
+
+class Node{
+    Point p;
+    int d;
+    public Node(Point p,int d){
+        this.p=p;
+        this.d=d;
+    }
+}
+
+class Point{
+    int x,y;
+    public Point(int x,int y){
+        this.x=x;
+        this.y=y;
+    }
+}
+
+public class P21922 {
+    public static int n,m,result=0;
+    public static int maze[][];
+    public static boolean visited[][][];
+    //위쪽부터 시계방향
+    public static int mx[]=new int[]{-1,0,1,0};
+    public static int my[]=new int[]{0,1,0,-1};
+    public static Queue<Node> q=new LinkedList<>();
+
+    public static boolean isIn(Point p){
+        return 0<=p.x&&p.x<n&&0<=p.y&&p.y<m;
+    }
+
+    public static Node move(Point p,int d){
+        if(maze[p.x][p.y]==1){
+            if(d==1||d==3) d=(d+2)%4;
+        } else if(maze[p.x][p.y]==2){
+            if(d==0||d==2) d=(d+2)%4;
+        }else if(maze[p.x][p.y]==3){
+            if(d==0 || d==2){
+                d++;
+            }
+            else{
+                d--;
+            }
+        }else if(maze[p.x][p.y]==3||maze[p.x][p.y]==4){
+            if(d==0 || d==2){
+                d = (d-1<0) ? 3 : d-1;
+            }
+            else{
+                d=(d+1)%4;
+            }
+        }
+        int nx=p.x+mx[d];
+        int ny=p.y+my[d];
+        return new Node(new Point(nx,ny),d);
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine());
+        n=Integer.parseInt(st.nextToken());
+        m=Integer.parseInt(st.nextToken());
+        maze=new int[n][m];
+        visited=new boolean[n][m][4];
+
+        for(int i=0;i<n;i++){
+            st=new StringTokenizer(br.readLine());
+            for(int j=0;j<m;j++){
+                maze[i][j]=Integer.parseInt(st.nextToken());
+                if(maze[i][j]==9){
+                    for(int d=0;d<4;d++){
+                        q.add(new Node(new Point(i,j),d));
+                        visited[i][j][d]=true;
+                    }
+                }
+            }
+        }
+
+        while(!q.isEmpty()){
+            Node now=q.poll();
+            Point p=now.p;
+            int d=now.d;
+
+            Node next=move(p,d);
+            if(isIn(next.p)&&!visited[next.p.x][next.p.y][next.d]){
+                q.add(next);
+                visited[next.p.x][next.p.y][next.d]=true;
+            }
+        }
+
+
+        for(int i=0;i<n;i++){
+            for(int j=0;j<m;j++){
+                result+=(visited[i][j][0]||visited[i][j][1]
+                        ||visited[i][j][2]||visited[i][j][3] ? 1: 0);
+            }
+        }
+
+        System.out.println(result);
+
+
+    }
+}
\ No newline at end of file
diff --git a/hyeon-uk/2022/0116~0122/P4096.java b/hyeon-uk/2022/0116~0122/P4096.java
new file mode 100644
index 0000000..9d47624
--- /dev/null
+++ b/hyeon-uk/2022/0116~0122/P4096.java
@@ -0,0 +1,34 @@
+import java.util.Scanner;
+
+public class P4096{
+    public static boolean isPal(String str){
+        int len=str.length();
+        for(int i=0;i<str.length()/2;i++){
+            if(str.charAt(i)!=str.charAt(len-1-i)) return false;
+        }
+        return true;
+    }
+
+    public static String intToString(int num,int len){
+        String str=Integer.toString(num);
+        while(str.length()<len) str="0"+str;
+        return str;
+    }
+
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+
+        while(true){
+            String str=sc.next();
+            if(str.equals("0")) break;
+            int len=str.length();
+            int cnt=0;
+            while(!isPal(str)){
+                cnt++;
+                int next=(Integer.parseInt(str)+1);
+                str=intToString(next,len);
+            }
+            System.out.println(cnt);
+        }
+    }
+}
\ No newline at end of file
diff --git a/hyeon-uk/2022/0123~0129/P1719.java b/hyeon-uk/2022/0123~0129/P1719.java
new file mode 100644
index 0000000..066cdd3
--- /dev/null
+++ b/hyeon-uk/2022/0123~0129/P1719.java
@@ -0,0 +1,56 @@
+import java.util.Arrays;
+import java.util.Scanner;
+
+public class P1719 {
+    public static int[][] weight;
+    public static int[][] route;
+
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+        int n=sc.nextInt();
+        int m=sc.nextInt();
+        weight=new int[n+1][n+1];
+        route=new int[n+1][n+1];
+
+        for(int i=1;i<=n;i++){
+            Arrays.fill(weight[i],987654321);
+            weight[i][i]=0;
+        }
+
+        for(int i=0;i<m;i++){
+            int u=sc.nextInt();
+            int v=sc.nextInt();
+            int w=sc.nextInt();
+
+            weight[u][v]=w;
+            weight[v][u]=w;
+
+            route[u][v]=v;
+            route[v][u]=u;
+        }
+        for(int k=1;k<=n;k++){
+            for(int i=1;i<=n;i++){
+                for(int j=1;j<=n;j++){
+                    if(weight[i][j] > weight[i][k]+weight[k][j]){
+                        weight[i][j]=weight[i][k]+weight[k][j];
+                        route[i][j]=route[i][k];
+                    }
+                }
+            }
+        }
+
+        for(int i=1;i<=n;i++){
+            for(int j=1;j<=n;j++){
+                if(i==j){
+                    System.out.print("- ");
+                }
+                else {
+                    System.out.print(route[i][j]+ " ");
+                }
+            }
+            System.out.println();
+        }
+
+
+    }
+}
diff --git a/hyeon-uk/2022/0123~0129/P20162.java b/hyeon-uk/2022/0123~0129/P20162.java
new file mode 100644
index 0000000..454d392
--- /dev/null
+++ b/hyeon-uk/2022/0123~0129/P20162.java
@@ -0,0 +1,31 @@
+import java.util.Scanner;
+
+public class P20162 {
+    public static int[] dp;
+    public static int[] food;
+    public static int n;
+    public static int ret=0;
+
+
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+
+        n=sc.nextInt();
+        food=new int[n+1];
+        dp=new int[n+1];
+
+        for(int i=1;i<=n;i++){
+            food[i]=sc.nextInt();
+        }
+        for(int i=1;i<=n;i++){
+            dp[i]=food[i];
+            for(int j=0;j<i;j++){
+                if(food[i]>food[j]){
+                    dp[i]=Math.max(dp[i],dp[j]+food[i]);
+                }
+            }
+            ret=Math.max(ret,dp[i]);
+        }
+        System.out.println(ret);
+    }
+}
diff --git a/hyeon-uk/2022/0123~0129/P2204.java b/hyeon-uk/2022/0123~0129/P2204.java
new file mode 100644
index 0000000..bb2035f
--- /dev/null
+++ b/hyeon-uk/2022/0123~0129/P2204.java
@@ -0,0 +1,31 @@
+import java.util.Comparator;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Scanner;
+
+public class P2204 {
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+
+        while(true){
+            int n=sc.nextInt();
+            if(n==0) break;
+
+            List<String> list=new LinkedList<>();
+            for(int i=0;i<n;i++){
+                String str=sc.next();
+                list.add(str);
+            }
+
+            list.sort(new Comparator<String>() {
+                @Override
+                public int compare(String o1, String o2) {
+                    o1=o1.toLowerCase();
+                    o2=o2.toLowerCase();
+                    return o1.compareTo(o2);
+                }
+            });
+            System.out.println(list.get(0));
+        }
+    }
+}
\ No newline at end of file
diff --git a/hyeon-uk/2022/0123~0129/P2374.java b/hyeon-uk/2022/0123~0129/P2374.java
new file mode 100644
index 0000000..cf496e5
--- /dev/null
+++ b/hyeon-uk/2022/0123~0129/P2374.java
@@ -0,0 +1,57 @@
+import java.util.Scanner;
+
+public class P2374{
+    public static long[] arr;
+    public static int n;
+    public static long ret=0l;
+
+    public static void func(int left,int right, Long lastMax){
+        if(left>right){
+            return;
+        }
+
+        long max=0l;
+        for(int i=left;i<=right;i++) {
+            max=Math.max(arr[i],max);
+        }
+
+        int ind=-1;
+        for(int i=left;i<=right;i++){
+            if(arr[i]==max){
+                ind=i;
+                break;
+            }
+        }
+
+        func(left,ind-1,max);
+        func(ind+1,right,max);
+        ret+=(lastMax-max);
+    }
+
+    public static void main(String[] args){
+        Scanner sc=new Scanner(System.in);
+        n=sc.nextInt();
+
+        arr=new long[n+1];
+
+        long max=0l;
+        for(int i=0;i<n;i++) {
+            arr[i]=sc.nextLong();
+            max=Math.max(arr[i],max);
+        }
+
+        int ind=-1;
+        for(int i=0;i<n;i++){
+            if(arr[i]==max){
+                ind=i;
+                break;
+            }
+        }
+
+        func(0,ind-1,max);
+        func(ind+1,n-1,max);
+
+
+        System.out.println(ret);
+    }
+}
diff --git a/hyeon-uk/2022/0130~0205/P15900.java b/hyeon-uk/2022/0130~0205/P15900.java
new file mode 100644
index 0000000..0556983
--- /dev/null
+++ b/hyeon-uk/2022/0130~0205/P15900.java
@@ -0,0 +1,63 @@
+import java.io.*;
+import java.util.*;
+
+
+
+public class P15900 {
+    public static ArrayList<ArrayList<Integer>> graph=new ArrayList<>();
+    public static int n;
+    public static boolean visited[];
+    public static int dist[];
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+
+        n=Integer.parseInt(st.nextToken());
+
+        visited=new boolean[n+1];
+        dist=new int[n+1];
+
+        for(int i=0;i<=n;i++){
+            graph.add(new ArrayList<>());
+        }
+
+        for(int i=0;i<n-1;i++){
+            st=new StringTokenizer(br.readLine()," ");
+            int u=Integer.parseInt(st.nextToken());
+            int v=Integer.parseInt(st.nextToken());
+            graph.get(u).add(v);
+            graph.get(v).add(u);
+        }
+
+        Queue<Integer> queue=new LinkedList<>();
+        visited[1]=true;
+        dist[1]=0;
+        queue.offer(1);
+
+        int sum=0;
+
+        while(!queue.isEmpty()){
+            int now=queue.poll();
+            boolean isLeaf=true;
+            for(int i=0;i<graph.get(now).size();i++){
+                int next=graph.get(now).get(i);
+                if(!visited[next]){
+                    visited[next]=true;
+                    dist[next]=dist[now]+1;
+                    queue.offer(next);
+                    isLeaf=false;
+                }
+            }
+            if(isLeaf){
+                sum+=dist[now];
+            }
+        }
+
+        if(sum%2==1){
+            System.out.println("Yes");
+        }
+        else{
+            System.out.println("No");
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0130~0205/P16437.java b/hyeon-uk/2022/0130~0205/P16437.java
new file mode 100644
index 0000000..3b2660e
--- /dev/null
+++ b/hyeon-uk/2022/0130~0205/P16437.java
@@ -0,0 +1,59 @@
+import java.io.*;
+import java.util.*;
+
+
+
+public class P16437 {
+    public static ArrayList<ArrayList<Integer>> graph=new ArrayList<>();
+    public static int n;
+    public static int wolf[];
+    public static int sheep[];
+
+    public static long dfs(int now){
+        //leaf node
+        if(graph.get(now).size()==0){
+            return sheep[now];
+        }
+
+        int nowSheep=sheep[now];
+        long childSheep=0;
+        for(int i=0;i<graph.get(now).size();i++){
+            int next=graph.get(now).get(i);
+            childSheep+=dfs(next);
+        }
+
+        //올라오다 늑대한테 먹히고 남은 양의수
+        long aliveSheep=nowSheep+childSheep-wolf[now];
+        if(aliveSheep<0) aliveSheep=0;
+        return aliveSheep;
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+
+        n=Integer.parseInt(st.nextToken());
+        wolf=new int[n+1];
+        sheep=new int[n+1];
+
+        for(int i=0;i<=n;i++) graph.add(new ArrayList<>());
+
+        for(int i=2;i<=n;i++){
+            st=new StringTokenizer(br.readLine()," ");
+
+            String op=st.nextToken();
+            int w=Integer.parseInt(st.nextToken());
+            int parent= Integer.parseInt(st.nextToken());
+
+            if(op.equals("S")){
+                sheep[i]=w;
+            }
+            else{
+                wolf[i]=w;
+            }
+            graph.get(parent).add(i);
+        }
+
+        System.out.println(dfs(1));
+    }
+}
diff --git a/hyeon-uk/2022/0130~0205/P2887.java b/hyeon-uk/2022/0130~0205/P2887.java
new file mode 100644
index 0000000..c13e1e9
--- /dev/null
+++ b/hyeon-uk/2022/0130~0205/P2887.java
@@ -0,0 +1,133 @@
+import java.io.*;
+import java.util.*;
+
+class Node{
+    int number;
+    int x,y,z;
+    public Node(int number,int x,int y,int z){
+        this.number=number;
+        this.x=x;
+        this.y=y;
+        this.z=z;
+    }
+}
+
+class CNode{
+    int dist;
+    int u,v;
+    public CNode(int dist,int u,int v){
+        this.dist=dist;
+        this.u=u;
+        this.v=v;
+    }
+}
+
+public class P2887{
+    public static List<Node> xList=new ArrayList<>();
+    public static List<Node> yList=new ArrayList<>();
+    public static List<Node> zList=new ArrayList<>();
+    public static List<CNode> totalList=new ArrayList<>();
+
+    public static int[] parent;
+    public static int find(int p){
+        if(parent[p]==p){
+            return p;
+        }
+        else{
+            return find(parent[p]);
+        }
+    }
+
+    public static void unionParent(int a,int b){
+        a=find(a);
+        b=find(b);
+
+        if(a<b){
+            parent[b]=a;
+        }
+        else{
+            parent[a]=b;
+        }
+    }
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+
+        int n=Integer.parseInt(st.nextToken());
+
+        for(int i=1;i<=n;i++){
+            st=new StringTokenizer(br.readLine()," ");
+            int x=Integer.parseInt(st.nextToken());
+            int y=Integer.parseInt(st.nextToken());
+            int z=Integer.parseInt(st.nextToken());
+
+            Node node=new Node(i,x,y,z);
+            xList.add(node);
+            yList.add(node);
+            zList.add(node);
+        }
+
+        xList.sort(new Comparator<Node>() {
+            @Override
+            public int compare(Node o1, Node o2) {
+                return o1.x-o2.x;
+            }
+        });
+
+        for(int i=0;i<n-1;i++){
+            int dist=xList.get(i+1).x-xList.get(i).x;
+            CNode node=new CNode(dist,xList.get(i).number,xList.get(i+1).number);
+            totalList.add(node);
+        }
+
+        yList.sort(new Comparator<Node>() {
+            @Override
+            public int compare(Node o1, Node o2) {
+                return o1.y-o2.y;
+            }
+        });
+
+        for(int i=0;i<n-1;i++){
+            int dist=yList.get(i+1).y-yList.get(i).y;
+            CNode node=new CNode(dist,yList.get(i).number,yList.get(i+1).number);
+            totalList.add(node);
+        }
+
+        zList.sort(new Comparator<Node>() {
+            @Override
+            public int compare(Node o1, Node o2) {
+                return o1.z-o2.z;
+            }
+        });
+
+        for(int i=0;i<n-1;i++){
+            int dist=zList.get(i+1).z-zList.get(i).z;
+            CNode node=new CNode(dist,zList.get(i).number,zList.get(i+1).number);
+            totalList.add(node);
+        }
+
+        totalList.sort(new Comparator<CNode>() {
+            @Override
+            public int compare(CNode o1, CNode o2) {
+                return o1.dist-o2.dist;
+            }
+        });
+
+        long sum=0;
+        parent=new int[n+1];
+        for(int i=1;i<=n;i++) parent[i]=i;
+        for(int i=0;i<totalList.size();i++){
+            CNode e=totalList.get(i);
+            int u=e.u;
+            int v=e.v;
+            int dist=e.dist;
+
+            if(find(u)==find(v)) continue;
+
+            unionParent(u,v);
+
+            sum+=dist;
+        };
+        System.out.println(sum);
+    }
+}
\ No newline at end of file
diff --git a/hyeon-uk/2022/0130~0205/P4690.java b/hyeon-uk/2022/0130~0205/P4690.java
new file mode 100644
index 0000000..b3c03da
--- /dev/null
+++ b/hyeon-uk/2022/0130~0205/P4690.java
@@ -0,0 +1,15 @@
+public class P4690 {
+    public static void main(String[] args){
+        for(int a=1;a<=100;a++){
+            for(int b=2;b<a;b++){
+                for(int c=b+1;c<a;c++){
+                    for(int d=c+1;d<a;d++){
+                        if(a*a*a==b*b*b+c*c*c+d*d*d){
+                            System.out.println(String.format("Cube = %d, Triple = (%d,%d,%d)",a,b,c,d));
+                        }
+                    }
+                }
+            }
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0206~0212/14391.java b/hyeon-uk/2022/0206~0212/14391.java
new file mode 100644
index 0000000..0f14cdf
--- /dev/null
+++ b/hyeon-uk/2022/0206~0212/14391.java
@@ -0,0 +1,87 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.Stack;
+import java.util.StringTokenizer;
+
+public class P14391 {
+    public static int maze[]=new int[16];
+    public static boolean row[]=new boolean[16];
+    public static int n,m;
+    public static long ret=0l;
+
+    public static void calc(){
+        long total=0l;
+        long temp=0l;
+        //가로로 묶인것들의 합
+        for(int i=0;i<n;i++){
+            temp=0;
+            for(int j=0;j<m;j++){
+                int ind=i*m+j;
+                if(row[ind]){
+                    temp=temp*10+maze[ind];
+                }
+                else{
+                    total+=temp;
+                    temp=0;
+                }
+            }
+            if(temp!=0) {
+                total += temp;//짬처리
+                temp=0;
+            }
+        }
+        //세로로 묶인것들의 합
+        for(int j=0;j<m;j++){
+            temp=0;
+            for(int i=0;i<n;i++){
+                int ind=i*m+j;
+                if(!row[ind]){
+                    temp=temp*10+maze[ind];
+                }
+                else{
+                    total+=temp;
+                    temp=0;
+                }
+            }
+            if(temp!=0){
+                total+=temp;
+                temp=0;
+            }
+        }
+        ret=Math.max(ret,total);
+    }
+
+    public static void func(int index){
+        if(index==n*m){
+            calc();
+            return;
+        }
+
+        //해당칸을 세로로했을때
+        func(index+1);
+
+        //해당칸을 가로로했을때
+        row[index]=true;
+        func(index+1);
+        row[index]=false;
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        n=Integer.parseInt(st.nextToken());
+        m=Integer.parseInt(st.nextToken());
+
+        for(int i=0;i<n;i++){
+            String line=br.readLine();
+            for(int j=0;j<m;j++){
+                maze[i*m+j]=(int)(line.charAt(j)-'0');
+            }
+        }
+        func(0);
+        System.out.println(ret);
+    }
+}
diff --git a/hyeon-uk/2022/0206~0212/17610.java b/hyeon-uk/2022/0206~0212/17610.java
new file mode 100644
index 0000000..9f6634c
--- /dev/null
+++ b/hyeon-uk/2022/0206~0212/17610.java
@@ -0,0 +1,43 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+public class P17610 {
+    public static int[] numbers;
+    public static boolean[] dp;
+    public static int sum=0;
+    public static int k;
+    public static void dfs(int index,int left,int right){
+        if(right-left>=0&&right-left<=sum){
+            dp[right-left]=true;
+        }
+        if(index==k) return;
+
+        dfs(index+1,left+numbers[index],right);
+        dfs(index+1,left,right+numbers[index]);
+        dfs(index+1,left,right);
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        k=Integer.parseInt(st.nextToken());
+        numbers=new int[k];
+        String str=br.readLine();
+        st=new StringTokenizer(str," ");
+        for(int i=0;i<k;i++){
+            numbers[i]=Integer.parseInt(st.nextToken());
+            sum+=numbers[i];
+        }
+        dp=new boolean[sum+1];
+        
+        dfs(0,0,0);
+        int ret=0;
+        for(boolean can:dp){
+            if(!can)ret++;
+        }
+        System.out.println(ret);
+    }
+}
diff --git a/hyeon-uk/2022/0206~0212/2504.java b/hyeon-uk/2022/0206~0212/2504.java
new file mode 100644
index 0000000..0627794
--- /dev/null
+++ b/hyeon-uk/2022/0206~0212/2504.java
@@ -0,0 +1,58 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.Stack;
+import java.util.StringTokenizer;
+
+public class P2504 {
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        String str=br.readLine();
+
+        Stack<Character> st=new Stack<>();
+        int ret=0;
+        int temp=1;
+        boolean flag=true;
+
+        for(int i=0;i<str.length();i++){
+            char now=str.charAt(i);
+            if(now=='('){
+                temp*=2;
+                st.push(now);
+            }
+            else if(now=='['){
+                temp*=3;
+                st.push(now);
+            }
+            else{
+                if(now==')'&&!st.isEmpty()&&st.peek()=='('){
+                    if(str.charAt(i-1)=='('){
+                        ret+=temp;
+                    }
+                    st.pop();
+                    temp/=2;
+                }
+                else if(now==']'&&!st.isEmpty()&&st.peek()=='['){
+                    if(str.charAt(i-1)=='['){
+                        ret+=temp;
+                    }
+                    st.pop();
+                    temp/=3;
+                }
+                else{
+                    flag=false;
+                    break;
+                }
+            }
+        }
+        if(!st.isEmpty() || !flag){
+            System.out.println(0);
+        }
+        else{
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0206~0212/3187.java b/hyeon-uk/2022/0206~0212/3187.java
new file mode 100644
index 0000000..7ff9d2e
--- /dev/null
+++ b/hyeon-uk/2022/0206~0212/3187.java
@@ -0,0 +1,82 @@
+import org.w3c.dom.Node;
+
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.LinkedList;
+import java.util.Queue;
+import java.util.StringTokenizer;
+
+class Point{
+    int x,y;
+    public Point(int x,int y){
+        this.x=x;
+        this.y=y;
+    }
+}
+
+public class P3187 {
+    public static char[][] maze;
+    public static boolean[][] visited;
+    public static int[][] mv=new int[][]{{1,0},{-1,0},{0,1},{0,-1}};
+    public static int r,c;
+    public static int sheep=0;
+    public static int wolf=0;
+
+    public static boolean isIn(int x,int y){
+        return 0<=x&&x<r&&0<=y&&y<c;
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+
+        r=Integer.parseInt(st.nextToken());
+        c=Integer.parseInt(st.nextToken());
+
+        maze=new char[r][c];
+        visited=new boolean[r][c];
+
+        for(int i=0;i<r;i++){
+            String temp=br.readLine();
+            for(int j=0;j<c;j++){
+                maze[i][j]=temp.charAt(j);
+            }
+        }
+
+        Queue<Point> queue=new LinkedList<>();
+        for(int i=0;i<r;i++){
+            for(int j=0;j<c;j++){
+                if(maze[i][j]!='#'&&!visited[i][j]){
+                    visited[i][j]=true;
+                    queue.offer(new Point(i,j));
+                    int tSheep=0;
+                    int tWolf=0;
+                    while(!queue.isEmpty()){
+                        Point now=queue.poll();
+
+                        if(maze[now.x][now.y]=='v') tWolf++;
+                        else if(maze[now.x][now.y]=='k') tSheep++;
+
+                        for(int d=0;d<4;d++){
+                            int nx=now.x+mv[d][0];
+                            int ny=now.y+mv[d][1];
+
+                            if(isIn(nx,ny)&&!visited[nx][ny]&&maze[nx][ny]!='#'){
+                                queue.offer(new Point(nx,ny));
+                                visited[nx][ny]=true;
+                            }
+                        }
+                    }
+                    if(tWolf>=tSheep){
+                        wolf+=tWolf;
+                    }
+                    else{
+                        sheep+=tSheep;
+                    }
+                }
+            }
+        }
+        System.out.println(sheep+" "+wolf);
+    }
+}
diff --git a/hyeon-uk/2022/0213~0219/14284.java b/hyeon-uk/2022/0213~0219/14284.java
new file mode 100644
index 0000000..f24871b
--- /dev/null
+++ b/hyeon-uk/2022/0213~0219/14284.java
@@ -0,0 +1,76 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+class Node implements Comparable<Node> {
+    int to;
+    int cost;
+    public Node(int to,int cost){
+        this.to=to;
+        this.cost=cost;
+    }
+
+    @Override
+    public int compareTo(Node node){
+        return this.cost-node.cost;
+    }
+}
+
+public class P14284 {
+    public static int n,m,a,b,c,start,end;
+    public static ArrayList<ArrayList<Node>> graph=new ArrayList<>();
+
+    public static long dijk(){
+        int dist[]=new int[n+1];
+        Arrays.fill(dist,Integer.MAX_VALUE);
+        PriorityQueue<Node> pq=new PriorityQueue<>();
+
+        pq.offer(new Node(start,0));
+        dist[start]=0;
+        while(!pq.isEmpty()){
+            Node node=pq.poll();
+            int now=node.to;
+            int cost=node.cost;
+
+            if(cost>dist[now]) continue;
+            if(now==end){
+                return cost;
+            }
+            for(Node nextNode:graph.get(now)){
+                int next=nextNode.to;
+                int next_cost=nextNode.cost;
+
+                if(dist[next]>cost+next_cost){
+                    dist[next]=cost+next_cost;
+                    pq.offer(new Node(next,cost+next_cost));
+                }
+            }
+        }
+        return -1;
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        n=Integer.parseInt(st.nextToken());
+        m=Integer.parseInt(st.nextToken());
+
+        for(int i=0;i<=n;i++) graph.add(new ArrayList<>());
+        for(int i=0;i<m;i++){
+            st=new StringTokenizer(br.readLine()," ");
+            a=Integer.parseInt(st.nextToken());
+            b=Integer.parseInt(st.nextToken());
+            c=Integer.parseInt(st.nextToken());
+
+            graph.get(a).add(new Node(b,c));
+            graph.get(b).add(new Node(a,c));
+        }
+
+        st=new StringTokenizer(br.readLine()," ");
+        start=Integer.parseInt(st.nextToken());
+        end=Integer.parseInt(st.nextToken());
+
+        System.out.println(dijk());
+    }
+}
diff --git a/hyeon-uk/2022/0213~0219/P1577.java b/hyeon-uk/2022/0213~0219/P1577.java
new file mode 100644
index 0000000..0ee5bc3
--- /dev/null
+++ b/hyeon-uk/2022/0213~0219/P1577.java
@@ -0,0 +1,49 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class P1577 {
+    public static boolean visited[][]=new boolean[202][202];
+    public static long dp[][]=new long[101][101];
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        int m=Integer.parseInt(st.nextToken());//가로
+        int n=Integer.parseInt(st.nextToken());//세로
+
+        int k=Integer.parseInt(br.readLine());
+
+        for(int i=0;i<k;i++){
+            st=new StringTokenizer(br.readLine()," ");
+            int a=Integer.parseInt(st.nextToken());//가로
+            int b=Integer.parseInt(st.nextToken());//세로
+            int c=Integer.parseInt(st.nextToken());//가로
+            int d=Integer.parseInt(st.nextToken());//세로
+
+            visited[b+d][a+c]=true;
+        }
+
+        //가로(첫번째 행) 초기화
+        for(int i=1;i<=m;i++){
+            if(visited[0][2*i-1]) break;
+            dp[0][i]=1;
+        }
+
+        //세로(첫번째 열) 초기화
+        for(int i=1;i<=n;i++){
+            if(visited[2*i-1][0]) break;
+            dp[i][0]=1;
+        }
+
+        for(int i=1;i<=n;i++){
+            for(int j=1;j<=m;j++){
+                if(!visited[i*2-1][j*2]) dp[i][j]+=dp[i-1][j];//세로로 들어오는 공사도로가 없으면 +
+                if(!visited[i*2][j*2-1]) dp[i][j]+=dp[i][j-1];//가로로 들어오는 공사도로가 없으면 +
+            }
+        }
+
+        System.out.println(dp[n][m]);
+    }
+}
diff --git a/hyeon-uk/2022/0213~0219/P2644.java b/hyeon-uk/2022/0213~0219/P2644.java
new file mode 100644
index 0000000..6b42d68
--- /dev/null
+++ b/hyeon-uk/2022/0213~0219/P2644.java
@@ -0,0 +1,61 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+
+public class P2644 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+        int n,m,a,b;
+        ArrayList<ArrayList<Integer>> graph=new ArrayList<>();
+        Queue<Integer> q=new LinkedList<>();
+        int dist[];
+        boolean visited[];
+
+        n=Integer.parseInt(br.readLine());
+        st=new StringTokenizer(br.readLine()," ");
+        a=Integer.parseInt(st.nextToken());
+        b=Integer.parseInt(st.nextToken());
+        m=Integer.parseInt(br.readLine());
+
+        for(int i=0;i<=n;i++){
+            graph.add(new ArrayList<>());
+        }
+        dist=new int[n+1];
+        visited=new boolean[n+1];
+
+        for(int i=0;i<m;i++){
+            st=new StringTokenizer(br.readLine()," ");
+            int u=Integer.parseInt(st.nextToken());
+            int v=Integer.parseInt(st.nextToken());
+
+            graph.get(u).add(v);
+            graph.get(v).add(u);
+        }
+
+        q.offer(a);
+        visited[a]=true;
+        while(!q.isEmpty()){
+            int now=q.poll();
+
+            if(now==b) break;
+
+            for(int next:graph.get(now)){
+                if(!visited[next]){
+                    visited[next]=true;
+                    dist[next]=dist[now]+1;
+                    q.offer(next);
+                }
+            }
+        }
+
+        if(dist[b]==0){
+            System.out.println(-1);
+        }
+        else{
+            System.out.println(dist[b]);
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0213~0219/P4095.java b/hyeon-uk/2022/0213~0219/P4095.java
new file mode 100644
index 0000000..46ed0da
--- /dev/null
+++ b/hyeon-uk/2022/0213~0219/P4095.java
@@ -0,0 +1,54 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.StringTokenizer;
+
+
+public class P4095 {
+    public static int maze[][]=new int[1000][1000];
+    public static int dp[][]=new int[1000][1000];
+    public static int n,m,ret;
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st;
+        while(true){
+            st=new StringTokenizer(br.readLine()," ");
+            n=Integer.parseInt(st.nextToken());
+            m=Integer.parseInt(st.nextToken());
+
+            if(n==0&&m==0) break;
+
+            for(int i=0;i<n;i++){
+                Arrays.fill(dp[i],0);
+                st=new StringTokenizer(br.readLine()," ");
+                for(int j=0;j<m;j++){
+                    maze[i][j]=Integer.parseInt(st.nextToken());
+                }
+            }
+
+            //가로 세로 초기화
+            for(int i=0;i<m;i++){
+                if(maze[0][i]==1) dp[0][i]=1;
+                if(maze[i][0]==1) dp[i][0]=1;
+            }
+            ret=0;
+
+            for(int i=1;i<n;i++){
+                for(int j=1;j<m;j++){
+                    if(maze[i][j]==1) {
+                        dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1;
+
+                    }
+                }
+            }
+
+            for(int i=0;i<n;i++){
+                for(int j=0;j<n;j++){
+                    ret=Math.max(ret,dp[i][j]);
+                }
+            }
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0220~0226/P17212.java b/hyeon-uk/2022/0220~0226/P17212.java
new file mode 100644
index 0000000..064de7d
--- /dev/null
+++ b/hyeon-uk/2022/0220~0226/P17212.java
@@ -0,0 +1,22 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+
+public class P17212 {
+    public static int dp[]=new int[100001];
+    public static int money[]=new int[]{1,2,5,7};
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        int n=Integer.parseInt(br.readLine());
+        Arrays.fill(dp,10000000);
+        dp[0]=0;
+        for(int i=0;i<4;i++){
+            int now=money[i];
+            for(int j=now;j<=n;j++){
+                dp[j]=Math.min(dp[j],1+dp[j-now]);
+            }
+        }
+        System.out.println(dp[n]);
+    }
+}
diff --git a/hyeon-uk/2022/0220~0226/P1874.java b/hyeon-uk/2022/0220~0226/P1874.java
new file mode 100644
index 0000000..cd0c252
--- /dev/null
+++ b/hyeon-uk/2022/0220~0226/P1874.java
@@ -0,0 +1,42 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.Stack;
+
+public class P1874 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        List<Character> op=new LinkedList<>();
+        Stack<Integer> num=new Stack<>();
+        int n=Integer.parseInt(br.readLine());
+        int data=1;
+        for(int i=0;i<n;i++){
+            int now=Integer.parseInt(br.readLine());
+
+            if(num.isEmpty()){
+                num.push(data++);
+                op.add('+');
+            }
+            if(num.peek()>now){
+                System.out.println("NO");
+                return;
+            }
+            while(num.peek()<now){
+                num.push(data++);
+                op.add('+');
+            }
+            if(now==num.peek()){
+                num.pop();
+                op.add('-');
+            }
+        }
+
+        for (char d : op) {
+            System.out.println(d);
+        }
+
+    }
+
+}
diff --git a/hyeon-uk/2022/0220~0226/P20056.java b/hyeon-uk/2022/0220~0226/P20056.java
new file mode 100644
index 0000000..fc5dfd7
--- /dev/null
+++ b/hyeon-uk/2022/0220~0226/P20056.java
@@ -0,0 +1,127 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+
+public class P20056 {
+    public static ArrayList<FireBall> maze[][];
+    public static ArrayList<FireBall> fireBalls;
+    public static int n,m,k;
+    public static int mr[]=new int[]{-1,-1,0,1,1,1,0,-1};
+    public static int mc[]=new int[]{0,1,1,1,0,-1,-1,-1};
+
+    static class FireBall{
+        int r,c,m,s,d;
+
+        public FireBall(int r, int c, int m, int s, int d) {
+            this.r = r;
+            this.c = c;
+            this.m = m;
+            this.s = s;
+            this.d = d;
+        }
+    }
+
+    public static void fireBallMove(){
+        for(FireBall fireBall:fireBalls){
+
+            int nr = (n+fireBall.r + (fireBall.s%n) * mr[fireBall.d])%n;
+            int nc = (n+fireBall.c + (fireBall.s%n) * mc[fireBall.d])%n;
+
+            fireBall.r=nr;
+            fireBall.c=nc;
+
+            maze[fireBall.r][fireBall.c].add(fireBall);
+        }
+    }
+
+    public static void dividFireBalls(){
+        for(int i=0;i<n;i++){
+            for(int j=0;j<n;j++){
+                if(maze[i][j].size()>=2){
+                    boolean flag=true;
+                    int mSum=0;
+                    int sSum=0;
+
+                    boolean even=true;
+                    for(int d=0;d<maze[i][j].size();d++){
+                        if(maze[i][j].get(d).d%2!=0) {
+                            even=false;
+                            break;
+                        }
+                    }
+
+                    boolean odd=true;
+                    for(int d=0;d<maze[i][j].size();d++){
+                        if(maze[i][j].get(d).d%2==0){
+                            odd=false;
+                            break;
+                        }
+                    }
+
+                    flag=even|odd;
+
+                    for(FireBall f:maze[i][j]){
+                        mSum+=f.m;
+                        sSum+=f.s;
+                        fireBalls.remove(f);
+                    }
+                    mSum/=5;
+                    sSum/=maze[i][j].size();
+                    if(mSum!=0){
+                        if(flag) {
+                            for(int d=0;d<=6;d+=2) {
+                                fireBalls.add(new FireBall(i, j, mSum , sSum, d));
+                            }
+                        }
+                        else{
+                            for(int d=1;d<=7;d+=2){
+                                fireBalls.add(new FireBall(i, j, mSum, sSum, d));
+                            }
+                        }
+                    }
+                }
+                maze[i][j].clear();
+            }
+        }
+    }
+
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        n=Integer.parseInt(st.nextToken());
+        m=Integer.parseInt(st.nextToken());
+        k=Integer.parseInt(st.nextToken());
+
+        maze=new ArrayList[n][n];
+        for(int i=0;i<n;i++){
+            for(int j=0;j<n;j++){
+                maze[i][j]=new ArrayList<>();
+            }
+        }
+        fireBalls=new ArrayList<>();
+
+        for(int i=0;i<m;i++){
+            st=new StringTokenizer(br.readLine()," ");
+            int r=Integer.parseInt(st.nextToken());
+            int c=Integer.parseInt(st.nextToken());
+            int dm=Integer.parseInt(st.nextToken());
+            int ds=Integer.parseInt(st.nextToken());
+            int dd=Integer.parseInt(st.nextToken());
+            fireBalls.add(new FireBall(r,c,dm,ds,dd));
+        }
+
+        for(int i=0;i<k;i++){
+            fireBallMove();
+            dividFireBalls();
+        }
+        int ret=0;
+        for(FireBall f:fireBalls){
+            ret+=f.m;
+        }
+        System.out.println(ret);
+    }
+
+}
diff --git a/hyeon-uk/2022/0220~0226/P7682.java b/hyeon-uk/2022/0220~0226/P7682.java
new file mode 100644
index 0000000..3a4d5fa
--- /dev/null
+++ b/hyeon-uk/2022/0220~0226/P7682.java
@@ -0,0 +1,53 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+import java.util.regex.Pattern;
+
+public class P7682 {
+    public static String check(String str){
+        char maze[][]=new char[3][3];
+        int xCount=0;
+        int oCount=0;
+        for(int i=0;i<9;i++){
+            maze[i/3][i%3]=str.charAt(i);
+            if(str.charAt(i)=='X') xCount++;
+            if(str.charAt(i)=='O') oCount++;
+        }
+
+        boolean xWin=false;
+        boolean oWin=false;
+
+        //가로 세로로 누가 이겼는지 확인
+        for(int i=0;i<3;i++){
+            if(maze[i][0]==maze[i][1]&&maze[i][1]==maze[i][2]){
+                if(maze[i][0]=='X') xWin=true;
+                if(maze[i][0]=='O') oWin=true;
+            }
+            if(maze[0][i]==maze[1][i]&&maze[1][i]==maze[2][i]){
+                if(maze[0][i]=='X') xWin=true;
+                if(maze[0][i]=='O') oWin=true;
+            }
+        }
+
+        //대각선도 확인
+        if(maze[0][0]==maze[1][1]&&maze[1][1]==maze[2][2] || maze[0][2]==maze[1][1]&&maze[1][1]==maze[2][0]){
+            if(maze[1][1]=='X') xWin=true;
+            if(maze[1][1]=='O') oWin=true;
+        }
+
+        if(xWin&&!oWin&&xCount-oCount==1) return "valid";
+        else if(!xWin&&oWin&&xCount==oCount) return "valid";
+        else if(!xWin&&!oWin&&xCount==5&&oCount==4) return "valid";
+        else return "invalid";
+    }
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        while(true){
+            String str=br.readLine();
+            if(str.equals("end")) break;
+
+            System.out.println(check(str));
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0227~0305/P11722.java b/hyeon-uk/2022/0227~0305/P11722.java
new file mode 100644
index 0000000..220e290
--- /dev/null
+++ b/hyeon-uk/2022/0227~0305/P11722.java
@@ -0,0 +1,42 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class P11722 {
+    public static int lower_bound(Vector<Integer> list,int start,int end,int target){
+        while(start<=end){
+            int middle=(start+end)>>1;
+
+            if(list.get(middle)<=target){
+                end=middle-1;
+            }
+            else{
+                start=middle+1;
+            }
+        }
+        return start;
+    }
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        int n=Integer.parseInt(br.readLine());
+        Vector<Integer> list=new Vector<>();
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        for(int i=0;i<n;i++){
+            int now=Integer.parseInt(st.nextToken());
+            if(list.isEmpty()){
+                list.add(now);
+            }else{
+                int ind=lower_bound(list,0,list.size()-1,now);
+                if(list.size()<=ind){
+                    list.add(now);
+                }
+                else{
+                    list.setElementAt(now,ind);
+                }
+            }
+        }
+
+        System.out.println(list.size());
+    }
+}
diff --git a/hyeon-uk/2022/0227~0305/P2798.java b/hyeon-uk/2022/0227~0305/P2798.java
new file mode 100644
index 0000000..17d1a9c
--- /dev/null
+++ b/hyeon-uk/2022/0227~0305/P2798.java
@@ -0,0 +1,32 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class P2798 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        int n=Integer.parseInt(st.nextToken());
+        int m=Integer.parseInt(st.nextToken());
+        List<Integer> list=new ArrayList<>();
+        st=new StringTokenizer(br.readLine()," ");
+        for(int i=0;i<n;i++){
+            list.add(Integer.parseInt(st.nextToken()));
+        }
+        int ret=0;
+        for(int i=0;i<list.size();i++){
+            for(int j=0;j<list.size();j++){
+                for(int k=0;k<list.size();k++){
+                    if(i!=j&&j!=k&&k!=i){
+                        int sum=list.get(i)+list.get(j)+list.get(k);
+                        if(sum<=m){
+                            ret=Math.max(ret,sum);
+                        }
+                    }
+                }
+            }
+        }
+        System.out.println(ret);
+    }
+}
diff --git a/hyeon-uk/2022/0227~0305/P9342.java b/hyeon-uk/2022/0227~0305/P9342.java
new file mode 100644
index 0000000..415289c
--- /dev/null
+++ b/hyeon-uk/2022/0227~0305/P9342.java
@@ -0,0 +1,22 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+import java.util.regex.Pattern;
+
+public class P9342 {
+    public static String check(String st){
+        String pattern="^[A-F]?A+F+C+[A-F]?$";
+        boolean regex= Pattern.matches(pattern,st);
+        return !regex ? "Good" : "Infected!";
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        int t=Integer.parseInt(br.readLine());
+        while(t-->0){
+            String st=br.readLine();
+            System.out.println(check(st));
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0227~0305/P9375.java b/hyeon-uk/2022/0227~0305/P9375.java
new file mode 100644
index 0000000..69bcb60
--- /dev/null
+++ b/hyeon-uk/2022/0227~0305/P9375.java
@@ -0,0 +1,30 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class P9375 {
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        int t=Integer.parseInt(br.readLine());
+        while(t-->0){
+            int n=Integer.parseInt(br.readLine());
+            Map<String,Integer> count=new HashMap<>();
+            int kindCnt=0;
+            for(int i=0;i<n;i++) {
+                StringTokenizer st = new StringTokenizer(br.readLine(), " ");
+                String clothes = st.nextToken();
+                String kind = st.nextToken();
+                if(count.get(kind)==null){
+                    count.put(kind,0);
+                }
+                count.put(kind, count.get(kind) + 1);
+            }
+            int ret = 1;
+            for (int value : count.values()) {
+                ret *= (value+1);
+            }
+            System.out.println(ret-1);
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0306~0312/P11568.java b/hyeon-uk/2022/0306~0312/P11568.java
new file mode 100644
index 0000000..436d70a
--- /dev/null
+++ b/hyeon-uk/2022/0306~0312/P11568.java
@@ -0,0 +1,44 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class P11568 {
+    public static int n;
+    public static Vector<Integer> list=new Vector<>();
+    public static int lower_bound(Vector<Integer> list,int start,int end,int target){
+        while(start<=end){
+            int middle=(start+end)/2;
+
+            if(list.get(middle)>=target){
+                end=middle-1;
+            }
+            else{
+                start=middle+1;
+            }
+        }
+        return start;
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        n=Integer.parseInt(br.readLine());
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        for(int i=0;i<n;i++){
+            int now=Integer.parseInt(st.nextToken());
+            if(list.isEmpty()){
+                list.add(now);
+            }
+            else{
+                int index=lower_bound(list,0,list.size()-1,now);
+                if(list.size()<=index){
+                    list.add(now);
+                }
+                else {
+                    list.set(index, now);
+                }
+            }
+        }
+        System.out.println(list.size());
+    }
+}
diff --git a/hyeon-uk/2022/0306~0312/P14595.java b/hyeon-uk/2022/0306~0312/P14595.java
new file mode 100644
index 0000000..81cc73a
--- /dev/null
+++ b/hyeon-uk/2022/0306~0312/P14595.java
@@ -0,0 +1,57 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class P14595 {
+    public static class Room{
+        int start;
+        int end;
+        public Room(int start,int end){
+            this.start=start;
+            this.end=end;
+        }
+    }
+
+    public static int n,m;
+    public static List<Room> rooms=new ArrayList<>();
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        n=Integer.parseInt(br.readLine());
+        m=Integer.parseInt(br.readLine());
+        for(int i=0;i<m;i++){
+            StringTokenizer st=new StringTokenizer(br.readLine()," ");
+            int x=Integer.parseInt(st.nextToken());
+            int y=Integer.parseInt(st.nextToken());
+            rooms.add(new Room(x,y));
+        }
+
+        rooms.sort(new Comparator<Room>() {
+            @Override
+            public int compare(Room o1, Room o2) {
+                return o1.start-o2.start;
+            }
+        });
+        if(m==0){
+            System.out.println(n);
+        }
+        else {
+            int startRoom = rooms.get(0).start;
+            int endRoom = rooms.get(0).end;
+            int ret = startRoom;
+
+            for (int i = 1; i < rooms.size(); i++) {
+                if(rooms.get(i).start<=endRoom){
+                    endRoom=Math.max(endRoom,rooms.get(i).end);
+                }
+                else{
+                    ret+=(rooms.get(i).start-endRoom);
+                    startRoom=rooms.get(i).start;
+                    endRoom=rooms.get(i).end;
+                }
+            }
+            ret += n - endRoom;
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0306~0312/P15664.java b/hyeon-uk/2022/0306~0312/P15664.java
new file mode 100644
index 0000000..df1e3b0
--- /dev/null
+++ b/hyeon-uk/2022/0306~0312/P15664.java
@@ -0,0 +1,54 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.*;
+
+public class P15664 {
+    public static List<Integer> list=new ArrayList<>();
+    public static List<Integer> ret=new ArrayList<>();
+    public static Map<String,Boolean> check=new HashMap<>();
+    public static int n,m;
+
+    public static void dfs(int index,int cnt){
+        if(cnt==m){
+            String tempCheck="";
+            for(int i=0;i<m;i++){
+                tempCheck+= ret.get(i).toString();
+            }
+            if(check.get(tempCheck)==null){
+                check.put(tempCheck,true);
+                for(int i=0;i<m;i++){
+                    System.out.print(ret.get(i)+" ");
+                }
+                System.out.println();
+            }
+            return;
+        }
+        for(int i=index+1;i<n;i++){
+            ret.add(list.get(i));
+            dfs(i,cnt+1);
+            ret.remove(cnt);
+            dfs(i,cnt);
+        }
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        n=Integer.parseInt(st.nextToken());
+        m=Integer.parseInt(st.nextToken());
+        st=new StringTokenizer(br.readLine(), " ");
+        for(int i=0;i<n;i++){
+            list.add(Integer.parseInt(st.nextToken()));
+        }
+        list.sort(new Comparator<Integer>() {
+            @Override
+            public int compare(Integer o1, Integer o2) {
+                return o1-o2;
+            }
+        });
+
+        dfs(-1,0);
+
+    }
+}
diff --git a/hyeon-uk/2022/0306~0312/P1864.java b/hyeon-uk/2022/0306~0312/P1864.java
new file mode 100644
index 0000000..8295ea2
--- /dev/null
+++ b/hyeon-uk/2022/0306~0312/P1864.java
@@ -0,0 +1,42 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.HashMap;
+import java.util.Map;
+
+public class P1864 {
+    public static Map<Character,Integer> map;
+
+    public static void setting(){
+        map=new HashMap<>();
+        map.put('-',0);
+        map.put('\\',1);
+        map.put('(',2);
+        map.put('@',3);
+        map.put('?',4);
+        map.put('>',5);
+        map.put('&',6);
+        map.put('%',7);
+        map.put('/',-1);
+    }
+    public static int calc(String str){
+        int num=1;
+        int ret=0;
+        for(int i=str.length()-1;i>=0;i--){
+            char c=str.charAt(i);
+            ret=ret+(map.get(c)*num);
+            num*=8;
+        }
+        return ret;
+    }
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        setting();
+        while(true){
+            String str=br.readLine();
+            if(str.equals("#")) break;
+
+            System.out.println(calc(str));
+        }
+    }
+}
diff --git a/hyeon-uk/2022/0327~0402/P17085.java b/hyeon-uk/2022/0327~0402/P17085.java
new file mode 100644
index 0000000..aefdb19
--- /dev/null
+++ b/hyeon-uk/2022/0327~0402/P17085.java
@@ -0,0 +1,99 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.StringTokenizer;
+
+public class Main {
+    public static char maze[][]=new char[15][15];
+    public static int ret=1;
+    public static int n,m;
+    public static int mv[][]=new int[][]{{1,0},{-1,0},{0,1},{0,-1}};
+
+    public static boolean isIn(int x,int y){
+        return x>=0&&x<n&&y>=0&&y<m;
+    }
+
+    public static void removeCross(int x,int y,int len){
+        for(int d=0;d<4;d++){
+            for(int l=1;l<=len;l++){
+                int nx=x+mv[d][0]*l;
+                int ny=y+mv[d][1]*l;
+                maze[nx][ny]='.';
+            }
+        }
+        maze[x][y]='.';
+    }
+    public static void paintCross(int x,int y,int len){
+        for(int d=0;d<4;d++){
+            for(int l=1;l<=len;l++){
+                int nx=x+mv[d][0]*l;
+                int ny=y+mv[d][1]*l;
+                maze[nx][ny]='#';
+            }
+        }
+        maze[x][y]='#';
+    }
+
+    public static boolean isCross(int x,int y,int len){
+        boolean flag=true;
+        for(int d=0;d<4;d++){
+            for(int l=1;l<=len;l++){
+                int nx=x+mv[d][0]*l;
+                int ny=y+mv[d][1]*l;
+
+                if(isIn(nx,ny)&&maze[nx][ny]=='#'){
+                    flag=true;
+                }
+                else{
+                    flag=false;
+                    break;
+                }
+            }
+            if(!flag) break;
+        }
+        return flag;
+    }
+
+    public static void trace(int score,int cnt){
+        if(cnt==2){
+            ret=Math.max(score,ret);
+            return;
+        }
+        boolean flag=false;
+        for(int i=0;i<n;i++){
+            for(int j=0;j<m;j++){
+                if(maze[i][j]=='#'){
+                    int len=0;
+                    while(isCross(i,j,len)){
+                        removeCross(i,j,len);
+                        trace(score*(4*len+1),cnt+1);
+                        paintCross(i,j,len);
+                        len++;
+                        flag=true;
+                    }
+                }
+            }
+        }
+        if(!flag) return;
+    }
+
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine(), " ");
+        n=Integer.parseInt(st.nextToken());
+        m=Integer.parseInt(st.nextToken());
+        for(int i=0;i<n;i++){
+            String str=br.readLine();
+            for(int j=0;j<m;j++){
+                maze[i][j]=str.charAt(j);
+            }
+        }
+        trace(1,0);
+        System.out.println(ret);
+
+    }
+}
diff --git a/hyeon-uk/2022/0327~0402/P2422.java b/hyeon-uk/2022/0327~0402/P2422.java
new file mode 100644
index 0000000..42e6f12
--- /dev/null
+++ b/hyeon-uk/2022/0327~0402/P2422.java
@@ -0,0 +1,40 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class Main {
+    public static boolean cantMix[][]=new boolean[201][201];
+
+    public static boolean canMix(int i,int j,int k){
+        if(cantMix[i][j]|| cantMix[i][k]||cantMix[j][k]) return false;
+        else return true;
+    }
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        int n=Integer.parseInt(st.nextToken());
+        int m=Integer.parseInt(st.nextToken());
+        for(int i=0;i<m;i++){
+            st=new StringTokenizer(br.readLine()," ");
+            int a=Integer.parseInt(st.nextToken());
+            int b=Integer.parseInt(st.nextToken());
+            if(a>b){
+                int temp=a;
+                a=b;
+                b=temp;
+            }
+            cantMix[a][b]=true;
+        }
+        int ret=0;
+        for(int i=1;i<=n;i++){
+            for(int j=i+1;j<=n;j++){
+                for(int k=j+1;k<=n;k++){
+                    if(canMix(i,j,k)) ret++;
+                }
+            }
+        }
+        System.out.println(ret);
+    }
+}
diff --git a/hyeon-uk/2022/0327~0402/P3151.java b/hyeon-uk/2022/0327~0402/P3151.java
new file mode 100644
index 0000000..3deb278
--- /dev/null
+++ b/hyeon-uk/2022/0327~0402/P3151.java
@@ -0,0 +1,66 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.lang.reflect.Array;
+import java.util.Arrays;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.StringTokenizer;
+
+public class Main {
+    public static boolean check[][];
+    public static int n,m;
+    public static long ret=0;
+    public static int arr[];
+
+    public static int upper_bound(int left,int right,int target){
+        while(left<right){
+            int middle=(left+right)>>1;
+            if(arr[middle]<=target){
+                left=middle+1;
+            }
+            else{
+                right=middle;
+            }
+        }
+        return right;
+    }
+
+    public static int lower_bound(int left,int right,int target){
+        while(left<right){
+            int middle=(left+right)>>1;
+
+            if(arr[middle]>=target){
+                right=middle;
+            }
+            else{
+                left=middle+1;
+            }
+        }
+        return right;
+    }
+
+
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        n=Integer.parseInt(br.readLine());
+        arr=new int[n];
+        check=new boolean[n][n];
+        StringTokenizer st=new StringTokenizer(br.readLine()," ");
+        for(int i=0;i<n;i++){
+            arr[i]=Integer.parseInt(st.nextToken());
+        }
+        Arrays.sort(arr);
+        for(int i=0;i<n-2;i++){
+            for(int j=i+1;j<n-1;j++){
+                int target=(arr[i]+arr[j])*-1;
+                int ind1=lower_bound(j+1,n,target);
+                if(ind1<n&&arr[ind1]==target){
+                    int ind2=upper_bound(j+1,n,target);
+                    ret+=(ind2-ind1);
+                }
+            }
+        }
+        System.out.println(ret);
+    }
+}
diff --git a/hyeon-uk/2022/0327~0402/P3980.java b/hyeon-uk/2022/0327~0402/P3980.java
new file mode 100644
index 0000000..877270f
--- /dev/null
+++ b/hyeon-uk/2022/0327~0402/P3980.java
@@ -0,0 +1,43 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.Arrays;
+import java.util.LinkedList;
+import java.util.List;
+import java.util.StringTokenizer;
+
+public class Main {
+    public static boolean check[]=new boolean[11];
+    public static int ret=0;
+    public static void dfs(List<List<Integer>> arr,int score,int cnt){
+        if(cnt==11){
+            ret=Math.max(ret,score);
+            return;
+        }
+        for(int i=0;i<11;i++){
+            if(!check[i] && arr.get(i).get(cnt)!=0){
+                check[i]=true;
+                dfs(arr,score+arr.get(i).get(cnt),cnt+1);
+                check[i]=false;
+            }
+        }
+    }
+    public static void main(String[] args) throws IOException {
+        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
+        int t=Integer.parseInt(br.readLine());
+        while(t-- > 0 ) {
+            List<List<Integer>> arr=new LinkedList<>();
+            for(int i=0;i<11;i++){
+                arr.add(new LinkedList<>());
+                StringTokenizer st = new StringTokenizer(br.readLine(), " ");
+                for(int j=0;j<11;j++){
+                    arr.get(i).add(Integer.parseInt(st.nextToken()));
+                }
+            }
+            ret=0;
+            Arrays.fill(check,false);
+            dfs(arr,0,0);
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/TnJ/2020/20200318/BOJ_1620.cpp b/jerry0339/2020/20200318/BOJ_1620.cpp
similarity index 100%
rename from TnJ/2020/20200318/BOJ_1620.cpp
rename to jerry0339/2020/20200318/BOJ_1620.cpp
diff --git a/TnJ/2020/20200318/BOJ_2231.cpp b/jerry0339/2020/20200318/BOJ_2231.cpp
similarity index 100%
rename from TnJ/2020/20200318/BOJ_2231.cpp
rename to jerry0339/2020/20200318/BOJ_2231.cpp
diff --git a/TnJ/2020/20200318/BOJ_7568.cpp b/jerry0339/2020/20200318/BOJ_7568.cpp
similarity index 100%
rename from TnJ/2020/20200318/BOJ_7568.cpp
rename to jerry0339/2020/20200318/BOJ_7568.cpp
diff --git a/TnJ/2020/20200319/BOJ_1260.cpp b/jerry0339/2020/20200319/BOJ_1260.cpp
similarity index 100%
rename from TnJ/2020/20200319/BOJ_1260.cpp
rename to jerry0339/2020/20200319/BOJ_1260.cpp
diff --git a/TnJ/2020/20200319/BOJ_1436.cpp b/jerry0339/2020/20200319/BOJ_1436.cpp
similarity index 100%
rename from TnJ/2020/20200319/BOJ_1436.cpp
rename to jerry0339/2020/20200319/BOJ_1436.cpp
diff --git a/TnJ/2020/20200319/BOJ_2805.cpp b/jerry0339/2020/20200319/BOJ_2805.cpp
similarity index 100%
rename from TnJ/2020/20200319/BOJ_2805.cpp
rename to jerry0339/2020/20200319/BOJ_2805.cpp
diff --git a/TnJ/2020/20200320/BOJ_12761.cpp b/jerry0339/2020/20200320/BOJ_12761.cpp
similarity index 100%
rename from TnJ/2020/20200320/BOJ_12761.cpp
rename to jerry0339/2020/20200320/BOJ_12761.cpp
diff --git a/TnJ/2020/20200320/BOJ_15354.cpp b/jerry0339/2020/20200320/BOJ_15354.cpp
similarity index 100%
rename from TnJ/2020/20200320/BOJ_15354.cpp
rename to jerry0339/2020/20200320/BOJ_15354.cpp
diff --git a/TnJ/2020/20200320/BOJ_15355.cpp b/jerry0339/2020/20200320/BOJ_15355.cpp
similarity index 100%
rename from TnJ/2020/20200320/BOJ_15355.cpp
rename to jerry0339/2020/20200320/BOJ_15355.cpp
diff --git a/TnJ/2020/20200320/writeUp.md b/jerry0339/2020/20200320/writeUp.md
similarity index 100%
rename from TnJ/2020/20200320/writeUp.md
rename to jerry0339/2020/20200320/writeUp.md
diff --git a/TnJ/2020/20200321/BOJ_14501.cpp b/jerry0339/2020/20200321/BOJ_14501.cpp
similarity index 100%
rename from TnJ/2020/20200321/BOJ_14501.cpp
rename to jerry0339/2020/20200321/BOJ_14501.cpp
diff --git a/TnJ/2020/20200321/BOJ_1987.cpp b/jerry0339/2020/20200321/BOJ_1987.cpp
similarity index 100%
rename from TnJ/2020/20200321/BOJ_1987.cpp
rename to jerry0339/2020/20200321/BOJ_1987.cpp
diff --git a/TnJ/2020/20200321/BOJ_9012.c b/jerry0339/2020/20200321/BOJ_9012.c
similarity index 100%
rename from TnJ/2020/20200321/BOJ_9012.c
rename to jerry0339/2020/20200321/BOJ_9012.c
diff --git a/TnJ/2020/20200321/writeUp.md b/jerry0339/2020/20200321/writeUp.md
similarity index 100%
rename from TnJ/2020/20200321/writeUp.md
rename to jerry0339/2020/20200321/writeUp.md
diff --git a/TnJ/2020/20200323/BOJ_15650.cpp b/jerry0339/2020/20200323/BOJ_15650.cpp
similarity index 100%
rename from TnJ/2020/20200323/BOJ_15650.cpp
rename to jerry0339/2020/20200323/BOJ_15650.cpp
diff --git a/TnJ/2020/20200323/BOJ_2580.cpp b/jerry0339/2020/20200323/BOJ_2580.cpp
similarity index 100%
rename from TnJ/2020/20200323/BOJ_2580.cpp
rename to jerry0339/2020/20200323/BOJ_2580.cpp
diff --git a/TnJ/2020/20200323/BOJ_2630.cpp b/jerry0339/2020/20200323/BOJ_2630.cpp
similarity index 100%
rename from TnJ/2020/20200323/BOJ_2630.cpp
rename to jerry0339/2020/20200323/BOJ_2630.cpp
diff --git a/TnJ/2020/20200324/BOJ_1780.cpp b/jerry0339/2020/20200324/BOJ_1780.cpp
similarity index 100%
rename from TnJ/2020/20200324/BOJ_1780.cpp
rename to jerry0339/2020/20200324/BOJ_1780.cpp
diff --git a/TnJ/2020/20200324/BOJ_2293.cpp b/jerry0339/2020/20200324/BOJ_2293.cpp
similarity index 100%
rename from TnJ/2020/20200324/BOJ_2293.cpp
rename to jerry0339/2020/20200324/BOJ_2293.cpp
diff --git a/TnJ/2020/20200325/BOJ_11403.cpp b/jerry0339/2020/20200325/BOJ_11403.cpp
similarity index 100%
rename from TnJ/2020/20200325/BOJ_11403.cpp
rename to jerry0339/2020/20200325/BOJ_11403.cpp
diff --git a/TnJ/2020/20200325/BOJ_15591_BFS.cpp b/jerry0339/2020/20200325/BOJ_15591_BFS.cpp
similarity index 100%
rename from TnJ/2020/20200325/BOJ_15591_BFS.cpp
rename to jerry0339/2020/20200325/BOJ_15591_BFS.cpp
diff --git a/TnJ/2020/20200325/BOJ_15591_DFS.cpp b/jerry0339/2020/20200325/BOJ_15591_DFS.cpp
similarity index 100%
rename from TnJ/2020/20200325/BOJ_15591_DFS.cpp
rename to jerry0339/2020/20200325/BOJ_15591_DFS.cpp
diff --git a/TnJ/2020/20200325/BOJ_17027.cpp b/jerry0339/2020/20200325/BOJ_17027.cpp
similarity index 100%
rename from TnJ/2020/20200325/BOJ_17027.cpp
rename to jerry0339/2020/20200325/BOJ_17027.cpp
diff --git a/TnJ/2020/20200326/BOJ_1759.cpp b/jerry0339/2020/20200326/BOJ_1759.cpp
similarity index 100%
rename from TnJ/2020/20200326/BOJ_1759.cpp
rename to jerry0339/2020/20200326/BOJ_1759.cpp
diff --git a/TnJ/2020/20200326/BOJ_7576.cpp b/jerry0339/2020/20200326/BOJ_7576.cpp
similarity index 100%
rename from TnJ/2020/20200326/BOJ_7576.cpp
rename to jerry0339/2020/20200326/BOJ_7576.cpp
diff --git a/TnJ/2020/20200329/BOJ_11404.cpp b/jerry0339/2020/20200329/BOJ_11404.cpp
similarity index 100%
rename from TnJ/2020/20200329/BOJ_11404.cpp
rename to jerry0339/2020/20200329/BOJ_11404.cpp
diff --git a/TnJ/2020/20200329/BOJ_1697.cpp b/jerry0339/2020/20200329/BOJ_1697.cpp
similarity index 100%
rename from TnJ/2020/20200329/BOJ_1697.cpp
rename to jerry0339/2020/20200329/BOJ_1697.cpp
diff --git a/TnJ/2020/20200329/BOJ_1753.cpp b/jerry0339/2020/20200329/BOJ_1753.cpp
similarity index 100%
rename from TnJ/2020/20200329/BOJ_1753.cpp
rename to jerry0339/2020/20200329/BOJ_1753.cpp
diff --git a/TnJ/2020/20200331/BOJ_14502.cpp b/jerry0339/2020/20200331/BOJ_14502.cpp
similarity index 100%
rename from TnJ/2020/20200331/BOJ_14502.cpp
rename to jerry0339/2020/20200331/BOJ_14502.cpp
diff --git a/TnJ/2020/20200331/BOJ_2022.cpp b/jerry0339/2020/20200331/BOJ_2022.cpp
similarity index 100%
rename from TnJ/2020/20200331/BOJ_2022.cpp
rename to jerry0339/2020/20200331/BOJ_2022.cpp
diff --git a/TnJ/2020/20200402/BOJ_12869.cpp b/jerry0339/2020/20200402/BOJ_12869.cpp
similarity index 100%
rename from TnJ/2020/20200402/BOJ_12869.cpp
rename to jerry0339/2020/20200402/BOJ_12869.cpp
diff --git a/TnJ/2020/20200402/BOJ_17141.cpp b/jerry0339/2020/20200402/BOJ_17141.cpp
similarity index 100%
rename from TnJ/2020/20200402/BOJ_17141.cpp
rename to jerry0339/2020/20200402/BOJ_17141.cpp
diff --git a/TnJ/2020/20200404/BOJ_11048.cpp b/jerry0339/2020/20200404/BOJ_11048.cpp
similarity index 100%
rename from TnJ/2020/20200404/BOJ_11048.cpp
rename to jerry0339/2020/20200404/BOJ_11048.cpp
diff --git a/TnJ/2020/20200404/BOJ_11060.cpp b/jerry0339/2020/20200404/BOJ_11060.cpp
similarity index 100%
rename from TnJ/2020/20200404/BOJ_11060.cpp
rename to jerry0339/2020/20200404/BOJ_11060.cpp
diff --git a/TnJ/2020/20200404/BOJ_15486.cpp b/jerry0339/2020/20200404/BOJ_15486.cpp
similarity index 100%
rename from TnJ/2020/20200404/BOJ_15486.cpp
rename to jerry0339/2020/20200404/BOJ_15486.cpp
diff --git a/TnJ/2020/20200407/BOJ_15989.cpp b/jerry0339/2020/20200407/BOJ_15989.cpp
similarity index 100%
rename from TnJ/2020/20200407/BOJ_15989.cpp
rename to jerry0339/2020/20200407/BOJ_15989.cpp
diff --git a/TnJ/2020/20200407/BOJ_2251.cpp b/jerry0339/2020/20200407/BOJ_2251.cpp
similarity index 100%
rename from TnJ/2020/20200407/BOJ_2251.cpp
rename to jerry0339/2020/20200407/BOJ_2251.cpp
diff --git a/TnJ/2020/20200411/BOJ_2011.cpp b/jerry0339/2020/20200411/BOJ_2011.cpp
similarity index 100%
rename from TnJ/2020/20200411/BOJ_2011.cpp
rename to jerry0339/2020/20200411/BOJ_2011.cpp
diff --git a/TnJ/2020/20200411/BOJ_2225.cpp b/jerry0339/2020/20200411/BOJ_2225.cpp
similarity index 100%
rename from TnJ/2020/20200411/BOJ_2225.cpp
rename to jerry0339/2020/20200411/BOJ_2225.cpp
diff --git a/TnJ/2020/20200411/BOJ_9461.cpp b/jerry0339/2020/20200411/BOJ_9461.cpp
similarity index 100%
rename from TnJ/2020/20200411/BOJ_9461.cpp
rename to jerry0339/2020/20200411/BOJ_9461.cpp
diff --git a/TnJ/2020/20200414/BOJ_10844.cpp b/jerry0339/2020/20200414/BOJ_10844.cpp
similarity index 100%
rename from TnJ/2020/20200414/BOJ_10844.cpp
rename to jerry0339/2020/20200414/BOJ_10844.cpp
diff --git a/TnJ/2020/20200414/BOJ_2600.cpp b/jerry0339/2020/20200414/BOJ_2600.cpp
similarity index 100%
rename from TnJ/2020/20200414/BOJ_2600.cpp
rename to jerry0339/2020/20200414/BOJ_2600.cpp
diff --git a/TnJ/2020/20200414/BOJ_3067.cpp b/jerry0339/2020/20200414/BOJ_3067.cpp
similarity index 100%
rename from TnJ/2020/20200414/BOJ_3067.cpp
rename to jerry0339/2020/20200414/BOJ_3067.cpp
diff --git a/TnJ/2020/20200416/BOJ_10422.cpp b/jerry0339/2020/20200416/BOJ_10422.cpp
similarity index 100%
rename from TnJ/2020/20200416/BOJ_10422.cpp
rename to jerry0339/2020/20200416/BOJ_10422.cpp
diff --git a/TnJ/2020/20200416/BOJ_11058.cpp b/jerry0339/2020/20200416/BOJ_11058.cpp
similarity index 100%
rename from TnJ/2020/20200416/BOJ_11058.cpp
rename to jerry0339/2020/20200416/BOJ_11058.cpp
diff --git a/TnJ/2020/20200416/BOJ_12969.cpp b/jerry0339/2020/20200416/BOJ_12969.cpp
similarity index 100%
rename from TnJ/2020/20200416/BOJ_12969.cpp
rename to jerry0339/2020/20200416/BOJ_12969.cpp
diff --git a/TnJ/2020/20200420/BOJ_16928.cpp b/jerry0339/2020/20200420/BOJ_16928.cpp
similarity index 100%
rename from TnJ/2020/20200420/BOJ_16928.cpp
rename to jerry0339/2020/20200420/BOJ_16928.cpp
diff --git a/TnJ/2020/20200420/BOJ_2156.cpp b/jerry0339/2020/20200420/BOJ_2156.cpp
similarity index 100%
rename from TnJ/2020/20200420/BOJ_2156.cpp
rename to jerry0339/2020/20200420/BOJ_2156.cpp
diff --git a/TnJ/2020/20200425/BOJ_13549.cpp b/jerry0339/2020/20200425/BOJ_13549.cpp
similarity index 100%
rename from TnJ/2020/20200425/BOJ_13549.cpp
rename to jerry0339/2020/20200425/BOJ_13549.cpp
diff --git a/TnJ/2020/20200425/BOJ_14500.cpp b/jerry0339/2020/20200425/BOJ_14500.cpp
similarity index 100%
rename from TnJ/2020/20200425/BOJ_14500.cpp
rename to jerry0339/2020/20200425/BOJ_14500.cpp
diff --git a/TnJ/2020/20200425/BOJ_2206(bfs+rbfs).cpp b/jerry0339/2020/20200425/BOJ_2206(bfs+rbfs).cpp
similarity index 100%
rename from TnJ/2020/20200425/BOJ_2206(bfs+rbfs).cpp
rename to jerry0339/2020/20200425/BOJ_2206(bfs+rbfs).cpp
diff --git a/TnJ/2020/20200425/BOJ_2206.cpp b/jerry0339/2020/20200425/BOJ_2206.cpp
similarity index 100%
rename from TnJ/2020/20200425/BOJ_2206.cpp
rename to jerry0339/2020/20200425/BOJ_2206.cpp
diff --git a/TnJ/2020/20200519/BOJ_11000.cpp b/jerry0339/2020/20200519/BOJ_11000.cpp
similarity index 100%
rename from TnJ/2020/20200519/BOJ_11000.cpp
rename to jerry0339/2020/20200519/BOJ_11000.cpp
diff --git a/TnJ/2020/20200519/BOJ_14241.cpp b/jerry0339/2020/20200519/BOJ_14241.cpp
similarity index 100%
rename from TnJ/2020/20200519/BOJ_14241.cpp
rename to jerry0339/2020/20200519/BOJ_14241.cpp
diff --git a/TnJ/2020/20200519/BOJ_1789.cpp b/jerry0339/2020/20200519/BOJ_1789.cpp
similarity index 100%
rename from TnJ/2020/20200519/BOJ_1789.cpp
rename to jerry0339/2020/20200519/BOJ_1789.cpp
diff --git a/TnJ/2020/20200519/BOJ_1931.cpp b/jerry0339/2020/20200519/BOJ_1931.cpp
similarity index 100%
rename from TnJ/2020/20200519/BOJ_1931.cpp
rename to jerry0339/2020/20200519/BOJ_1931.cpp
diff --git a/TnJ/2020/20200521/BOJ_16236.cpp b/jerry0339/2020/20200521/BOJ_16236.cpp
similarity index 100%
rename from TnJ/2020/20200521/BOJ_16236.cpp
rename to jerry0339/2020/20200521/BOJ_16236.cpp
diff --git a/TnJ/2020/20200521/BOJ_1946.cpp b/jerry0339/2020/20200521/BOJ_1946.cpp
similarity index 100%
rename from TnJ/2020/20200521/BOJ_1946.cpp
rename to jerry0339/2020/20200521/BOJ_1946.cpp
diff --git a/TnJ/2020/20200521/BOJ_2823.cpp b/jerry0339/2020/20200521/BOJ_2823.cpp
similarity index 100%
rename from TnJ/2020/20200521/BOJ_2823.cpp
rename to jerry0339/2020/20200521/BOJ_2823.cpp
diff --git a/TnJ/2020/20200526/BOJ_11508.cpp b/jerry0339/2020/20200526/BOJ_11508.cpp
similarity index 100%
rename from TnJ/2020/20200526/BOJ_11508.cpp
rename to jerry0339/2020/20200526/BOJ_11508.cpp
diff --git a/TnJ/2020/20200526/BOJ_17086.cpp b/jerry0339/2020/20200526/BOJ_17086.cpp
similarity index 100%
rename from TnJ/2020/20200526/BOJ_17086.cpp
rename to jerry0339/2020/20200526/BOJ_17086.cpp
diff --git a/TnJ/2020/20200526/BOJ_18230.cpp b/jerry0339/2020/20200526/BOJ_18230.cpp
similarity index 100%
rename from TnJ/2020/20200526/BOJ_18230.cpp
rename to jerry0339/2020/20200526/BOJ_18230.cpp
diff --git a/TnJ/2020/20200528/BOJ_17143.cpp b/jerry0339/2020/20200528/BOJ_17143.cpp
similarity index 100%
rename from TnJ/2020/20200528/BOJ_17143.cpp
rename to jerry0339/2020/20200528/BOJ_17143.cpp
diff --git a/TnJ/2020/20200528/BOJ_2138.cpp b/jerry0339/2020/20200528/BOJ_2138.cpp
similarity index 100%
rename from TnJ/2020/20200528/BOJ_2138.cpp
rename to jerry0339/2020/20200528/BOJ_2138.cpp
diff --git a/TnJ/2020/20200701/BOJ_12094.cpp b/jerry0339/2020/20200701/BOJ_12094.cpp
similarity index 100%
rename from TnJ/2020/20200701/BOJ_12094.cpp
rename to jerry0339/2020/20200701/BOJ_12094.cpp
diff --git a/TnJ/2020/20200701/BOJ_12100.cpp b/jerry0339/2020/20200701/BOJ_12100.cpp
similarity index 100%
rename from TnJ/2020/20200701/BOJ_12100.cpp
rename to jerry0339/2020/20200701/BOJ_12100.cpp
diff --git a/TnJ/2020/20200701/BOJ_1706.cpp b/jerry0339/2020/20200701/BOJ_1706.cpp
similarity index 100%
rename from TnJ/2020/20200701/BOJ_1706.cpp
rename to jerry0339/2020/20200701/BOJ_1706.cpp
diff --git a/TnJ/2020/20200701/BOJ_9466.cpp b/jerry0339/2020/20200701/BOJ_9466.cpp
similarity index 100%
rename from TnJ/2020/20200701/BOJ_9466.cpp
rename to jerry0339/2020/20200701/BOJ_9466.cpp
diff --git a/TnJ/2020/20200704/BOJ_14496.cpp b/jerry0339/2020/20200704/BOJ_14496.cpp
similarity index 100%
rename from TnJ/2020/20200704/BOJ_14496.cpp
rename to jerry0339/2020/20200704/BOJ_14496.cpp
diff --git a/TnJ/2020/20200704/BOJ_16137.cpp b/jerry0339/2020/20200704/BOJ_16137.cpp
similarity index 100%
rename from TnJ/2020/20200704/BOJ_16137.cpp
rename to jerry0339/2020/20200704/BOJ_16137.cpp
diff --git a/TnJ/2020/20200704/BOJ_3020.cpp b/jerry0339/2020/20200704/BOJ_3020.cpp
similarity index 100%
rename from TnJ/2020/20200704/BOJ_3020.cpp
rename to jerry0339/2020/20200704/BOJ_3020.cpp
diff --git a/TnJ/2020/20200706&20200709/BOJ_1238.cpp b/jerry0339/2020/20200706&20200709/BOJ_1238.cpp
similarity index 100%
rename from TnJ/2020/20200706&20200709/BOJ_1238.cpp
rename to jerry0339/2020/20200706&20200709/BOJ_1238.cpp
diff --git a/TnJ/2020/20200706&20200709/BOJ_1238_BF_Dijk.cpp b/jerry0339/2020/20200706&20200709/BOJ_1238_BF_Dijk.cpp
similarity index 100%
rename from TnJ/2020/20200706&20200709/BOJ_1238_BF_Dijk.cpp
rename to jerry0339/2020/20200706&20200709/BOJ_1238_BF_Dijk.cpp
diff --git a/TnJ/2020/20200706&20200709/BOJ_1238_FW_solve.cpp b/jerry0339/2020/20200706&20200709/BOJ_1238_FW_solve.cpp
similarity index 100%
rename from TnJ/2020/20200706&20200709/BOJ_1238_FW_solve.cpp
rename to jerry0339/2020/20200706&20200709/BOJ_1238_FW_solve.cpp
diff --git a/TnJ/2020/20200706&20200709/BOJ_1991.cpp b/jerry0339/2020/20200706&20200709/BOJ_1991.cpp
similarity index 100%
rename from TnJ/2020/20200706&20200709/BOJ_1991.cpp
rename to jerry0339/2020/20200706&20200709/BOJ_1991.cpp
diff --git a/TnJ/2020/20200706&20200709/BOJ_5639.cpp b/jerry0339/2020/20200706&20200709/BOJ_5639.cpp
similarity index 100%
rename from TnJ/2020/20200706&20200709/BOJ_5639.cpp
rename to jerry0339/2020/20200706&20200709/BOJ_5639.cpp
diff --git a/TnJ/2020/20200711/BOJ_1238.cpp b/jerry0339/2020/20200711/BOJ_1238.cpp
similarity index 100%
rename from TnJ/2020/20200711/BOJ_1238.cpp
rename to jerry0339/2020/20200711/BOJ_1238.cpp
diff --git a/TnJ/2020/20200711/BOJ_13424.cpp b/jerry0339/2020/20200711/BOJ_13424.cpp
similarity index 100%
rename from TnJ/2020/20200711/BOJ_13424.cpp
rename to jerry0339/2020/20200711/BOJ_13424.cpp
diff --git a/TnJ/2020/20200711/BOJ_5972.cpp b/jerry0339/2020/20200711/BOJ_5972.cpp
similarity index 100%
rename from TnJ/2020/20200711/BOJ_5972.cpp
rename to jerry0339/2020/20200711/BOJ_5972.cpp
diff --git a/TnJ/2020/20200720/BOJ_15685.cpp b/jerry0339/2020/20200720/BOJ_15685.cpp
similarity index 100%
rename from TnJ/2020/20200720/BOJ_15685.cpp
rename to jerry0339/2020/20200720/BOJ_15685.cpp
diff --git a/TnJ/2020/20200720/BOJ_1937.cpp b/jerry0339/2020/20200720/BOJ_1937.cpp
similarity index 100%
rename from TnJ/2020/20200720/BOJ_1937.cpp
rename to jerry0339/2020/20200720/BOJ_1937.cpp
diff --git a/TnJ/2020/20200720/BOJ_2437.cpp b/jerry0339/2020/20200720/BOJ_2437.cpp
similarity index 100%
rename from TnJ/2020/20200720/BOJ_2437.cpp
rename to jerry0339/2020/20200720/BOJ_2437.cpp
diff --git a/TnJ/2020/20200730/BOJ_11066.cpp b/jerry0339/2020/20200730/BOJ_11066.cpp
similarity index 100%
rename from TnJ/2020/20200730/BOJ_11066.cpp
rename to jerry0339/2020/20200730/BOJ_11066.cpp
diff --git a/TnJ/2020/20200730/BOJ_11066_Recursive.cpp b/jerry0339/2020/20200730/BOJ_11066_Recursive.cpp
similarity index 100%
rename from TnJ/2020/20200730/BOJ_11066_Recursive.cpp
rename to jerry0339/2020/20200730/BOJ_11066_Recursive.cpp
diff --git a/TnJ/2020/20200730/BOJ_13974.cpp b/jerry0339/2020/20200730/BOJ_13974.cpp
similarity index 100%
rename from TnJ/2020/20200730/BOJ_13974.cpp
rename to jerry0339/2020/20200730/BOJ_13974.cpp
diff --git a/TnJ/2020/20200730/BOJ_4256.cpp b/jerry0339/2020/20200730/BOJ_4256.cpp
similarity index 100%
rename from TnJ/2020/20200730/BOJ_4256.cpp
rename to jerry0339/2020/20200730/BOJ_4256.cpp
diff --git "a/TnJ/2020/20200803/124\353\202\230\353\235\274\354\235\230\354\210\253\354\236\220.cpp" "b/jerry0339/2020/20200803/124\353\202\230\353\235\274\354\235\230\354\210\253\354\236\220.cpp"
similarity index 100%
rename from "TnJ/2020/20200803/124\353\202\230\353\235\274\354\235\230\354\210\253\354\236\220.cpp"
rename to "jerry0339/2020/20200803/124\353\202\230\353\235\274\354\235\230\354\210\253\354\236\220.cpp"
diff --git "a/TnJ/2020/20200803/\353\213\244\353\246\254\353\245\274\354\247\200\353\202\230\353\212\224\355\212\270\353\237\255.cpp" "b/jerry0339/2020/20200803/\353\213\244\353\246\254\353\245\274\354\247\200\353\202\230\353\212\224\355\212\270\353\237\255.cpp"
similarity index 100%
rename from "TnJ/2020/20200803/\353\213\244\353\246\254\353\245\274\354\247\200\353\202\230\353\212\224\355\212\270\353\237\255.cpp"
rename to "jerry0339/2020/20200803/\353\213\244\353\246\254\353\245\274\354\247\200\353\202\230\353\212\224\355\212\270\353\237\255.cpp"
diff --git "a/TnJ/2020/20200803/\354\234\204\354\236\245.cpp" "b/jerry0339/2020/20200803/\354\234\204\354\236\245.cpp"
similarity index 100%
rename from "TnJ/2020/20200803/\354\234\204\354\236\245.cpp"
rename to "jerry0339/2020/20200803/\354\234\204\354\236\245.cpp"
diff --git "a/TnJ/2020/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.cpp" "b/jerry0339/2020/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.cpp"
similarity index 100%
rename from "TnJ/2020/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.cpp"
rename to "jerry0339/2020/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.cpp"
diff --git a/TnJ/2020/20200818/H-Index.cpp b/jerry0339/2020/20200818/H-Index.cpp
similarity index 100%
rename from TnJ/2020/20200818/H-Index.cpp
rename to jerry0339/2020/20200818/H-Index.cpp
diff --git "a/TnJ/2020/20200818/\352\260\200\354\236\245\355\201\260\354\210\230.cpp" "b/jerry0339/2020/20200818/\352\260\200\354\236\245\355\201\260\354\210\230.cpp"
similarity index 100%
rename from "TnJ/2020/20200818/\352\260\200\354\236\245\355\201\260\354\210\230.cpp"
rename to "jerry0339/2020/20200818/\352\260\200\354\236\245\355\201\260\354\210\230.cpp"
diff --git "a/TnJ/2020/20200818/\352\260\200\354\236\245\355\201\260\354\240\225\354\202\254\352\260\201\355\230\225\354\260\276\352\270\260.cpp" "b/jerry0339/2020/20200818/\352\260\200\354\236\245\355\201\260\354\240\225\354\202\254\352\260\201\355\230\225\354\260\276\352\270\260.cpp"
similarity index 100%
rename from "TnJ/2020/20200818/\352\260\200\354\236\245\355\201\260\354\240\225\354\202\254\352\260\201\355\230\225\354\260\276\352\270\260.cpp"
rename to "jerry0339/2020/20200818/\352\260\200\354\236\245\355\201\260\354\240\225\354\202\254\352\260\201\355\230\225\354\260\276\352\270\260.cpp"
diff --git "a/TnJ/2020/20200818/\354\240\204\355\231\224\353\262\210\355\230\270\353\252\251\353\241\235.cpp" "b/jerry0339/2020/20200818/\354\240\204\355\231\224\353\262\210\355\230\270\353\252\251\353\241\235.cpp"
similarity index 100%
rename from "TnJ/2020/20200818/\354\240\204\355\231\224\353\262\210\355\230\270\353\252\251\353\241\235.cpp"
rename to "jerry0339/2020/20200818/\354\240\204\355\231\224\353\262\210\355\230\270\353\252\251\353\241\235.cpp"
diff --git a/TnJ/2020/20200831/BOJ_1562.cpp b/jerry0339/2020/20200831/BOJ_1562.cpp
similarity index 100%
rename from TnJ/2020/20200831/BOJ_1562.cpp
rename to jerry0339/2020/20200831/BOJ_1562.cpp
diff --git a/TnJ/2020/20200831/TSP_BOJ_2098_BU.cpp b/jerry0339/2020/20200831/TSP_BOJ_2098_BU.cpp
similarity index 100%
rename from TnJ/2020/20200831/TSP_BOJ_2098_BU.cpp
rename to jerry0339/2020/20200831/TSP_BOJ_2098_BU.cpp
diff --git a/TnJ/2020/20200831/TSP_BOJ_2098_TD.cpp b/jerry0339/2020/20200831/TSP_BOJ_2098_TD.cpp
similarity index 100%
rename from TnJ/2020/20200831/TSP_BOJ_2098_TD.cpp
rename to jerry0339/2020/20200831/TSP_BOJ_2098_TD.cpp
diff --git a/TnJ/2020/20200902/BOJ_15961.cpp b/jerry0339/2020/20200902/BOJ_15961.cpp
similarity index 100%
rename from TnJ/2020/20200902/BOJ_15961.cpp
rename to jerry0339/2020/20200902/BOJ_15961.cpp
diff --git a/TnJ/2020/20200902/BOJ_1749.cpp b/jerry0339/2020/20200902/BOJ_1749.cpp
similarity index 100%
rename from TnJ/2020/20200902/BOJ_1749.cpp
rename to jerry0339/2020/20200902/BOJ_1749.cpp
diff --git a/TnJ/2020/20200902/BOJ_2473.cpp b/jerry0339/2020/20200902/BOJ_2473.cpp
similarity index 100%
rename from TnJ/2020/20200902/BOJ_2473.cpp
rename to jerry0339/2020/20200902/BOJ_2473.cpp
diff --git a/TnJ/2020/20200902/BOJ_5721.cpp b/jerry0339/2020/20200902/BOJ_5721.cpp
similarity index 100%
rename from TnJ/2020/20200902/BOJ_5721.cpp
rename to jerry0339/2020/20200902/BOJ_5721.cpp
diff --git a/TnJ/2020/20200907/BOJ_1194.cpp b/jerry0339/2020/20200907/BOJ_1194.cpp
similarity index 100%
rename from TnJ/2020/20200907/BOJ_1194.cpp
rename to jerry0339/2020/20200907/BOJ_1194.cpp
diff --git a/TnJ/2020/20200909/BOJ_2250.cpp b/jerry0339/2020/20200909/BOJ_2250.cpp
similarity index 100%
rename from TnJ/2020/20200909/BOJ_2250.cpp
rename to jerry0339/2020/20200909/BOJ_2250.cpp
diff --git a/TnJ/2020/20200909/BOJ_2263.cpp b/jerry0339/2020/20200909/BOJ_2263.cpp
similarity index 100%
rename from TnJ/2020/20200909/BOJ_2263.cpp
rename to jerry0339/2020/20200909/BOJ_2263.cpp
diff --git a/TnJ/2020/20200909/BOJ_7579.cpp b/jerry0339/2020/20200909/BOJ_7579.cpp
similarity index 100%
rename from TnJ/2020/20200909/BOJ_7579.cpp
rename to jerry0339/2020/20200909/BOJ_7579.cpp
diff --git a/TnJ/2020/20200911/BOJ_1595.cpp b/jerry0339/2020/20200911/BOJ_1595.cpp
similarity index 100%
rename from TnJ/2020/20200911/BOJ_1595.cpp
rename to jerry0339/2020/20200911/BOJ_1595.cpp
diff --git a/TnJ/2020/20200911/BOJ_18224.cpp b/jerry0339/2020/20200911/BOJ_18224.cpp
similarity index 100%
rename from TnJ/2020/20200911/BOJ_18224.cpp
rename to jerry0339/2020/20200911/BOJ_18224.cpp
diff --git a/TnJ/2020/20200911/BOJ_19542.cpp b/jerry0339/2020/20200911/BOJ_19542.cpp
similarity index 100%
rename from TnJ/2020/20200911/BOJ_19542.cpp
rename to jerry0339/2020/20200911/BOJ_19542.cpp
diff --git a/TnJ/2020/20200916/BOJ_2176.cpp b/jerry0339/2020/20200916/BOJ_2176.cpp
similarity index 100%
rename from TnJ/2020/20200916/BOJ_2176.cpp
rename to jerry0339/2020/20200916/BOJ_2176.cpp
diff --git a/TnJ/2020/20201112/BOJ_1197.cpp b/jerry0339/2020/20201112/BOJ_1197.cpp
similarity index 100%
rename from TnJ/2020/20201112/BOJ_1197.cpp
rename to jerry0339/2020/20201112/BOJ_1197.cpp
diff --git a/TnJ/2020/20201112/BOJ_1261.cpp b/jerry0339/2020/20201112/BOJ_1261.cpp
similarity index 100%
rename from TnJ/2020/20201112/BOJ_1261.cpp
rename to jerry0339/2020/20201112/BOJ_1261.cpp
diff --git a/TnJ/2020/20201112/BOJ_1563.cpp b/jerry0339/2020/20201112/BOJ_1563.cpp
similarity index 100%
rename from TnJ/2020/20201112/BOJ_1563.cpp
rename to jerry0339/2020/20201112/BOJ_1563.cpp
diff --git a/TnJ/2020/20201113/BOJ_1717.cpp b/jerry0339/2020/20201113/BOJ_1717.cpp
similarity index 100%
rename from TnJ/2020/20201113/BOJ_1717.cpp
rename to jerry0339/2020/20201113/BOJ_1717.cpp
diff --git a/TnJ/2020/20201113/BOJ_1766.cpp b/jerry0339/2020/20201113/BOJ_1766.cpp
similarity index 100%
rename from TnJ/2020/20201113/BOJ_1766.cpp
rename to jerry0339/2020/20201113/BOJ_1766.cpp
diff --git a/TnJ/2020/20201113/BOJ_1976.cpp b/jerry0339/2020/20201113/BOJ_1976.cpp
similarity index 100%
rename from TnJ/2020/20201113/BOJ_1976.cpp
rename to jerry0339/2020/20201113/BOJ_1976.cpp
diff --git a/TnJ/2020/20201116/BOJ_12893_Bfs_solving.cpp b/jerry0339/2020/20201116/BOJ_12893_Bfs_solving.cpp
similarity index 100%
rename from TnJ/2020/20201116/BOJ_12893_Bfs_solving.cpp
rename to jerry0339/2020/20201116/BOJ_12893_Bfs_solving.cpp
diff --git a/TnJ/2020/20201116/BOJ_12893_UnionFind_solving.cpp b/jerry0339/2020/20201116/BOJ_12893_UnionFind_solving.cpp
similarity index 100%
rename from TnJ/2020/20201116/BOJ_12893_UnionFind_solving.cpp
rename to jerry0339/2020/20201116/BOJ_12893_UnionFind_solving.cpp
diff --git a/TnJ/2020/20201116/BOJ_14948.cpp b/jerry0339/2020/20201116/BOJ_14948.cpp
similarity index 100%
rename from TnJ/2020/20201116/BOJ_14948.cpp
rename to jerry0339/2020/20201116/BOJ_14948.cpp
diff --git a/TnJ/2020/20201116/BOJ_2412.cpp b/jerry0339/2020/20201116/BOJ_2412.cpp
similarity index 100%
rename from TnJ/2020/20201116/BOJ_2412.cpp
rename to jerry0339/2020/20201116/BOJ_2412.cpp
diff --git a/TnJ/2020/20201121/BOJ_1275.cpp b/jerry0339/2020/20201121/BOJ_1275.cpp
similarity index 100%
rename from TnJ/2020/20201121/BOJ_1275.cpp
rename to jerry0339/2020/20201121/BOJ_1275.cpp
diff --git a/TnJ/2020/20201121/BOJ_2268.cpp b/jerry0339/2020/20201121/BOJ_2268.cpp
similarity index 100%
rename from TnJ/2020/20201121/BOJ_2268.cpp
rename to jerry0339/2020/20201121/BOJ_2268.cpp
diff --git a/TnJ/2020/20201226/BOJ_11505_multi.cpp b/jerry0339/2020/20201226/BOJ_11505_multi.cpp
similarity index 100%
rename from TnJ/2020/20201226/BOJ_11505_multi.cpp
rename to jerry0339/2020/20201226/BOJ_11505_multi.cpp
diff --git a/TnJ/2020/20201226/BOJ_1168.cpp b/jerry0339/2020/20201226/BOJ_1168.cpp
similarity index 100%
rename from TnJ/2020/20201226/BOJ_1168.cpp
rename to jerry0339/2020/20201226/BOJ_1168.cpp
diff --git a/TnJ/2020/20201226/BOJ_12846.cpp b/jerry0339/2020/20201226/BOJ_12846.cpp
similarity index 100%
rename from TnJ/2020/20201226/BOJ_12846.cpp
rename to jerry0339/2020/20201226/BOJ_12846.cpp
diff --git a/TnJ/2020/20201226/BOJ_2104.cpp b/jerry0339/2020/20201226/BOJ_2104.cpp
similarity index 100%
rename from TnJ/2020/20201226/BOJ_2104.cpp
rename to jerry0339/2020/20201226/BOJ_2104.cpp
diff --git a/TnJ/2020/20201226/BOJ_6549.cpp b/jerry0339/2020/20201226/BOJ_6549.cpp
similarity index 100%
rename from TnJ/2020/20201226/BOJ_6549.cpp
rename to jerry0339/2020/20201226/BOJ_6549.cpp
diff --git a/TnJ/2020/20201226/BOJ_9426.cpp b/jerry0339/2020/20201226/BOJ_9426.cpp
similarity index 100%
rename from TnJ/2020/20201226/BOJ_9426.cpp
rename to jerry0339/2020/20201226/BOJ_9426.cpp
diff --git a/TnJ/2020/20201231/BOJ_6086.cpp b/jerry0339/2020/20201231/BOJ_6086.cpp
similarity index 100%
rename from TnJ/2020/20201231/BOJ_6086.cpp
rename to jerry0339/2020/20201231/BOJ_6086.cpp
diff --git a/TnJ/2021/0207/BOJ_1245.cpp b/jerry0339/2021/0207/BOJ_1245.cpp
similarity index 100%
rename from TnJ/2021/0207/BOJ_1245.cpp
rename to jerry0339/2021/0207/BOJ_1245.cpp
diff --git a/TnJ/2021/0207/BOJ_13975.cpp b/jerry0339/2021/0207/BOJ_13975.cpp
similarity index 100%
rename from TnJ/2021/0207/BOJ_13975.cpp
rename to jerry0339/2021/0207/BOJ_13975.cpp
diff --git a/TnJ/2021/0207/BOJ_14921.cpp b/jerry0339/2021/0207/BOJ_14921.cpp
similarity index 100%
rename from TnJ/2021/0207/BOJ_14921.cpp
rename to jerry0339/2021/0207/BOJ_14921.cpp
diff --git a/TnJ/2021/0207/BOJ_1647.cpp b/jerry0339/2021/0207/BOJ_1647.cpp
similarity index 100%
rename from TnJ/2021/0207/BOJ_1647.cpp
rename to jerry0339/2021/0207/BOJ_1647.cpp
diff --git a/TnJ/2021/0207/BOJ_2343.cpp b/jerry0339/2021/0207/BOJ_2343.cpp
similarity index 100%
rename from TnJ/2021/0207/BOJ_2343.cpp
rename to jerry0339/2021/0207/BOJ_2343.cpp
diff --git a/TnJ/2021/0207/BOJ_2491.cpp b/jerry0339/2021/0207/BOJ_2491.cpp
similarity index 100%
rename from TnJ/2021/0207/BOJ_2491.cpp
rename to jerry0339/2021/0207/BOJ_2491.cpp
diff --git a/TnJ/2021/0207/BOJ_6087.cpp b/jerry0339/2021/0207/BOJ_6087.cpp
similarity index 100%
rename from TnJ/2021/0207/BOJ_6087.cpp
rename to jerry0339/2021/0207/BOJ_6087.cpp
diff --git a/TnJ/2021/0211/BOJ_2611.cpp b/jerry0339/2021/0211/BOJ_2611.cpp
similarity index 100%
rename from TnJ/2021/0211/BOJ_2611.cpp
rename to jerry0339/2021/0211/BOJ_2611.cpp
diff --git a/TnJ/2021/0211/BOJ_3055.cpp b/jerry0339/2021/0211/BOJ_3055.cpp
similarity index 100%
rename from TnJ/2021/0211/BOJ_3055.cpp
rename to jerry0339/2021/0211/BOJ_3055.cpp
diff --git a/TnJ/2021/0211/BOJ_3649.cpp b/jerry0339/2021/0211/BOJ_3649.cpp
similarity index 100%
rename from TnJ/2021/0211/BOJ_3649.cpp
rename to jerry0339/2021/0211/BOJ_3649.cpp
diff --git a/TnJ/2021/0211/BOJ_7511.cpp b/jerry0339/2021/0211/BOJ_7511.cpp
similarity index 100%
rename from TnJ/2021/0211/BOJ_7511.cpp
rename to jerry0339/2021/0211/BOJ_7511.cpp
diff --git a/TnJ/2021/0211/BOJ_9347.cpp b/jerry0339/2021/0211/BOJ_9347.cpp
similarity index 100%
rename from TnJ/2021/0211/BOJ_9347.cpp
rename to jerry0339/2021/0211/BOJ_9347.cpp
diff --git a/TnJ/2021/0217/BOJ_1106.cpp b/jerry0339/2021/0217/BOJ_1106.cpp
similarity index 100%
rename from TnJ/2021/0217/BOJ_1106.cpp
rename to jerry0339/2021/0217/BOJ_1106.cpp
diff --git a/TnJ/2021/0217/BOJ_15990.cpp b/jerry0339/2021/0217/BOJ_15990.cpp
similarity index 100%
rename from TnJ/2021/0217/BOJ_15990.cpp
rename to jerry0339/2021/0217/BOJ_15990.cpp
diff --git a/TnJ/2021/0217/BOJ_15991.cpp b/jerry0339/2021/0217/BOJ_15991.cpp
similarity index 100%
rename from TnJ/2021/0217/BOJ_15991.cpp
rename to jerry0339/2021/0217/BOJ_15991.cpp
diff --git a/TnJ/2021/0217/BOJ_15992.cpp b/jerry0339/2021/0217/BOJ_15992.cpp
similarity index 100%
rename from TnJ/2021/0217/BOJ_15992.cpp
rename to jerry0339/2021/0217/BOJ_15992.cpp
diff --git a/TnJ/2021/0217/BOJ_15993.cpp b/jerry0339/2021/0217/BOJ_15993.cpp
similarity index 100%
rename from TnJ/2021/0217/BOJ_15993.cpp
rename to jerry0339/2021/0217/BOJ_15993.cpp
diff --git a/TnJ/2021/0221/BOJ_14925.cpp b/jerry0339/2021/0221/BOJ_14925.cpp
similarity index 100%
rename from TnJ/2021/0221/BOJ_14925.cpp
rename to jerry0339/2021/0221/BOJ_14925.cpp
diff --git a/TnJ/2021/0221/BOJ_17498.cpp b/jerry0339/2021/0221/BOJ_17498.cpp
similarity index 100%
rename from TnJ/2021/0221/BOJ_17498.cpp
rename to jerry0339/2021/0221/BOJ_17498.cpp
diff --git a/TnJ/2021/0221/BOJ_1943.cpp b/jerry0339/2021/0221/BOJ_1943.cpp
similarity index 100%
rename from TnJ/2021/0221/BOJ_1943.cpp
rename to jerry0339/2021/0221/BOJ_1943.cpp
diff --git a/TnJ/2021/0221/BOJ_5527.cpp b/jerry0339/2021/0221/BOJ_5527.cpp
similarity index 100%
rename from TnJ/2021/0221/BOJ_5527.cpp
rename to jerry0339/2021/0221/BOJ_5527.cpp
diff --git a/TnJ/2021/0224/BOJ_1727.cpp b/jerry0339/2021/0224/BOJ_1727.cpp
similarity index 100%
rename from TnJ/2021/0224/BOJ_1727.cpp
rename to jerry0339/2021/0224/BOJ_1727.cpp
diff --git a/TnJ/2021/0224/BOJ_2141.cpp b/jerry0339/2021/0224/BOJ_2141.cpp
similarity index 100%
rename from TnJ/2021/0224/BOJ_2141.cpp
rename to jerry0339/2021/0224/BOJ_2141.cpp
diff --git a/TnJ/2021/0224/BOJ_2539.cpp b/jerry0339/2021/0224/BOJ_2539.cpp
similarity index 100%
rename from TnJ/2021/0224/BOJ_2539.cpp
rename to jerry0339/2021/0224/BOJ_2539.cpp
diff --git a/TnJ/2021/0224/BOJ_8983.cpp b/jerry0339/2021/0224/BOJ_8983.cpp
similarity index 100%
rename from TnJ/2021/0224/BOJ_8983.cpp
rename to jerry0339/2021/0224/BOJ_8983.cpp
diff --git a/TnJ/2021/0224/BOJ_9007.cpp b/jerry0339/2021/0224/BOJ_9007.cpp
similarity index 100%
rename from TnJ/2021/0224/BOJ_9007.cpp
rename to jerry0339/2021/0224/BOJ_9007.cpp
diff --git a/TnJ/2021/0228/BOJ_20444.cpp b/jerry0339/2021/0228/BOJ_20444.cpp
similarity index 100%
rename from TnJ/2021/0228/BOJ_20444.cpp
rename to jerry0339/2021/0228/BOJ_20444.cpp
diff --git a/TnJ/2021/0228/BOJ_2550.cpp b/jerry0339/2021/0228/BOJ_2550.cpp
similarity index 100%
rename from TnJ/2021/0228/BOJ_2550.cpp
rename to jerry0339/2021/0228/BOJ_2550.cpp
diff --git a/TnJ/2021/0228/BOJ_9998.cpp b/jerry0339/2021/0228/BOJ_9998.cpp
similarity index 100%
rename from TnJ/2021/0228/BOJ_9998.cpp
rename to jerry0339/2021/0228/BOJ_9998.cpp
diff --git a/TnJ/2021/0303/BOJ_14675.cpp b/jerry0339/2021/0303/BOJ_14675.cpp
similarity index 100%
rename from TnJ/2021/0303/BOJ_14675.cpp
rename to jerry0339/2021/0303/BOJ_14675.cpp
diff --git a/TnJ/2021/0303/BOJ_17073.cpp b/jerry0339/2021/0303/BOJ_17073.cpp
similarity index 100%
rename from TnJ/2021/0303/BOJ_17073.cpp
rename to jerry0339/2021/0303/BOJ_17073.cpp
diff --git a/TnJ/2021/0303/BOJ_2031.cpp b/jerry0339/2021/0303/BOJ_2031.cpp
similarity index 100%
rename from TnJ/2021/0303/BOJ_2031.cpp
rename to jerry0339/2021/0303/BOJ_2031.cpp
diff --git a/TnJ/2021/0303/BOJ_2638.cpp b/jerry0339/2021/0303/BOJ_2638.cpp
similarity index 100%
rename from TnJ/2021/0303/BOJ_2638.cpp
rename to jerry0339/2021/0303/BOJ_2638.cpp
diff --git a/TnJ/2021/0303/BOJ_9489.cpp b/jerry0339/2021/0303/BOJ_9489.cpp
similarity index 100%
rename from TnJ/2021/0303/BOJ_9489.cpp
rename to jerry0339/2021/0303/BOJ_9489.cpp
diff --git a/TnJ/2021/0307/BOJ_1043.cpp b/jerry0339/2021/0307/BOJ_1043.cpp
similarity index 100%
rename from TnJ/2021/0307/BOJ_1043.cpp
rename to jerry0339/2021/0307/BOJ_1043.cpp
diff --git a/TnJ/2021/0307/BOJ_14466.cpp b/jerry0339/2021/0307/BOJ_14466.cpp
similarity index 100%
rename from TnJ/2021/0307/BOJ_14466.cpp
rename to jerry0339/2021/0307/BOJ_14466.cpp
diff --git a/TnJ/2021/0307/BOJ_16918.cpp b/jerry0339/2021/0307/BOJ_16918.cpp
similarity index 100%
rename from TnJ/2021/0307/BOJ_16918.cpp
rename to jerry0339/2021/0307/BOJ_16918.cpp
diff --git a/TnJ/2021/0307/BOJ_18427.cpp b/jerry0339/2021/0307/BOJ_18427.cpp
similarity index 100%
rename from TnJ/2021/0307/BOJ_18427.cpp
rename to jerry0339/2021/0307/BOJ_18427.cpp
diff --git a/TnJ/2021/0314/BOJ_12945_1.cpp b/jerry0339/2021/0314/BOJ_12945_1.cpp
similarity index 100%
rename from TnJ/2021/0314/BOJ_12945_1.cpp
rename to jerry0339/2021/0314/BOJ_12945_1.cpp
diff --git a/TnJ/2021/0314/BOJ_12945_2.cpp b/jerry0339/2021/0314/BOJ_12945_2.cpp
similarity index 100%
rename from TnJ/2021/0314/BOJ_12945_2.cpp
rename to jerry0339/2021/0314/BOJ_12945_2.cpp
diff --git a/TnJ/2021/0314/BOJ_14676.cpp b/jerry0339/2021/0314/BOJ_14676.cpp
similarity index 100%
rename from TnJ/2021/0314/BOJ_14676.cpp
rename to jerry0339/2021/0314/BOJ_14676.cpp
diff --git a/TnJ/2021/0314/BOJ_1637.cpp b/jerry0339/2021/0314/BOJ_1637.cpp
similarity index 100%
rename from TnJ/2021/0314/BOJ_1637.cpp
rename to jerry0339/2021/0314/BOJ_1637.cpp
diff --git a/TnJ/2021/0314/BOJ_2026.cpp b/jerry0339/2021/0314/BOJ_2026.cpp
similarity index 100%
rename from TnJ/2021/0314/BOJ_2026.cpp
rename to jerry0339/2021/0314/BOJ_2026.cpp
diff --git a/TnJ/2021/0317/BOJ_10838.cpp b/jerry0339/2021/0317/BOJ_10838.cpp
similarity index 100%
rename from TnJ/2021/0317/BOJ_10838.cpp
rename to jerry0339/2021/0317/BOJ_10838.cpp
diff --git a/TnJ/2021/0317/BOJ_13397.cpp b/jerry0339/2021/0317/BOJ_13397.cpp
similarity index 100%
rename from TnJ/2021/0317/BOJ_13397.cpp
rename to jerry0339/2021/0317/BOJ_13397.cpp
diff --git a/TnJ/2021/0317/BOJ_13904.cpp b/jerry0339/2021/0317/BOJ_13904.cpp
similarity index 100%
rename from TnJ/2021/0317/BOJ_13904.cpp
rename to jerry0339/2021/0317/BOJ_13904.cpp
diff --git a/TnJ/2021/0317/BOJ_1939.cpp b/jerry0339/2021/0317/BOJ_1939.cpp
similarity index 100%
rename from TnJ/2021/0317/BOJ_1939.cpp
rename to jerry0339/2021/0317/BOJ_1939.cpp
diff --git a/TnJ/2021/0317/BOJ_1939_MST.cpp b/jerry0339/2021/0317/BOJ_1939_MST.cpp
similarity index 100%
rename from TnJ/2021/0317/BOJ_1939_MST.cpp
rename to jerry0339/2021/0317/BOJ_1939_MST.cpp
diff --git a/TnJ/2021/0317/BOJ_5884.cpp b/jerry0339/2021/0317/BOJ_5884.cpp
similarity index 100%
rename from TnJ/2021/0317/BOJ_5884.cpp
rename to jerry0339/2021/0317/BOJ_5884.cpp
diff --git a/TnJ/2021/0321/BOJ_10282.cpp b/jerry0339/2021/0321/BOJ_10282.cpp
similarity index 100%
rename from TnJ/2021/0321/BOJ_10282.cpp
rename to jerry0339/2021/0321/BOJ_10282.cpp
diff --git a/TnJ/2021/0321/BOJ_11779.cpp b/jerry0339/2021/0321/BOJ_11779.cpp
similarity index 100%
rename from TnJ/2021/0321/BOJ_11779.cpp
rename to jerry0339/2021/0321/BOJ_11779.cpp
diff --git a/TnJ/2021/0321/BOJ_16118.cpp b/jerry0339/2021/0321/BOJ_16118.cpp
similarity index 100%
rename from TnJ/2021/0321/BOJ_16118.cpp
rename to jerry0339/2021/0321/BOJ_16118.cpp
diff --git a/TnJ/2021/0321/BOJ_17144.cpp b/jerry0339/2021/0321/BOJ_17144.cpp
similarity index 100%
rename from TnJ/2021/0321/BOJ_17144.cpp
rename to jerry0339/2021/0321/BOJ_17144.cpp
diff --git a/TnJ/2021/0321/BOJ_3176.cpp b/jerry0339/2021/0321/BOJ_3176.cpp
similarity index 100%
rename from TnJ/2021/0321/BOJ_3176.cpp
rename to jerry0339/2021/0321/BOJ_3176.cpp
diff --git a/TnJ/2021/0324/BOJ_13511.cpp b/jerry0339/2021/0324/BOJ_13511.cpp
similarity index 100%
rename from TnJ/2021/0324/BOJ_13511.cpp
rename to jerry0339/2021/0324/BOJ_13511.cpp
diff --git a/TnJ/2021/0331/BOJ_17182.cpp b/jerry0339/2021/0331/BOJ_17182.cpp
similarity index 100%
rename from TnJ/2021/0331/BOJ_17182.cpp
rename to jerry0339/2021/0331/BOJ_17182.cpp
diff --git a/TnJ/2021/0331/BOJ_21276.cpp b/jerry0339/2021/0331/BOJ_21276.cpp
similarity index 100%
rename from TnJ/2021/0331/BOJ_21276.cpp
rename to jerry0339/2021/0331/BOJ_21276.cpp
diff --git a/TnJ/2021/0331/BOJ_4179.cpp b/jerry0339/2021/0331/BOJ_4179.cpp
similarity index 100%
rename from TnJ/2021/0331/BOJ_4179.cpp
rename to jerry0339/2021/0331/BOJ_4179.cpp
diff --git a/TnJ/2021/0730/23th_BOJ_15787.cpp b/jerry0339/2021/0730/23th_BOJ_15787.cpp
similarity index 100%
rename from TnJ/2021/0730/23th_BOJ_15787.cpp
rename to jerry0339/2021/0730/23th_BOJ_15787.cpp
diff --git a/TnJ/2021/0730/24th_BOJ_19598.cpp b/jerry0339/2021/0730/24th_BOJ_19598.cpp
similarity index 100%
rename from TnJ/2021/0730/24th_BOJ_19598.cpp
rename to jerry0339/2021/0730/24th_BOJ_19598.cpp
diff --git a/TnJ/2021/0806/BOJ_13305.cpp b/jerry0339/2021/0806/BOJ_13305.cpp
similarity index 100%
rename from TnJ/2021/0806/BOJ_13305.cpp
rename to jerry0339/2021/0806/BOJ_13305.cpp
diff --git a/TnJ/README.md b/jerry0339/README.md
similarity index 100%
rename from TnJ/README.md
rename to jerry0339/README.md
diff --git a/jochanmin/20200318/1620.txt b/jochanmin/2020/20200318/1620.txt
similarity index 100%
rename from jochanmin/20200318/1620.txt
rename to jochanmin/2020/20200318/1620.txt
diff --git a/jochanmin/20200318/2231.txt b/jochanmin/2020/20200318/2231.txt
similarity index 100%
rename from jochanmin/20200318/2231.txt
rename to jochanmin/2020/20200318/2231.txt
diff --git a/jochanmin/20200318/7568.txt b/jochanmin/2020/20200318/7568.txt
similarity index 100%
rename from jochanmin/20200318/7568.txt
rename to jochanmin/2020/20200318/7568.txt
diff --git a/jochanmin/20200319/1260.txt b/jochanmin/2020/20200319/1260.txt
similarity index 100%
rename from jochanmin/20200319/1260.txt
rename to jochanmin/2020/20200319/1260.txt
diff --git a/jochanmin/20200319/1436.txt b/jochanmin/2020/20200319/1436.txt
similarity index 100%
rename from jochanmin/20200319/1436.txt
rename to jochanmin/2020/20200319/1436.txt
diff --git a/jochanmin/20200319/2805.txt b/jochanmin/2020/20200319/2805.txt
similarity index 100%
rename from jochanmin/20200319/2805.txt
rename to jochanmin/2020/20200319/2805.txt
diff --git a/jochanmin/20200319/write_up.txt b/jochanmin/2020/20200319/write_up.txt
similarity index 100%
rename from jochanmin/20200319/write_up.txt
rename to jochanmin/2020/20200319/write_up.txt
diff --git a/jochanmin/20200320/12761.txt b/jochanmin/2020/20200320/12761.txt
similarity index 100%
rename from jochanmin/20200320/12761.txt
rename to jochanmin/2020/20200320/12761.txt
diff --git a/jochanmin/20200320/15354.txt b/jochanmin/2020/20200320/15354.txt
similarity index 100%
rename from jochanmin/20200320/15354.txt
rename to jochanmin/2020/20200320/15354.txt
diff --git a/jochanmin/20200320/15355.txt b/jochanmin/2020/20200320/15355.txt
similarity index 100%
rename from jochanmin/20200320/15355.txt
rename to jochanmin/2020/20200320/15355.txt
diff --git a/jochanmin/20200320/writeup.txt b/jochanmin/2020/20200320/writeup.txt
similarity index 100%
rename from jochanmin/20200320/writeup.txt
rename to jochanmin/2020/20200320/writeup.txt
diff --git a/jochanmin/20200321/14501.txt b/jochanmin/2020/20200321/14501.txt
similarity index 100%
rename from jochanmin/20200321/14501.txt
rename to jochanmin/2020/20200321/14501.txt
diff --git a/jochanmin/20200321/1987.txt b/jochanmin/2020/20200321/1987.txt
similarity index 100%
rename from jochanmin/20200321/1987.txt
rename to jochanmin/2020/20200321/1987.txt
diff --git a/jochanmin/20200321/9012.txt b/jochanmin/2020/20200321/9012.txt
similarity index 100%
rename from jochanmin/20200321/9012.txt
rename to jochanmin/2020/20200321/9012.txt
diff --git a/jochanmin/20200321/writeup.txt b/jochanmin/2020/20200321/writeup.txt
similarity index 100%
rename from jochanmin/20200321/writeup.txt
rename to jochanmin/2020/20200321/writeup.txt
diff --git a/jochanmin/20200323/15650.txt b/jochanmin/2020/20200323/15650.txt
similarity index 100%
rename from jochanmin/20200323/15650.txt
rename to jochanmin/2020/20200323/15650.txt
diff --git a/jochanmin/20200323/2580.txt b/jochanmin/2020/20200323/2580.txt
similarity index 100%
rename from jochanmin/20200323/2580.txt
rename to jochanmin/2020/20200323/2580.txt
diff --git a/jochanmin/20200323/2630.txt b/jochanmin/2020/20200323/2630.txt
similarity index 100%
rename from jochanmin/20200323/2630.txt
rename to jochanmin/2020/20200323/2630.txt
diff --git a/jochanmin/20200324/1780.txt b/jochanmin/2020/20200324/1780.txt
similarity index 100%
rename from jochanmin/20200324/1780.txt
rename to jochanmin/2020/20200324/1780.txt
diff --git a/jochanmin/20200324/2293.txt b/jochanmin/2020/20200324/2293.txt
similarity index 100%
rename from jochanmin/20200324/2293.txt
rename to jochanmin/2020/20200324/2293.txt
diff --git a/jochanmin/20200325/11403.cpp b/jochanmin/2020/20200325/11403.cpp
similarity index 100%
rename from jochanmin/20200325/11403.cpp
rename to jochanmin/2020/20200325/11403.cpp
diff --git a/jochanmin/20200325/15591.cpp b/jochanmin/2020/20200325/15591.cpp
similarity index 100%
rename from jochanmin/20200325/15591.cpp
rename to jochanmin/2020/20200325/15591.cpp
diff --git a/jochanmin/20200325/17027.cpp b/jochanmin/2020/20200325/17027.cpp
similarity index 100%
rename from jochanmin/20200325/17027.cpp
rename to jochanmin/2020/20200325/17027.cpp
diff --git a/jochanmin/20200325/think.txt b/jochanmin/2020/20200325/think.txt
similarity index 100%
rename from jochanmin/20200325/think.txt
rename to jochanmin/2020/20200325/think.txt
diff --git a/jochanmin/20200326/1559.txt b/jochanmin/2020/20200326/1559.txt
similarity index 100%
rename from jochanmin/20200326/1559.txt
rename to jochanmin/2020/20200326/1559.txt
diff --git a/jochanmin/20200326/2662.txt b/jochanmin/2020/20200326/2662.txt
similarity index 100%
rename from jochanmin/20200326/2662.txt
rename to jochanmin/2020/20200326/2662.txt
diff --git a/jochanmin/20200326/7476.txt b/jochanmin/2020/20200326/7476.txt
similarity index 100%
rename from jochanmin/20200326/7476.txt
rename to jochanmin/2020/20200326/7476.txt
diff --git a/jochanmin/20200326/think.txt b/jochanmin/2020/20200326/think.txt
similarity index 100%
rename from jochanmin/20200326/think.txt
rename to jochanmin/2020/20200326/think.txt
diff --git a/jochanmin/20200330/11404.cpp b/jochanmin/2020/20200330/11404.cpp
old mode 100755
new mode 100644
similarity index 100%
rename from jochanmin/20200330/11404.cpp
rename to jochanmin/2020/20200330/11404.cpp
diff --git a/jochanmin/20200330/1697.cpp b/jochanmin/2020/20200330/1697.cpp
old mode 100755
new mode 100644
similarity index 100%
rename from jochanmin/20200330/1697.cpp
rename to jochanmin/2020/20200330/1697.cpp
diff --git a/jochanmin/20200330/1753.cpp b/jochanmin/2020/20200330/1753.cpp
old mode 100755
new mode 100644
similarity index 100%
rename from jochanmin/20200330/1753.cpp
rename to jochanmin/2020/20200330/1753.cpp
diff --git a/jochanmin/20200331/14502.cpp b/jochanmin/2020/20200331/14502.cpp
old mode 100755
new mode 100644
similarity index 100%
rename from jochanmin/20200331/14502.cpp
rename to jochanmin/2020/20200331/14502.cpp
diff --git a/jochanmin/20200331/1520.cpp b/jochanmin/2020/20200331/1520.cpp
similarity index 100%
rename from jochanmin/20200331/1520.cpp
rename to jochanmin/2020/20200331/1520.cpp
diff --git a/jochanmin/20200331/2022.cpp b/jochanmin/2020/20200331/2022.cpp
old mode 100755
new mode 100644
similarity index 100%
rename from jochanmin/20200331/2022.cpp
rename to jochanmin/2020/20200331/2022.cpp
diff --git a/jochanmin/20200331/writeup.txt b/jochanmin/2020/20200331/writeup.txt
old mode 100755
new mode 100644
similarity index 100%
rename from jochanmin/20200331/writeup.txt
rename to jochanmin/2020/20200331/writeup.txt
diff --git a/jochanmin/20200403/12869.cpp b/jochanmin/2020/20200403/12869.cpp
similarity index 100%
rename from jochanmin/20200403/12869.cpp
rename to jochanmin/2020/20200403/12869.cpp
diff --git a/jochanmin/20200403/17141.cpp b/jochanmin/2020/20200403/17141.cpp
similarity index 100%
rename from jochanmin/20200403/17141.cpp
rename to jochanmin/2020/20200403/17141.cpp
diff --git a/jochanmin/20200403/5014.cpp b/jochanmin/2020/20200403/5014.cpp
similarity index 100%
rename from jochanmin/20200403/5014.cpp
rename to jochanmin/2020/20200403/5014.cpp
diff --git a/jochanmin/20200403/writeup.txt b/jochanmin/2020/20200403/writeup.txt
similarity index 100%
rename from jochanmin/20200403/writeup.txt
rename to jochanmin/2020/20200403/writeup.txt
diff --git a/jochanmin/20200407/11048.txt b/jochanmin/2020/20200407/11048.txt
similarity index 100%
rename from jochanmin/20200407/11048.txt
rename to jochanmin/2020/20200407/11048.txt
diff --git a/jochanmin/20200407/11060.txt b/jochanmin/2020/20200407/11060.txt
similarity index 100%
rename from jochanmin/20200407/11060.txt
rename to jochanmin/2020/20200407/11060.txt
diff --git a/jochanmin/20200407/15486.txt b/jochanmin/2020/20200407/15486.txt
similarity index 100%
rename from jochanmin/20200407/15486.txt
rename to jochanmin/2020/20200407/15486.txt
diff --git a/jochanmin/20200409/10564.txt b/jochanmin/2020/20200409/10564.txt
similarity index 100%
rename from jochanmin/20200409/10564.txt
rename to jochanmin/2020/20200409/10564.txt
diff --git a/jochanmin/20200409/15989.txt b/jochanmin/2020/20200409/15989.txt
similarity index 100%
rename from jochanmin/20200409/15989.txt
rename to jochanmin/2020/20200409/15989.txt
diff --git a/jochanmin/20200409/2251.txt b/jochanmin/2020/20200409/2251.txt
similarity index 100%
rename from jochanmin/20200409/2251.txt
rename to jochanmin/2020/20200409/2251.txt
diff --git a/jochanmin/20200409/write.txt b/jochanmin/2020/20200409/write.txt
similarity index 100%
rename from jochanmin/20200409/write.txt
rename to jochanmin/2020/20200409/write.txt
diff --git a/jochanmin/20200410/2011.txt b/jochanmin/2020/20200410/2011.txt
similarity index 100%
rename from jochanmin/20200410/2011.txt
rename to jochanmin/2020/20200410/2011.txt
diff --git a/jochanmin/20200410/2225.txt b/jochanmin/2020/20200410/2225.txt
similarity index 100%
rename from jochanmin/20200410/2225.txt
rename to jochanmin/2020/20200410/2225.txt
diff --git a/jochanmin/20200410/9461.txt b/jochanmin/2020/20200410/9461.txt
similarity index 100%
rename from jochanmin/20200410/9461.txt
rename to jochanmin/2020/20200410/9461.txt
diff --git a/jochanmin/20200414/10844.txt b/jochanmin/2020/20200414/10844.txt
similarity index 100%
rename from jochanmin/20200414/10844.txt
rename to jochanmin/2020/20200414/10844.txt
diff --git a/jochanmin/20200414/2600.txt b/jochanmin/2020/20200414/2600.txt
similarity index 100%
rename from jochanmin/20200414/2600.txt
rename to jochanmin/2020/20200414/2600.txt
diff --git a/jochanmin/20200414/3067.txt b/jochanmin/2020/20200414/3067.txt
similarity index 100%
rename from jochanmin/20200414/3067.txt
rename to jochanmin/2020/20200414/3067.txt
diff --git a/jochanmin/20200416/10422.txt b/jochanmin/2020/20200416/10422.txt
similarity index 100%
rename from jochanmin/20200416/10422.txt
rename to jochanmin/2020/20200416/10422.txt
diff --git a/jochanmin/20200416/11058.txt b/jochanmin/2020/20200416/11058.txt
similarity index 100%
rename from jochanmin/20200416/11058.txt
rename to jochanmin/2020/20200416/11058.txt
diff --git a/jochanmin/20200416/12969.txt b/jochanmin/2020/20200416/12969.txt
similarity index 100%
rename from jochanmin/20200416/12969.txt
rename to jochanmin/2020/20200416/12969.txt
diff --git a/jochanmin/20200416/writeup.txt b/jochanmin/2020/20200416/writeup.txt
similarity index 100%
rename from jochanmin/20200416/writeup.txt
rename to jochanmin/2020/20200416/writeup.txt
diff --git a/jochanmin/20200424/13913.txt b/jochanmin/2020/20200424/13913.txt
similarity index 100%
rename from jochanmin/20200424/13913.txt
rename to jochanmin/2020/20200424/13913.txt
diff --git a/jochanmin/20200424/16928.txt b/jochanmin/2020/20200424/16928.txt
similarity index 100%
rename from jochanmin/20200424/16928.txt
rename to jochanmin/2020/20200424/16928.txt
diff --git a/jochanmin/20200424/2156.txt b/jochanmin/2020/20200424/2156.txt
similarity index 100%
rename from jochanmin/20200424/2156.txt
rename to jochanmin/2020/20200424/2156.txt
diff --git "a/jochanmin/20200424/\355\213\200\353\246\260\352\261\260 \354\260\276\353\212\224 \353\260\251\353\262\225.txt" "b/jochanmin/2020/20200424/\355\213\200\353\246\260\352\261\260 \354\260\276\353\212\224 \353\260\251\353\262\225.txt"
similarity index 100%
rename from "jochanmin/20200424/\355\213\200\353\246\260\352\261\260 \354\260\276\353\212\224 \353\260\251\353\262\225.txt"
rename to "jochanmin/2020/20200424/\355\213\200\353\246\260\352\261\260 \354\260\276\353\212\224 \353\260\251\353\262\225.txt"
diff --git a/jochanmin/20200704/14496.txt b/jochanmin/2020/20200704/14496.txt
similarity index 100%
rename from jochanmin/20200704/14496.txt
rename to jochanmin/2020/20200704/14496.txt
diff --git a/jochanmin/20200704/3020.txt b/jochanmin/2020/20200704/3020.txt
similarity index 100%
rename from jochanmin/20200704/3020.txt
rename to jochanmin/2020/20200704/3020.txt
diff --git a/jochanmin/20200707/1991.txt b/jochanmin/2020/20200707/1991.txt
similarity index 100%
rename from jochanmin/20200707/1991.txt
rename to jochanmin/2020/20200707/1991.txt
diff --git a/jochanmin/20200712/1238.txt b/jochanmin/2020/20200712/1238.txt
similarity index 100%
rename from jochanmin/20200712/1238.txt
rename to jochanmin/2020/20200712/1238.txt
diff --git a/jochanmin/20200712/13424.txt b/jochanmin/2020/20200712/13424.txt
similarity index 100%
rename from jochanmin/20200712/13424.txt
rename to jochanmin/2020/20200712/13424.txt
diff --git a/jochanmin/20200712/5972.txt b/jochanmin/2020/20200712/5972.txt
similarity index 100%
rename from jochanmin/20200712/5972.txt
rename to jochanmin/2020/20200712/5972.txt
diff --git a/jochanmin/20200714/1330.txt b/jochanmin/2020/20200714/1330.txt
similarity index 100%
rename from jochanmin/20200714/1330.txt
rename to jochanmin/2020/20200714/1330.txt
diff --git a/jochanmin/20200714/2660.txt b/jochanmin/2020/20200714/2660.txt
similarity index 100%
rename from jochanmin/20200714/2660.txt
rename to jochanmin/2020/20200714/2660.txt
diff --git a/jochanmin/20200714/2933.txt b/jochanmin/2020/20200714/2933.txt
similarity index 100%
rename from jochanmin/20200714/2933.txt
rename to jochanmin/2020/20200714/2933.txt
diff --git a/jochanmin/20200730/4256.txt b/jochanmin/2020/20200730/4256.txt
similarity index 100%
rename from jochanmin/20200730/4256.txt
rename to jochanmin/2020/20200730/4256.txt
diff --git a/jochanmin/20200730/9251.txt b/jochanmin/2020/20200730/9251.txt
similarity index 100%
rename from jochanmin/20200730/9251.txt
rename to jochanmin/2020/20200730/9251.txt
diff --git a/jochanmin/20200730/9252.txt b/jochanmin/2020/20200730/9252.txt
similarity index 100%
rename from jochanmin/20200730/9252.txt
rename to jochanmin/2020/20200730/9252.txt
diff --git "a/jochanmin/20200803/124\353\202\230\353\235\274.txt" "b/jochanmin/2020/20200803/124\353\202\230\353\235\274.txt"
similarity index 100%
rename from "jochanmin/20200803/124\353\202\230\353\235\274.txt"
rename to "jochanmin/2020/20200803/124\353\202\230\353\235\274.txt"
diff --git "a/jochanmin/20200803/\353\213\244\353\246\254\353\245\274 \354\247\200\353\202\230\353\212\224 \355\212\270\353\237\255.txt" "b/jochanmin/2020/20200803/\353\213\244\353\246\254\353\245\274 \354\247\200\353\202\230\353\212\224 \355\212\270\353\237\255.txt"
similarity index 100%
rename from "jochanmin/20200803/\353\213\244\353\246\254\353\245\274 \354\247\200\353\202\230\353\212\224 \355\212\270\353\237\255.txt"
rename to "jochanmin/2020/20200803/\353\213\244\353\246\254\353\245\274 \354\247\200\353\202\230\353\212\224 \355\212\270\353\237\255.txt"
diff --git "a/jochanmin/20200803/\354\234\204\354\236\245.txt" "b/jochanmin/2020/20200803/\354\234\204\354\236\245.txt"
similarity index 100%
rename from "jochanmin/20200803/\354\234\204\354\236\245.txt"
rename to "jochanmin/2020/20200803/\354\234\204\354\236\245.txt"
diff --git "a/jochanmin/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.txt" "b/jochanmin/2020/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.txt"
similarity index 100%
rename from "jochanmin/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.txt"
rename to "jochanmin/2020/20200803/\354\243\274\354\213\235\352\260\200\352\262\251.txt"
diff --git a/jochanmin/20200806/H-index.txt b/jochanmin/2020/20200806/H-index.txt
similarity index 100%
rename from jochanmin/20200806/H-index.txt
rename to jochanmin/2020/20200806/H-index.txt
diff --git "a/jochanmin/20200806/\352\260\200\354\236\245 \355\201\260 \354\240\225\354\202\254\352\260\201\355\230\225.txt" "b/jochanmin/2020/20200806/\352\260\200\354\236\245 \355\201\260 \354\240\225\354\202\254\352\260\201\355\230\225.txt"
similarity index 100%
rename from "jochanmin/20200806/\352\260\200\354\236\245 \355\201\260 \354\240\225\354\202\254\352\260\201\355\230\225.txt"
rename to "jochanmin/2020/20200806/\352\260\200\354\236\245 \355\201\260 \354\240\225\354\202\254\352\260\201\355\230\225.txt"
diff --git "a/jochanmin/20200806/\352\260\200\354\236\245\355\201\260 \354\210\230.txt" "b/jochanmin/2020/20200806/\352\260\200\354\236\245\355\201\260 \354\210\230.txt"
similarity index 100%
rename from "jochanmin/20200806/\352\260\200\354\236\245\355\201\260 \354\210\230.txt"
rename to "jochanmin/2020/20200806/\352\260\200\354\236\245\355\201\260 \354\210\230.txt"
diff --git "a/jochanmin/20200806/\354\240\204\355\231\224\353\262\210\355\230\270 \353\252\251\353\241\235.txt" "b/jochanmin/2020/20200806/\354\240\204\355\231\224\353\262\210\355\230\270 \353\252\251\353\241\235.txt"
similarity index 100%
rename from "jochanmin/20200806/\354\240\204\355\231\224\353\262\210\355\230\270 \353\252\251\353\241\235.txt"
rename to "jochanmin/2020/20200806/\354\240\204\355\231\224\353\262\210\355\230\270 \353\252\251\353\241\235.txt"
diff --git "a/jochanmin/20200821/\353\251\200\354\251\241\355\225\234 \354\202\254\352\260\201\355\230\225.txt" "b/jochanmin/2020/20200821/\353\251\200\354\251\241\355\225\234 \354\202\254\352\260\201\355\230\225.txt"
similarity index 100%
rename from "jochanmin/20200821/\353\251\200\354\251\241\355\225\234 \354\202\254\352\260\201\355\230\225.txt"
rename to "jochanmin/2020/20200821/\353\251\200\354\251\241\355\225\234 \354\202\254\352\260\201\355\230\225.txt"
diff --git "a/jochanmin/20200821/\354\265\234\353\214\200\352\260\222\352\263\274 \354\265\234\354\206\214\352\260\222.txt" "b/jochanmin/2020/20200821/\354\265\234\353\214\200\352\260\222\352\263\274 \354\265\234\354\206\214\352\260\222.txt"
similarity index 100%
rename from "jochanmin/20200821/\354\265\234\353\214\200\352\260\222\352\263\274 \354\265\234\354\206\214\352\260\222.txt"
rename to "jochanmin/2020/20200821/\354\265\234\353\214\200\352\260\222\352\263\274 \354\265\234\354\206\214\352\260\222.txt"
diff --git "a/jochanmin/20200821/\354\271\264\355\216\253.txt" "b/jochanmin/2020/20200821/\354\271\264\355\216\253.txt"
similarity index 100%
rename from "jochanmin/20200821/\354\271\264\355\216\253.txt"
rename to "jochanmin/2020/20200821/\354\271\264\355\216\253.txt"
diff --git "a/jochanmin/20200821/\354\272\220\354\213\234.txt" "b/jochanmin/2020/20200821/\354\272\220\354\213\234.txt"
similarity index 100%
rename from "jochanmin/20200821/\354\272\220\354\213\234.txt"
rename to "jochanmin/2020/20200821/\354\272\220\354\213\234.txt"
diff --git "a/jochanmin/20200821/\355\226\211\353\240\254\354\235\230 \352\263\261\354\205\210.txt" "b/jochanmin/2020/20200821/\355\226\211\353\240\254\354\235\230 \352\263\261\354\205\210.txt"
similarity index 100%
rename from "jochanmin/20200821/\355\226\211\353\240\254\354\235\230 \352\263\261\354\205\210.txt"
rename to "jochanmin/2020/20200821/\355\226\211\353\240\254\354\235\230 \352\263\261\354\205\210.txt"
diff --git a/jochanmin/20200823/hanoi.txt b/jochanmin/2020/20200823/hanoi.txt
similarity index 100%
rename from jochanmin/20200823/hanoi.txt
rename to jochanmin/2020/20200823/hanoi.txt
diff --git "a/jochanmin/20200823/\353\204\244\355\212\270\354\233\214\355\201\254.txt" "b/jochanmin/2020/20200823/\353\204\244\355\212\270\354\233\214\355\201\254.txt"
similarity index 100%
rename from "jochanmin/20200823/\353\204\244\355\212\270\354\233\214\355\201\254.txt"
rename to "jochanmin/2020/20200823/\353\204\244\355\212\270\354\233\214\355\201\254.txt"
diff --git "a/jochanmin/20200823/\353\213\250\354\226\264\353\263\200\355\231\230.txt" "b/jochanmin/2020/20200823/\353\213\250\354\226\264\353\263\200\355\231\230.txt"
similarity index 100%
rename from "jochanmin/20200823/\353\213\250\354\226\264\353\263\200\355\231\230.txt"
rename to "jochanmin/2020/20200823/\353\213\250\354\226\264\353\263\200\355\231\230.txt"
diff --git "a/jochanmin/20200823/\355\224\274\353\263\264\353\202\230\354\271\230.txt" "b/jochanmin/2020/20200823/\355\224\274\353\263\264\353\202\230\354\271\230.txt"
similarity index 100%
rename from "jochanmin/20200823/\355\224\274\353\263\264\353\202\230\354\271\230.txt"
rename to "jochanmin/2020/20200823/\355\224\274\353\263\264\353\202\230\354\271\230.txt"
diff --git "a/jochanmin/20200901/\352\263\204\353\213\250\354\210\230.txt" "b/jochanmin/2020/20200901/\352\263\204\353\213\250\354\210\230.txt"
similarity index 100%
rename from "jochanmin/20200901/\352\263\204\353\213\250\354\210\230.txt"
rename to "jochanmin/2020/20200901/\352\263\204\353\213\250\354\210\230.txt"
diff --git "a/jochanmin/20200901/\354\231\270\355\214\220\354\233\220.txt" "b/jochanmin/2020/20200901/\354\231\270\355\214\220\354\233\220.txt"
similarity index 100%
rename from "jochanmin/20200901/\354\231\270\355\214\220\354\233\220.txt"
rename to "jochanmin/2020/20200901/\354\231\270\355\214\220\354\233\220.txt"
diff --git "a/jochanmin/20200904/\353\213\244\354\235\264\354\226\264\355\212\270.txt" "b/jochanmin/2020/20200904/\353\213\244\354\235\264\354\226\264\355\212\270.txt"
similarity index 100%
rename from "jochanmin/20200904/\353\213\244\354\235\264\354\226\264\355\212\270.txt"
rename to "jochanmin/2020/20200904/\353\213\244\354\235\264\354\226\264\355\212\270.txt"
diff --git "a/jochanmin/20200904/\353\254\270\354\236\220\354\227\264 \355\231\224\355\217\220.txt" "b/jochanmin/2020/20200904/\353\254\270\354\236\220\354\227\264 \355\231\224\355\217\220.txt"
similarity index 100%
rename from "jochanmin/20200904/\353\254\270\354\236\220\354\227\264 \355\231\224\355\217\220.txt"
rename to "jochanmin/2020/20200904/\353\254\270\354\236\220\354\227\264 \355\231\224\355\217\220.txt"
diff --git "a/jochanmin/20200904/\353\266\200\353\266\204\353\254\270\354\236\220\354\227\264.txt" "b/jochanmin/2020/20200904/\353\266\200\353\266\204\353\254\270\354\236\220\354\227\264.txt"
similarity index 100%
rename from "jochanmin/20200904/\353\266\200\353\266\204\353\254\270\354\236\220\354\227\264.txt"
rename to "jochanmin/2020/20200904/\353\266\200\353\266\204\353\254\270\354\236\220\354\227\264.txt"
diff --git "a/jochanmin/20200904/\354\210\230\352\263\240\353\245\264\352\270\260.txt" "b/jochanmin/2020/20200904/\354\210\230\352\263\240\353\245\264\352\270\260.txt"
similarity index 100%
rename from "jochanmin/20200904/\354\210\230\352\263\240\353\245\264\352\270\260.txt"
rename to "jochanmin/2020/20200904/\354\210\230\352\263\240\353\245\264\352\270\260.txt"
diff --git "a/jochanmin/20200909/\354\226\215.txt" "b/jochanmin/2020/20200909/\354\226\215.txt"
similarity index 100%
rename from "jochanmin/20200909/\354\226\215.txt"
rename to "jochanmin/2020/20200909/\354\226\215.txt"
diff --git "a/jochanmin/20200909/\355\212\270\353\246\254\354\235\230\354\210\234\355\232\214.txt" "b/jochanmin/2020/20200909/\355\212\270\353\246\254\354\235\230\354\210\234\355\232\214.txt"
similarity index 100%
rename from "jochanmin/20200909/\355\212\270\353\246\254\354\235\230\354\210\234\355\232\214.txt"
rename to "jochanmin/2020/20200909/\355\212\270\353\246\254\354\235\230\354\210\234\355\232\214.txt"
diff --git "a/jochanmin/20200911/\353\266\201\354\252\275\353\202\230\353\235\274\354\235\230 \353\217\204\353\241\234.txt" "b/jochanmin/2020/20200911/\353\266\201\354\252\275\353\202\230\353\235\274\354\235\230 \353\217\204\353\241\234.txt"
similarity index 100%
rename from "jochanmin/20200911/\353\266\201\354\252\275\353\202\230\353\235\274\354\235\230 \353\217\204\353\241\234.txt"
rename to "jochanmin/2020/20200911/\353\266\201\354\252\275\353\202\230\353\235\274\354\235\230 \353\217\204\353\241\234.txt"
diff --git "a/jochanmin/20200911/\354\240\204\353\213\250\354\247\200 \353\217\214\353\246\254\352\270\260.txt" "b/jochanmin/2020/20200911/\354\240\204\353\213\250\354\247\200 \353\217\214\353\246\254\352\270\260.txt"
similarity index 100%
rename from "jochanmin/20200911/\354\240\204\353\213\250\354\247\200 \353\217\214\353\246\254\352\270\260.txt"
rename to "jochanmin/2020/20200911/\354\240\204\353\213\250\354\247\200 \353\217\214\353\246\254\352\270\260.txt"
diff --git a/jochanmin/20201109/1197.txt b/jochanmin/2020/20201109/1197.txt
similarity index 100%
rename from jochanmin/20201109/1197.txt
rename to jochanmin/2020/20201109/1197.txt
diff --git a/jochanmin/20201109/1261.txt b/jochanmin/2020/20201109/1261.txt
similarity index 100%
rename from jochanmin/20201109/1261.txt
rename to jochanmin/2020/20201109/1261.txt
diff --git a/jochanmin/20201109/1563.txt b/jochanmin/2020/20201109/1563.txt
similarity index 100%
rename from jochanmin/20201109/1563.txt
rename to jochanmin/2020/20201109/1563.txt
diff --git a/jochanmin/20201113/1717.txt b/jochanmin/2020/20201113/1717.txt
similarity index 100%
rename from jochanmin/20201113/1717.txt
rename to jochanmin/2020/20201113/1717.txt
diff --git a/jochanmin/20201113/1766.txt b/jochanmin/2020/20201113/1766.txt
similarity index 100%
rename from jochanmin/20201113/1766.txt
rename to jochanmin/2020/20201113/1766.txt
diff --git a/jochanmin/20201113/1976.txt b/jochanmin/2020/20201113/1976.txt
similarity index 100%
rename from jochanmin/20201113/1976.txt
rename to jochanmin/2020/20201113/1976.txt
diff --git a/jochanmin/20201121/1275.txt b/jochanmin/2020/20201121/1275.txt
similarity index 100%
rename from jochanmin/20201121/1275.txt
rename to jochanmin/2020/20201121/1275.txt
diff --git a/jochanmin/20201121/2268.txt b/jochanmin/2020/20201121/2268.txt
similarity index 100%
rename from jochanmin/20201121/2268.txt
rename to jochanmin/2020/20201121/2268.txt
diff --git a/jochanmin/20201121/2357.txt b/jochanmin/2020/20201121/2357.txt
similarity index 100%
rename from jochanmin/20201121/2357.txt
rename to jochanmin/2020/20201121/2357.txt
diff --git a/jochanmin/20201226/11505.txt b/jochanmin/2020/20201226/11505.txt
similarity index 100%
rename from jochanmin/20201226/11505.txt
rename to jochanmin/2020/20201226/11505.txt
diff --git a/jochanmin/20201226/1168.txt b/jochanmin/2020/20201226/1168.txt
similarity index 100%
rename from jochanmin/20201226/1168.txt
rename to jochanmin/2020/20201226/1168.txt
diff --git a/jochanmin/20201226/12846.txt b/jochanmin/2020/20201226/12846.txt
similarity index 100%
rename from jochanmin/20201226/12846.txt
rename to jochanmin/2020/20201226/12846.txt
diff --git a/jochanmin/20220101/22942.cpp b/jochanmin/2020/20201226/2104.txt
similarity index 100%
rename from jochanmin/20220101/22942.cpp
rename to jochanmin/2020/20201226/2104.txt
diff --git a/jochanmin/20201226/6549.txt b/jochanmin/2020/20201226/6549.txt
similarity index 100%
rename from jochanmin/20201226/6549.txt
rename to jochanmin/2020/20201226/6549.txt
diff --git a/jochanmin/20201226/9426.txt b/jochanmin/2020/20201226/9426.txt
similarity index 100%
rename from jochanmin/20201226/9426.txt
rename to jochanmin/2020/20201226/9426.txt
diff --git a/jochanmin/2021/20210207/13975.cpp b/jochanmin/2021/20210207/13975.cpp
new file mode 100644
index 0000000..3d53973
--- /dev/null
+++ b/jochanmin/2021/20210207/13975.cpp
@@ -0,0 +1,30 @@
+#include <iostream>
+#include<queue>
+using namespace std;
+typedef long long ll;
+int main() {
+	// your code goes here
+	int t;
+	scanf("%d",&t);
+	while(t--){
+		int k;
+		ll sum=0;
+		scanf("%d",&k);
+		priority_queue<ll, vector<ll>, greater<ll>> pq;
+		ll num;
+		for(int i=0;i<k;i++){
+			scanf("%lld",&num);
+			pq.push(num);
+		}
+		while(pq.size()!=1){
+			ll one=pq.top();
+			pq.pop();
+			ll two=pq.top();
+			pq.pop();
+			sum+=(one+two);
+			pq.push(one+two);
+		}
+		printf("%lld\n",sum);
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210207/2491.cpp b/jochanmin/2021/20210207/2491.cpp
new file mode 100644
index 0000000..728e3c3
--- /dev/null
+++ b/jochanmin/2021/20210207/2491.cpp
@@ -0,0 +1,37 @@
+#include <iostream>
+using namespace std;
+
+int dp[100000][2];
+int arr[100000];
+int main() {
+	// your code goes here
+	int n;
+	scanf("%d",&n);
+	for(int i=0;i<n;i++){
+		scanf("%d",&arr[i]);
+	}
+	//1. increasing sequence
+	//2. decreasing sequence
+	dp[0][0]=1;dp[0][1]=1;
+	for(int i=1;i<n;i++){
+		if(arr[i-1]<=arr[i])
+			dp[i][0]=dp[i-1][0]+1;
+		else
+			dp[i][0]=1;
+		if(arr[i-1]>=arr[i])
+			dp[i][1]=dp[i-1][1]+1;
+		else
+			dp[i][1]=1;
+	}
+	int max1=0;
+	int max2=0;
+	for(int i=0;i<n;i++){
+		if(dp[i][0]>max1){
+			max1=dp[i][0];
+		}
+		if(dp[i][1]>max2)
+			max2=dp[i][1];
+	}
+	printf("%d",max1>max2?max1:max2);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210211/2611.cpp b/jochanmin/2021/20210211/2611.cpp
new file mode 100644
index 0000000..9433a41
--- /dev/null
+++ b/jochanmin/2021/20210211/2611.cpp
@@ -0,0 +1,62 @@
+#include <cstdio>
+#include <cstring>
+#include <vector>
+using namespace std;
+ 
+int n;
+int dp[1002], road[1002];
+vector<pair<int, int>> graph[1002];
+ 
+int go(int idx)
+{
+    int i, weight;
+ 
+    if (dp[idx] != -1)    return dp[idx];
+    dp[idx] = 0;
+ 
+    for (i = 0; i < graph[idx].size(); i++) {
+        weight = go(graph[idx][i].first) + graph[idx][i].second;
+ 
+        if (dp[idx] < weight) {
+            dp[idx] = weight;
+            road[idx] = graph[idx][i].first;
+        }
+    }
+ 
+    return dp[idx];
+}
+ 
+void solve()
+{
+    int r = 1;
+ 
+    memset(dp, -1, sizeof(dp));
+    dp[n + 1] = 0;
+ 
+    printf("%d\n", go(1));
+ 
+    while (r <= n) {
+        printf("%d ", r);
+        r = road[r];
+    }
+    printf("1\n");
+}
+ 
+int main()
+{
+    int m;
+    int i, from, to, weight;
+ 
+    scanf("%d %d", &n, &m);
+ 
+    for (i = 0; i < m; i++) {
+        scanf("%d %d %d", &from, &to, &weight);
+ 
+        if (to == 1)    to = n + 1;
+        graph[from].push_back(make_pair(to, weight));
+    }
+ 
+    solve();
+ 
+    return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210211/3055.cpp b/jochanmin/2021/20210211/3055.cpp
new file mode 100644
index 0000000..f872755
--- /dev/null
+++ b/jochanmin/2021/20210211/3055.cpp
@@ -0,0 +1,56 @@
+#include <cstdio>
+#include <queue>
+using namespace std;
+
+struct map {
+    int x, y, s;
+    // s represents water(0) or hedgehog(1).
+};
+
+int r, c, sx, sy;
+char a[51][51];
+int dist[51][51];
+queue<map> q;
+const int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
+
+void bfs() {
+    // Second, push position of hedgehog.
+    q.push({sx, sy, 1});
+    dist[sx][sy] = 1;
+    while (!q.empty()) {
+        int x = q.front().x, y = q.front().y, s = q.front().s;
+        q.pop();
+        for (int i=0; i<4; i++) {
+            int nx = x+dx[i], ny = y+dy[i];
+            if (nx < 0 || nx >= r || ny < 0 || ny >= c) continue;
+            if (a[nx][ny] == 'X' || dist[nx][ny]) continue;
+            if (a[nx][ny] == 'D') {
+                if (s == 0) continue;       // Water don't flood the cave.
+                printf("%d\n", dist[x][y]); // Answer
+                return;
+            }
+            dist[nx][ny] = dist[x][y] + 1;
+            q.push({nx, ny, s});
+        }
+    }
+    printf("KAKTUS\n");
+}
+
+int main() {
+    scanf("%d %d", &r, &c);
+    for (int i=0; i<r; i++) {
+        for (int j=0; j<c; j++) {
+            scanf("%1s", &a[i][j]);
+            if (a[i][j] == '*') {
+                // First, push position of water.
+                q.push({i, j, 0});
+                dist[i][j] = 1;
+            } else if (a[i][j] == 'S') {
+                // Save position of hedgehog.
+                sx = i, sy = j;
+            }
+        }
+    }
+    bfs();
+    return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210211/3649.cpp b/jochanmin/2021/20210211/3649.cpp
new file mode 100644
index 0000000..8250df8
--- /dev/null
+++ b/jochanmin/2021/20210211/3649.cpp
@@ -0,0 +1,31 @@
+#include <cstdio>
+#include<algorithm>
+using namespace std;
+
+typedef long long ll;
+
+
+int main() {
+	int x;
+	int n;
+	while(scanf("%lld",&x)==1){
+		ll arr[1000001];
+		x*=10000000;
+		scanf("%d",&n);
+		for(int i=0;i<n;i++)
+			scanf("%d",&arr[i]);
+		sort(arr,arr+n);
+		bool flag=false;
+		for(int i=0;i<n-1;i++){
+			ll c=*lower_bound(arr+i+1,arr+n,x-arr[i]);
+			if(c==x-arr[i]){
+				printf("yes %lld %lld\n",arr[i],c);
+				flag=true;
+				break;
+			}
+		}
+		if(!flag)
+		 printf("danger\n");
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210211/7511.cpp b/jochanmin/2021/20210211/7511.cpp
new file mode 100644
index 0000000..51bda95
--- /dev/null
+++ b/jochanmin/2021/20210211/7511.cpp
@@ -0,0 +1,47 @@
+#include <cstdio>
+#include<vector>
+#include<set>
+using namespace std;
+int parent[1000001];
+int find(int x){
+  if (x==parent[x]){
+    return x;
+  }
+  else{
+    int y = find(parent[x]);
+    parent[x] = y;
+    return y;
+  }
+}
+void union2(int x,int y){
+  x = find(x);
+  y = find(y);
+  if (x!=y)
+    parent[y] = x;
+}
+
+int main() {
+	int t;
+	scanf("%d",&t);
+	for(int cnt=1;cnt<=t;cnt++){
+		int n,k;
+		scanf("%d\n%d",&n,&k);
+		for(int i=0;i<n;i++) parent[i]=i;
+		while(k--){
+			int u,v;
+			scanf("%d%d",&u,&v);
+			union2(u,v);
+		}
+		scanf("%d",&k);
+		printf("Scenario %d:\n",cnt);
+		while(k--){
+			int u,v;
+			scanf("%d%d",&u,&v);
+			if(find(v)==find(u)){
+				printf("1\n");
+			}else printf("0\n");
+		}
+		printf("\n");
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210217/1106.cpp b/jochanmin/2021/20210217/1106.cpp
new file mode 100644
index 0000000..991a945
--- /dev/null
+++ b/jochanmin/2021/20210217/1106.cpp
@@ -0,0 +1,34 @@
+#include <iostream>
+#include <algorithm>
+#include <cstring>
+using namespace std;
+
+#define MAX 1234
+
+int n,m;
+pair<int,int> arr[MAX];
+int dp[MAX];
+
+
+int go(int num){
+	if(num<=0) return 0;
+	int &ret=dp[num];
+	if(ret!=-1)
+		return ret;
+	ret=123456789;
+	for(int i=0;i<m;i++){
+		ret=min(ret,arr[i].first+go(num-arr[i].second));
+	}
+	return ret;
+}
+
+int main(){
+	int a,b;
+	scanf("%d%d",&n,&m);
+	for(int i=0;i<m;i++){
+		scanf("%d%d",&a,&b);
+		arr[i]={a,b};
+	}
+	memset(dp,-1,sizeof(dp));
+	printf("%d\n",go(n));
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210217/14728.cpp b/jochanmin/2021/20210217/14728.cpp
new file mode 100644
index 0000000..70a9c6e
--- /dev/null
+++ b/jochanmin/2021/20210217/14728.cpp
@@ -0,0 +1,18 @@
+#include<cstdio>
+#include<algorithm>
+
+using namespace std;
+int dp[12345];
+int main(){
+    int n,t;
+    scanf("%d %d",&n,&t);
+    for(int i=0;i<n;i++){
+        int k,s;
+        scanf("%d %d",&k,&s);
+        for(int j=t;j>=k;j--){
+            dp[j]=max(dp[j],dp[j-k]+s);
+        }
+    }
+    printf("%d",dp[t]);
+    return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210217/15990.cpp b/jochanmin/2021/20210217/15990.cpp
new file mode 100644
index 0000000..ea1ed6b
--- /dev/null
+++ b/jochanmin/2021/20210217/15990.cpp
@@ -0,0 +1,22 @@
+#include <cstdio>
+using namespace std;
+#define mod 1000000009
+
+long long arr[100001][3];
+int main() {
+	int t;
+	scanf("%d",&t);
+	arr[1][0]=1;
+	arr[2][1]=1;
+	arr[3][0]=1;arr[3][1]=1;arr[3][2]=1;
+	for(int i=4;i<=100000;i++){
+		arr[i][0]=(long long)(arr[i-1][1]+arr[i-1][2])%mod;
+		arr[i][1]=(long long)(arr[i-2][0]+arr[i-2][2])%mod;
+		arr[i][2]=(long long)(arr[i-3][0]+arr[i-3][1])%mod;
+	}
+	while(t--){
+		int num;scanf("%d",&num);
+		printf("%lld\n",(arr[num][0]+arr[num][1]+arr[num][2])%mod);
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210217/15991.cpp b/jochanmin/2021/20210217/15991.cpp
new file mode 100644
index 0000000..5eb01e5
--- /dev/null
+++ b/jochanmin/2021/20210217/15991.cpp
@@ -0,0 +1,19 @@
+#include<cstdio>
+#define MAX 1000000009
+
+int dp[100001];
+
+using namespace std;
+int main(){
+    dp[1]=1;dp[2]=2;dp[3]=2;dp[4]=3;dp[5]=3;dp[6]=6;
+    for(int i=7;i<=100000;i++){
+        dp[i]=((dp[i-2]+dp[i-4])%MAX+dp[i-6])%MAX;
+    }
+    int n,t;
+    scanf("%d",&t);
+    while(t--){
+        scanf("%d",&n);
+        printf("%d\n",dp[n]);
+    }
+    return 0;
+}
diff --git a/jochanmin/2021/20210217/15992.cpp b/jochanmin/2021/20210217/15992.cpp
new file mode 100644
index 0000000..b4a49e4
--- /dev/null
+++ b/jochanmin/2021/20210217/15992.cpp
@@ -0,0 +1,21 @@
+#include<cstdio>
+#define MAX 1000000009
+
+int dp[1001][1001];
+
+using namespace std;
+int main(){
+    dp[1][1]=1;dp[2][1]=1;dp[2][2]=1;dp[3][1]=1;dp[3][2]=2;dp[3][3]=1;
+    for(int i=4;i<=1000;i++){
+        for(int j=1;j<=1000;j++){
+            dp[i][j]=((dp[i-1][j-1]+dp[i-2][j-1])%MAX +dp[i-3][j-1])%MAX;
+        }
+    }
+    int n,m,t;
+    scanf("%d",&t);
+    while(t--){
+        scanf("%d%d",&n,&m);
+        printf("%d\n",dp[n][m]);
+    }
+    return 0;
+}
diff --git a/jochanmin/2021/20210217/15993.cpp b/jochanmin/2021/20210217/15993.cpp
new file mode 100644
index 0000000..1c5be9a
--- /dev/null
+++ b/jochanmin/2021/20210217/15993.cpp
@@ -0,0 +1,20 @@
+#include<cstdio>
+#define MAX 1000000009
+
+int dp[2][1000001];
+
+using namespace std;
+int main(){
+    dp[1][1]=1;dp[0][2]=1;dp[1][2]=1;dp[0][3]=2;dp[1][3]=2;
+    for(int i=4;i<=1000000;i++){
+            dp[0][i]=((dp[1][i-1]+dp[1][i-2])%MAX+dp[1][i-3])%MAX;
+            dp[1][i]=((dp[0][i-1]+dp[0][i-2])%MAX+dp[0][i-3])%MAX;
+    }
+    int n,t;
+    scanf("%d",&t);
+    while(t--){
+        scanf("%d",&n);
+        printf("%d %d\n",dp[1][n],dp[0][n]);
+    }
+    return 0;
+}
diff --git a/jochanmin/2021/20210217/4781.cpp b/jochanmin/2021/20210217/4781.cpp
new file mode 100644
index 0000000..5ddd276
--- /dev/null
+++ b/jochanmin/2021/20210217/4781.cpp
@@ -0,0 +1,37 @@
+#include <iostream>
+#include <algorithm>
+#include <cstring> //memset
+using namespace std;
+
+#define MAX 5001
+
+int n,c;
+double m,p;
+pair<int,int> candy[MAX];
+int dp[10001];
+
+
+int go(int num){
+	int &ret=dp[num];
+	if(ret!=-1)
+		return ret;
+		
+	ret=0;
+	for(int i=0;i<n;i++){
+		if(num-candy[i].second>=0)
+			ret=max(ret,candy[i].first+go(num-candy[i].second));
+	}
+	return ret;
+}
+
+int main(){
+	while(scanf("%d %lf",&n,&m)){
+		memset(dp,-1,sizeof(dp));
+		if(n==0 && m==0.00) break;
+		for(int i=0;i<n;i++){
+			scanf("%d %lf",&c,&p);
+			candy[i]={c,(int)(p*100+0.5)};
+		}
+		printf("%d\n",go((int)(m*100+0.5)));
+	}
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210224/1727.cpp b/jochanmin/2021/20210224/1727.cpp
new file mode 100644
index 0000000..95a6b28
--- /dev/null
+++ b/jochanmin/2021/20210224/1727.cpp
@@ -0,0 +1,60 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <cstring>
+#include <cmath>
+#include <string>
+#include <stack>
+#include <queue>
+
+using namespace std;
+
+const int inf = 987654321;
+int n, m, t;
+vector<int>man;
+vector<int>W;
+int dp[1001][1001];
+int dfs(int Widx, int manidx)
+{
+	if (Widx == m)return 0;
+	int&ret = dp[Widx][manidx];
+
+	if (ret != -1)return ret;
+
+	ret = inf;
+
+	for (int i = manidx; i < n - (m - Widx) + 1; ++i)
+	{
+		ret = min(ret, dfs(Widx + 1, i + 1) + abs(W[Widx] - man[i]));
+	}
+
+	return ret;
+}
+int main()
+{
+	memset(dp, -1, sizeof(dp));
+
+	cin >> n >> m;
+	
+	for (int i = 0; i < n; ++i)
+	{
+		cin >> t;
+
+		man.push_back(t);
+	}
+	for (int i = 0; i < m; ++i)
+	{
+		cin >> t;
+
+		W.push_back(t);
+	}
+
+	if (n < m)
+		swap(man, W), swap(n, m);
+
+	sort(man.begin(), man.end());
+	sort(W.begin(), W.end());
+
+	cout << dfs(0, 0);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20210224/8983.cpp b/jochanmin/2021/20210224/8983.cpp
new file mode 100644
index 0000000..9295856
--- /dev/null
+++ b/jochanmin/2021/20210224/8983.cpp
@@ -0,0 +1,45 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+
+
+using namespace std;
+typedef long long ll;
+typedef pair<ll, ll> P;
+ll n, m, l,res;
+
+vector<ll> gun;
+int func(ll animal) {
+
+	ll l = 0,r=gun.size()-1;
+	while (l < r) {
+		ll mid = (l + r) >> 1;
+
+		if (gun[mid] < animal) l = mid + 1;
+		else r = mid;
+	}
+    
+	if (l > 0) {
+		if (abs(animal - gun[l - 1]) < abs(animal - gun[l])) return gun[l - 1];
+		else return gun[l];
+	}
+	else return gun[l];
+}
+int main() {
+	cin >> m >> n >> l;
+	for (int i = 0; i < m; i++) {
+		ll a;
+		cin >> a;
+		gun.push_back(a);
+	}
+
+	sort(gun.begin(), gun.end());
+	for (int i = 0; i < n; i++) {
+		ll a, b;
+		cin >> a >> b;
+		ll p=func(a);
+		if (abs(a - p) + b <= l) res++;
+	}
+	cout <<res << '\n';
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/20210304/14675.txt b/jochanmin/2021/20210304/14675.cpp
similarity index 100%
rename from jochanmin/20210304/14675.txt
rename to jochanmin/2021/20210304/14675.cpp
diff --git a/jochanmin/20210304/17073.txt b/jochanmin/2021/20210304/17073.cpp
similarity index 100%
rename from jochanmin/20210304/17073.txt
rename to jochanmin/2021/20210304/17073.cpp
diff --git a/jochanmin/20210304/2638.txt b/jochanmin/2021/20210304/2638.cpp
similarity index 100%
rename from jochanmin/20210304/2638.txt
rename to jochanmin/2021/20210304/2638.cpp
diff --git a/jochanmin/20210304/9489.txt b/jochanmin/2021/20210304/9489.cpp
similarity index 100%
rename from jochanmin/20210304/9489.txt
rename to jochanmin/2021/20210304/9489.cpp
diff --git a/jochanmin/2021/20210314/12945.cpp b/jochanmin/2021/20210314/12945.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/jochanmin/20220101/14676.cpp b/jochanmin/2021/20210314/14676.cpp
similarity index 100%
rename from jochanmin/20220101/14676.cpp
rename to jochanmin/2021/20210314/14676.cpp
diff --git a/jochanmin/2021/20210314/2026.cpp b/jochanmin/2021/20210314/2026.cpp
new file mode 100644
index 0000000..6e58f2e
--- /dev/null
+++ b/jochanmin/2021/20210314/2026.cpp
@@ -0,0 +1,55 @@
+#include <cstdio>
+#include <cstring>
+#include<vector>
+#include<algorithm>
+using namespace std;
+
+int k, n, f;
+bool flag;
+int visit[901];
+int graph[901][901];
+vector<int> back;
+void dfs(int x) {
+    visit[x] = true;
+    back.push_back(x);
+
+    if (k == back.size()) {
+        for (auto &p : back) {
+            printf("%d\n", p);
+
+        }
+        exit(0);
+    }
+    else {
+        for (int i = x + 1; i <= n; i++) {
+            if (!visit[i]) {
+                bool chk = true;
+                for (auto &p : back) {
+                    if (!graph[i][p]) {
+                        chk = false;
+                        break;
+                    }
+                }
+                if (chk) {
+                    dfs(i);
+                }
+            }
+        }
+        back.pop_back();
+    }
+}
+int main() {
+    scanf("%d%d%d", &k, &n, &f);
+    for (int i = 0; i < f; i++) {
+        int a, b; scanf("%d%d", &a, &b);
+        graph[a][b] = 1;
+        graph[b][a] = 1;
+    }
+    for (int i = 1; i <= n; i++) {
+        back.clear();
+        memset(visit, 0, sizeof(visit));
+        dfs(i);
+    }
+    printf("-1\n");
+    return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20211107/1120.cpp b/jochanmin/2021/20211107/1120.cpp
new file mode 100644
index 0000000..f59550b
--- /dev/null
+++ b/jochanmin/2021/20211107/1120.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+#include <string>
+using namespace std;
+
+int main() {
+	string a,b;
+	cin>>a>>b;
+	int max_cnt=0;
+	int idx=0;
+	int cnt=0;
+	for(int i=0;i<=b.size()-a.size();i++){
+		cnt=0;
+		for(int j=0;j<a.size();j++){
+			if(a[j]==b[i+j]) cnt++;
+		}
+		if(cnt>max_cnt){
+			max_cnt=cnt;
+		}
+	}
+	cout<<(a.size()-max_cnt);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20211107/1181.cpp b/jochanmin/2021/20211107/1181.cpp
new file mode 100644
index 0000000..e9856b4
--- /dev/null
+++ b/jochanmin/2021/20211107/1181.cpp
@@ -0,0 +1,41 @@
+#include<iostream>
+#include<vector>
+#include<algorithm>
+#include<string>
+
+using namespace std;
+
+int N;
+vector<string> vec;
+
+bool cmp(string s1, string s2){
+    if(s1.length() < s2.length()){
+        return true;
+    }else if(s1.length() == s2.length()){ 
+         return s1<s2;
+        
+    }else{
+        return false;
+    }
+}
+
+int main(){
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    cin >> N;
+    
+    while(N--){
+        string s;
+        cin >> s;
+        vec.push_back(s);
+    }
+    
+    sort(vec.begin(), vec.end(), cmp);
+    vec.erase(unique(vec.begin(), vec.end()), vec.end());
+
+
+    
+    for(string s : vec){
+        cout << s << "\n";
+    }
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20211107/2920.cpp b/jochanmin/2021/20211107/2920.cpp
new file mode 100644
index 0000000..e001295
--- /dev/null
+++ b/jochanmin/2021/20211107/2920.cpp
@@ -0,0 +1,23 @@
+#include <iostream>
+#include<string>
+using namespace std;
+int main(void) {
+	string des="87654321";
+	string asc="12345678";
+	string input="";
+	for(int i=0;i<8;i++){
+		string a;
+		cin>>a;
+		input+=a;
+	}
+	if(!des.compare(input)){
+		cout<<"descending";
+	}else if(!asc.compare(input)){
+		cout<<"ascending";
+	}else{
+		cout<<"mixed";
+	}
+ 
+	return 0;
+}
+ 
\ No newline at end of file
diff --git a/jochanmin/2021/20211107/7568.cpp b/jochanmin/2021/20211107/7568.cpp
new file mode 100644
index 0000000..1c261a0
--- /dev/null
+++ b/jochanmin/2021/20211107/7568.cpp
@@ -0,0 +1,30 @@
+//* 자신보다 더 "큰 덩치"의 사람의 수가 중요 
+#include<bits/stdc++.h>
+using namespace std;
+typedef pair<int,int> ii;
+
+
+ii arr[50];
+int ret[50];
+int main() {
+	int n;
+	scanf("%d",&n);
+	for(int i=0;i<n;i++){
+		int x,y;
+		scanf("%d %d",&x,&y);
+		arr[i]=make_pair(x,y);
+	}
+	for(int i=0;i<n;i++){
+		for(int j=i+1;j<n;j++){
+			if(arr[i].first<arr[j].first && arr[i].second<arr[j].second)
+			 ret[i]++;
+			if(arr[i].first>arr[j].first && arr[i].second>arr[j].second)
+			 ret[j]++;
+		}
+	}
+	for(int i=0;i<n;i++){
+		printf("%d ",ret[i]+1);
+	}
+	
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2021/20211107/9012.cpp b/jochanmin/2021/20211107/9012.cpp
new file mode 100644
index 0000000..e03f6ef
--- /dev/null
+++ b/jochanmin/2021/20211107/9012.cpp
@@ -0,0 +1,36 @@
+#include <cstdio>
+#include <string>
+#include <stack>
+using namespace std;
+
+int main() {
+	int n;
+	scanf("%d",&n);
+	char s[51];
+	for(int i=0;i<n;i++){
+		bool flag=false;
+		stack<char> si;
+		scanf("%s",s);
+		for(int j=0;s[j];j++){
+			if(s[j]=='(')
+				si.push('(');
+			else{
+				if(si.empty()){
+					printf("NO\n");
+					flag=true;
+					break;
+				}
+				else
+				 si.pop();
+			}
+			
+		}
+		if(flag)
+		 continue;
+		if(!si.empty())
+		 printf("NO\n");
+		else
+		 printf("YES\n");
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/20220101/11497.cpp b/jochanmin/2022/20220101/11497.cpp
similarity index 100%
rename from jochanmin/20220101/11497.cpp
rename to jochanmin/2022/20220101/11497.cpp
diff --git a/jochanmin/2022/20220101/14676.cpp b/jochanmin/2022/20220101/14676.cpp
new file mode 100644
index 0000000..9313898
--- /dev/null
+++ b/jochanmin/2022/20220101/14676.cpp
@@ -0,0 +1,53 @@
+#include <cstdio>
+#include<vector>
+#include <algorithm>
+using namespace std;
+
+int degree[100001];
+int spot[100001];
+
+int main() {
+	int n,m,k;
+    scanf("%d %d %d",&n,&m,&k);
+
+    vector<vector<int>> arr(n+1);
+    for(int i=0;i<m;i++){
+        int u,v;
+        scanf("%d %d",&u,&v);
+        arr[u].push_back(v);
+        degree[v]++;
+    }
+
+    bool ret=false;
+    for(int i=0;i<k;i++){
+        int oper,num;
+        scanf("%d %d",&oper,&num);
+        if(ret) break;
+        switch(oper){
+            case 1:
+            if(degree[num]==0){
+                spot[num]++;
+                if(spot[num]==1){
+                    for(int j=0;j<arr[num].size();j++) degree[arr[num][j]]--;
+                }
+            }else{
+                ret=true;
+            }
+            break;
+            case 2:
+            if(spot[num]==0){
+                ret=true;
+            }else{
+                spot[num]--;
+                if(spot[num]==0){
+                    for(int j=0;j<arr[num].size();j++) degree[arr[num][j]]++;
+                }
+            }
+            break;
+        }
+    }
+    if(ret) printf("Lier!\n");
+    else printf("King-God-Emperor\n");
+
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220101/22942.cpp b/jochanmin/2022/20220101/22942.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/jochanmin/20220101/2631.cpp b/jochanmin/2022/20220101/2631.cpp
similarity index 100%
rename from jochanmin/20220101/2631.cpp
rename to jochanmin/2022/20220101/2631.cpp
diff --git a/jochanmin/20220101/5567.cpp b/jochanmin/2022/20220101/5567.cpp
similarity index 100%
rename from jochanmin/20220101/5567.cpp
rename to jochanmin/2022/20220101/5567.cpp
diff --git a/jochanmin/20220101/7347.cpp b/jochanmin/2022/20220101/7347.cpp
similarity index 100%
rename from jochanmin/20220101/7347.cpp
rename to jochanmin/2022/20220101/7347.cpp
diff --git a/jochanmin/20220108/1005.cpp b/jochanmin/2022/20220108/1005.cpp
similarity index 100%
rename from jochanmin/20220108/1005.cpp
rename to jochanmin/2022/20220108/1005.cpp
diff --git a/jochanmin/20220108/12896.cpp b/jochanmin/2022/20220108/12896.cpp
similarity index 100%
rename from jochanmin/20220108/12896.cpp
rename to jochanmin/2022/20220108/12896.cpp
diff --git a/jochanmin/20220108/21313.cpp b/jochanmin/2022/20220108/21313.cpp
similarity index 100%
rename from jochanmin/20220108/21313.cpp
rename to jochanmin/2022/20220108/21313.cpp
diff --git a/jochanmin/20220116/14499.cpp b/jochanmin/2022/20220116/14499.cpp
similarity index 100%
rename from jochanmin/20220116/14499.cpp
rename to jochanmin/2022/20220116/14499.cpp
diff --git a/jochanmin/20220116/16956.cpp b/jochanmin/2022/20220116/16956.cpp
similarity index 100%
rename from jochanmin/20220116/16956.cpp
rename to jochanmin/2022/20220116/16956.cpp
diff --git a/jochanmin/20220116/1823.cpp b/jochanmin/2022/20220116/1823.cpp
similarity index 100%
rename from jochanmin/20220116/1823.cpp
rename to jochanmin/2022/20220116/1823.cpp
diff --git a/jochanmin/2022/20220206/15900.cpp b/jochanmin/2022/20220206/15900.cpp
new file mode 100644
index 0000000..504d669
--- /dev/null
+++ b/jochanmin/2022/20220206/15900.cpp
@@ -0,0 +1,31 @@
+#include <cstdio>
+#include <vector>
+#include<cstring>
+using namespace std;
+vector<int> tree[500001];
+bool visit[500001];
+int cnt;
+void dfs(int now,int depth){
+	visit[now]=true;
+	if(tree[now].size()==1) cnt+=depth;
+	for(int i=0;i<tree[now].size();i++){
+		if(!visit[tree[now][i]]){
+			dfs(tree[now][i],depth+1);
+		}
+	}
+}
+int main() {
+	int n;
+	int u,v;
+	scanf("%d",&n);
+	for(int i=0;i<n-1;i++){
+		scanf("%d %d",&u,&v);
+		tree[u].push_back(v);
+		tree[v].push_back(u);
+	}
+	dfs(1,0);
+	if(cnt%2==1) printf("Yes");
+	else printf("No");
+	
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220206/16437.cpp b/jochanmin/2022/20220206/16437.cpp
new file mode 100644
index 0000000..2027459
--- /dev/null
+++ b/jochanmin/2022/20220206/16437.cpp
@@ -0,0 +1,31 @@
+#include <cstdio>
+#include<vector>
+using namespace std;
+
+long long result[123457];
+vector<int> tree[123457];
+long long dfs(int now){
+	long long ret=0;
+	for(int i=0;i<tree[now].size();i++){
+		ret+=dfs(tree[now][i]);
+	}
+	ret+=result[now];
+	if(ret<0)ret=0;
+	return ret;
+}
+int main() {
+	int n;
+	scanf("%d",&n);
+	for(int i=2;i<=n;i++){
+		getchar();
+		char t;
+		int a,p;
+		scanf("%c %d %d",&t,&a,&p);
+		if(t=='W') result[i]=a*-1;
+		else result[i]=a;
+		tree[p].push_back(i);
+	}
+	long long ret = dfs(1);
+	printf("%lld",ret);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220206/2887.cpp b/jochanmin/2022/20220206/2887.cpp
new file mode 100644
index 0000000..b841de3
--- /dev/null
+++ b/jochanmin/2022/20220206/2887.cpp
@@ -0,0 +1,67 @@
+#include <cstdio>
+#include <vector>
+#include <cmath>
+#include <algorithm>
+#define MAX 100001
+using namespace std;
+
+int n, cost =  0;
+struct Planet{
+    int idx, x, y, z;
+};
+bool cmpx (Planet a, Planet b){
+    return a.x < b.x;
+}
+bool cmpy (Planet a, Planet b){
+    return a.y < b.y;
+}
+bool cmpz (Planet a, Planet b){
+    return a.z < b.z;
+}
+struct Tunnel{
+    int i, j, w;
+    bool operator < (const Tunnel &t) const {
+        return w < t.w;
+    }
+};
+Planet planet[MAX];
+vector<Tunnel> tunnel;
+int tree[MAX];
+
+int findRoot(int v){
+    if(tree[v] == v) return v;
+    return tree[v] = findRoot(tree[v]);
+}
+
+int main(){
+    scanf("%d",&n);
+    for(int i = 1; i <= n; i++){
+    	scanf("%d %d %d",&planet[i].x,planet[i].y ,planet[i].z);
+        planet[i].idx = i;
+        tree[i] = i;
+    }
+    sort(planet+1, planet+n+1, cmpx);
+    for(int i = 1; i <= n-1; i++){
+        tunnel.push_back({planet[i].idx, planet[i+1].idx, abs(planet[i].x-planet[i+1].x)});
+    }
+    sort(planet+1, planet+n+1, cmpy);
+    for(int i = 1; i <= n-1; i++){
+        tunnel.push_back({planet[i].idx, planet[i+1].idx, abs(planet[i].y-planet[i+1].y)});
+    }
+    sort(planet+1, planet+n+1, cmpz);
+    for(int i = 1; i <= n-1; i++){
+        tunnel.push_back({planet[i].idx, planet[i+1].idx, abs(planet[i].z-planet[i+1].z)});
+    }
+    sort(tunnel.begin(), tunnel.end());
+    for(Tunnel t : tunnel){
+        int i = findRoot(t.i);
+        int j = findRoot(t.j);
+        if(i != j){
+            tree[j] = i;
+            cost += t.w;
+        }
+    }
+    printf("%d",cost);
+
+    return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220206/4690.cpp b/jochanmin/2022/20220206/4690.cpp
new file mode 100644
index 0000000..108f477
--- /dev/null
+++ b/jochanmin/2022/20220206/4690.cpp
@@ -0,0 +1,18 @@
+#include<cstdio>
+using namespace std;
+
+int main(){
+    for(int i=1;i<=100;i++){
+        for(int j=2;j<=i;j++){
+            for(int k=j;k<=i;k++){
+                for(int q=k;q<=i;q++){
+                    if(i*i*i==j*j*j+k*k*k+q*q*q){
+                        printf("Cube = %d, Triple = (%d,%d,%d)\n",i,j,k,q);
+                    }
+                }
+            }
+        }
+    }
+    
+    return 0; 
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220213/14391.cpp b/jochanmin/2022/20220213/14391.cpp
new file mode 100644
index 0000000..4cdcaa4
--- /dev/null
+++ b/jochanmin/2022/20220213/14391.cpp
@@ -0,0 +1,60 @@
+#include <cstdio>
+#include <algorithm>
+#include <vector>
+using namespace std;
+int arr[16];
+bool visit[16];
+int ans;
+int n,m;
+void calc(){
+	int sum=0,tmp=0;
+	for(int i=0;i<n;i++){
+		tmp=0;
+		for(int j=0;j<m;j++){
+			if(visit[i*m+j]){
+				tmp*=10;
+				tmp+=arr[i*m+j];
+			}else{
+				sum+=tmp;
+				tmp=0;
+			}
+		}
+		sum+=tmp;
+	}
+	for(int j=0;j<m;j++){
+		tmp=0;
+		for(int i=0;i<n;i++){
+			if(!visit[i*m+j]){
+				tmp*=10;
+				tmp+=arr[i*m+j];
+			}else{
+				sum+=tmp;
+				tmp=0;
+			}
+		}
+		sum+=tmp;
+	}
+	ans=max(ans,sum);
+}
+void dfs(int idx){
+	if(idx==n*m){
+		calc();
+		return;
+	}
+	visit[idx]=true;
+	dfs(idx+1);
+	visit[idx]=false;
+	dfs(idx+1);
+}
+int main(){
+	scanf("%d %d",&n,&m);
+	for(int i=0;i<n;i++){
+		for(int j=0;j<m;j++){
+			scanf("%1d",&arr[m*i+j]);
+		}
+	}
+	
+	dfs(0);
+	printf("%d",ans);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220213/17610.cpp b/jochanmin/2022/20220213/17610.cpp
new file mode 100644
index 0000000..82062a3
--- /dev/null
+++ b/jochanmin/2022/20220213/17610.cpp
@@ -0,0 +1,29 @@
+#include <cstdio>
+#include <algorithm>
+using namespace std;
+int arr[14];
+int n,s;
+bool visit[200000*13+12];
+void go(int weight,int depth){
+	if(depth==n){
+		if(weight>0) visit[weight]=true;
+		return;
+	}
+	go(weight+arr[depth],depth+1);
+	go(weight-arr[depth],depth+1);
+	go(weight,depth+1);
+}
+int main() {
+	scanf("%d",&n);
+	for(int i=0;i<n;i++){
+		scanf("%d",&arr[i]);
+		s+=arr[i];
+	}
+	go(0,0);
+	int cnt=0;
+	for(int i=1;i<=s;i++){
+		if(!visit[i]) cnt++;
+	}
+	printf("%d",cnt);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220213/2504.cpp b/jochanmin/2022/20220213/2504.cpp
new file mode 100644
index 0000000..078a20e
--- /dev/null
+++ b/jochanmin/2022/20220213/2504.cpp
@@ -0,0 +1,41 @@
+#include <string>
+#include<algorithm>
+#include<stack>
+#include<iostream>
+using namespace std;
+
+string str;
+stack<char> st;
+int ans, piv=1;
+bool vaild=true;
+int main() {
+	cin>>str;
+	for(int i=0;i<str.size();i++){
+		if(str[i]=='('){
+			piv*=2;
+			st.push('(');
+		}
+		if(str[i]=='['){
+			piv*=3;
+			st.push('[');
+		}
+		if(str[i]==')'){
+			if(!st.size() || st.top() != '('){
+				vaild=false;
+				break;
+			}
+			if(str[i-1]=='(') ans+=piv;
+			piv/=2;
+			st.pop();
+		}
+		if(str[i]==']'){
+			if(!st.size()||st.top() !='['){vaild=false;break;}
+			if(str[i-1]=='[') ans+=piv;
+			piv/=3;
+			st.pop();
+		}
+	}
+	if(!vaild || st.size()) cout<<0;
+	else cout<<ans;
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220213/3187.cpp b/jochanmin/2022/20220213/3187.cpp
new file mode 100644
index 0000000..441cc8a
--- /dev/null
+++ b/jochanmin/2022/20220213/3187.cpp
@@ -0,0 +1,56 @@
+#include <cstdio>
+#include <algorithm>
+#include <queue>
+using namespace std;
+int r,c;
+int sheep,wolf;
+char arr[277][277];
+bool visit[277][277];
+
+int dx []={0,0,1,-1};
+int dy[]={1,-1,0,0};
+void bfs(int i,int j){
+	int cur_sheep=0,cur_wolf=0;
+	queue<pair<int,int>> q;
+	q.push({i,j});
+	visit[i][j]=true;
+	if(arr[i][j]=='k') cur_sheep++;
+	if(arr[i][j]=='v') cur_wolf++;
+	while(!q.empty()){
+		int x=q.front().first,y=q.front().second;
+		q.pop();
+		for(int i=0;i<4;i++){
+			int cx=x+dx[i];
+			int cy=y+dy[i];
+			
+			if(cx>=0 && cy>=0 && cx<r && cy<c){
+				if(arr[cx][cy]!='#' && !visit[cx][cy]){
+					visit[cx][cy]=true;
+					q.push({cx,cy});
+					if(arr[cx][cy]=='k') cur_sheep++;
+					if(arr[cx][cy]=='v') cur_wolf++;
+				}
+			}
+		}
+	}
+	if(cur_sheep > cur_wolf) sheep+=cur_sheep;
+	else wolf+=cur_wolf;
+}
+int main() {
+	scanf("%d %d",&r,&c);
+	getchar();
+	for(int i=0;i<r;i++){
+		scanf("%s",arr[i]);
+	}
+	for(int i=0;i<r;i++){
+		for(int j=0;j<c;j++){
+			if(arr[i][j]!='#'){
+				if(!visit[i][j]){
+					bfs(i,j);
+				}
+			} 
+		}
+	}
+	printf("%d %d",sheep,wolf);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220226/17212.cpp b/jochanmin/2022/20220226/17212.cpp
new file mode 100644
index 0000000..f2c6f70
--- /dev/null
+++ b/jochanmin/2022/20220226/17212.cpp
@@ -0,0 +1,31 @@
+#include <cstdio>
+#include <queue>
+#include<cstring>
+using namespace std;
+
+
+int dp[100001];
+int coin[]={7,5,2,1};
+int main() {
+	int n,cnt=0,idx=0;
+	memset(dp,-1,sizeof(dp));
+	scanf("%d",&n);
+	dp[0]=0;
+	queue<int> q;
+	q.push(1);dp[1]=1;
+	q.push(2);dp[2]=1;
+	q.push(5);dp[5]=1;
+	q.push(7);dp[7]=1;
+	while(!q.empty()){
+		int now=q.front();
+		q.pop();
+		for(int i=0;i<4;i++){
+			if(now+coin[i] <=100000 && dp[now+coin[i]]==-1){
+				dp[now+coin[i]]=dp[now]+1;
+				q.push(now+coin[i]);
+			}
+		}
+	}
+	printf("%d",dp[n]);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220226/1874.cpp b/jochanmin/2022/20220226/1874.cpp
new file mode 100644
index 0000000..e69de29
diff --git a/jochanmin/2022/20220226/7682.cpp b/jochanmin/2022/20220226/7682.cpp
new file mode 100644
index 0000000..7edde65
--- /dev/null
+++ b/jochanmin/2022/20220226/7682.cpp
@@ -0,0 +1,55 @@
+#include <cstdio>
+#include <queue>
+#include<cstring>
+using namespace std;
+
+char str[20];
+char arr[3][3];
+bool check(){
+	int oCount=0,xCount=0,spotCount=0;
+	for(int i=0;i<3;i++){
+		for(int j=0;j<3;j++){
+			if(arr[i][j]=='.'){
+				spotCount++;
+			}else if(arr[i][j]=='O') oCount++;
+			else xCount++;
+		}
+	}
+	bool xwin=false;
+	bool ywin= false;
+	for(int i=0;i<3;i++){
+		if(arr[i][0]=='O'&&arr[i][0]==arr[i][1] &&arr[i][1]==arr[i][2]) xwin=true;
+		if(arr[0][i]=='O'&&arr[0][i]==arr[1][i] &&arr[1][i]==arr[2][i]) xwin=true;
+	}
+	if(arr[0][0]=='O'&&arr[0][0]==arr[1][1] &&arr[1][1]==arr[2][2]) xwin=true;
+	if(arr[0][2]=='O'&&arr[0][2]==arr[1][1] &&arr[1][1]==arr[2][0]) xwin=true;
+	
+	for(int i=0;i<3;i++){
+		if(arr[i][0]=='X'&&arr[i][0]==arr[i][1] &&arr[i][1]==arr[i][2]) ywin=true;
+		if(arr[0][i]=='X'&&arr[0][i]==arr[1][i] &&arr[1][i]==arr[2][i]) ywin=true;
+	}
+	if(arr[0][0]=='X'&&arr[0][0]==arr[1][1] &&arr[1][1]==arr[2][2]) ywin=true;
+	if(arr[0][2]=='X'&&arr[0][2]==arr[1][1] &&arr[1][1]==arr[2][0]) ywin=true;
+	if(ywin && !xwin && xCount-oCount==1) return true;
+	if(!ywin && xwin && xCount==oCount) return true;
+	if(!ywin && !xwin &&xCount==5 && oCount==4) return true;
+	
+	return false;
+}
+int main() {
+	while(1){
+		scanf("%s",&str);
+		if(!strcmp(str,"end")) break;
+		for(int j=0;j<3;j++){
+			for(int k=0;k<3;k++){
+				arr[j][k]=str[j*3+k];
+			}
+		}
+		if(check()){
+			printf("valid\n");
+		}else{
+			printf("invalid\n");
+		}
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220305/11722.cpp b/jochanmin/2022/20220305/11722.cpp
new file mode 100644
index 0000000..77ae415
--- /dev/null
+++ b/jochanmin/2022/20220305/11722.cpp
@@ -0,0 +1,29 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+using namespace std;
+int main() {
+	ios_base :: sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+	int n,num;
+	vector<int> v;
+	cin>>n;
+	cin>>num;
+	v.push_back(-num);
+	for(int i=1;i<n;i++){
+		cin>>num;
+		num=-num;
+		if(v.back()<num) v.push_back(num);
+		else{
+			auto it =lower_bound(v.begin(),v.end(),num);
+
+			*it=num;
+		}
+		
+		
+	}
+	cout<<v.size();
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220305/2798.cpp b/jochanmin/2022/20220305/2798.cpp
new file mode 100644
index 0000000..1632ec5
--- /dev/null
+++ b/jochanmin/2022/20220305/2798.cpp
@@ -0,0 +1,28 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+using namespace std;
+int main() {
+	ios_base :: sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+	int n,m;
+	cin>>n>>m;
+	int arr[101];
+	for(int i=0;i<n;i++){
+		cin>>arr[i];
+	}
+	int tmp=0;
+	for(int i=0;i<n;i++){
+		for(int j=i+1;j<n;j++){
+			for(int k=j+1;k<n;k++){
+				if(arr[i]+arr[j]+arr[k]<=m){
+					tmp=max(tmp,arr[i]+arr[j]+arr[k]);		
+				}
+			}
+		}
+	}
+	cout<<tmp;
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220305/9342.cpp b/jochanmin/2022/20220305/9342.cpp
new file mode 100644
index 0000000..8de3ada
--- /dev/null
+++ b/jochanmin/2022/20220305/9342.cpp
@@ -0,0 +1,22 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+#include <regex>
+using namespace std;
+int main() {
+	ios_base :: sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+	regex r(R"(^[A-F]?A+F+C+[A-F]?$)");
+	int n;
+	cin>>n;
+	string str;
+	for(int i=0;i<n;i++){
+		cin>>str;
+		if (regex_match(str, r)) // 정규식을 이용한 패턴 매칭
+            cout << "Infected!" << endl;
+        else cout << "Good" << endl;
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220305/9375.cpp b/jochanmin/2022/20220305/9375.cpp
new file mode 100644
index 0000000..4c16f9a
--- /dev/null
+++ b/jochanmin/2022/20220305/9375.cpp
@@ -0,0 +1,28 @@
+#include <iostream>
+#include <map>
+#include<string>
+using namespace std;
+map<string, int> clothes;
+int main() {
+	ios_base :: sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+	int T;
+	cin>>T;
+	while(T--){
+		int n;
+		cin>>n;
+		clothes.clear();
+		string name,type;
+		for(int i=0;i<n;i++){
+			cin>>name>>type;
+			clothes[type]++;
+		}
+		int cal=1;
+		for(auto it=clothes.begin();it!=clothes.end();it++){
+			cal*=(it->second+1);
+		}
+		cout<<cal-1<<'\n';
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220320/11279.cpp b/jochanmin/2022/20220320/11279.cpp
new file mode 100644
index 0000000..5f203ca
--- /dev/null
+++ b/jochanmin/2022/20220320/11279.cpp
@@ -0,0 +1,25 @@
+#include <cstdio>
+#include<queue>
+using namespace std;
+
+int main() {
+	int n;
+	scanf("%d",&n);
+	priority_queue<int> pq;
+	
+	for(int i=0;i<n;i++){
+		int num;
+		scanf("%d",&num);
+		if(num==0){
+			if(pq.empty()){
+				printf("0\n");
+			}else{
+				printf("%d\n",pq.top());
+				pq.pop();
+			}
+		}else{
+			pq.push(num);
+		}
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220320/19539.cpp b/jochanmin/2022/20220320/19539.cpp
new file mode 100644
index 0000000..864b4a2
--- /dev/null
+++ b/jochanmin/2022/20220320/19539.cpp
@@ -0,0 +1,21 @@
+#include <cstdio>
+#include<queue>
+using namespace std;
+
+int main() {
+	int n;
+	int arr[100001];
+	scanf("%d",&n);
+	int sum=0;
+	int two=0;
+	for(int i=0;i<n;i++){
+		scanf("%d",&arr[i]);
+		two+=arr[i]/2;
+		sum+=arr[i];
+	}
+	if(sum%3==0 && two>=sum/3){
+		printf("YES");
+	}else printf("NO");
+	
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220320/20154.cpp b/jochanmin/2022/20220320/20154.cpp
new file mode 100644
index 0000000..f2c082d
--- /dev/null
+++ b/jochanmin/2022/20220320/20154.cpp
@@ -0,0 +1,25 @@
+#include <iostream>
+#include<string>
+#include<vector>
+using namespace std;
+
+int main() {
+	string str;
+	cin>>str;
+	vector<int> v;
+	int arr[]={3, 2, 1, 2, 3, 3, 3, 3, 1, 1, 3, 1, 3, 3, 1, 2, 2, 2, 1, 2, 1, 1, 2, 2, 2, 1};
+	for(int i=0;i<str.size();i++){
+		v.push_back(arr[str[i]-'A']);
+	}
+	int sum=0;
+	for(int i=0;i<v.size();i++){
+		sum+=v[i];
+		sum%=10;
+	}
+	if(sum%2==0){
+		cout<<"You're the winner?";
+	}else{
+		cout<<"I'm a winner!";
+	}
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220320/5624.cpp b/jochanmin/2022/20220320/5624.cpp
new file mode 100644
index 0000000..2ff6963
--- /dev/null
+++ b/jochanmin/2022/20220320/5624.cpp
@@ -0,0 +1,25 @@
+#include <cstdio>
+#include<string>
+#include<vector>
+#include<algorithm>
+using namespace std;
+int arr[12345];
+int dp[400001];
+
+int main() {
+	int n;
+	int res=0;
+	int base=200000;
+	scanf("%d",&n);
+	for(int i=0;i<n;i++) scanf("%d",&arr[i]);
+	for(int i=0;i<n;i++){
+		for(int j=0;j<i;j++){
+			if(dp[arr[i]-arr[j]+base]){
+				res++;break;
+			}
+		}
+		for(int j=0;j<=i;j++) dp[arr[i]+arr[j]+base]++;
+	}
+	printf("%d",res);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220327/1978.cpp b/jochanmin/2022/20220327/1978.cpp
new file mode 100644
index 0000000..31fa9f1
--- /dev/null
+++ b/jochanmin/2022/20220327/1978.cpp
@@ -0,0 +1,22 @@
+#include <cstdio>
+#include<cmath>
+using namespace std;
+bool isPrime(int n){
+	if(n==1) return false;
+	for(int i=2;i<=sqrt(n);i++){
+		if(n%i==0) return false;
+	}
+	return true;
+}
+int main() {
+	int n;
+	scanf("%d",&n);
+	int count=0;
+	for(int i=0;i<n;i++){
+		int num;
+		scanf("%d",&num);
+		if(isPrime(num)) count++;
+	}
+	printf("%d",count);
+	return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220327/22943.cpp b/jochanmin/2022/20220327/22943.cpp
new file mode 100644
index 0000000..5d11217
--- /dev/null
+++ b/jochanmin/2022/20220327/22943.cpp
@@ -0,0 +1,68 @@
+#include<iostream>
+#include<vector>
+#include<string>
+#include<algorithm>
+#include<cmath>
+#include<cstring>
+using namespace std;
+
+
+int k,m;
+bool prime[100001];
+bool sumPrime[100001];
+bool sumPrimeSame[100001];
+bool sameAtom(int num){
+	bool arr[10]={false};
+	while(num){
+		if(!arr[num%10]) arr[num%10]=true;
+		else return true;
+		num/=10;
+	}
+	return false;
+}
+bool check(int num){
+    if(!sumPrime[num]) return false;
+    if(sameAtom(num)) return false;
+    while(num%m==0){
+        num/=m;
+    }
+    if(!sumPrimeSame[num]) return false;
+    return true;
+}
+int main(){
+  cin>>k>>m;
+  vector<int> primeList;
+  memset(prime,true,sizeof(prime));
+  prime[0]=false;prime[1]=false;
+  for(int i=2;i*i<100000;i++){
+      if(prime[i]){
+          for(int j=i*i;j<100000;j+=i) prime[j]=false;
+      }
+  }
+  for(int i=2;i<100000;i++){
+      if(prime[i]) primeList.push_back(i);
+  }
+  for(int i=0;i<primeList.size();i++){
+      for(int j=i+1;j<primeList.size();j++){
+          if(primeList[i]+primeList[j]<100000)
+           sumPrime[primeList[i]+primeList[j]]=true;
+      }
+  }
+  for(int i=0;i<primeList.size();i++){
+      for(int j=i;j<primeList.size();j++){
+          if((long long)primeList[i]*primeList[j]<100000)
+           sumPrimeSame[primeList[i]*primeList[j]]=true;
+      }
+  }
+  int count =0;
+  if(k==1){
+      for(int i=1;i<10;i++){
+          if(check(i)) count++;
+      }
+  }else{
+      for(int i=(int)pow(10,k-1);i<(int)pow(10,k);i++){
+          if(check(i)) count++;
+      }
+  }
+  cout<<count;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220327/5052.cpp b/jochanmin/2022/20220327/5052.cpp
new file mode 100644
index 0000000..d357c04
--- /dev/null
+++ b/jochanmin/2022/20220327/5052.cpp
@@ -0,0 +1,26 @@
+#include<iostream>
+#include<vector>
+#include<string>
+#include<algorithm>
+using namespace std;
+
+int main(){
+  int T, n, i;
+  cin >> T;
+  while(T--){
+    cin >> n;
+    string s;
+    vector<string> v(n);
+    for(i=0; i < n; i++) cin >> v[i];
+    sort(v.begin(), v.end());
+    bool answer = true;
+    for(i=0; i <n-1; i++){
+      if(v[i] == v[i+1].substr(0, v[i].length())){
+        answer = false;
+        break;
+      }
+    }
+    cout << (answer ? "YES":"NO") <<endl;
+  }
+  return 0;
+}
\ No newline at end of file
diff --git a/jochanmin/2022/20220327/8980.cpp b/jochanmin/2022/20220327/8980.cpp
new file mode 100644
index 0000000..27d6c36
--- /dev/null
+++ b/jochanmin/2022/20220327/8980.cpp
@@ -0,0 +1,46 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+struct box {
+	int u;
+	int v;
+	int w;
+};
+
+box arr[10000];
+int capacity[10001] = { 0 };
+int n = 0, c = 0, m = 0;
+int result = 0;
+
+bool cmp(box a, box b) {
+	if (a.v < b.v)return true;
+	else if (a.v == b.v)
+		if (a.u < b.u)
+			return true;
+		
+	return false;
+}
+
+int main() {
+	cin >> n >> c;
+	cin >> m;
+	for (int i = 0; i < m; i++)
+		cin >> arr[i].u >> arr[i].v >> arr[i].w;
+
+	sort(arr, arr + m,cmp);
+
+	for (int i = 0; i < m; i++) { 
+		int maxcnt = 0;
+		for (int j = arr[i].u; j < arr[i].v; j++)  
+			maxcnt = max(capacity[j], maxcnt); 
+		int val = min(arr[i].w, c - maxcnt);
+		result += val;
+		
+		for (int j = arr[i].u; j < arr[i].v; j++) {
+			capacity[j] += val;
+		}
+
+	}
+	cout << result << endl;
+}
\ No newline at end of file
diff --git a/seong_cheol/.DS_Store b/seong_cheol/.DS_Store
new file mode 100644
index 0000000..e39c51b
Binary files /dev/null and b/seong_cheol/.DS_Store differ
diff --git a/seong_cheol/220116~220122/11509.cpp b/seong_cheol/220116~220122/11509.cpp
new file mode 100644
index 0000000..ddd3217
--- /dev/null
+++ b/seong_cheol/220116~220122/11509.cpp
@@ -0,0 +1,41 @@
+//
+//  main.cpp
+//  11509
+//
+//  Created by wi_seong on 2022/01/16.
+//
+
+#include <iostream>
+
+using namespace std;
+
+int N;
+int MX = 1000001;
+int ans = 0;
+
+void solution() {
+    cin >> N;
+    
+    int arrow[MX];
+    fill(arrow, arrow+MX, 0);
+    for(int i = 0; i < N; i++) {
+        int M; cin >> M;
+        if(arrow[M + 1] == 0) {
+            ans++;
+            arrow[M]++;
+        } else {
+            arrow[M+1]--;
+            arrow[M]++;
+        }
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(NULL);
+    cin.tie(NULL); cout.tie(NULL);
+    
+    solution();
+    cout << ans;
+    
+    return 0;
+}
diff --git a/seong_cheol/220116~220122/14950.cpp b/seong_cheol/220116~220122/14950.cpp
new file mode 100644
index 0000000..46ed201
--- /dev/null
+++ b/seong_cheol/220116~220122/14950.cpp
@@ -0,0 +1,62 @@
+//
+//  main.cpp
+//  14950
+//
+//  Created by wi_seong on 2022/01/16.
+//
+
+#include <iostream>
+#include <queue>
+#include <vector>
+
+using namespace std;
+
+int N, M, t;
+int ans = 0;
+
+int isVisited[10001];
+vector<vector<pair<int, int>>> edges;
+priority_queue<pair<int, int>> pq;
+
+void prim(int here, int cnt) {
+    
+    isVisited[here] = 1;
+    
+    for(int i = 0; i < edges[here].size(); i++) {
+        int next = edges[here][i].first;
+        int cost = edges[here][i].second;
+        
+        if(isVisited[next] == 0) pq.push({-cost, next});
+    }
+    
+    while (!pq.empty()) {
+        int next = pq.top().second;
+        int cost = -pq.top().first;
+        pq.pop();
+        
+        if(isVisited[next]) continue;
+        ans += cost + cnt*t;
+        prim(next, cnt + 1);
+        return;
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(NULL);
+    cin.tie(NULL); cout.tie(NULL);
+    
+    cin >> N >> M >> t;
+    edges.resize(N+1);
+    
+    int a, b, c;
+    for(int i = 0; i < M; i++) {
+        cin >> a >> b >> c;
+        edges[a].push_back({b, c});
+        edges[b].push_back({a, c});
+    }
+    
+    prim(1, 0);
+    cout << ans;
+    
+    return 0;
+}
diff --git a/seong_cheol/220116~220122/21922.cpp b/seong_cheol/220116~220122/21922.cpp
new file mode 100644
index 0000000..bd54a18
--- /dev/null
+++ b/seong_cheol/220116~220122/21922.cpp
@@ -0,0 +1,90 @@
+//
+//  main.cpp
+//  21922
+//
+//  Created by wi_seong on 2022/01/16.
+//
+
+#include <iostream>
+#include <algorithm>
+#include <queue>
+
+using namespace std;
+
+#define MAX 2001
+int ans = 0;
+int N, M;
+int res[MAX][MAX];
+int arr[MAX][MAX];
+bool isVisited[4][MAX][MAX];
+queue<pair<pair<int, int>, int>> q;
+
+int mov[4][2] = { {-1,0}, {0,1},{1,0} ,{0,-1} };
+
+void bfs() {
+    while(!q.empty()) {
+        int dir = q.front().second;
+        int nR = q.front().first.first + mov[dir][0];
+        int nC = q.front().first.second + mov[dir][1];
+
+        q.pop();
+        if (nR < 0 || nR >= N || nC < 0 || nC >= M) continue;
+        if (isVisited[dir][nR][nC]) continue;
+        isVisited[dir][nR][nC] = true;
+        res[nR][nC] = 1;
+        if (arr[nR][nC] == 1 && dir % 2 == 1) continue;
+        else if (arr[nR][nC] == 2 && dir % 2 == 0) continue;
+        else if (arr[nR][nC] == 9) continue;
+        else if (arr[nR][nC] == 3) {
+            if (dir < 2) {
+                dir = (dir + 1) % 2;
+            } else {
+                dir = 2 + (dir + 1) % 2;
+            }
+        }
+        else if (arr[nR][nC] == 4) {
+            if (dir == 0) dir = 3;
+            else if (dir == 3) dir = 0;
+            else if (dir == 1) dir = 2;
+            else dir = 1;
+        }
+        q.push({{nR, nC}, dir});
+    }
+}
+
+void solution() {
+    for(int i = 0; i < N; i++) {
+        for(int j = 0; j < M; j++) {
+            cin >> arr[i][j];
+            if (arr[i][j] == 9) {
+                res[i][j] = 1;
+                for(int k = 0; k < 4; k++) {
+                    isVisited[k][i][j] = true;
+                    q.push({{i, j}, k});
+                }
+            }
+        }
+    }
+    bfs();
+}
+
+void result_count() {
+    for(int i = 0; i < N; i++) {
+        for(int j = 0; j < M; j++) {
+            ans += res[i][j];
+        }
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(NULL);
+    cin.tie(NULL); cout.tie(NULL);
+    
+    cin >> N >> M;
+
+    solution();
+    result_count();
+    cout << ans;
+    
+    return 0;
+}
diff --git a/seong_cheol/220116~220122/4096.cpp b/seong_cheol/220116~220122/4096.cpp
new file mode 100644
index 0000000..c6aefc9
--- /dev/null
+++ b/seong_cheol/220116~220122/4096.cpp
@@ -0,0 +1,57 @@
+//
+//  main.cpp
+//  4096
+//
+//  Created by wi_seong on 2022/01/16.
+//
+
+#include <iostream>
+#include <math.h>
+#include <cstring>
+
+using namespace std;
+
+int N;
+char str[10];
+
+int func(int cur) {
+    int tmp = 0;
+    
+    if (str[cur - 1] >= str[strlen(str) - cur]) {
+        tmp = str[cur - 1] - str[strlen(str) - cur];
+
+    }
+    
+    else {
+        int times = 1;
+        while(true) {
+            if (str[strlen(str) - cur - times] == '9') {
+                str[strlen(str) - cur - times] = '0';
+                times++;
+            } else {
+                str[strlen(str) - cur - times] += 1;
+                break;
+            }
+        }
+        tmp = str[cur - 1] - str[strlen(str) - cur] + 10;
+    }
+    
+    str[strlen(str) - cur] = str[cur - 1];
+    if (cur == strlen(str)/2) {
+        return tmp*(int)pow(10, cur-1);
+    }
+    return tmp*(int)pow(10, cur-1)+func(cur+1);
+}
+
+int main() {
+    ios::sync_with_stdio(NULL);
+    cin.tie(NULL); cout.tie(NULL);
+    
+    cin >> str;
+    while(!(strlen(str)==1 && str[0]=='0')) {
+        cout << func(1) << '\n';
+        cin >> str;
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220206~220212/17610.cpp b/seong_cheol/220206~220212/17610.cpp
new file mode 100644
index 0000000..69fb113
--- /dev/null
+++ b/seong_cheol/220206~220212/17610.cpp
@@ -0,0 +1,43 @@
+//
+//  main.cpp
+//  17610
+//
+//  Created by wi_seong on 2022/02/12.
+//
+
+#include <iostream>
+
+using namespace std;
+bool d[14][260001];
+int weight[14];
+int n;
+
+void solve(int i, int w) {
+    if(i > n || d[i][w]) return;
+    d[i][w] = true;
+    solve(i + 1, w);
+    solve(i + 1, w + weight[i]);
+    solve(i + 1, abs(w - weight[i]));
+}
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    
+    int ans = 0;
+    int sum = 0;
+    for(int i = 0; i < n; i++) {
+        cin >> weight[i];
+        sum += weight[i];
+    }
+    
+    solve(0,0);
+    
+    for(int i = 1; i <= sum; i++)
+        if(!d[n][i]) ans++;
+    cout << ans;
+    
+    return 0;
+}
diff --git a/seong_cheol/220206~220212/2504.cpp b/seong_cheol/220206~220212/2504.cpp
new file mode 100644
index 0000000..7fd1bd8
--- /dev/null
+++ b/seong_cheol/220206~220212/2504.cpp
@@ -0,0 +1,51 @@
+//
+//  main.cpp
+//  2504
+//
+//  Created by wi_seong on 2022/01/28.
+//
+
+#include <iostream>
+#include <stack>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(NULL);
+    cin.tie(NULL); cout.tie(NULL);
+    
+    string s; cin >> s;
+    stack<char> st;
+    int sum = 0;
+    int num = 1;
+    
+    for(int i = 0; i < s.length(); i++) {
+        if (s[i] == '(') {
+            num *= 2;
+            st.push(s[i]);
+        } else if (s[i] == '[') {
+            num *= 3;
+            st.push(s[i]);
+        } else if (s[i] == ')') {
+            if (st.empty() || st.top() != '(') {
+                cout << 0;
+                return 0;
+            }
+            if (s[i-1] == '(') sum += num;
+            st.pop();
+            num /= 2;
+        }  else if (s[i] == ']') {
+            if (st.empty() || st.top() != '[') {
+                cout << 0;
+                return 0;
+            }
+            if (s[i-1] == '[') sum += num;
+            st.pop();
+            num /= 3;
+        }
+    }
+    if (st.empty()) cout << sum;
+    else cout << 0;
+    
+    return 0;
+}
diff --git a/seong_cheol/220206~220212/3187.cpp b/seong_cheol/220206~220212/3187.cpp
new file mode 100644
index 0000000..41be4c3
--- /dev/null
+++ b/seong_cheol/220206~220212/3187.cpp
@@ -0,0 +1,67 @@
+//
+//  main.cpp
+//  3187
+//
+//  Created by wi_seong on 2022/02/12.
+//
+
+#include <iostream>
+#include <queue>
+#include <algorithm>
+
+using namespace std;
+#define X first
+#define Y second
+int r, c;
+char board[251][251];
+bool vis[251][251];
+int cnt1 = 0, cnt2 = 0;
+int dx[4] = {1,0,-1,0};
+int dy[4] = {0,1,0,-1};
+
+void bfs(int i, int j) {
+    int a = 0, b = 0;
+    queue<pair<int, int>> Q;
+    Q.push({i, j});
+    
+    while(!Q.empty()) {
+        auto cur = Q.front(); Q.pop();
+    
+        for(int dir = 0; dir < 4; dir++) {
+            int nx = cur.X + dx[dir];
+            int ny = cur.Y + dy[dir];
+            if(nx < 0 || nx >= r || ny < 0 || ny >= c) continue;
+            if(vis[nx][ny]) continue;
+            if(board[nx][ny] == '#') continue;
+            if(board[nx][ny] == 'k') a++;
+            if(board[nx][ny] == 'v') b++;
+            vis[nx][ny] = true;
+            Q.push({nx, ny});
+        }
+    }
+    if(a > b) cnt1 += a;
+    else cnt2 += b;
+}
+
+void solution() {
+    for(int i = 0; i < r; i++) {
+        for(int j = 0; j < c; j++) {
+            if(!vis[i][j]) bfs(i,j);
+        }
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> r >> c;
+    for(int i = 0; i < r; i++)
+        for(int j = 0; j < c; j++)
+            cin >> board[i][j];
+    
+    solution();
+    cout << cnt1 << ' ' << cnt2;
+    
+    return 0;
+}
diff --git a/seong_cheol/220213~220219/14284.cpp b/seong_cheol/220213~220219/14284.cpp
new file mode 100644
index 0000000..049e903
--- /dev/null
+++ b/seong_cheol/220213~220219/14284.cpp
@@ -0,0 +1,50 @@
+//
+//  14284.cpp
+//  main
+//
+//  Created by wi_seong on 2022/02/20.
+//
+
+#include <iostream>
+#include <queue>
+
+using namespace std;
+#define X first
+#define Y second
+int v, e, st, en;
+const int INF = 0x3f3f3f3f;
+vector<pair<int, int>> adj[5001];
+int d[5001];
+
+int main(void) {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    cin >> v >> e;
+    fill(d,d+v+1,INF);
+    while(e--){
+        int u,v,w;
+        cin >> u >> v >> w;
+        adj[u].push_back({w,v});
+        adj[v].push_back({w,u});
+    }
+    cin >> st >> en;
+    
+    priority_queue<pair<int,int>, vector<pair<int,int>>, greater<pair<int,int>> > pq;
+    d[st] = 0;
+    pq.push({d[st],st});
+    while(!pq.empty()){
+        auto cur = pq.top(); pq.pop();
+        if(d[cur.Y] < cur.X) continue;
+        if(cur.Y == en) {
+            cout << cur.X;
+            return 0;
+        }
+        for(auto nxt : adj[cur.Y]){
+            if(d[nxt.Y] <= d[cur.Y]+nxt.X) continue;
+            d[nxt.Y] = d[cur.Y]+nxt.X;
+            pq.push({d[nxt.Y],nxt.Y});
+        }
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220213~220219/1577.cpp b/seong_cheol/220213~220219/1577.cpp
new file mode 100644
index 0000000..ee41871
--- /dev/null
+++ b/seong_cheol/220213~220219/1577.cpp
@@ -0,0 +1,43 @@
+//
+//  1577.cpp
+//  main
+//
+//  Created by wi_seong on 2022/02/19.
+//
+
+#include <iostream>
+
+using namespace std;
+int n, m, k;
+unsigned long long d[101][101];
+bool x[201][201];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n >> m >> k;
+    while(k--) {
+        int a, b, c, d;
+        cin >> a >> b >> c >> d;
+        x[b+d][a+c] = 1;
+    }
+    
+    for(int i = 1; i <= m; i++) {
+        if(x[2*i-1][0]) break;
+        d[i][0] = 1;
+    }
+    for(int i = 1; i <= n; i++) {
+        if(x[0][2*i-1]) break;
+        d[0][i] = 1;
+    }
+    for(int i = 1; i <= m; i++) {
+        for(int j = 1; j <= n; j++) {
+            if(!x[2*i-1][2*j]) d[i][j] += d[i-1][j];
+            if(!x[2*i][2*j-1]) d[i][j] += d[i][j-1];
+        }
+    }
+    cout << d[m][n];
+    
+    return 0;
+}
diff --git a/seong_cheol/220213~220219/2644.cpp b/seong_cheol/220213~220219/2644.cpp
new file mode 100644
index 0000000..a380aa3
--- /dev/null
+++ b/seong_cheol/220213~220219/2644.cpp
@@ -0,0 +1,49 @@
+//
+//  2644.cpp
+//  main
+//
+//  Created by wi_seong on 2022/02/19.
+//
+
+#include <iostream>
+#include <queue>
+
+using namespace std;
+int n, m;
+int a, b;
+vector<int> v[101];
+int dist[101];
+
+int bfs(int a, int b) {
+    queue<int> q;
+    q.push(a);
+    
+    while(!q.empty()) {
+        int cur = q.front(); q.pop();
+        if(cur == b) return dist[b];
+        for(auto x : v[cur]) {
+            if(!dist[x]) {
+                q.push(x);
+                dist[x] = dist[cur] + 1;
+            }
+        }
+    }
+    return -1;
+}
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    cin >> a >> b;
+    cin >> m;
+    while(m--) {
+        int x, y; cin >> x >> y;
+        v[x].push_back(y);
+        v[y].push_back(x);
+    }
+    cout << bfs(a, b);
+    
+    return 0;
+}
diff --git a/seong_cheol/220213~220219/4095.cpp b/seong_cheol/220213~220219/4095.cpp
new file mode 100644
index 0000000..f2c89a5
--- /dev/null
+++ b/seong_cheol/220213~220219/4095.cpp
@@ -0,0 +1,51 @@
+//
+//  4095.cpp
+//  main
+//
+//  Created by wi_seong on 2022/02/19.
+//
+
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+int n, m;
+int ans;
+int d[1001][1001];
+int board[1001][1001];
+
+void input() {
+    for(int i = 1; i <= n; i++)
+        for(int j = 1; j <= m; j++) {
+            cin >> board[i][j];
+            d[i][j] = board[i][j];
+            ans = max(ans, d[i][j]);
+        }
+}
+
+void solve() {
+    for(int i = 2; i <= n; i++) {
+        for(int j = 2; j <= m; j++) {
+            if(board[i][j]) {
+                d[i][j] = min(d[i-1][j-1], min(d[i][j-1], d[i-1][j])) + 1;
+                ans = max(ans, d[i][j]);
+            }
+        }
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    while(1) {
+        cin >> n >> m;
+        if(n == 0 && m == 0) break;
+        ans = 0;
+        input();
+        solve();
+        cout << ans << '\n';
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220220~220226/17212.cpp b/seong_cheol/220220~220226/17212.cpp
new file mode 100644
index 0000000..6f7239a
--- /dev/null
+++ b/seong_cheol/220220~220226/17212.cpp
@@ -0,0 +1,35 @@
+//
+//  17212.cpp
+//  main
+//
+//  Created by wi_seong on 2022/02/26.
+//
+
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+int d[100001];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int n; cin >> n;
+    d[1] = 1;
+    d[2] = 1;
+    d[3] = 2;
+    d[4] = 2;
+    d[5] = 1;
+    d[6] = 2;
+    d[7] = 1;
+    for(int i = 8; i <= n; i++) {
+        if (i % 7 == 0) d[i] = i / 7;
+        else d[i] = min({ d[i - 7],d[i - 5],d[i - 2],d[i - 1] }) + 1;
+    }
+    cout << d[n];
+    return 0;
+}
+/*
+ 1 1 2 2 1
+ */
diff --git a/seong_cheol/220220~220226/1874.cpp b/seong_cheol/220220~220226/1874.cpp
new file mode 100644
index 0000000..6711ea1
--- /dev/null
+++ b/seong_cheol/220220~220226/1874.cpp
@@ -0,0 +1,39 @@
+//
+//  1874.cpp
+//  main
+//
+//  Created by wi_seong on 2022/02/21.
+//
+
+#include <iostream>
+#include <string>
+#include <stack>
+
+using namespace std;
+int n;
+string res;
+stack<int> s;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    int cnt = 1;
+    while(n--) {
+        int x; cin >> x;
+        
+        while(cnt <= x) {
+            s.push(cnt++);
+            res += "+\n";
+        }
+        if(s.top() != x) {
+            cout << "NO";
+            return 0;
+        }
+        s.pop();
+        res += "-\n";
+    }
+    cout << res;
+    return 0;
+}
diff --git a/seong_cheol/220227~220305/11722.cpp b/seong_cheol/220227~220305/11722.cpp
new file mode 100644
index 0000000..f39bb50
--- /dev/null
+++ b/seong_cheol/220227~220305/11722.cpp
@@ -0,0 +1,33 @@
+//
+//  11722.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/02.
+//
+
+#include <iostream>
+#include <stack>
+
+using namespace std;
+int n, arr[1001], d[1001];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    for(int i = 0; i < n; i++) cin >> arr[i];
+    for(int i = 0; i < n; i++) {
+        d[i] = 1;
+        for(int j = 0; j <= i; j++) {
+            if(arr[i] < arr[j] && d[j] + 1 > d[i]) {
+                d[i] = d[j] + 1;
+            }
+        }
+    }
+    int mx = 0;
+    for(int i = 0; i < n; i++)
+        mx = max(mx, d[i]);
+    cout << mx;
+    return 0;
+}
diff --git a/seong_cheol/220227~220305/2798.cpp b/seong_cheol/220227~220305/2798.cpp
new file mode 100644
index 0000000..4ee6096
--- /dev/null
+++ b/seong_cheol/220227~220305/2798.cpp
@@ -0,0 +1,33 @@
+//
+//  2798.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/06.
+//
+
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+int n, m;
+int arr[101];
+bool isused[101];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n >> m;
+    fill(isused + 3, isused + n, true);
+    for(int i = 0; i < n; i++) cin >> arr[i];
+    int mx = 0;
+    do {
+        int sum = 0;
+        for(int i = 0; i < n; i++)
+            if(!isused[i]) sum += arr[i];
+        if(sum <= m) mx = max(mx, sum);
+    } while(next_permutation(isused, isused + n));
+    cout << mx;
+    
+    return 0;
+}
diff --git a/seong_cheol/220227~220305/9342.cpp b/seong_cheol/220227~220305/9342.cpp
new file mode 100644
index 0000000..0e4057a
--- /dev/null
+++ b/seong_cheol/220227~220305/9342.cpp
@@ -0,0 +1,26 @@
+//
+//  9342.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/06.
+//
+
+#include <iostream>
+#include <string>
+#include <regex>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    int t; cin >> t;
+    regex r(R"(^[A-F]?A+F+C+[A-F]?$)");
+    while(t--) {
+        string s; cin >> s;
+        regex_match(s, r) ? cout << "Infected!" << '\n' : cout << "Good" << '\n';
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220227~220305/9375.cpp b/seong_cheol/220227~220305/9375.cpp
new file mode 100644
index 0000000..1b81173
--- /dev/null
+++ b/seong_cheol/220227~220305/9375.cpp
@@ -0,0 +1,36 @@
+//
+//  9375.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/03.
+//
+
+#include <iostream>
+#include <string>
+#include <map>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    int t; cin >> t;
+    while(t--) {
+        int n; cin >> n;
+        map<string, int> m;
+        for(int i = 0; i < n; i++) {
+            string name, catag;
+            cin >> name >> catag;
+            if(m.find(catag) == m.end())  m.insert({catag, 1});
+            else m[catag]++;
+        }
+        int ans = 1;
+        for(auto i : m)
+            ans *= i.second + 1;
+        ans -= 1;
+        cout << ans << '\n';
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220306~220312/11568.cpp b/seong_cheol/220306~220312/11568.cpp
new file mode 100644
index 0000000..ce67f56
--- /dev/null
+++ b/seong_cheol/220306~220312/11568.cpp
@@ -0,0 +1,33 @@
+//
+//  11568.cpp
+//  Algorithm
+//
+//  Created by wi_seong on 2022/03/13.
+//
+
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+int n;
+int a[1001];
+int d[1001];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    for(int i = 0; i < n; i++) cin >> a[i];
+    int res = d[0] = 1;
+    for(int i = 1; i <= n; i++) {
+        d[i] = 1;
+        for(int j = 0; j < i; j++) {
+            if(a[i] > a[j] && d[j] + 1 > d[i])
+                d[i] = d[j] + 1;
+        }
+        res = max(res, d[i]);
+    }
+    cout << res;
+    return 0;
+}
diff --git a/seong_cheol/220306~220312/14595.cpp b/seong_cheol/220306~220312/14595.cpp
new file mode 100644
index 0000000..1dec5a2
--- /dev/null
+++ b/seong_cheol/220306~220312/14595.cpp
@@ -0,0 +1,28 @@
+//
+//  14595.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/13.
+//
+
+#include <iostream>
+
+using namespace std;
+int n, m;
+bool r[1000001];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n >> m;
+    while(m--) {
+        int a, b; cin >> a >> b;
+        for(int i = a + 1; i <= b; i++) r[i] = 1;
+    }
+    int ans = 0;
+    for(int i = 1; i <= n; i++)
+        if(!r[i]) ans++;
+    cout << ans;
+    return 0;
+}
diff --git a/seong_cheol/220306~220312/15664.cpp b/seong_cheol/220306~220312/15664.cpp
new file mode 100644
index 0000000..f7343f6
--- /dev/null
+++ b/seong_cheol/220306~220312/15664.cpp
@@ -0,0 +1,43 @@
+//
+//  15664.cpp
+//  main
+//
+//  Created by wi_seong on 2022/02/27.
+//
+
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+int n, m;
+int arr[10];
+int num[10];
+
+void func(int k, int st) {
+    if(k == m) {
+        for(int i = 0; i < m; i++)
+            cout << num[arr[i]] << ' ';
+        cout << '\n';
+        return;
+    }
+    int tmp = 0;
+    for(int i = st; i < n; i++) {
+        if(tmp != num[i]) {
+            arr[k] = i;
+            tmp = num[arr[k]];
+            func(k + 1,i + 1);
+        }
+    }
+}
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n >> m;
+    for(int i = 0; i < n; i++) cin >> num[i];
+    sort(num, num + n);
+    func(0, 0);
+    
+    return 0;
+}
diff --git a/seong_cheol/220306~220312/1864.cpp b/seong_cheol/220306~220312/1864.cpp
new file mode 100644
index 0000000..089c5d5
--- /dev/null
+++ b/seong_cheol/220306~220312/1864.cpp
@@ -0,0 +1,39 @@
+//
+//  1864.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/13.
+//
+
+#include <iostream>
+#include <string>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    while(1) {
+        string s; cin >> s;
+        if(s[0] == '#') break;
+        int len = int(s.length());
+        int ans = 0;
+        for(int i = 0; i < len; i++) {
+            int n;
+            if(s[i] == '-') n = 0;
+            else if(s[i] == '\\') n = 1;
+            else if(s[i] == '(') n = 2;
+            else if(s[i] == '@') n = 3;
+            else if(s[i] == '?') n = 4;
+            else if(s[i] == '>') n = 5;
+            else if(s[i] == '&') n = 6;
+            else if(s[i] == '%') n = 7;
+            else n = -1;
+            ans += n * (1 << 3 * (len - i - 1));
+        }
+        cout << ans << '\n';
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220313~220319/11279.cpp b/seong_cheol/220313~220319/11279.cpp
new file mode 100644
index 0000000..a5daaa4
--- /dev/null
+++ b/seong_cheol/220313~220319/11279.cpp
@@ -0,0 +1,33 @@
+//
+//  11279.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/14.
+//
+
+#include <iostream>
+#include <queue>
+
+using namespace std;
+int n;
+priority_queue<int> pq;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    for(int i = 0; i < n; i++) {
+        int a; cin >> a;
+        if(a == 0) {
+            if(pq.empty()) cout << 0 << '\n';
+            else {
+                cout << pq.top() << '\n';
+                pq.pop();
+            }
+        }
+        else pq.push(a);
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220313~220319/19539.cpp b/seong_cheol/220313~220319/19539.cpp
new file mode 100644
index 0000000..03bece4
--- /dev/null
+++ b/seong_cheol/220313~220319/19539.cpp
@@ -0,0 +1,33 @@
+//
+//  19539.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/14.
+//
+
+#include <iostream>
+
+using namespace std;
+int n;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    int c2, c3;
+    c2 = c3 = 0;
+    for(int i = 0; i < n; i++) {
+        int a; cin >> a;
+        c2 += a / 2;
+        c3 += a;
+    }
+    if(c3 % 3 != 0) cout << "NO";
+    else {
+        c3 /= 3;
+        if(c2 >= c3) cout << "YES";
+        else cout << "NO";
+    }
+    
+    return 0;
+}
diff --git a/seong_cheol/220313~220319/20154.cpp b/seong_cheol/220313~220319/20154.cpp
new file mode 100644
index 0000000..0defc76
--- /dev/null
+++ b/seong_cheol/220313~220319/20154.cpp
@@ -0,0 +1,30 @@
+//
+//  20154.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/14.
+//
+
+#include <iostream>
+#include <string>
+
+using namespace std;
+int a[26] = {3, 2, 1, 2, 3, 3, 3, 3, 1, 1, 3, 1, 3, 3, 1, 2, 2, 2, 1, 2, 1, 1, 2, 2, 2, 1};
+string s;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> s;
+    int len = int(s.length());
+    int cnt = 0;
+    for(int i = 0; i < len; i++) {
+        cnt += a[s[i] - 'A'];
+        cnt %= 10;
+    }
+    if(cnt%2 == 1) cout << "I'm a winner!";
+    else cout << "You're the winner?";
+    
+    return 0;
+}
diff --git a/seong_cheol/220313~220319/5624.cpp b/seong_cheol/220313~220319/5624.cpp
new file mode 100644
index 0000000..e135c3d
--- /dev/null
+++ b/seong_cheol/220313~220319/5624.cpp
@@ -0,0 +1,35 @@
+//
+//  5624.cpp
+//  main
+//
+//  Created by wi_seong on 2022/03/14.
+//
+
+#include <iostream>
+
+using namespace std;
+int n;
+int a[5001];
+bool vis[400001];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    
+    cin >> n;
+    for(int i = 0; i < n; i++) cin >> a[i];
+    int res = 0;
+    for(int i = 0; i < n; i++) {
+        for(int j = 0; j < i; j++) {
+            if(vis[a[i] - a[j] + 200000]) {
+                res++;
+                break;
+            }
+        }
+        for(int j = 0; j <= i; j++)
+            vis[a[i] + a[j] + 200000] = 1;
+    }
+    cout << res;
+    
+    return 0;
+}
diff --git a/seong_cheol/SJAlgorithm.xcodeproj/project.pbxproj b/seong_cheol/SJAlgorithm.xcodeproj/project.pbxproj
new file mode 100644
index 0000000..5d8fded
--- /dev/null
+++ b/seong_cheol/SJAlgorithm.xcodeproj/project.pbxproj
@@ -0,0 +1,375 @@
+// !$*UTF8*$!
+{
+	archiveVersion = 1;
+	classes = {
+	};
+	objectVersion = 55;
+	objects = {
+
+/* Begin PBXCopyFilesBuildPhase section */
+		4DD423EB27C246B70094A25D /* CopyFiles */ = {
+			isa = PBXCopyFilesBuildPhase;
+			buildActionMask = 2147483647;
+			dstPath = /usr/share/man/man1/;
+			dstSubfolderSpec = 0;
+			files = (
+			);
+			runOnlyForDeploymentPostprocessing = 1;
+		};
+/* End PBXCopyFilesBuildPhase section */
+
+/* Begin PBXFileReference section */
+		4D25360A27D4E0A900405E70 /* 9342.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 9342.cpp; sourceTree = "<group>"; };
+		4D25360C27D4E0E200405E70 /* 9375.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 9375.cpp; sourceTree = "<group>"; };
+		4D25360E27D4E0EF00405E70 /* 11722.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 11722.cpp; sourceTree = "<group>"; };
+		4D25361027D4E13E00405E70 /* 2798.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 2798.cpp; sourceTree = "<group>"; };
+		4D335F8727E75C7E007640F7 /* 11279.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 11279.cpp; sourceTree = "<group>"; };
+		4D335F8827E75C7E007640F7 /* 5624.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 5624.cpp; sourceTree = "<group>"; };
+		4D335F8927E75C7E007640F7 /* 20154.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 20154.cpp; sourceTree = "<group>"; };
+		4D335F8A27E75C7E007640F7 /* 19539.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 19539.cpp; sourceTree = "<group>"; };
+		4D6C690E27CBAE120081F18A /* 1874.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 1874.cpp; sourceTree = "<group>"; };
+		4D6C691027CBAE290081F18A /* 17212.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 17212.cpp; sourceTree = "<group>"; };
+		4D826DA0279D8C7900459892 /* 4096.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 4096.cpp; sourceTree = "<group>"; };
+		4D826DAD279D8CA200459892 /* 21922.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 21922.cpp; sourceTree = "<group>"; };
+		4D9811EB27DDEDD900D6740A /* 11568.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 11568.cpp; sourceTree = "<group>"; };
+		4D9811EC27DDEDD900D6740A /* 1864.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 1864.cpp; sourceTree = "<group>"; };
+		4D9811ED27DDEDD900D6740A /* 14595.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 14595.cpp; sourceTree = "<group>"; };
+		4D9811EE27DDEE1600D6740A /* 15664.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 15664.cpp; sourceTree = "<group>"; };
+		4DB6210927B8CB75001244AB /* 14950.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 14950.cpp; sourceTree = "<group>"; };
+		4DB6213827B8CC62001244AB /* 2504.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 2504.cpp; sourceTree = "<group>"; };
+		4DB6213927B8CC62001244AB /* 17610.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 17610.cpp; sourceTree = "<group>"; };
+		4DB6213A27B8CC62001244AB /* 3187.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 3187.cpp; sourceTree = "<group>"; };
+		4DD423E127C246A00094A25D /* 2644.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 2644.cpp; sourceTree = "<group>"; };
+		4DD423E227C246A00094A25D /* 1577.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 1577.cpp; sourceTree = "<group>"; };
+		4DD423E327C246A00094A25D /* 4095.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 4095.cpp; sourceTree = "<group>"; };
+		4DD423E427C246A00094A25D /* 14284.cpp */ = {isa = PBXFileReference; fileEncoding = 4; lastKnownFileType = sourcecode.cpp.cpp; path = 14284.cpp; sourceTree = "<group>"; };
+		4DD423ED27C246B70094A25D /* main */ = {isa = PBXFileReference; explicitFileType = "compiled.mach-o.executable"; includeInIndex = 0; path = main; sourceTree = BUILT_PRODUCTS_DIR; };
+		4DE42989279D8C39007BAA4E /* 11509.cpp */ = {isa = PBXFileReference; lastKnownFileType = sourcecode.cpp.cpp; path = 11509.cpp; sourceTree = "<group>"; };
+/* End PBXFileReference section */
+
+/* Begin PBXFrameworksBuildPhase section */
+		4DD423EA27C246B70094A25D /* Frameworks */ = {
+			isa = PBXFrameworksBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXFrameworksBuildPhase section */
+
+/* Begin PBXGroup section */
+		4D25360927D4E04600405E70 /* 220227~220305 */ = {
+			isa = PBXGroup;
+			children = (
+				4D25361027D4E13E00405E70 /* 2798.cpp */,
+				4D25360A27D4E0A900405E70 /* 9342.cpp */,
+				4D25360C27D4E0E200405E70 /* 9375.cpp */,
+				4D25360E27D4E0EF00405E70 /* 11722.cpp */,
+			);
+			path = "220227~220305";
+			sourceTree = "<group>";
+		};
+		4D335F8627E75C7E007640F7 /* 220313~220319 */ = {
+			isa = PBXGroup;
+			children = (
+				4D335F8727E75C7E007640F7 /* 11279.cpp */,
+				4D335F8827E75C7E007640F7 /* 5624.cpp */,
+				4D335F8927E75C7E007640F7 /* 20154.cpp */,
+				4D335F8A27E75C7E007640F7 /* 19539.cpp */,
+			);
+			path = "220313~220319";
+			sourceTree = "<group>";
+		};
+		4D6C690D27CBAD890081F18A /* 220220~220226 */ = {
+			isa = PBXGroup;
+			children = (
+				4D6C690E27CBAE120081F18A /* 1874.cpp */,
+				4D6C691027CBAE290081F18A /* 17212.cpp */,
+			);
+			path = "220220~220226";
+			sourceTree = "<group>";
+		};
+		4D9811EA27DDEDD900D6740A /* 220306~220312 */ = {
+			isa = PBXGroup;
+			children = (
+				4D9811EB27DDEDD900D6740A /* 11568.cpp */,
+				4D9811EC27DDEDD900D6740A /* 1864.cpp */,
+				4D9811ED27DDEDD900D6740A /* 14595.cpp */,
+				4D9811EE27DDEE1600D6740A /* 15664.cpp */,
+			);
+			path = "220306~220312";
+			sourceTree = "<group>";
+		};
+		4DB6210B27B8CB84001244AB /* 220206~220212 */ = {
+			isa = PBXGroup;
+			children = (
+				4DB6213827B8CC62001244AB /* 2504.cpp */,
+				4DB6213A27B8CC62001244AB /* 3187.cpp */,
+				4DB6213927B8CC62001244AB /* 17610.cpp */,
+			);
+			path = "220206~220212";
+			sourceTree = "<group>";
+		};
+		4DD423E027C2461C0094A25D /* 220213~220219 */ = {
+			isa = PBXGroup;
+			children = (
+				4DD423E227C246A00094A25D /* 1577.cpp */,
+				4DD423E127C246A00094A25D /* 2644.cpp */,
+				4DD423E327C246A00094A25D /* 4095.cpp */,
+				4DD423E427C246A00094A25D /* 14284.cpp */,
+			);
+			path = "220213~220219";
+			sourceTree = "<group>";
+		};
+		4DE4295F279D8966007BAA4E = {
+			isa = PBXGroup;
+			children = (
+				4DE42973279D8B32007BAA4E /* 220116~220122 */,
+				4DB6210B27B8CB84001244AB /* 220206~220212 */,
+				4DD423E027C2461C0094A25D /* 220213~220219 */,
+				4D6C690D27CBAD890081F18A /* 220220~220226 */,
+				4D25360927D4E04600405E70 /* 220227~220305 */,
+				4D9811EA27DDEDD900D6740A /* 220306~220312 */,
+				4D335F8627E75C7E007640F7 /* 220313~220319 */,
+				4DE42969279D8966007BAA4E /* Products */,
+			);
+			sourceTree = "<group>";
+		};
+		4DE42969279D8966007BAA4E /* Products */ = {
+			isa = PBXGroup;
+			children = (
+				4DD423ED27C246B70094A25D /* main */,
+			);
+			name = Products;
+			sourceTree = "<group>";
+		};
+		4DE42973279D8B32007BAA4E /* 220116~220122 */ = {
+			isa = PBXGroup;
+			children = (
+				4D826DA0279D8C7900459892 /* 4096.cpp */,
+				4DE42989279D8C39007BAA4E /* 11509.cpp */,
+				4DB6210927B8CB75001244AB /* 14950.cpp */,
+				4D826DAD279D8CA200459892 /* 21922.cpp */,
+			);
+			path = "220116~220122";
+			sourceTree = "<group>";
+		};
+/* End PBXGroup section */
+
+/* Begin PBXNativeTarget section */
+		4DD423EC27C246B70094A25D /* main */ = {
+			isa = PBXNativeTarget;
+			buildConfigurationList = 4DD423F127C246B70094A25D /* Build configuration list for PBXNativeTarget "main" */;
+			buildPhases = (
+				4DD423E927C246B70094A25D /* Sources */,
+				4DD423EA27C246B70094A25D /* Frameworks */,
+				4DD423EB27C246B70094A25D /* CopyFiles */,
+			);
+			buildRules = (
+			);
+			dependencies = (
+			);
+			name = main;
+			productName = main;
+			productReference = 4DD423ED27C246B70094A25D /* main */;
+			productType = "com.apple.product-type.tool";
+		};
+/* End PBXNativeTarget section */
+
+/* Begin PBXProject section */
+		4DE42960279D8966007BAA4E /* Project object */ = {
+			isa = PBXProject;
+			attributes = {
+				BuildIndependentTargetsInParallel = 1;
+				LastUpgradeCheck = 1310;
+				TargetAttributes = {
+					4DD423EC27C246B70094A25D = {
+						CreatedOnToolsVersion = 13.1;
+					};
+				};
+			};
+			buildConfigurationList = 4DE42963279D8966007BAA4E /* Build configuration list for PBXProject "SJAlgorithm" */;
+			compatibilityVersion = "Xcode 13.0";
+			developmentRegion = en;
+			hasScannedForEncodings = 0;
+			knownRegions = (
+				en,
+				Base,
+			);
+			mainGroup = 4DE4295F279D8966007BAA4E;
+			productRefGroup = 4DE42969279D8966007BAA4E /* Products */;
+			projectDirPath = "";
+			projectRoot = "";
+			targets = (
+				4DD423EC27C246B70094A25D /* main */,
+			);
+		};
+/* End PBXProject section */
+
+/* Begin PBXSourcesBuildPhase section */
+		4DD423E927C246B70094A25D /* Sources */ = {
+			isa = PBXSourcesBuildPhase;
+			buildActionMask = 2147483647;
+			files = (
+			);
+			runOnlyForDeploymentPostprocessing = 0;
+		};
+/* End PBXSourcesBuildPhase section */
+
+/* Begin XCBuildConfiguration section */
+		4DD423F227C246B70094A25D /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				CODE_SIGN_STYLE = Automatic;
+				DEVELOPMENT_TEAM = 2KQLD72485;
+				ENABLE_HARDENED_RUNTIME = YES;
+				PRODUCT_NAME = "$(TARGET_NAME)";
+			};
+			name = Debug;
+		};
+		4DD423F327C246B70094A25D /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				CODE_SIGN_STYLE = Automatic;
+				DEVELOPMENT_TEAM = 2KQLD72485;
+				ENABLE_HARDENED_RUNTIME = YES;
+				PRODUCT_NAME = "$(TARGET_NAME)";
+			};
+			name = Release;
+		};
+		4DE4296D279D8966007BAA4E /* Debug */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ALWAYS_SEARCH_USER_PATHS = NO;
+				CLANG_ANALYZER_NONNULL = YES;
+				CLANG_ANALYZER_NUMBER_OBJECT_CONVERSION = YES_AGGRESSIVE;
+				CLANG_CXX_LANGUAGE_STANDARD = "gnu++17";
+				CLANG_CXX_LIBRARY = "libc++";
+				CLANG_ENABLE_MODULES = YES;
+				CLANG_ENABLE_OBJC_ARC = YES;
+				CLANG_ENABLE_OBJC_WEAK = YES;
+				CLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;
+				CLANG_WARN_BOOL_CONVERSION = YES;
+				CLANG_WARN_COMMA = YES;
+				CLANG_WARN_CONSTANT_CONVERSION = YES;
+				CLANG_WARN_DEPRECATED_OBJC_IMPLEMENTATIONS = YES;
+				CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;
+				CLANG_WARN_DOCUMENTATION_COMMENTS = YES;
+				CLANG_WARN_EMPTY_BODY = YES;
+				CLANG_WARN_ENUM_CONVERSION = YES;
+				CLANG_WARN_INFINITE_RECURSION = YES;
+				CLANG_WARN_INT_CONVERSION = YES;
+				CLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;
+				CLANG_WARN_OBJC_IMPLICIT_RETAIN_SELF = YES;
+				CLANG_WARN_OBJC_LITERAL_CONVERSION = YES;
+				CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;
+				CLANG_WARN_QUOTED_INCLUDE_IN_FRAMEWORK_HEADER = YES;
+				CLANG_WARN_RANGE_LOOP_ANALYSIS = YES;
+				CLANG_WARN_STRICT_PROTOTYPES = YES;
+				CLANG_WARN_SUSPICIOUS_MOVE = YES;
+				CLANG_WARN_UNGUARDED_AVAILABILITY = YES_AGGRESSIVE;
+				CLANG_WARN_UNREACHABLE_CODE = YES;
+				CLANG_WARN__DUPLICATE_METHOD_MATCH = YES;
+				COPY_PHASE_STRIP = NO;
+				DEBUG_INFORMATION_FORMAT = dwarf;
+				ENABLE_STRICT_OBJC_MSGSEND = YES;
+				ENABLE_TESTABILITY = YES;
+				GCC_C_LANGUAGE_STANDARD = gnu11;
+				GCC_DYNAMIC_NO_PIC = NO;
+				GCC_NO_COMMON_BLOCKS = YES;
+				GCC_OPTIMIZATION_LEVEL = 0;
+				GCC_PREPROCESSOR_DEFINITIONS = (
+					"DEBUG=1",
+					"$(inherited)",
+				);
+				GCC_WARN_64_TO_32_BIT_CONVERSION = YES;
+				GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;
+				GCC_WARN_UNDECLARED_SELECTOR = YES;
+				GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;
+				GCC_WARN_UNUSED_FUNCTION = YES;
+				GCC_WARN_UNUSED_VARIABLE = YES;
+				MACOSX_DEPLOYMENT_TARGET = 12.0;
+				MTL_ENABLE_DEBUG_INFO = INCLUDE_SOURCE;
+				MTL_FAST_MATH = YES;
+				ONLY_ACTIVE_ARCH = YES;
+				SDKROOT = macosx;
+			};
+			name = Debug;
+		};
+		4DE4296E279D8966007BAA4E /* Release */ = {
+			isa = XCBuildConfiguration;
+			buildSettings = {
+				ALWAYS_SEARCH_USER_PATHS = NO;
+				CLANG_ANALYZER_NONNULL = YES;
+				CLANG_ANALYZER_NUMBER_OBJECT_CONVERSION = YES_AGGRESSIVE;
+				CLANG_CXX_LANGUAGE_STANDARD = "gnu++17";
+				CLANG_CXX_LIBRARY = "libc++";
+				CLANG_ENABLE_MODULES = YES;
+				CLANG_ENABLE_OBJC_ARC = YES;
+				CLANG_ENABLE_OBJC_WEAK = YES;
+				CLANG_WARN_BLOCK_CAPTURE_AUTORELEASING = YES;
+				CLANG_WARN_BOOL_CONVERSION = YES;
+				CLANG_WARN_COMMA = YES;
+				CLANG_WARN_CONSTANT_CONVERSION = YES;
+				CLANG_WARN_DEPRECATED_OBJC_IMPLEMENTATIONS = YES;
+				CLANG_WARN_DIRECT_OBJC_ISA_USAGE = YES_ERROR;
+				CLANG_WARN_DOCUMENTATION_COMMENTS = YES;
+				CLANG_WARN_EMPTY_BODY = YES;
+				CLANG_WARN_ENUM_CONVERSION = YES;
+				CLANG_WARN_INFINITE_RECURSION = YES;
+				CLANG_WARN_INT_CONVERSION = YES;
+				CLANG_WARN_NON_LITERAL_NULL_CONVERSION = YES;
+				CLANG_WARN_OBJC_IMPLICIT_RETAIN_SELF = YES;
+				CLANG_WARN_OBJC_LITERAL_CONVERSION = YES;
+				CLANG_WARN_OBJC_ROOT_CLASS = YES_ERROR;
+				CLANG_WARN_QUOTED_INCLUDE_IN_FRAMEWORK_HEADER = YES;
+				CLANG_WARN_RANGE_LOOP_ANALYSIS = YES;
+				CLANG_WARN_STRICT_PROTOTYPES = YES;
+				CLANG_WARN_SUSPICIOUS_MOVE = YES;
+				CLANG_WARN_UNGUARDED_AVAILABILITY = YES_AGGRESSIVE;
+				CLANG_WARN_UNREACHABLE_CODE = YES;
+				CLANG_WARN__DUPLICATE_METHOD_MATCH = YES;
+				COPY_PHASE_STRIP = NO;
+				DEBUG_INFORMATION_FORMAT = "dwarf-with-dsym";
+				ENABLE_NS_ASSERTIONS = NO;
+				ENABLE_STRICT_OBJC_MSGSEND = YES;
+				GCC_C_LANGUAGE_STANDARD = gnu11;
+				GCC_NO_COMMON_BLOCKS = YES;
+				GCC_WARN_64_TO_32_BIT_CONVERSION = YES;
+				GCC_WARN_ABOUT_RETURN_TYPE = YES_ERROR;
+				GCC_WARN_UNDECLARED_SELECTOR = YES;
+				GCC_WARN_UNINITIALIZED_AUTOS = YES_AGGRESSIVE;
+				GCC_WARN_UNUSED_FUNCTION = YES;
+				GCC_WARN_UNUSED_VARIABLE = YES;
+				MACOSX_DEPLOYMENT_TARGET = 12.0;
+				MTL_ENABLE_DEBUG_INFO = NO;
+				MTL_FAST_MATH = YES;
+				SDKROOT = macosx;
+			};
+			name = Release;
+		};
+/* End XCBuildConfiguration section */
+
+/* Begin XCConfigurationList section */
+		4DD423F127C246B70094A25D /* Build configuration list for PBXNativeTarget "main" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				4DD423F227C246B70094A25D /* Debug */,
+				4DD423F327C246B70094A25D /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+		4DE42963279D8966007BAA4E /* Build configuration list for PBXProject "SJAlgorithm" */ = {
+			isa = XCConfigurationList;
+			buildConfigurations = (
+				4DE4296D279D8966007BAA4E /* Debug */,
+				4DE4296E279D8966007BAA4E /* Release */,
+			);
+			defaultConfigurationIsVisible = 0;
+			defaultConfigurationName = Release;
+		};
+/* End XCConfigurationList section */
+	};
+	rootObject = 4DE42960279D8966007BAA4E /* Project object */;
+}
diff --git a/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/contents.xcworkspacedata b/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/contents.xcworkspacedata
new file mode 100644
index 0000000..919434a
--- /dev/null
+++ b/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/contents.xcworkspacedata
@@ -0,0 +1,7 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<Workspace
+   version = "1.0">
+   <FileRef
+      location = "self:">
+   </FileRef>
+</Workspace>
diff --git a/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist b/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist
new file mode 100644
index 0000000..18d9810
--- /dev/null
+++ b/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/xcshareddata/IDEWorkspaceChecks.plist
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>IDEDidComputeMac32BitWarning</key>
+	<true/>
+</dict>
+</plist>
diff --git a/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/xcuserdata/wi_seong.xcuserdatad/UserInterfaceState.xcuserstate b/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/xcuserdata/wi_seong.xcuserdatad/UserInterfaceState.xcuserstate
new file mode 100644
index 0000000..2ea22dd
Binary files /dev/null and b/seong_cheol/SJAlgorithm.xcodeproj/project.xcworkspace/xcuserdata/wi_seong.xcuserdatad/UserInterfaceState.xcuserstate differ
diff --git a/seong_cheol/SJAlgorithm.xcodeproj/xcuserdata/wi_seong.xcuserdatad/xcschemes/xcschememanagement.plist b/seong_cheol/SJAlgorithm.xcodeproj/xcuserdata/wi_seong.xcuserdatad/xcschemes/xcschememanagement.plist
new file mode 100644
index 0000000..151e287
--- /dev/null
+++ b/seong_cheol/SJAlgorithm.xcodeproj/xcuserdata/wi_seong.xcuserdatad/xcschemes/xcschememanagement.plist
@@ -0,0 +1,27 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
+<plist version="1.0">
+<dict>
+	<key>SchemeUserState</key>
+	<dict>
+		<key>SJAlgorithm.xcscheme_^#shared#^_</key>
+		<dict>
+			<key>orderHint</key>
+			<integer>2</integer>
+		</dict>
+		<key>main.xcscheme_^#shared#^_</key>
+		<dict>
+			<key>orderHint</key>
+			<integer>8</integer>
+		</dict>
+	</dict>
+	<key>SuppressBuildableAutocreation</key>
+	<dict>
+		<key>4DD423EC27C246B70094A25D</key>
+		<dict>
+			<key>primary</key>
+			<true/>
+		</dict>
+	</dict>
+</dict>
+</plist>