feat: [Renewal] update Main README

tony9402 · Jul 2, 2024 · 5d3309c · 5d3309c
1 parent 32da731
commit 5d3309c
Show file tree

Hide file tree

Showing 6 changed files with 61 additions and 129 deletions.
diff --git a/baekjoon_utils/baekjoon_utils/main.py b/baekjoon_utils/baekjoon_utils/main.py
@@ -4,6 +4,7 @@
 
 from baekjoon_utils.daily.pick import TodayProblemPicker
 from baekjoon_utils.docs.problem import ProblemByTag
+from baekjoon_utils.docs.contributor import make_table as contributor_make_table
 from baekjoon_utils.core.solved_api import SolvedAPI
 from baekjoon_utils.utils import get_today_date_kst_str
 
@@ -35,6 +36,15 @@ def main():
 
     api = SolvedAPI()
     if option & 2:
+        # Update Contributors
+        contributors = contributor_make_table()
+
+        with open("markdown/contributors.md", "w") as f:
+            f.write("## Contributors\n\n")
+            f.write(contributors + "\n\n")
+            f.close()
+
+        # Update Problems
         api.update_all()
         tags = glob("algorithms/*")
         for tag_path in tags:
@@ -75,6 +85,23 @@ def main():
 
         picker.save()
 
+    # Update README
+    base_folder = "markdown"
+    md_seq = ["header.md", "codingtest_info.md", "workbook_header.md", "workbook.md", "workbook_footer.md", "contributors.md", "updatelog.md", "TODO.md", "footer.md"]
+
+    assemble_text = ""
+    for md_path in md_seq:
+        path = os.path.join(base_folder, md_path)
+        if not os.path.exists(path):
+            continue
+
+        with open(path, 'r') as f:
+            assemble_text = f"{assemble_text}{f.read()}"
+            f.close()
+
+    with open("test.md", "w") as f:
+        f.write(assemble_text)
+        f.close()
 
 if __name__ == "__main__":
     os.environ["TZ"] = "Asia/Seoul"

diff --git a/change_level.log b/change_level.log
diff --git a/guideline_for_contribute.md b/guideline_for_contribute.md
@@ -1,6 +1,6 @@
 # 📕 문제 풀이 컨트리뷰트 가이드라인
 
-**솔루션 PR은 [여기](https://github.com/tony9402/solutions_for_baekjoon_problems)로 옮겼습니다. 현재 대학원 졸업준비로 인해 업데이트를 못하고 있습니다...**  
+**솔루션 PR은 [여기](https://github.com/tony9402/solutions_for_baekjoon_problems)로 옮겼습니다.**  
 **가이드라인은 계속 업데이트 될 수 있습니다. 가이드라인이 업데이트 된 시점부터 한달동안 Issue에도 올리겠습니다.**
 
 <!-- 1694 x 1588 (1.06675 : 1) -->

diff --git a/link_for_study.md b/link_for_study.md
@@ -1,5 +1,9 @@
 # 알고리즘 설명 링크 모음
 
+
+여기있는 자료 이외에도 좋은 자료들이 있다면 Discussions이나 Issue에 공유해주시면 확인 후 업데이트 하겠습니다.
+
+
 ### 1. [VSFe](https://github.com/VSFe)
 
 <table>
@@ -155,4 +159,4 @@
 
 #### 공부자료
 * [대회알고리즘 (Blog)](https://blog.naver.com/kks227/220769859177) [무료]
-* [Github](https://github.com/kks227/BOJ) [무료]
+* [Github](https://github.com/kks227/BOJ) [무료]
diff --git a/markdown/header.md b/markdown/header.md
@@ -1,8 +1,13 @@
 # 코딩테스트 대비 문제집 with Baekjoon
 
 [![Auto Update README](https://github.com/tony9402/baekjoon/actions/workflows/auto_update.yml/badge.svg)](https://github.com/tony9402/baekjoon/actions/workflows/auto_update.yml)  
+
+<!--
 [![Auto Update README](https://github.com/tony9402/baekjoon/actions/workflows/auto_solution_update.yml/badge.svg)](https://github.com/tony9402/baekjoon/actions/workflows/auto_solution_update.yml)  
+-->
+<!--
 [![Auto Update README](https://github.com/tony9402/baekjoon/actions/workflows/auto_pick.yml/badge.svg)](https://github.com/tony9402/baekjoon/actions/workflows/auto_pick.yml)  
+-->
 
 [![하루 방문자 수](https://hits.seeyoufarm.com/api/count/incr/badge.svg?url=https%3A%2F%2Fgithub.com%2Ftony9402%2Fbaekjoon)](https://github.com/tony9402/baekjoon)
 [![Discussions](https://img.shields.io/badge/discussions-바로가기-brightgreen)](https://github.com/tony9402/baekjoon/discussions)

diff --git a/markdown/workbook.md b/markdown/workbook.md
@@ -1,29 +1,25 @@
 | 순번 | Tag                          | 태그                | 문제집    | 추천 문제 수 | 총 문제 수 |  상태             |
 | :--: | :--------------------------: | :-----------------: | :------:  | :---------:  | :------: |:---------------:|
-| 00 | Data Structure | 자료구조 | [바로가기](./data_structure) | 16 | 25 | ![status][Doing] |
-| 01 | Data Structure 2 | 자료구조 2 | [바로가기](./data_structure2) | 11 | 21 | ![status][Doing] |
-| 02 | Tree | 트리 | [바로가기](./tree) | 15 | 44 | ![status][Doing] |
-| 03 | Math | 수학 | [바로가기](./math) | 18 | 29 | ![status][Doing] |
-| 04 | Greedy | 탐욕법 | [바로가기](./greedy) | 27 | 62 | ![status][Doing] |
-| 05 | Dynamic Programming 1 | 동적계획법 1 | [바로가기](./dynamic_programming_1) | 27 | 80 | ![status][Doing] |
-| 06 | Dynamic Programming 2 | 동적계획법 2 | [바로가기](./dynamic_programming_2) | 28 | 81 | ![status][Doing] |
-| 07 | Two Pointer | 투 포인터 | [바로가기](./two_pointer) | 13 | 36 | ![status][Doing] |
-| 08 | Implementation | 구현 | [바로가기](./implementation) | 30 | 51 | ![status][Doing] |
-| 09 | Graph Traversal | 그래프 탐색 | [바로가기](./graph_traversal) | 31 | 96 | ![status][Doing] |
-| 10 | Brute Force | 완전탐색 | [바로가기](./brute_force) | 33 | 94 | ![status][Doing] |
-| 11 | Simulation | 시뮬레이션 | [바로가기](./simulation) | 30 | 48 | ![status][Doing] |
-| 12 | Binary Search | 이분탐색 | [바로가기](./binary_search) | 20 | 66 | ![status][Doing] |
-| 13 | Backtracking | 백트래킹 | [바로가기](./backtracking) | 28 | 75 | ![status][Doing] |
-| 14 | Divide and conquer | 분할정복 | [바로가기](./divide_and_conquer) | 08 | 18 | ![status][Doing] |
-| 15 | Prefix Sum | 누적 합 | [바로가기](./prefix_sum) | 11 | 32 | ![status][Doing] |
-| 16 | String | 문자열 | [바로가기](./string) | 19 | 63 | ![status][Doing] |
-| 17 | Shortest Path | 최단거리 | [바로가기](./shortest_path) | 18 | 53 | ![status][Doing] |
-| 18 | Topological Sorting | 위상정렬 | [바로가기](./topological_sorting) | 05 | 14 | ![status][Doing] |
-| 19 | Disjoint Set | 분리 집합 | [바로가기](./disjoint_set) | 06 | 20 | ![status][Doing] |
-| 20 | Minimum Spanning Tree(MST) | 최소 스패닝 트리 | [바로가기](./minimum_spanning_tree) | 08 | 24 | ![status][Doing] |
-| 21 | Trie | 트라이 | [바로가기](./trie) | 05 | 09 | ![status][Doing] |
-| 22 | Dynamic Programming On Trees | 트리디피 | [바로가기](./dynamic_programming_on_trees) | 04 | 08 | ![status][Doing] |
-
-
-
-
+| 00 | Data Structure | 자료구조 | [바로가기](./algorithms/data_structure) | 16 | 25 | ![status][Doing] |
+| 01 | Data Structure 2 | 자료구조 2 | [바로가기](./algorithms/data_structure2) | 11 | 21 | ![status][Doing] |
+| 02 | Tree | 트리 | [바로가기](./algorithms/tree) | 15 | 44 | ![status][Doing] |
+| 03 | Math | 수학 | [바로가기](./algorithms/math) | 18 | 29 | ![status][Doing] |
+| 04 | Greedy | 탐욕법 | [바로가기](./algorithms/greedy) | 27 | 62 | ![status][Doing] |
+| 05 | Dynamic Programming 1 | 동적계획법 1 | [바로가기](./algorithms/dynamic_programming_1) | 27 | 80 | ![status][Doing] |
+| 06 | Dynamic Programming 2 | 동적계획법 2 | [바로가기](./algorithms/dynamic_programming_2) | 28 | 81 | ![status][Doing] |
+| 07 | Two Pointer | 투 포인터 | [바로가기](./algorithms/two_pointer) | 13 | 36 | ![status][Doing] |
+| 08 | Implementation | 구현 | [바로가기](./algorithms/implementation) | 30 | 51 | ![status][Doing] |
+| 09 | Graph Traversal | 그래프 탐색 | [바로가기](./algorithms/graph_traversal) | 31 | 96 | ![status][Doing] |
+| 10 | Brute Force | 완전탐색 | [바로가기](./algorithms/brute_force) | 33 | 94 | ![status][Doing] |
+| 11 | Simulation | 시뮬레이션 | [바로가기](./algorithms/simulation) | 30 | 48 | ![status][Doing] |
+| 12 | Binary Search | 이분탐색 | [바로가기](./algorithms/binary_search) | 20 | 66 | ![status][Doing] |
+| 13 | Backtracking | 백트래킹 | [바로가기](./algorithms/backtracking) | 28 | 75 | ![status][Doing] |
+| 14 | Divide and conquer | 분할정복 | [바로가기](./algorithms/divide_and_conquer) | 08 | 18 | ![status][Doing] |
+| 15 | Prefix Sum | 누적 합 | [바로가기](./algorithms/prefix_sum) | 11 | 32 | ![status][Doing] |
+| 16 | String | 문자열 | [바로가기](./algorithms/string) | 19 | 63 | ![status][Doing] |
+| 17 | Shortest Path | 최단거리 | [바로가기](./algorithms/shortest_path) | 18 | 53 | ![status][Doing] |
+| 18 | Topological Sorting | 위상정렬 | [바로가기](./algorithms/topological_sorting) | 05 | 14 | ![status][Doing] |
+| 19 | Disjoint Set | 분리 집합 | [바로가기](./algorithms/disjoint_set) | 06 | 20 | ![status][Doing] |
+| 20 | Minimum Spanning Tree(MST) | 최소 스패닝 트리 | [바로가기](./algorithms/minimum_spanning_tree) | 08 | 24 | ![status][Doing] |
+| 21 | Trie | 트라이 | [바로가기](./algorithms/trie) | 05 | 09 | ![status][Doing] |
+| 22 | Dynamic Programming On Trees | 트리디피 | [바로가기](./algorithms/dynamic_programming_on_trees) | 04 | 08 | ![status][Doing] |