Merge pull request #27 from AlgoLeadMe/8-YIM2UL2ET

8-YIM2UL2ET

YIM2UL2ET/README.md

@@ -9,4 +9,5 @@
 | 5차시 | 2024.02.24 |  큐  | [BOJ 1158](https://www.acmicpc.net/problem/1158)  | [BOJ 1158 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/16) |
 | 6차시 | 2024.02.27 |  정렬  | [BOJ 1599](https://www.acmicpc.net/problem/1599)  | [BOJ 1599 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/21) |
 | 7차시 | 2024.03.01 |  재귀  | [BOJ 2705](https://www.acmicpc.net/problem/2705)  | [BOJ 2705 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/23) |
+| 8차시 | 2024.03.01 |  재귀  | [BOJ 10994](https://www.acmicpc.net/problem/10994)  | [BOJ 10994 풀이](https://github.com/AlgoLeadMe/AlgoLeadMe-7/pull/27) |
 ---

YIM2UL2ET/재귀/8차시 - BOJ 10994.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+
+void cover1(int n, int level)
+{
+    for (int i = 0; i < level; i++) std::cout << "* ";
+    for (int i = 0; i < 4*(n-level)-3; i++) std::cout << "*";
+    for (int i = 0; i < level; i++) std::cout << " *";
+    std::cout << "\n";
+}
+
+void cover2(int n, int level)
+{
+    for (int i = 0; i < level; i++) std::cout << "* ";
+    std::cout << "*";
+    for (int i = 0; i < 4*(n-level)-5; i++) std::cout << " ";
+    std::cout << "*";
+    for (int i = 0; i < level; i++) std::cout << " *";
+    std::cout << "\n";
+}
+
+void star(int n, int level)
+{
+    if (n == level+1) {
+        for (int i = 0; i < n*2-2; i++) std::cout << "* ";
+        std::cout << "*\n";
+    }
+    else {
+        cover1(n, level);
+        cover2(n, level);
+        star(n, level+1);
+        cover2(n, level);
+        cover1(n, level);
+    }
+}
+
+int main(void)
+{
+    int n;
+    std::cin >> n;
+    star(n, 0);
+    return 0;
+}