Merge branch 'main' into 7-rivkms

Author: rivkms

YIM2UL2ET/README.md

@@ -6,4 +6,6 @@
 | 2차시 | 2024.02.15 |  그리디  | [BOJ 1263](https://www.acmicpc.net/problem/1263)  | [BOJ 1449 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/7) |
 | 3차시 | 2024.02.18 |  스택  | [BOJ 2504](https://www.acmicpc.net/problem/2504)  | [BOJ 2504 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/9) |
 | 4차시 | 2024.02.21 |  덱  | [BOJ 1021](https://www.acmicpc.net/problem/1021)  | [BOJ 1021 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/12) |
+| 5차시 | 2024.02.21 |  큐  | [BOJ 1158](https://www.acmicpc.net/problem/1158)  | [BOJ 1158 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/16) |
+| 5차시 | 2024.02.21 |  정렬  | [BOJ 1599](https://www.acmicpc.net/problem/1599)  | [BOJ 1599 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/21) |
 ---

YIM2UL2ET/정렬/6차시 - BOJ 1599.cpp

@@ -0,0 +1,36 @@
+#include <iostream>
+#include <algorithm>
+
+std::string translation(std::string min_str)
+{
+    int s_diff = 0;
+    std::string alpha_str = min_str;
+    for (int i = 0; i < min_str.size(); i++) {
+        if (min_str[i] == 'k') alpha_str[i-s_diff] = 'c';
+        else if (min_str[i] > 'n') alpha_str[i-s_diff]++;
+        else if (min_str[i] == 'n' && i+1 < min_str.size() && min_str[i+1] == 'g') {
+            alpha_str.erase(alpha_str.begin() + (i++) - s_diff);
+            alpha_str[i - (++s_diff)] = 'o';
+        }
+    }
+    return alpha_str;
+}
+
+bool compare(std::string str1, std::string str2)
+{
+    return translation(str1) < translation(str2);
+}
+
+int main(void)
+{
+    int n;
+    std::cin >> n;
+
+    std::string min_str[n];
+    for (int i = 0; i < n; i++) std::cin >> min_str[i];
+    
+    std::sort(min_str, min_str+n, compare);
+
+    for (int i = 0; i < n; i++) std::cout << min_str[i] << std::endl;
+    return 0;
+}

YIM2UL2ET/큐/5차시 - BOJ 1158.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <vector>
+
+int main(void)
+{
+    int size, k, idx = 0;
+    std::vector <int> v;
+
+    std::cin >> size >> k;
+    for (int i = 0; i < size;) v.push_back(++i);
+
+    std::cout << "<";
+    while(true) {
+        idx = (idx + k - 1) % size--;
+        std::cout << v[idx];
+        v.erase(v.begin() + idx);
+
+        if (size > 0) std::cout << ", ";
+        else break;
+    }
+    std::cout << ">";
+    
+    return 0;
+}

kjs254/DFS/모음 사전.py

@@ -0,0 +1,16 @@
+def dfs(my_word):
+    global dic
+    vowel = ['A','E','I','O','U']
+    
+    if len(my_word)<=5:
+        dic.append(my_word)
+        
+        for v in vowel:
+            dfs(my_word + v)
+
+def solution(word):
+    global dic
+    dic = []
+    dfs('')
+    answer = dic.index(word)
+    return answer

kjs254/README.md

@@ -4,5 +4,7 @@
 |:----:|:---------:|:----:|:-----:|:----:|
 | 1차시 | 2024.02.12 |  스택  | [기능개발](https://school.programmers.co.kr/learn/courses/30/lessons/42586)  | [#2](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/2) |
 | 2차시 | 2024.02.15 | 큐 | [프로세스](https://school.programmers.co.kr/learn/courses/30/lessons/42587) | [#6](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/6) |
-| 3차시 | 2024.02.15 | 힙 | [야근 지수](https://school.programmers.co.kr/learn/courses/30/lessons/12927) | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/10) |
+| 3차시 | 2024.02.15 | 힙 | [야근지수](https://school.programmers.co.kr/learn/courses/30/lessons/12927) | [#10](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/10) |
+| 4차시 | 2024.02.15 | 힙 | [구명보트](https://school.programmers.co.kr/learn/courses/30/lessons/42885) | [#14](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/14) |
+| 5차시 | 2024.02.15 | 힙 | [모음사전](https://school.programmers.co.kr/learn/courses/30/lessons/84512) | [#19](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/19) |
 ---

kjs254/그리디/구명보트.py

@@ -0,0 +1,16 @@
+from collections import deque
+
+def solution(people, limit):
+    answer = 0
+    people = deque(sorted(people))
+    
+    while len(people)>1:
+        if people[0]+people[-1]<=limit:
+            people.pop()
+            people.popleft()
+            answer+=1
+        else:
+            people.pop()
+            answer+=1
+        
+    return answer+1 if people else answer

mong3125/수학/BOJ10986.java

@@ -0,0 +1,31 @@
+import java.io.BufferedReader;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.util.StringTokenizer;
+
+public class BOJ10986 {
+    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());
+
+        st = new StringTokenizer(br.readLine());
+        int[] remainders = new int[N + 1];  // 부분 합을 M으로 나눈 리스트
+        int[] remainders_count = new int[M];     // 나머지 개수
+        for (int i = 1; i <= N; i++) {
+            remainders[i] = (remainders[i - 1] + Integer.parseInt(st.nextToken())) % M;
+            remainders_count[remainders[i]] += 1;
+        }
+
+        long count = 0;
+        for (int i = 0; i < M; i++) {
+            count += (long) remainders_count[i] * (remainders_count[i] - 1) / 2;   // 조합
+        }
+
+        count += remainders_count[0];  // 나머지가 0일때 (i = j 일때)
+
+        System.out.println(count);
+    }
+}

rivkms/Backtracking/31413.cpp

@@ -51,5 +51,6 @@ int main() {
 
     pair<int, int> p = dfs(0, 0, 0, 0);
     cout<< p.first << " " << p.second;
+
     return 0;
 }