Merge branch 'main' into 48-tgyuuAn

H0ngJu/DP/1,2,3 더하기.py

@@ -0,0 +1,26 @@
+import sys
+
+def input(): return sys.stdin.readline().strip()
+
+T = int(input())
+
+answer = []
+dp = [0] * (11)
+
+for index in range(T):
+    data = int(input())
+
+    for i in range(1, data + 1):
+        if i == 1:
+            dp[i] = 1
+        elif i == 2:
+            dp[i] = 2
+        elif i == 3:
+            dp[i] = 4
+        else:
+            dp[i] = dp[i-1] + dp[i-2] + dp[i-3]
+
+    answer.append(dp[data])
+
+for a in answer:
+    print(a, end=" ")

H0ngJu/README.md

@@ -1,11 +1,14 @@
 ## ✏️ 기록
 
-| 차시  |    날짜    | 문제유형 |                                    링크                                     |                        풀이                         |
-| :---: | :--------: | :------: | :-------------------------------------------------------------------------: | :-------------------------------------------------: |
-| 1차시 | 2024.03.05 |    큐    | [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/151 |
+| 차시  |    날짜    | 문제유형 |                                         링크                                          |                        풀이                         |
+| :---: | :--------: | :------: | :-----------------------------------------------------------------------------------: | :-------------------------------------------------: |
+| 1차시 | 2024.03.05 |    큐    |      [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587)      | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/151 |
 | 2차시 | 2024.03.07 |    큐    | [다리를 지나는 트럭](https://school.programmers.co.kr/learn/courses/30/lessons/42583) | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/153 |
-| 3차시 | 2024.03.10 |    힙    |             [N번째 큰 수](https://www.acmicpc.net/problem/2075)             | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/156 |
-| 4차시 | 2024.03.13 |    힙    |               [문제집](https://www.acmicpc.net/problem/1766)                | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/158 |
-| 5차시 | 2024.03.16 |   구현   |            [요세푸스 문제](https://www.acmicpc.net/problem/1158)            | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/161 |
+| 3차시 | 2024.03.10 |    힙    |                  [N번째 큰 수](https://www.acmicpc.net/problem/2075)                  | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/156 |
+| 4차시 | 2024.03.13 |    힙    |                    [문제집](https://www.acmicpc.net/problem/1766)                     | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/158 |
+| 5차시 | 2024.03.16 |   구현   |                 [요세푸스 문제](https://www.acmicpc.net/problem/1158)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/161 |
+| 6차시 | 2024.03.19 |   스택   |               [오큰수](https://www.acmicpc.net/problem/17298)               | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/164 |
+| 7차시 | 2024.03.22 |    DP    |            [1,2,3 더하기](https://www.acmicpc.net/problem/9095)             | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/166 |
+| 8차시 | 2024.03.16 |    DP    |                 [쉬운 계단 수](https://www.acmicpc.net/problem/10844)                 | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/170 |
 
 ---

H0ngJu/쉬운 계단 수.py

@@ -0,0 +1,28 @@
+import sys
+
+DIV = 1_000_000_000
+
+N = int(sys.stdin.readline().rstrip())
+
+dp = [[0] * 10 for _ in range(N+1)] 
+answer = 0
+
+for i in range(1,N+1):
+    if i == 1:
+        for k in range(1,10):
+            dp[i][k] = 1
+
+    else:
+        for num in range(10):
+            if num == 0:
+                dp[i][num] = dp[i-1][1]%DIV
+            elif num == 9:
+                dp[i][num] = dp[i-1][8]%DIV
+            else:
+                dp[i][num] = (dp[i-1][num-1] + dp[i-1][num+1])%DIV
+
+for k in range(10):
+    answer += dp[N][k]
+
+print(answer%DIV)
+

H0ngJu/오큰수.py

@@ -0,0 +1,25 @@
+import sys
+from collections import *
+
+def input(): return sys.stdin.readline().strip()
+N = int(input())
+
+arr = list(map(int, input().split()))
+arr.reverse()
+answer = [-1 for _ in range(N)]
+
+id = 0
+
+stack = []
+stack.append((id,arr.pop()))
+
+while arr:
+    id += 1
+    arr_data = arr.pop()
+    while stack and stack[-1][1] < arr_data:
+        index, data = stack.pop()
+        answer[index] = arr_data
+    stack.append((id, arr_data))
+
+for i in answer:
+    print(i, end=" ")

tgyuuAn/README.md

@@ -47,5 +47,7 @@
 | 43차시 | 2024.03.10 |  이분 탐색  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/64062">징검다리 건너기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/157
 | 44차시 | 2023.03.13 |  트라이  | <a href="https://www.acmicpc.net/problem/14725">개미굴</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/159
 | 45차시 | 2023.03.16 |  트라이  | <a href="https://www.acmicpc.net/problem/31413">트라이</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/162
+| 46차시 | 2023.03.20 |  트라이  | <a href="https://www.acmicpc.net/problem/27652">AB</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/165
+| 47차시 | 2023.03.22 |  수학, 분할정복  | <a href="https://www.acmicpc.net/problem/15824">너 봄에는 캡사이신이 맛있단다</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/167
 | 48차시 | 2023.03.25 |  벨만 포드  | <a href="https://www.acmicpc.net/problem/1738">골목길</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/171
 ---

tgyuuAn/수학/너 봄에는 캡사이신이 맛있단다.py

@@ -0,0 +1,33 @@
+import sys
+
+DIV = 1_000_000_007
+
+def input(): return sys.stdin.readline().rstrip()
+
+def power(n, over):
+    if over == 0: return 1
+    elif over == 1: return n
+    elif over %2 == 0: 
+        half = (power(n, over//2) % DIV)
+        return (half * half) % DIV
+    else: 
+        half = (power(n, over//2) % DIV)
+        return (half * half * (n % DIV)) % DIV
+
+N = int(input())
+numbers = sorted(list(map(int,input().split())))
+DP = [-1 for _ in range(N)]
+answer = 0
+
+for start_idx in range(N):
+    start_num = numbers[start_idx]
+    end_num = numbers[N-start_idx-1]
+
+    # 만약 캐싱이 되어있지 않을 경우 직접 계산
+    if DP[N-start_idx-1] == -1: DP[N-start_idx-1] = power(2, N-start_idx-1)
+
+    # 한번이라도 계산  했으면 바로 이용
+    answer += ((end_num % DIV) * (DP[N-start_idx-1] % DIV)) % DIV
+    answer -= ((start_num % DIV) * (DP[N-start_idx-1] % DIV)) % DIV
+
+print(answer % DIV)

tgyuuAn/트라이/AB.py

@@ -0,0 +1,80 @@
+import sys
+from collections import defaultdict
+
+class Node():
+    def __init__(self, key = None):
+        self.key = key
+        self.count = 0
+        self.children = {}
+
+class Tries():
+    def __init__(self):
+        self.head = Node(None)
+
+    def add(self, element):
+        now = self.head
+
+        for char in element:
+            if char not in now.children:
+                now.children[char] = Node(char)
+
+            now = now.children[char]
+            now.count += 1
+
+    def delete(self, element):
+        now = self.head
+
+        for char in element:
+            child = now.children[char]
+            child.count -= 1
+            if child.count == 0: del now.children[char]
+            now = child
+
+    def find(self, element):
+        now = self.head
+        dic = defaultdict(int)
+
+        string = ""
+        for char in element:
+            if char not in now.children: return dic
+
+            string = string + char
+            now = now.children[char]
+            dic[string] = now.count
+
+        return dic
+
+def input(): return sys.stdin.readline().rstrip()
+
+def query(method, target, element):
+    if method == "add": target.add(element)
+
+    if method == "delete": target.delete(element)
+
+    if method == "find":
+        n = len(element)
+        a_result = A.find(element)
+        b_result = B.find(element[::-1])
+
+        answer = 0
+        for a_len in range(1,n):
+            answer += a_result[element[:a_len]] * b_result[element[:a_len-1:-1]]
+
+        print(answer)
+
+N = int(input())
+A = Tries()
+B = Tries()
+method, target, element = "", "", ""
+
+for _ in range(N):
+    _input = input()
+    if _input[:4] == "find": 
+        method,element = _input.split()
+        query(method, A, element)
+
+    else:
+        method, target, element = _input.split()
+
+        if target == "A": query(method, A, element)
+        else: query(method, B, element[::-1])