diff --git a/.github/workflows/auto_check_solution_open.yml b/.github/workflows/auto_check_solution_open.yml
deleted file mode 100644
index cabdf42..0000000
--- a/.github/workflows/auto_check_solution_open.yml
+++ /dev/null
@@ -1,60 +0,0 @@
-name: Auto Check Solution
-
-on:
- pull_request_target:
- types: [opened, reopened]
-
-jobs:
- create-pull-requst:
- runs-on: ubuntu-latest
- steps:
- - name: Checkout
- uses: actions/checkout@v2
- with:
- ref: main
- - name: Setup Python
- uses: actions/setup-python@v1
- with:
- python-version: '3.x'
- architecture: 'x64'
- - name: Setup Python Package
- run: |
- python -m pip install --upgrade pip
- pip install bs4 requests
- - name: tagging (1. Run script)
- run: |
- python scripts/check_pull_request.py --check_solution --pr_number ${{ github.event.number }}
- echo "SOLUTION_LANG=`head -1 result`" >> $GITHUB_ENV
- - name: add Label
- if: contains(github.event.pull_request.labels.*.name, 'Solution') == false
- uses: actions/github-script@v4
- with:
- script: |
- const { SOLUTION_LANG } = process.env
- if (SOLUTION_LANG == "python") {
- github.issues.addLabels({
- issue_number: context.issue.number,
- owner: context.repo.owner,
- repo: context.repo.repo,
- labels: ["Python", "Solution"]
- });
- }
- else if(SOLUTION_LANG == "cpp") {
- github.issues.addLabels({
- issue_number: context.issue.number,
- owner: context.repo.owner,
- repo: context.repo.repo,
- labels: ["C++", "Solution"]
- });
- }
- else if(SOLUTION_LANG == "java") {
- github.issues.addLabels({
- issue_number: context.issue.number,
- owner: context.repo.owner,
- repo: context.repo.repo,
- labels: ["Java", "Solution"]
- });
- }
- - name: Check Solution
- run: |
- python scripts/check_pull_request.py --pr_number ${{ github.event.number }}
diff --git a/.github/workflows/auto_check_solution_pr.yml b/.github/workflows/auto_check_solution_pr.yml
deleted file mode 100644
index c3ad5fb..0000000
--- a/.github/workflows/auto_check_solution_pr.yml
+++ /dev/null
@@ -1,29 +0,0 @@
-name: Auto Check Solution
-
-on:
- pull_request:
- branches: [main]
-
-jobs:
- create-pull-requst:
- runs-on: ubuntu-latest
- steps:
- - name: Checkout
- uses: actions/checkout@v2
- with:
- ref: main
- - name: Setup Python
- uses: actions/setup-python@v1
- with:
- python-version: '3.x'
- architecture: 'x64'
- - name: Setup Python Package
- run: |
- python -m pip install --upgrade pip
- pip install bs4 requests
- - name: tagging (1. Run script)
- run: |
- python scripts/check_pull_request.py --check_solution --pr_number ${{ github.event.number }}
- - name: Check Solution
- run: |
- python scripts/check_pull_request.py --pr_number ${{ github.event.number }}
diff --git a/.github/workflows/auto_pick.yml b/.github/workflows/auto_pick.yml
deleted file mode 100644
index c672252..0000000
--- a/.github/workflows/auto_pick.yml
+++ /dev/null
@@ -1,34 +0,0 @@
-name: Auto Pick Problem (Daliy)
-
-on:
- schedule:
- - cron: '30 16 * * *'
-
-jobs:
- build:
- runs-on: ubuntu-latest
- steps:
- - uses: actions/checkout@v2
- - name: Setup Python
- uses: actions/setup-python@v1
- with:
- python-version: '3.x'
- architecture: 'x64'
- - name: Setup pip
- run: |
- python -m pip install --upgrade pip
- pip install pytz
- - name: PICK
- run: |
- python scripts/pick_problem.py
- - name: Commits
- run: |
- git config --local user.email "tony9402@naver.com"
- git config --local user.name "tony9402"
- git add .
- git commit -m "Today Problem"
- - name: Push
- uses: ad-m/github-push-action@master
- with:
- branch: 'main'
- github_token: $
diff --git a/.github/workflows/auto_solution_update.yml b/.github/workflows/auto_solution_update.yml
deleted file mode 100644
index 5f13bdb..0000000
--- a/.github/workflows/auto_solution_update.yml
+++ /dev/null
@@ -1,48 +0,0 @@
-name: Auto Solution Update
-
-on:
- push:
- branches: [ main ]
- paths-ignore:
- - assets
- - .github
- - markdown
- - scripts
- - '.gitignore'
- - 'CodingTest.md'
- - 'LICENSE'
- - 'README.md'
- - 'algorithm_list.md'
- - 'change_level.log'
- - 'guideline_for_contribute.md'
- - 'picked.md'
- - 'status.md'
-
-jobs:
- build:
- runs-on: ubuntu-latest
- steps:
- - uses: actions/checkout@v2
- - name: Setup Python
- uses: actions/setup-python@v1
- with:
- python-version: '3.x'
- architecture: 'x64'
- - name: Setup pip
- run: |
- python -m pip install --upgrade pip
- pip install pytz
- - name: Run auto_update.py
- run: |
- python scripts/auto_update.py --push
- - name: Config Github
- run: |
- git config --local user.email "tony9402@naver.com"
- git config --local user.name "tony9402"
- git add .
- git commit -m "Auto Update (PUSH)"
- - name: Push
- uses: ad-m/github-push-action@master
- with:
- branch: ${{ github.ref }}
- github_token: ${{ secrets.GITHUB_TOKEN }}
diff --git a/.github/workflows/auto_update.yml b/.github/workflows/auto_update.yml
deleted file mode 100644
index 1a8a4c8..0000000
--- a/.github/workflows/auto_update.yml
+++ /dev/null
@@ -1,34 +0,0 @@
-name: Auto Update README
-
-on:
- schedule:
- - cron: '30 19 * * *'
-
-jobs:
- build:
- runs-on: ubuntu-latest
- steps:
- - uses: actions/checkout@v2
- - name: Setup Python
- uses: actions/setup-python@v1
- with:
- python-version: '3.x'
- architecture: 'x64'
- - name: Setup pip
- run: |
- python -m pip install --upgrade pip
- pip install pytz
- - name: Run assemble.py
- run: |
- python scripts/auto_update.py --all
- - name: Commits
- run: |
- git config --local user.email "tony9402@naver.com"
- git config --local user.name "tony9402"
- git add .
- git commit -m "Auto UPDATE (ALL)"
- - name: Push
- uses: ad-m/github-push-action@master
- with:
- branch: 'main'
- github_token: $
diff --git a/algorithm_list.md b/algorithm_list.md
deleted file mode 100644
index 8d91f51..0000000
--- a/algorithm_list.md
+++ /dev/null
@@ -1,36 +0,0 @@
-# 알고리즘 유형 정리
-
-코테에 나올 만한 & 코테에 나온 적 있는 알고리즘을 정리 해봤습니다.
-
-### 알고리즘
-
-- 수학
-- 그리디
-- 동적계획법
-- 투 포인터
-- 구현
-- BFS
-- DFS
-- 완전 탐색
-- 시뮬레이션
-- 이분탐색
-- 백트래킹
-- 분할정복
-- 누적 합
-- 문자열
-- 최단거리
-- 위상정렬
-- 분리 집합
-- 최소 스패닝 트리
-- 트라이
-- 트리디피
-
-### 자료구조
-- map
-- set
-- tree
-- priority queue
-- queue
-- stack
-- deque
-- list
diff --git a/backtracking/README.md b/backtracking/README.md
deleted file mode 100644
index 85cc3d1..0000000
--- a/backtracking/README.md
+++ /dev/null
@@ -1,92 +0,0 @@
-# Backtracking (백트래킹)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-백트래킹 문제를 뽑았습니다.
-
-백트래킹의 기본 연습 문제인 N과 M 시리즈 모든 문제를 추천 문제로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7135)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 15649 | N과 M (1) | | 바로가기 |
-| 01 | :heavy_check_mark: | 15650 | N과 M (2) | | 바로가기 |
-| 02 | :heavy_check_mark: | 15651 | N과 M (3) | | 바로가기 |
-| 03 | :heavy_check_mark: | 15652 | N과 M (4) | | 바로가기 |
-| 04 | :heavy_check_mark: | 15654 | N과 M (5) | | 바로가기 |
-| 05 | :heavy_check_mark: | 15655 | N과 M (6) | | 바로가기 |
-| 06 | :heavy_check_mark: | 15656 | N과 M (7) | | 바로가기 |
-| 07 | :heavy_check_mark: | 15657 | N과 M (8) | | 바로가기 |
-| 08 | :heavy_check_mark: | 15663 | N과 M (9) | | 바로가기 |
-| 09 | :heavy_check_mark: | 15664 | N과 M (10) | | 바로가기 |
-| 10 | :heavy_check_mark: | 15665 | N과 M (11) | | 바로가기 |
-| 11 | :heavy_check_mark: | 15666 | N과 M (12) | | 바로가기 |
-| 12 | :heavy_check_mark: | 1182 | 부분수열의 합 | | 바로가기 |
-| 13 | :heavy_check_mark: | 10971 | 외판원 순회 2 | | |
-| 14 | :heavy_check_mark: | 16987 | 계란으로 계란치기 | | |
-| 15 | :heavy_check_mark: | 14712 | 넴모넴모 (Easy) | | 바로가기 |
-| 16 | :heavy_check_mark: | 14888 | 연산자 끼워넣기 | | |
-| 17 | :heavy_check_mark: | 1174 | 줄어드는 수 | | |
-| 18 | :heavy_check_mark: | 18430 | 무기 공학 | | 바로가기 |
-| 19 | :heavy_check_mark: | 9663 | N-Queen | | 바로가기 |
-| 20 | :heavy_check_mark: | 3980 | 선발 명단 | | |
-| 21 | :heavy_check_mark: | 6443 | 애너그램 | | |
-| 22 | :heavy_check_mark: | 2580 | 스도쿠 | | 바로가기 |
-| 23 | :heavy_check_mark: | 1062 | 가르침 | | |
-| 24 | :heavy_check_mark: | 2661 | 좋은수열 | | |
-| 25 | :heavy_check_mark: | 22944 | 죽음의 비 | | 바로가기 |
-| 26 | :heavy_check_mark: | 17136 | 색종이 붙이기 | | |
-| 27 | :heavy_check_mark: | 1799 | 비숍 | | |
-| 28 | | 10974 | 모든 순열 | | 바로가기 |
-| 29 | | 16922 | 로마 숫자 만들기 | | |
-| 30 | | 18429 | 근손실 | | |
-| 31 | | 19949 | 영재의 시험 | | |
-| 32 | | 14889 | 스타트와 링크 | | 바로가기 |
-| 33 | | 15658 | 연산자 끼워넣기 (2) | | 바로가기 |
-| 34 | | 20950 | 미술가 미미 | | |
-| 35 | | 6603 | 로또 | | |
-| 36 | | 10819 | 차이를 최대로 | | |
-| 37 | | 2529 | 부등호 | | |
-| 38 | | 19699 | 소-난다! | | |
-| 39 | | 1553 | 도미노 찾기 | | |
-| 40 | | 16198 | 에너지 모으기 | | 바로가기 |
-| 41 | | 12101 | 1, 2, 3 더하기 2 | | |
-| 42 | | 10597 | 순열장난 | | |
-| 43 | | 1189 | 컴백홈 | | 바로가기 |
-| 44 | | 18290 | NM과 K (1) | | |
-| 45 | | 1497 | 기타콘서트 | | |
-| 46 | | 15566 | 개구리 1 | | |
-| 47 | | 1342 | 행운의 문자열 | | |
-| 48 | | 13908 | 비밀번호 | | |
-| 49 | | 6987 | 월드컵 | | |
-| 50 | | 19942 | 다이어트 | | |
-| 51 | | 1759 | 암호 만들기 | | |
-| 52 | | 1038 | 감소하는 수 | | 바로가기 |
-| 53 | | 2023 | 신기한 소수 | | |
-| 54 | | 1405 | 미친 로봇 | | 바로가기 |
-| 55 | | 7490 | 0 만들기 | | |
-| 56 | | 7682 | 틱택토 | | |
-| 57 | | 20208 | 진우의 민트초코우유 | | |
-| 58 | | 10421 | 수식 완성하기 | | |
-| 59 | | 16938 | 캠프 준비 | | |
-| 60 | | 2922 | 즐거운 단어 | | |
-| 61 | | 15684 | 사다리 조작 | | |
-| 62 | | 1469 | 숌 사이 수열 | | |
-| 63 | | 1987 | 알파벳 | | |
-| 64 | | 2239 | 스도쿠 | | |
-| 65 | | 15918 | 랭퍼든 수열쟁이야!! | | |
-| 66 | | 12908 | 텔레포트 3 | | |
-| 67 | | 1941 | 소문난 칠공주 | | |
-| 68 | | 1248 | Guess | | |
-| 69 | | 9944 | NxM 보드 완주하기 | | |
-| 70 | | 2026 | 소풍 | | 바로가기 |
-| 71 | | 15659 | 연산자 끼워넣기 (3) | | |
-| 72 | | 16571 | 알파 틱택토 | | |
-| 73 | | 3165 | 5 | | |
-| 74 | | 1729 | 이차원 배열의 합 | | |
diff --git a/backtracking/header.md b/backtracking/header.md
deleted file mode 100644
index 63e5fed..0000000
--- a/backtracking/header.md
+++ /dev/null
@@ -1,15 +0,0 @@
-# Backtracking (백트래킹)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-백트래킹 문제를 뽑았습니다.
-
-백트래킹의 기본 연습 문제인 N과 M 시리즈 모든 문제를 추천 문제로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7135)
diff --git a/backtracking/list.md b/backtracking/list.md
deleted file mode 100644
index c838222..0000000
--- a/backtracking/list.md
+++ /dev/null
@@ -1,75 +0,0 @@
-1,15649,./../solution/backtracking/15649
-1,15650,./../solution/backtracking/15650
-1,15651,./../solution/backtracking/15651
-1,15652,./../solution/backtracking/15652
-1,15654,./../solution/backtracking/15654
-1,15655,./../solution/backtracking/15655
-1,15656,./../solution/backtracking/15656
-1,15657,./../solution/backtracking/15657
-1,15663,./../solution/backtracking/15663
-1,15664,./../solution/backtracking/15664
-1,15665,./../solution/backtracking/15665
-1,15666,./../solution/backtracking/15666
-,14889,./../solution/backtracking/14889
-,10974,./../solution/backtracking/10974
-,15658,./../solution/backtracking/15658
-,16922,
-,18429,
-,19949,
-,1553,
-,20950,
-,6603,
-1,1182,./../solution/backtracking/1182
-,10819,
-1,10971,
-,2529,
-,6987,
-1,16987,
-,19699,
-1,14712,./../solution/backtracking/14712
-1,14888,
-,16198,./../solution/backtracking/16198
-,12101,
-,10597,
-1,1174,
-,1189,./../solution/backtracking/1189
-,19942,
-,18290,
-,1497,
-1,18430,./../solution/backtracking/18430
-,15566,
-1,9663,./../solution/backtracking/9663
-,1759,
-,15684,
-,1038,./../solution/backtracking/1038
-,2023,
-,1405,./../solution/backtracking/1405
-,1342,
-,7490,
-,13908,
-,7682,
-,20208,
-,1469,
-,10421,
-,1987,
-1,2580,./../solution/backtracking/2580
-1,1062,
-1,2661,
-,2239,
-1,3980,
-,16938,
-,2922,
-,15918,
-,1941,
-,1248,
-,9944,
-1,6443,
-,2026,./../solution/backtracking/2026
-,15659,
-,12908,
-,1729,
-1,17136,
-1,1799,
-,16571,
-,3165,
-1,22944,./../solution/backtracking/22944
diff --git a/binary_search/README.md b/binary_search/README.md
deleted file mode 100644
index c1d927d..0000000
--- a/binary_search/README.md
+++ /dev/null
@@ -1,81 +0,0 @@
-# Binary Search (이분탐색)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7277)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 1789 | 수들의 합 | | 바로가기 |
-| 01 | :heavy_check_mark: | 2417 | 정수 제곱근 | | 바로가기 |
-| 02 | :heavy_check_mark: | 10815 | 숫자 카드 | | 바로가기 |
-| 03 | :heavy_check_mark: | 2805 | 나무 자르기 | | 바로가기 |
-| 04 | :heavy_check_mark: | 1654 | 랜선 자르기 | | 바로가기 |
-| 05 | :heavy_check_mark: | 2512 | 예산 | | 바로가기 |
-| 06 | :heavy_check_mark: | 19637 | IF문 좀 대신 써줘 | | 바로가기 |
-| 07 | :heavy_check_mark: | 11663 | 선분 위의 점 | | |
-| 08 | :heavy_check_mark: | 22871 | 징검다리 건너기 (large) | | |
-| 09 | :heavy_check_mark: | 2110 | 공유기 설치 | | 바로가기 |
-| 10 | :heavy_check_mark: | 3079 | 입국심사 | | 바로가기 |
-| 11 | :heavy_check_mark: | 2470 | 두 용액 | | 바로가기 |
-| 12 | :heavy_check_mark: | 20444 | 색종이와 가위 | | |
-| 13 | :heavy_check_mark: | 1477 | 휴게소 세우기 | | 바로가기 |
-| 14 | :heavy_check_mark: | 1939 | 중량제한 | | |
-| 15 | :heavy_check_mark: | 2473 | 세 용액 | | |
-| 16 | :heavy_check_mark: | 13397 | 구간 나누기 2 | | |
-| 17 | :heavy_check_mark: | 2412 | 암벽 등반 | | |
-| 18 | :heavy_check_mark: | 1300 | K번째 수 | | |
-| 19 | :heavy_check_mark: | 7453 | 합이 0인 네 정수 | | |
-| 20 | | 17266 | 어두운 굴다리 | | |
-| 21 | | 1920 | 수 찾기 | | 바로가기 |
-| 22 | | 10816 | 숫자 카드 2 | | 바로가기 |
-| 23 | | 20551 | Sort 마스터 배지훈의 후계자 | | |
-| 24 | | 2776 | 암기왕 | | 바로가기 |
-| 25 | | 16960 | 스위치와 램프 | | |
-| 26 | | 1072 | 게임 | | |
-| 27 | | 7795 | 먹을 것인가 먹힐 것인가 | | |
-| 28 | | 16401 | 과자 나눠주기 | | |
-| 29 | | 13702 | 이상한 술집 | | |
-| 30 | | 11561 | 징검다리 | | |
-| 31 | | 14627 | 파닭파닭 | | |
-| 32 | | 1166 | 선물 | | |
-| 33 | | 17451 | 평행 우주 | | |
-| 34 | | 17393 | 다이나믹 롤러 | | |
-| 35 | | 17124 | 두 개의 배열 | | |
-| 36 | | 2121 | 넷이 놀기 | | |
-| 37 | | 6236 | 용돈 관리 | | 바로가기 |
-| 38 | | 2792 | 보석 상자 | | |
-| 39 | | 15810 | 풍선 공장 | | |
-| 40 | | 17503 | 맥주 축제 | | |
-| 41 | | 18113 | 그르다 김가놈 | | |
-| 42 | | 2343 | 기타 레슨 | | |
-| 43 | | 2022 | 사다리 | | |
-| 44 | | 16564 | 히오스 프로게이머 | | |
-| 45 | | 18114 | 블랙 프라이데이 | | |
-| 46 | | 14575 | 뒤풀이 | | |
-| 47 | | 17179 | 케이크 자르기 | | |
-| 48 | | 20495 | 수열과 헌팅 | | |
-| 49 | | 11687 | 팩토리얼 0의 개수 | | |
-| 50 | | 3020 | 개똥벌레 | | |
-| 51 | | 2467 | 용액 | | |
-| 52 | | 2866 | 문자열 잘라내기 | | |
-| 53 | | 9024 | 두 수의 합 | | |
-| 54 | | 8983 | 사냥꾼 | | |
-| 55 | | 17951 | 흩날리는 시험지 속에서 내 평점이 느껴진거야 | | |
-| 56 | | 16434 | 드래곤 앤 던전 | | |
-| 57 | | 22945 | 팀 빌딩 | | |
-| 58 | | 9007 | 카누 선수 | | |
-| 59 | | 12757 | 전설의 JBNU | | |
-| 60 | | 2143 | 두 배열의 합 | | 바로가기 |
-| 61 | | 15823 | 카드 팩 구매하기 | | |
-| 62 | | 2613 | 숫자구슬 | | |
-| 63 | | 1561 | 놀이 공원 | | |
-| 64 | | 15732 | 도토리 숨기기 | | |
-| 65 | | 6209 | 제자리 멀리뛰기 | | |
diff --git a/binary_search/header.md b/binary_search/header.md
deleted file mode 100644
index a672999..0000000
--- a/binary_search/header.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Binary Search (이분탐색)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7277)
diff --git a/binary_search/list.md b/binary_search/list.md
deleted file mode 100644
index b098ac4..0000000
--- a/binary_search/list.md
+++ /dev/null
@@ -1,66 +0,0 @@
-1,1789,./../solution/binary_search/1789
-1,2417,./../solution/binary_search/2417
-,17266,
-,1920,./../solution/binary_search/1920
-1,10815,./../solution/binary_search/10815
-,10816,./../solution/binary_search/10816
-,20551,
-1,2805,./../solution/binary_search/2805
-1,1654,./../solution/binary_search/1654
-1,2512,./../solution/binary_search/2512
-,1072,
-,2776,./../solution/binary_search/2776
-,6236,./../solution/binary_search/6236
-,7795,
-,2792,
-,16401,
-,13702,
-,11561,
-,14627,
-,1166,
-,17451,
-1,19637,./../solution/binary_search/19637
-,17393,
-,17124,
-1,11663,
-,15810,
-,17503,
-,18113,
-,2121,
-1,2110,./../solution/binary_search/2110
-,2343,
-1,3079,./../solution/binary_search/3079
-,2022,
-,16564,
-,11687,
-,18114,
-,14575,
-,17179,
-,16960,
-,20495,
-1,2470,./../solution/binary_search/2470
-,3020,
-,2467,
-1,1477,./../solution/binary_search/1477
-,2866,
-1,20444,
-,9024,
-1,1939,
-,8983,
-1,2473,
-1,13397,
-,9007,
-1,2412,
-,17951,
-,12757,
-1,1300,
-,2143,./../solution/binary_search/2143
-,16434,
-,15823,
-1,7453,
-,2613,
-,1561,
-,15732,
-,6209,
-1,22871,
-,22945,
diff --git a/brute_force/README.md b/brute_force/README.md
deleted file mode 100644
index 60d4e47..0000000
--- a/brute_force/README.md
+++ /dev/null
@@ -1,113 +0,0 @@
-# Brute Force (완전탐색)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-완전탐색 중 백트래킹 있었던 문제와 최대한 겹치지 않도록 했습니다.
-
-다른 알고리즘 풀었어도 완전탐색으로 풀어보시면 좋습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7271)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 22864 | 피로도 | | |
-| 01 | :heavy_check_mark: | 2798 | 블랙잭 | | 바로가기 |
-| 02 | :heavy_check_mark: | 2231 | 분해합 | | 바로가기 |
-| 03 | :heavy_check_mark: | 19532 | 수학은 비대면강의입니다 | | 바로가기 |
-| 04 | :heavy_check_mark: | 18312 | 시각 | | 바로가기 |
-| 05 | :heavy_check_mark: | 15721 | 번데기 | | 바로가기 |
-| 06 | :heavy_check_mark: | 1969 | DNA | | 바로가기 |
-| 07 | :heavy_check_mark: | 2422 | 한윤정이 이탈리아에 가서 아이스크림을 사먹는데 | | 바로가기 |
-| 08 | :heavy_check_mark: | 18511 | 큰 수 구성하기 | | 바로가기 |
-| 09 | :heavy_check_mark: | 2503 | 숫자 야구 | | 바로가기 |
-| 10 | :heavy_check_mark: | 17626 | Four Squares | | 바로가기 |
-| 11 | :heavy_check_mark: | 5568 | 카드 놓기 | | 바로가기 |
-| 12 | :heavy_check_mark: | 9079 | 동전 게임 | | 바로가기 |
-| 13 | :heavy_check_mark: | 16937 | 두 스티커 | | |
-| 14 | :heavy_check_mark: | 14501 | 퇴사 | | |
-| 15 | :heavy_check_mark: | 16439 | 치킨치킨치킨 | | 바로가기 |
-| 16 | :heavy_check_mark: | 16508 | 전공책 | | |
-| 17 | :heavy_check_mark: | 2615 | 오목 | | 바로가기 |
-| 18 | :heavy_check_mark: | 14620 | 꽃길 | | 바로가기 |
-| 19 | :heavy_check_mark: | 2961 | 도영이가 만든 맛있는 음식 | | |
-| 20 | :heavy_check_mark: | 15661 | 링크와 스타트 | | 바로가기 |
-| 21 | :heavy_check_mark: | 12919 | A와 B 2 | | |
-| 22 | :heavy_check_mark: | 1548 | 부분 삼각 수열 | | |
-| 23 | :heavy_check_mark: | 1025 | 제곱수 찾기 | | |
-| 24 | :heavy_check_mark: | 14500 | 테트로미노 | | 바로가기 |
-| 25 | :heavy_check_mark: | 15686 | 치킨 배달 | | |
-| 26 | :heavy_check_mark: | 21278 | 호석이 두 마리 치킨 | | 바로가기 |
-| 27 | :heavy_check_mark: | 21315 | 카드 섞기 | | 바로가기 |
-| 28 | :heavy_check_mark: | 16637 | 괄호 추가하기 | | |
-| 29 | :heavy_check_mark: | 14391 | 종이 조각 | | |
-| 30 | :heavy_check_mark: | 18808 | 스티커 붙이기 | | 바로가기 |
-| 31 | :heavy_check_mark: | 22944 | 죽음의 비 | | |
-| 32 | :heavy_check_mark: | 21943 | 연산 최대로 | | |
-| 33 | | 9094 | 수학적 호기심 | | 바로가기 |
-| 34 | | 4690 | 완전 세제곱 | | 바로가기 |
-| 35 | | 3040 | 백설 공주와 일곱 난쟁이 | | |
-| 36 | | 10448 | 유레카 이론 | | |
-| 37 | | 2309 | 일곱 난쟁이 | | 바로가기 |
-| 38 | | 14697 | 방 배정하기 | | |
-| 39 | | 1668 | 트로피 진열 | | |
-| 40 | | 13410 | 거꾸로 구구단 | | 바로가기 |
-| 41 | | 1145 | 적어도 대부분의 배수 | | 바로가기 |
-| 42 | | 2160 | 그림 비교 | | |
-| 43 | | 18512 | 점프 점프 | | |
-| 44 | | 18868 | 멀티버스 Ⅰ | | |
-| 45 | | 4096 | 팰린드로미터 | | 바로가기 |
-| 46 | | 1436 | 영화감독 숌 | | 바로가기 |
-| 47 | | 1018 | 체스판 다시 칠하기 | | |
-| 48 | | 7568 | 덩치 | | 바로가기 |
-| 49 | | 2435 | 기상청 인턴 신현수 | | |
-| 50 | | 2635 | 수 이어가기 | | |
-| 51 | | 1059 | 좋은 구간 | | |
-| 52 | | 11170 | 0의 개수 | | |
-| 53 | | 1251 | 단어 나누기 | | |
-| 54 | | 14912 | 숫자 빈도수 | | |
-| 55 | | 17521 | Byte Coin | | |
-| 56 | | 19947 | 투자의 귀재 배주형 | | |
-| 57 | | 15779 | Zigzag | | |
-| 58 | | 5671 | 호텔 방 번호 | | |
-| 59 | | 1359 | 복권 | | |
-| 60 | | 17484 | 진우의 달 여행 (Small) | | |
-| 61 | | 1065 | 한수 | | |
-| 62 | | 1120 | 문자열 | | |
-| 63 | | 1543 | 문서 검색 | | |
-| 64 | | 15970 | 화살표 그리기 | | |
-| 65 | | 5883 | 아이폰 9S | | |
-| 66 | | 16951 | 블록 놀이 | | |
-| 67 | | 1487 | 물건 팔기 | | |
-| 68 | | 11502 | 세 개의 소수 문제 | | |
-| 69 | | 1895 | 필터 | | |
-| 70 | | 3085 | 사탕 게임 | | |
-| 71 | | 15270 | 친구 팰린드롬 | | |
-| 72 | | 9996 | 한국이 그리울 땐 서버에 접속하지 | | |
-| 73 | | 19949 | 영재의 시험 | | |
-| 74 | | 15728 | 에리 - 카드 | | |
-| 75 | | 1503 | 세 수 고르기 | | |
-| 76 | | 1421 | 나무꾼 이다솜 | | |
-| 77 | | 1411 | 비슷한 단어 | | |
-| 78 | | 2304 | 창고 다각형 | | |
-| 79 | | 10472 | 십자뒤집기 | | |
-| 80 | | 1254 | 팰린드롬 만들기 | | |
-| 81 | | 1527 | 금민수의 개수 | | |
-| 82 | | 17610 | 양팔저울 | | |
-| 83 | | 16943 | 숫자 재배치 | | |
-| 84 | | 1747 | 소수&팰린드롬 | | |
-| 85 | | 14225 | 부분수열의 합 | | |
-| 86 | | 1711 | 직각삼각형 | | |
-| 87 | | 17085 | 십자가 2개 놓기 | | |
-| 88 | | 1107 | 리모컨 | | |
-| 89 | | 1034 | 램프 | | |
-| 90 | | 17471 | 게리맨더링 | | 바로가기 |
-| 91 | | 1581 | 락스타 락동호 | | |
-| 92 | | 16986 | 인싸들의 가위바위보 | | |
-| 93 | | 22947 | 실행 시간 | | |
diff --git a/brute_force/header.md b/brute_force/header.md
deleted file mode 100644
index 695f95c..0000000
--- a/brute_force/header.md
+++ /dev/null
@@ -1,17 +0,0 @@
-# Brute Force (완전탐색)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-완전탐색 중 백트래킹 있었던 문제와 최대한 겹치지 않도록 했습니다.
-
-다른 알고리즘 풀었어도 완전탐색으로 풀어보시면 좋습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7271)
diff --git a/brute_force/list.md b/brute_force/list.md
deleted file mode 100644
index 0818c49..0000000
--- a/brute_force/list.md
+++ /dev/null
@@ -1,94 +0,0 @@
-,9094,./../solution/brute_force/9094
-,4690,./../solution/brute_force/4690
-,3040,
-,10448,
-1,2798,./../solution/brute_force/2798
-,2309,./../solution/brute_force/2309
-1,2231,./../solution/brute_force/2231
-,14697,
-,1668,
-,13410,./../solution/brute_force/13410
-1,19532,./../solution/brute_force/19532
-1,18312,./../solution/brute_force/18312
-,1145,./../solution/brute_force/1145
-,2160,
-,18512,
-,18868,
-1,15721,./../solution/brute_force/15721
-1,1969,./../solution/brute_force/1969
-1,2503,./../solution/brute_force/2503
-,1436,./../solution/brute_force/1436
-,1018,
-,7568,./../solution/brute_force/7568
-1,2422,./../solution/brute_force/2422
-,2435,
-1,17626,./../solution/brute_force/17626
-,2635,
-,1059,
-1,5568,./../solution/brute_force/5568
-,11170,
-,1251,
-,14912,
-,17521,
-,19947,
-,1359,
-,15779,
-1,18511,./../solution/brute_force/18511
-,17484,
-1,9079,./../solution/brute_force/9079
-,4096,./../solution/brute_force/4096
-,1065,
-1,14501,
-,1120,
-,3085,
-,1543,
-,15970,
-,5671,
-1,16937,
-,5883,
-,16951,
-,1487,
-,15270,
-1,2615,./../solution/brute_force/2615
-,11502,
-,9996,
-,10472,
-,1895,
-1,16439,./../solution/brute_force/16439
-,19949,
-,15728,
-1,16508,
-,1503,
-1,14620,./../solution/brute_force/14620
-1,12919,
-,1421,
-,1411,
-1,1548,
-,1254,
-1,2961,
-1,15661,./../solution/brute_force/15661
-,1527,
-,17610,
-,16943,
-1,1025,
-,17085,
-1,14500,./../solution/brute_force/14500
-1,15686,
-,1107,
-,17471,./../solution/brute_force/17471
-,1747,
-,14225,
-,1034,
-1,16637,
-1,14391,
-1,18808,./../solution/brute_force/18808
-,16986,
-,1711,
-,1581,
-1,21278,./../solution/brute_force/21278
-1,21315,./../solution/brute_force/21315
-,2304,
-1,21943,
-1,22864,
-1,22944,
-,22947,
diff --git a/data_structure/README.md b/data_structure/README.md
deleted file mode 100644
index 82779b0..0000000
--- a/data_structure/README.md
+++ /dev/null
@@ -1,40 +0,0 @@
-# Data Structre (자료구조)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-이 자료구조에서는 큐, 스택, 덱을 익히는 문제들로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6779)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 10828 | 스택 | | 바로가기 |
-| 01 | :heavy_check_mark: | 9012 | 괄호 | | 바로가기 |
-| 02 | :heavy_check_mark: | 18258 | 큐 2 | | 바로가기 |
-| 03 | :heavy_check_mark: | 1158 | 요세푸스 문제 | | 바로가기 |
-| 04 | :heavy_check_mark: | 2164 | 카드2 | | 바로가기 |
-| 05 | :heavy_check_mark: | 10866 | 덱 | | 바로가기 |
-| 06 | :heavy_check_mark: | 1874 | 스택 수열 | | 바로가기 |
-| 07 | :heavy_check_mark: | 1935 | 후위 표기식2 | | 바로가기 |
-| 08 | :heavy_check_mark: | 10799 | 쇠막대기 | | 바로가기 |
-| 09 | :heavy_check_mark: | 1966 | 프린터 큐 | | 바로가기 |
-| 10 | :heavy_check_mark: | 2346 | 풍선 터뜨리기 | | 바로가기 |
-| 11 | :heavy_check_mark: | 2504 | 괄호의 값 | | 바로가기 |
-| 12 | :heavy_check_mark: | 2800 | 괄호 제거 | | 바로가기 |
-| 13 | :heavy_check_mark: | 2493 | 탑 | | 바로가기 |
-| 14 | :heavy_check_mark: | 22942 | 데이터 체커 | | 바로가기 |
-| 15 | :heavy_check_mark: | 1918 | 후위 표기식 | | 바로가기 |
-| 16 | | 10845 | 큐 | | 바로가기 |
-| 17 | | 4949 | 균형잡힌 세상 | | |
-| 18 | | 3986 | 좋은 단어 | | 바로가기 |
-| 19 | | 1021 | 회전하는 큐 | | 바로가기 |
-| 20 | | 5397 | 키로거 | | 바로가기 |
-| 21 | | 18115 | 카드 놓기 | | |
-| 22 | | 5430 | AC | | 바로가기 |
-| 23 | | 1863 | 스카이라인 쉬운거 | | |
-| 24 | | 22866 | 탑 보기 | | |
diff --git a/data_structure/header.md b/data_structure/header.md
deleted file mode 100644
index 0cb41b5..0000000
--- a/data_structure/header.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Data Structre (자료구조)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-이 자료구조에서는 큐, 스택, 덱을 익히는 문제들로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6779)
diff --git a/data_structure/list.md b/data_structure/list.md
deleted file mode 100644
index deb9974..0000000
--- a/data_structure/list.md
+++ /dev/null
@@ -1,25 +0,0 @@
-1,10828,./../solution/data_structure/10828
-1,9012,./../solution/data_structure/9012
-1,1874,./../solution/data_structure/1874
-1,1935,./../solution/data_structure/1935
-1,10799,./../solution/data_structure/10799
-1,2504,./../solution/data_structure/2504
-1,2800,./../solution/data_structure/2800
-1,2493,./../solution/data_structure/2493
-1,1918,./../solution/data_structure/1918
-1,18258,./../solution/data_structure/18258
-1,1158,./../solution/data_structure/1158
-1,2164,./../solution/data_structure/2164
-1,1966,./../solution/data_structure/1966
-1,10866,./../solution/data_structure/10866
-1,2346,./../solution/data_structure/2346
-,10845,./../solution/data_structure/10845
-,4949,
-,3986,./../solution/data_structure/3986
-,1021,./../solution/data_structure/1021
-,5397,./../solution/data_structure/5397
-,18115,
-,5430,./../solution/data_structure/5430
-,1863,
-,22866,
-1,22942,./../solution/data_structure/22942
diff --git a/data_structure2/README.md b/data_structure2/README.md
deleted file mode 100644
index 8623083..0000000
--- a/data_structure2/README.md
+++ /dev/null
@@ -1,36 +0,0 @@
-# Data Structre2 (자료구조2)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-이 자료구조에서는 Map, Set, Priority Queue(우선순위 큐)를 익히는 문제들로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6780)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 1620 | 나는야 포켓몬 마스터 이다솜 | | 바로가기 |
-| 01 | :heavy_check_mark: | 14425 | 문자열 집합 | | 바로가기 |
-| 02 | :heavy_check_mark: | 11279 | 최대 힙 | | 바로가기 |
-| 03 | :heavy_check_mark: | 11286 | 절댓값 힙 | | 바로가기 |
-| 04 | :heavy_check_mark: | 4358 | 생태학 | | 바로가기 |
-| 05 | :heavy_check_mark: | 7662 | 이중 우선순위 큐 | | 바로가기 |
-| 06 | :heavy_check_mark: | 2075 | N번째 큰 수 | | 바로가기 |
-| 07 | :heavy_check_mark: | 21939 | 문제 추천 시스템 Version 1 | | 바로가기 |
-| 08 | :heavy_check_mark: | 21944 | 문제 추천 시스템 Version 2 | | |
-| 09 | :heavy_check_mark: | 2696 | 중앙값 구하기 | | 바로가기 |
-| 10 | :heavy_check_mark: | 21942 | 부품 대여장 | | 바로가기 |
-| 11 | | 2776 | 암기왕 | | |
-| 12 | | 10546 | 배부른 마라토너 | | 바로가기 |
-| 13 | | 1302 | 베스트셀러 | | 바로가기 |
-| 14 | | 9375 | 패션왕 신해빈 | | |
-| 15 | | 1269 | 대칭 차집합 | | 바로가기 |
-| 16 | | 1927 | 최소 힙 | | 바로가기 |
-| 17 | | 19583 | 싸이버개강총회 | | |
-| 18 | | 17255 | N으로 만들기 | | |
-| 19 | | 12764 | 싸지방에 간 준하 | | |
-| 20 | | 1655 | 가운데를 말해요 | | |
diff --git a/data_structure2/header.md b/data_structure2/header.md
deleted file mode 100644
index 170b2d9..0000000
--- a/data_structure2/header.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Data Structre2 (자료구조2)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-이 자료구조에서는 Map, Set, Priority Queue(우선순위 큐)를 익히는 문제들로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6780)
diff --git a/data_structure2/list.md b/data_structure2/list.md
deleted file mode 100644
index b33430a..0000000
--- a/data_structure2/list.md
+++ /dev/null
@@ -1,21 +0,0 @@
-1,1620,./../solution/data_structure2/1620
-1,14425,./../solution/data_structure2/14425
-1,11279,./../solution/data_structure2/11279
-1,11286,./../solution/data_structure2/11286
-1,7662,./../solution/data_structure2/7662
-1,2075,./../solution/data_structure2/2075
-1,4358,./../solution/data_structure2/4358
-1,2696,./../solution/data_structure2/2696
-,9375,
-,1927,./../solution/data_structure2/1927
-,19583,
-,17255,
-,12764,
-,1655,
-,2776,
-,1269,./../solution/data_structure2/1269
-,10546,./../solution/data_structure2/10546
-,1302,./../solution/data_structure2/1302
-1,21939,./../solution/data_structure2/21939
-1,21942,./../solution/data_structure2/21942
-1,21944,
diff --git a/disjoint_set/README.md b/disjoint_set/README.md
deleted file mode 100644
index ac32673..0000000
--- a/disjoint_set/README.md
+++ /dev/null
@@ -1,40 +0,0 @@
-# Disjoint Set (분리집합)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-일반적으로 분리집합을 표현하는데에는 배열을 활용한 유니언 파인드 자료구조를 사용합니다.
-
-다만, 카카오 기출 문제에서 일반적인 유니언 파인드 구조를 사용하지 못하도록 전체 크기를 엄청나게 늘린 문제가 출제 되었던 만큼,
-배열이 아닌 해시나 이진트리를 활용해 유니언 파인드 구조를 만들어 보는 연습도 필요합니다!
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6784)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 1717 | 집합의 표현 | | 바로가기 |
-| 01 | :heavy_check_mark: | 1976 | 여행 가자 | | 바로가기 |
-| 02 | :heavy_check_mark: | 18116 | 로봇 조립 | | 바로가기 |
-| 03 | :heavy_check_mark: | 16562 | 친구비 | | 바로가기 |
-| 04 | :heavy_check_mark: | 4195 | 친구 네트워크 | | 바로가기 |
-| 05 | :heavy_check_mark: | 10775 | 공항 | | 바로가기 |
-| 06 | | 17352 | 여러분의 다리가 되어 드리겠습니다! | | 바로가기 |
-| 07 | | 7511 | 소셜 네트워킹 어플리케이션 | | |
-| 08 | | 20040 | 사이클 게임 | | |
-| 09 | | 12893 | 적의 적 | | |
-| 10 | | 1043 | 거짓말 | | 바로가기 |
-| 11 | | 16168 | 퍼레이드 | | |
-| 12 | | 20955 | 민서의 응급 수술 | | |
-| 13 | | 15789 | CTP 왕국은 한솔 왕국을 이길 수 있을까? | | |
-| 14 | | 11085 | 군사 이동 | | |
-| 15 | | 3108 | 로고 | | |
-| 16 | | 17090 | 미로 탈출하기 | | |
-| 17 | | 16724 | 피리 부는 사나이 | | |
-| 18 | | 14595 | 동방 프로젝트 (Large) | | |
-| 19 | | 17398 | 통신망 분할 | | |
diff --git a/disjoint_set/header.md b/disjoint_set/header.md
deleted file mode 100644
index 8836fab..0000000
--- a/disjoint_set/header.md
+++ /dev/null
@@ -1,18 +0,0 @@
-# Disjoint Set (분리집합)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-일반적으로 분리집합을 표현하는데에는 배열을 활용한 유니언 파인드 자료구조를 사용합니다.
-
-다만, 카카오 기출 문제에서 일반적인 유니언 파인드 구조를 사용하지 못하도록 전체 크기를 엄청나게 늘린 문제가 출제 되었던 만큼,
-배열이 아닌 해시나 이진트리를 활용해 유니언 파인드 구조를 만들어 보는 연습도 필요합니다!
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6784)
diff --git a/disjoint_set/list.md b/disjoint_set/list.md
deleted file mode 100644
index 8b55759..0000000
--- a/disjoint_set/list.md
+++ /dev/null
@@ -1,20 +0,0 @@
-1,1717,./../solution/disjoint_set/1717
-1,1976,./../solution/disjoint_set/1976
-1,16562,./../solution/disjoint_set/16562
-1,4195,./../solution/disjoint_set/4195
-1,10775,./../solution/disjoint_set/10775
-,20040,
-,11085,
-,17398,
-,17352,./../solution/disjoint_set/17352
-,12893,
-,1043,./../solution/disjoint_set/1043
-,16168,
-,7511,
-,20955,
-,3108,
-,15789,
-1,18116,./../solution/disjoint_set/18116
-,17090,
-,16724,
-,14595,
diff --git a/divide_and_conquer/README.md b/divide_and_conquer/README.md
deleted file mode 100644
index 0a880fb..0000000
--- a/divide_and_conquer/README.md
+++ /dev/null
@@ -1,33 +0,0 @@
-# Divide and conquer (분할정복)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7275)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 2630 | 색종이 만들기 | | 바로가기 |
-| 01 | :heavy_check_mark: | 17829 | 222-풀링 | | 바로가기 |
-| 02 | :heavy_check_mark: | 18222 | 투에-모스 문자열 | | 바로가기 |
-| 03 | :heavy_check_mark: | 2447 | 별 찍기 - 10 | | 바로가기 |
-| 04 | :heavy_check_mark: | 1992 | 쿼드트리 | | 바로가기 |
-| 05 | :heavy_check_mark: | 1074 | Z | | 바로가기 |
-| 06 | :heavy_check_mark: | 2448 | 별 찍기 - 11 | | 바로가기 |
-| 07 | :heavy_check_mark: | 4256 | 트리 | | 바로가기 |
-| 08 | | 4779 | 칸토어 집합 | | 바로가기 |
-| 09 | | 1780 | 종이의 개수 | | |
-| 10 | | 1802 | 종이 접기 | | 바로가기 |
-| 11 | | 5904 | Moo 게임 | | |
-| 12 | | 14600 | 샤워실 바닥 깔기 (Small) | | |
-| 13 | | 1493 | 박스 채우기 | | |
-| 14 | | 2374 | 같은 수로 만들기 | | |
-| 15 | | 1030 | 프렉탈 평면 | | |
-| 16 | | 16438 | 원숭이 스포츠 | | |
-| 17 | | 14601 | 샤워실 바닥 깔기 (Large) | | |
diff --git a/divide_and_conquer/header.md b/divide_and_conquer/header.md
deleted file mode 100644
index 21cc939..0000000
--- a/divide_and_conquer/header.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Divide and conquer (분할정복)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7275)
diff --git a/divide_and_conquer/list.md b/divide_and_conquer/list.md
deleted file mode 100644
index c9652d1..0000000
--- a/divide_and_conquer/list.md
+++ /dev/null
@@ -1,18 +0,0 @@
-1,2630,./../solution/divide_and_conquer/2630
-,4779,./../solution/divide_and_conquer/4779
-,1780,
-1,17829,./../solution/divide_and_conquer/17829
-1,18222,./../solution/divide_and_conquer/18222
-,1802,./../solution/divide_and_conquer/1802
-1,2447,./../solution/divide_and_conquer/2447
-1,1992,./../solution/divide_and_conquer/1992
-1,1074,./../solution/divide_and_conquer/1074
-,5904,
-,1493,
-,2374,
-1,4256,./../solution/divide_and_conquer/4256
-,14600,
-,1030,
-,16438,
-,14601,
-1,2448,./../solution/divide_and_conquer/2448
diff --git a/dynamic_programming_1/README.md b/dynamic_programming_1/README.md
deleted file mode 100644
index 27c5287..0000000
--- a/dynamic_programming_1/README.md
+++ /dev/null
@@ -1,100 +0,0 @@
-# Dynamic Programming 1 (동적계획법 1)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-다이나믹 프로그래밍 유형 쉬운 문제 위주로 뽑았습니다.
-
-다이나믹 프로그래밍은 점화식을 세우면 절반 이상은 풀었다고 볼 수 있습니다.
-
-점화식 세우는 건 금방 익히기 힘들어 코딩테스트에 나올만한 문제들,
-다이나믹 프로그래밍을 공부할만한 문제들을 최대한 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7020)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 10870 | 피보나치 수 5 | | 바로가기 |
-| 01 | :heavy_check_mark: | 2839 | 설탕 배달 | | 바로가기 |
-| 02 | :heavy_check_mark: | 2748 | 피보나치 수 2 | | 바로가기 |
-| 03 | :heavy_check_mark: | 1010 | 다리 놓기 | | 바로가기 |
-| 04 | :heavy_check_mark: | 9655 | 돌 게임 | | 바로가기 |
-| 05 | :heavy_check_mark: | 17626 | Four Squares | | 바로가기 |
-| 06 | :heavy_check_mark: | 1463 | 1로 만들기 | | 바로가기 |
-| 07 | :heavy_check_mark: | 9095 | 1, 2, 3 더하기 | | 바로가기 |
-| 08 | :heavy_check_mark: | 11726 | 2×n 타일링 | | 바로가기 |
-| 09 | :heavy_check_mark: | 2579 | 계단 오르기 | | 바로가기 |
-| 10 | :heavy_check_mark: | 11727 | 2×n 타일링 2 | | 바로가기 |
-| 11 | :heavy_check_mark: | 2407 | 조합 | | 바로가기 |
-| 12 | :heavy_check_mark: | 22857 | 가장 긴 짝수 연속한 부분 수열 (small) | | |
-| 13 | :heavy_check_mark: | 11053 | 가장 긴 증가하는 부분 수열 | | 바로가기 |
-| 14 | :heavy_check_mark: | 1912 | 연속합 | | 바로가기 |
-| 15 | :heavy_check_mark: | 11055 | 가장 큰 증가 부분 수열 | | 바로가기 |
-| 16 | :heavy_check_mark: | 1890 | 점프 | | 바로가기 |
-| 17 | :heavy_check_mark: | 9465 | 스티커 | | 바로가기 |
-| 18 | :heavy_check_mark: | 15486 | 퇴사 2 | | 바로가기 |
-| 19 | :heavy_check_mark: | 1106 | 호텔 | | 바로가기 |
-| 20 | :heavy_check_mark: | 2156 | 포도주 시식 | | |
-| 21 | :heavy_check_mark: | 10844 | 쉬운 계단 수 | | |
-| 22 | :heavy_check_mark: | 2294 | 동전 2 | | 바로가기 |
-| 23 | :heavy_check_mark: | 11660 | 구간 합 구하기 5 | | 바로가기 |
-| 24 | :heavy_check_mark: | 21317 | 징검다리 건너기 | | 바로가기 |
-| 25 | :heavy_check_mark: | 22869 | 징검다리 건너기 (small) | | 바로가기 |
-| 26 | :heavy_check_mark: | 2293 | 동전 1 | | |
-| 27 | | 15489 | 파스칼 삼각형 | | |
-| 28 | | 2670 | 연속부분최대곱 | | |
-| 29 | | 13699 | 점화식 | | 바로가기 |
-| 30 | | 15624 | 피보나치 수 7 | | |
-| 31 | | 2491 | 수열 | | |
-| 32 | | 14501 | 퇴사 | | |
-| 33 | | 1003 | 피보나치 함수 | | |
-| 34 | | 2193 | 이친수 | | |
-| 35 | | 9461 | 파도반 수열 | | 바로가기 |
-| 36 | | 1699 | 제곱수의 합 | | |
-| 37 | | 10211 | Maximum Subarray | | |
-| 38 | | 17175 | 피보나치는 지겨웡~ | | |
-| 39 | | 17212 | 달나라 토끼를 위한 구매대금 지불 도우미 | | |
-| 40 | | 15990 | 1, 2, 3 더하기 5 | | 바로가기 |
-| 41 | | 2876 | 그래픽스 퀴즈 | | |
-| 42 | | 20152 | Game Addiction | | |
-| 43 | | 11722 | 가장 긴 감소하는 부분 수열 | | 바로가기 |
-| 44 | | 1965 | 상자넣기 | | |
-| 45 | | 11060 | 점프 점프 | | |
-| 46 | | 15988 | 1, 2, 3 더하기 3 | | |
-| 47 | | 1660 | 캡틴 이다솜 | | |
-| 48 | | 14430 | 자원 캐기 | | |
-| 49 | | 18353 | 병사 배치하기 | | |
-| 50 | | 17291 | 새끼치기 | | |
-| 51 | | 4097 | 수익 | | |
-| 52 | | 20162 | 간식 파티 | | |
-| 53 | | 19622 | 회의실 배정 3 | | 바로가기 |
-| 54 | | 11568 | 민균이의 계략 | | |
-| 55 | | 1633 | 최고의 팀 만들기 | | |
-| 56 | | 1149 | RGB거리 | | |
-| 57 | | 1932 | 정수 삼각형 | | |
-| 58 | | 11052 | 카드 구매하기 | | |
-| 59 | | 11057 | 오르막 수 | | |
-| 60 | | 11051 | 이항 계수 2 | | |
-| 61 | | 11048 | 이동하기 | | 바로가기 |
-| 62 | | 1309 | 동물원 | | |
-| 63 | | 10164 | 격자상의 경로 | | 바로가기 |
-| 64 | | 16194 | 카드 구매하기 2 | | |
-| 65 | | 15989 | 1, 2, 3 더하기 4 | | 바로가기 |
-| 66 | | 12101 | 1, 2, 3 더하기 2 | | |
-| 67 | | 15992 | 1, 2, 3 더하기 7 | | |
-| 68 | | 15991 | 1, 2, 3 더하기 6 | | |
-| 69 | | 16195 | 1, 2, 3 더하기 9 | | |
-| 70 | | 15993 | 1, 2, 3 더하기 8 | | |
-| 71 | | 1495 | 기타리스트 | | |
-| 72 | | 2302 | 극장 좌석 | | |
-| 73 | | 12026 | BOJ 거리 | | |
-| 74 | | 13910 | 개업 | | |
-| 75 | | 22871 | 징검다리 건너기 (large) | | |
-| 76 | | 14852 | 타일 채우기 3 | | |
-| 77 | | 2565 | 전깃줄 | | |
-| 78 | | 2011 | 암호코드 | | |
-| 79 | | 14722 | 우유 도시 | | 바로가기 |
diff --git a/dynamic_programming_1/header.md b/dynamic_programming_1/header.md
deleted file mode 100644
index a5020df..0000000
--- a/dynamic_programming_1/header.md
+++ /dev/null
@@ -1,18 +0,0 @@
-# Dynamic Programming 1 (동적계획법 1)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-다이나믹 프로그래밍 유형 쉬운 문제 위주로 뽑았습니다.
-
-다이나믹 프로그래밍은 점화식을 세우면 절반 이상은 풀었다고 볼 수 있습니다.
-
-점화식 세우는 건 금방 익히기 힘들어 코딩테스트에 나올만한 문제들,
-다이나믹 프로그래밍을 공부할만한 문제들을 최대한 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7020)
diff --git a/dynamic_programming_1/list.md b/dynamic_programming_1/list.md
deleted file mode 100644
index d5e4f4d..0000000
--- a/dynamic_programming_1/list.md
+++ /dev/null
@@ -1,80 +0,0 @@
-1,10870,./../solution/dynamic_programming_1/10870
-1,2839,./../solution/dynamic_programming_1/2839
-1,2748,./../solution/dynamic_programming_1/2748
-1,1010,./../solution/dynamic_programming_1/1010
-1,9655,./../solution/dynamic_programming_1/9655
-1,17626,./../solution/dynamic_programming_1/17626
-,15489,
-,14501,
-,2670,
-,13699,./../solution/dynamic_programming_1/13699
-1,1463,./../solution/dynamic_programming_1/1463
-1,9095,./../solution/dynamic_programming_1/9095
-,1003,
-1,11726,./../solution/dynamic_programming_1/11726
-1,2579,./../solution/dynamic_programming_1/2579
-,2193,
-1,11727,./../solution/dynamic_programming_1/11727
-,9461,./../solution/dynamic_programming_1/9461
-,1699,
-,15990,./../solution/dynamic_programming_1/15990
-,10211,
-,17175,
-,15624,
-,17212,
-,2876,
-,20152,
-1,11053,./../solution/dynamic_programming_1/11053
-1,1912,./../solution/dynamic_programming_1/1912
-1,9465,./../solution/dynamic_programming_1/9465
-1,11055,./../solution/dynamic_programming_1/11055
-,11722,./../solution/dynamic_programming_1/11722
-1,1890,./../solution/dynamic_programming_1/1890
-,1965,
-1,2407,./../solution/dynamic_programming_1/2407
-,11060,
-,15988,
-,2491,
-1,15486,./../solution/dynamic_programming_1/15486
-,1660,
-,14852,
-,14430,
-,1633,
-,18353,
-1,1106,./../solution/dynamic_programming_1/1106
-,17291,
-,4097,
-,20162,
-,1149,
-,1932,
-1,2156,
-1,10844,
-,11052,
-,11057,
-1,2293,
-,11051,
-,11048,./../solution/dynamic_programming_1/11048
-1,2294,./../solution/dynamic_programming_1/2294
-,1309,
-,2565,
-,2011,
-1,11660,./../solution/dynamic_programming_1/11660
-,10164,./../solution/dynamic_programming_1/10164
-,16194,
-,19622,./../solution/dynamic_programming_1/19622
-,15989,./../solution/dynamic_programming_1/15989
-,12101,
-,15992,
-,15991,
-,16195,
-,15993,
-,1495,
-,2302,
-,11568,
-,12026,
-,14722,./../solution/dynamic_programming_1/14722
-,13910,
-1,21317,./../solution/dynamic_programming_1/21317
-1,22857,
-1,22869,./../solution/dynamic_programming_1/22869
-,22871,
diff --git a/dynamic_programming_2/README.md b/dynamic_programming_2/README.md
deleted file mode 100644
index b58489f..0000000
--- a/dynamic_programming_2/README.md
+++ /dev/null
@@ -1,101 +0,0 @@
-# Dynamic Programming 2 (동적계획법 2)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-다이나믹 프로그래밍 유형 문제 위주로 뽑았습니다.
-
-다이나믹 프로그래밍은 점화식을 세우면 절반 이상은 풀었다고 볼 수 있습니다.
-
-점화식 세우는 건 금방 익히기 힘들어 코딩테스트에 나올만한 문제들,
-다이나믹 프로그래밍을 공부할만한 문제들을 최대한 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7021)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 15724 | 주지수 | | |
-| 01 | :heavy_check_mark: | 9084 | 동전 | | |
-| 02 | :heavy_check_mark: | 12865 | 평범한 배낭 | | |
-| 03 | :heavy_check_mark: | 9251 | LCS | | 바로가기 |
-| 04 | :heavy_check_mark: | 2225 | 합분해 | | |
-| 05 | :heavy_check_mark: | 5557 | 1학년 | | 바로가기 |
-| 06 | :heavy_check_mark: | 2631 | 줄세우기 | | |
-| 07 | :heavy_check_mark: | 2624 | 동전 바꿔주기 | | |
-| 08 | :heavy_check_mark: | 14567 | 선수과목 (Prerequisite) | | 바로가기 |
-| 09 | :heavy_check_mark: | 17485 | 진우의 달 여행 (Large) | | 바로가기 |
-| 10 | :heavy_check_mark: | 21941 | 문자열 제거 | | |
-| 11 | :heavy_check_mark: | 18427 | 함께 블록 쌓기 | | 바로가기 |
-| 12 | :heavy_check_mark: | 1915 | 가장 큰 정사각형 | | |
-| 13 | :heavy_check_mark: | 2228 | 구간 나누기 | | |
-| 14 | :heavy_check_mark: | 2758 | 로또 | | |
-| 15 | :heavy_check_mark: | 2073 | 수도배관공사 | | |
-| 16 | :heavy_check_mark: | 1520 | 내리막 길 | | 바로가기 |
-| 17 | :heavy_check_mark: | 2056 | 작업 | | |
-| 18 | :heavy_check_mark: | 1695 | 팰린드롬 만들기 | | |
-| 19 | :heavy_check_mark: | 21923 | 곡예 비행 | | 바로가기 |
-| 20 | :heavy_check_mark: | 2629 | 양팔저울 | | |
-| 21 | :heavy_check_mark: | 20542 | 받아쓰기 | | |
-| 22 | :heavy_check_mark: | 1005 | ACM Craft | | 바로가기 |
-| 23 | :heavy_check_mark: | 11049 | 행렬 곱셈 순서 | | |
-| 24 | :heavy_check_mark: | 1823 | 수확 | | |
-| 25 | :heavy_check_mark: | 10942 | 팰린드롬? | | |
-| 26 | :heavy_check_mark: | 20181 | 꿈틀꿈틀 호석 애벌레 - 효율성 | | |
-| 27 | :heavy_check_mark: | 3687 | 성냥개비 | | 바로가기 |
-| 28 | | 1535 | 안녕 | | |
-| 29 | | 17216 | 가장 큰 감소 부분 수열 | | |
-| 30 | | 3067 | Coins | | |
-| 31 | | 14728 | 벼락치기 | | |
-| 32 | | 17845 | 수강 과목 | | |
-| 33 | | 17070 | 파이프 옮기기 1 | | |
-| 34 | | 14226 | 이모티콘 | | |
-| 35 | | 5582 | 공통 부분 문자열 | | |
-| 36 | | 13398 | 연속합 2 | | |
-| 37 | | 4811 | 알약 | | |
-| 38 | | 2688 | 줄어들지 않아 | | |
-| 39 | | 13302 | 리조트 | | |
-| 40 | | 17069 | 파이프 옮기기 2 | | |
-| 41 | | 2229 | 조 짜기 | | |
-| 42 | | 14699 | 관악산 등산 | | |
-| 43 | | 17265 | 나의 인생에는 수학과 함께 | | |
-| 44 | | 4095 | 최대 정사각형 | | |
-| 45 | | 16400 | 소수 화폐 | | |
-| 46 | | 11985 | 오렌지 출하 | | 바로가기 |
-| 47 | | 20002 | 사과나무 | | |
-| 48 | | 11909 | 배열 탈출 | | 바로가기 |
-| 49 | | 17208 | 카우버거 알바생 | | |
-| 50 | | 5569 | 출근 경로 | | |
-| 51 | | 5624 | 좋은 수 | | |
-| 52 | | 14925 | 목장 건설하기 | | |
-| 53 | | 1757 | 달려달려 | | |
-| 54 | | 10653 | 마라톤 2 | | |
-| 55 | | 17255 | N으로 만들기 | | |
-| 56 | | 2602 | 돌다리 건너기 | | |
-| 57 | | 2616 | 소형기관차 | | |
-| 58 | | 17404 | RGB거리 2 | | |
-| 59 | | 2157 | 여행 | | |
-| 60 | | 14863 | 서울에서 경산까지 | | |
-| 61 | | 1577 | 도로의 개수 | | |
-| 62 | | 1082 | 방 번호 | | |
-| 63 | | 2411 | 아이템 먹기 | | |
-| 64 | | 1301 | 비즈 공예 | | |
-| 65 | | 2253 | 점프 | | |
-| 66 | | 13902 | 개업 2 | | |
-| 67 | | 13707 | 합분해 2 | | |
-| 68 | | 14945 | 불장난 | | |
-| 69 | | 7579 | 앱 | | 바로가기 |
-| 70 | | 1943 | 동전 분배 | | |
-| 71 | | 11054 | 가장 긴 바이토닉 부분 수열 | | |
-| 72 | | 1937 | 욕심쟁이 판다 | | |
-| 73 | | 11066 | 파일 합치기 | | |
-| 74 | | 1516 | 게임 개발 | | 바로가기 |
-| 75 | | 1958 | LCS 3 | | |
-| 76 | | 1727 | 커플 만들기 | | |
-| 77 | | 21925 | 짝수 팰린드롬 | | |
-| 78 | | 12015 | 가장 긴 증가하는 부분 수열 2 | | 바로가기 |
-| 79 | | 19645 | 햄최몇? | | |
-| 80 | | 20667 | 크롬 | | |
diff --git a/dynamic_programming_2/header.md b/dynamic_programming_2/header.md
deleted file mode 100644
index bd299ed..0000000
--- a/dynamic_programming_2/header.md
+++ /dev/null
@@ -1,18 +0,0 @@
-# Dynamic Programming 2 (동적계획법 2)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-다이나믹 프로그래밍 유형 문제 위주로 뽑았습니다.
-
-다이나믹 프로그래밍은 점화식을 세우면 절반 이상은 풀었다고 볼 수 있습니다.
-
-점화식 세우는 건 금방 익히기 힘들어 코딩테스트에 나올만한 문제들,
-다이나믹 프로그래밍을 공부할만한 문제들을 최대한 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7021)
diff --git a/dynamic_programming_2/list.md b/dynamic_programming_2/list.md
deleted file mode 100644
index fb71d38..0000000
--- a/dynamic_programming_2/list.md
+++ /dev/null
@@ -1,81 +0,0 @@
-,1535,
-1,9084,
-,3067,
-1,12865,
-,14728,
-,17845,
-,17208,
-1,18427,./../solution/dynamic_programming_2/18427
-,7579,./../solution/dynamic_programming_2/7579
-1,2629,
-,19645,
-,20667,
-1,9251,./../solution/dynamic_programming_2/9251
-1,2225,
-1,1915,
-,17070,
-1,5557,./../solution/dynamic_programming_2/5557
-1,2631,
-,14226,
-,5582,
-,13398,
-,4811,
-,2688,
-1,2624,
-,13302,
-1,2228,
-,17069,
-,2229,
-,5569,
-,5624,
-,14925,
-,14699,
-1,14567,./../solution/dynamic_programming_2/14567
-,17265,
-,1757,
-,4095,
-1,2758,
-,10653,
-,16400,
-,17216,
-,11985,./../solution/dynamic_programming_2/11985
-1,17485,./../solution/dynamic_programming_2/17485
-1,15724,
-,20002,
-,17255,
-1,2073,
-1,1520,./../solution/dynamic_programming_2/1520
-1,2056,
-,2602,
-,2616,
-,17404,
-1,1695,
-,2157,
-,14863,
-,1577,
-,1082,
-,2411,
-,1301,
-,2253,
-,13902,
-,13707,
-,14945,
-,1943,
-1,20542,
-,11054,
-1,1005,./../solution/dynamic_programming_2/1005
-,1937,
-,11066,
-1,11049,
-,1516,./../solution/dynamic_programming_2/1516
-,1958,
-,1727,
-1,1823,
-1,10942,
-1,20181,
-1,3687,./../solution/dynamic_programming_2/3687
-,12015,./../solution/dynamic_programming_2/12015
-,11909,./../solution/dynamic_programming_2/11909
-,21925,
-1,21923,./../solution/dynamic_programming_2/21923
-1,21941,
diff --git a/dynamic_programming_on_trees/README.md b/dynamic_programming_on_trees/README.md
deleted file mode 100644
index 8002ad6..0000000
--- a/dynamic_programming_on_trees/README.md
+++ /dev/null
@@ -1,29 +0,0 @@
-# Dynamic Programming On Trees (트리 디피)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-트리에서의 다이나믹 프로그래밍(Tree DP, 트리디피) 문제를 뽑아봤습니다.
-
-이 유형은 코딩테스트에서 나올 확률이 매우 적습니다.
-
-이 유형을 몰라도 충분히 통과할 수 있다고 추측되니 다른 유형을 더 보완하는게 좋을 수 있습니다.
-**또한 이 유형은 최근 카카오 코딩테스트를 제외하고 본 적이 없습니다.
- 하지만 카카오 코딩테스트에서 나왔기 때문에 추가하였습니다.**
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7166)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 15681 | 트리와 쿼리 | | 바로가기 |
-| 01 | :heavy_check_mark: | 2533 | 사회망 서비스(SNS) | | 바로가기 |
-| 02 | :heavy_check_mark: | 1949 | 우수 마을 | | 바로가기 |
-| 03 | :heavy_check_mark: | 2213 | 트리의 독립집합 | | 바로가기 |
-| 04 | | 2058 | 원자의 에너지 | | |
-| 05 | | 12978 | 스크루지 민호 2 | | |
-| 06 | | 1135 | 뉴스 전하기 | | 바로가기 |
-| 07 | | 17831 | 대기업 승범이네 | | 바로가기 |
diff --git a/dynamic_programming_on_trees/header.md b/dynamic_programming_on_trees/header.md
deleted file mode 100644
index 2e77273..0000000
--- a/dynamic_programming_on_trees/header.md
+++ /dev/null
@@ -1,19 +0,0 @@
-# Dynamic Programming On Trees (트리 디피)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-트리에서의 다이나믹 프로그래밍(Tree DP, 트리디피) 문제를 뽑아봤습니다.
-
-이 유형은 코딩테스트에서 나올 확률이 매우 적습니다.
-
-이 유형을 몰라도 충분히 통과할 수 있다고 추측되니 다른 유형을 더 보완하는게 좋을 수 있습니다.
-**또한 이 유형은 최근 카카오 코딩테스트를 제외하고 본 적이 없습니다.
- 하지만 카카오 코딩테스트에서 나왔기 때문에 추가하였습니다.**
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7166)
diff --git a/dynamic_programming_on_trees/list.md b/dynamic_programming_on_trees/list.md
deleted file mode 100644
index 32328fb..0000000
--- a/dynamic_programming_on_trees/list.md
+++ /dev/null
@@ -1,8 +0,0 @@
-1,15681,./../solution/dynamic_programming_on_trees/15681
-1,2533,./../solution/dynamic_programming_on_trees/2533
-,2058,
-1,2213,./../solution/dynamic_programming_on_trees/2213
-1,1949,./../solution/dynamic_programming_on_trees/1949
-,12978,
-,17831,./../solution/dynamic_programming_on_trees/17831
-,1135,./../solution/dynamic_programming_on_trees/1135
diff --git a/graph_traversal/README.md b/graph_traversal/README.md
deleted file mode 100644
index 34d2b35..0000000
--- a/graph_traversal/README.md
+++ /dev/null
@@ -1,115 +0,0 @@
-# Graph Traversal (그래프 탐색)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-BFS, DFS 유형을 다양하게 골랐습니다.
-
-문제를 보고 어떤 알고리즘을 써야할지 잘 판단하셔야 합니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6853)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 2606 | 바이러스 | | 바로가기 |
-| 01 | :heavy_check_mark: | 1260 | DFS와 BFS | | 바로가기 |
-| 02 | :heavy_check_mark: | 11725 | 트리의 부모 찾기 | | 바로가기 |
-| 03 | :heavy_check_mark: | 1325 | 효율적인 해킹 | | 바로가기 |
-| 04 | :heavy_check_mark: | 2178 | 미로 탐색 | | 바로가기 |
-| 05 | :heavy_check_mark: | 2667 | 단지번호붙이기 | | 바로가기 |
-| 06 | :heavy_check_mark: | 16918 | 봄버맨 | | 바로가기 |
-| 07 | :heavy_check_mark: | 7576 | 토마토 | | 바로가기 |
-| 08 | :heavy_check_mark: | 7569 | 토마토 | | 바로가기 |
-| 09 | :heavy_check_mark: | 5547 | 일루미네이션 | | 바로가기 |
-| 10 | :heavy_check_mark: | 14502 | 연구소 | | 바로가기 |
-| 11 | :heavy_check_mark: | 16234 | 인구 이동 | | 바로가기 |
-| 12 | :heavy_check_mark: | 2636 | 치즈 | | 바로가기 |
-| 13 | :heavy_check_mark: | 13549 | 숨바꼭질 3 | | 바로가기 |
-| 14 | :heavy_check_mark: | 17836 | 공주님을 구해라! | | 바로가기 |
-| 15 | :heavy_check_mark: | 14940 | 쉬운 최단거리 | | 바로가기 |
-| 16 | :heavy_check_mark: | 18513 | 샘터 | | 바로가기 |
-| 17 | :heavy_check_mark: | 2668 | 숫자고르기 | | |
-| 18 | :heavy_check_mark: | 13023 | ABCDE | | |
-| 19 | :heavy_check_mark: | 1600 | 말이 되고픈 원숭이 | | |
-| 20 | :heavy_check_mark: | 16954 | 움직이는 미로 탈출 | | 바로가기 |
-| 21 | :heavy_check_mark: | 16973 | 직사각형 탈출 | | |
-| 22 | :heavy_check_mark: | 2206 | 벽 부수고 이동하기 | | 바로가기 |
-| 23 | :heavy_check_mark: | 2573 | 빙산 | | |
-| 24 | :heavy_check_mark: | 4179 | 불! | | 바로가기 |
-| 25 | :heavy_check_mark: | 16932 | 모양 만들기 | | |
-| 26 | :heavy_check_mark: | 1967 | 트리의 지름 | | |
-| 27 | :heavy_check_mark: | 9466 | 텀 프로젝트 | | |
-| 28 | :heavy_check_mark: | 22868 | 산책 (small) | | |
-| 29 | :heavy_check_mark: | 22946 | 원 이동하기 1 | | |
-| 30 | :heavy_check_mark: | 22948 | 원 이동하기 2 | | |
-| 31 | | 16956 | 늑대와 양 | | |
-| 32 | | 1012 | 유기농 배추 | | 바로가기 |
-| 33 | | 11724 | 연결 요소의 개수 | | 바로가기 |
-| 34 | | 4963 | 섬의 개수 | | 바로가기 |
-| 35 | | 2644 | 촌수계산 | | |
-| 36 | | 3184 | 양 | | |
-| 37 | | 18352 | 특정 거리의 도시 찾기 | | |
-| 38 | | 13565 | 침투 | | |
-| 39 | | 3187 | 양치기 꿍 | | |
-| 40 | | 18232 | 텔레포트 정거장 | | |
-| 41 | | 14248 | 점프 점프 | | |
-| 42 | | 5567 | 결혼식 | | |
-| 43 | | 17086 | 아기 상어 2 | | |
-| 44 | | 1058 | 친구 | | 바로가기 |
-| 45 | | 21938 | 영상처리 | | |
-| 46 | | 7562 | 나이트의 이동 | | |
-| 47 | | 12761 | 돌다리 | | |
-| 48 | | 1697 | 숨바꼭질 | | |
-| 49 | | 2583 | 영역 구하기 | | |
-| 50 | | 1926 | 그림 | | |
-| 51 | | 1743 | 음식물 피하기 | | |
-| 52 | | 6118 | 숨바꼭질 | | |
-| 53 | | 16953 | A → B | | 바로가기 |
-| 54 | | 16948 | 데스 나이트 | | |
-| 55 | | 18405 | 경쟁적 전염 | | |
-| 56 | | 15558 | 점프 게임 | | |
-| 57 | | 1303 | 전쟁 - 전투 | | |
-| 58 | | 14496 | 그대, 그머가 되어 | | |
-| 59 | | 11123 | 양 한마리... 양 두마리... | | |
-| 60 | | 18404 | 현명한 나이트 | | |
-| 61 | | 14716 | 현수막 | | 바로가기 |
-| 62 | | 16174 | 점프왕 쩰리 (Large) | | 바로가기 |
-| 63 | | 21937 | 작업 | | |
-| 64 | | 16928 | 뱀과 사다리 게임 | | |
-| 65 | | 10026 | 적록색약 | | |
-| 66 | | 5014 | 스타트링크 | | |
-| 67 | | 2589 | 보물섬 | | 바로가기 |
-| 68 | | 12851 | 숨바꼭질 2 | | |
-| 69 | | 17129 | 윌리암슨수액빨이딱따구리가 정보섬에 올라온 이유 | | |
-| 70 | | 2194 | 유닛 이동시키기 | | |
-| 71 | | 1068 | 트리 | | |
-| 72 | | 16432 | 떡장수와 호랑이 | | |
-| 73 | | 3055 | 탈출 | | |
-| 74 | | 9019 | DSLR | | |
-| 75 | | 11559 | Puyo Puyo | | |
-| 76 | | 17141 | 연구소 2 | | |
-| 77 | | 1707 | 이분 그래프 | | 바로가기 |
-| 78 | | 17142 | 연구소 3 | | |
-| 79 | | 5427 | 불 | | |
-| 80 | | 13913 | 숨바꼭질 4 | | |
-| 81 | | 2638 | 치즈 | | |
-| 82 | | 2665 | 미로만들기 | | |
-| 83 | | 2234 | 성곽 | | |
-| 84 | | 2151 | 거울 설치 | | |
-| 85 | | 14923 | 미로 탈출 | | |
-| 86 | | 1726 | 로봇 | | 바로가기 |
-| 87 | | 6087 | 레이저 통신 | | |
-| 88 | | 2146 | 다리 만들기 | | |
-| 89 | | 14442 | 벽 부수고 이동하기 2 | | |
-| 90 | | 10711 | 모래성 | | |
-| 91 | | 16947 | 서울 지하철 2호선 | | |
-| 92 | | 16988 | Baaaaaaaaaduk2 (Easy) | | |
-| 93 | | 16985 | Maaaaaaaaaze | | |
-| 94 | | 17616 | 등수 찾기 | | |
-| 95 | | 22949 | 회전 미로 탐색 | | |
diff --git a/graph_traversal/header.md b/graph_traversal/header.md
deleted file mode 100644
index 32545da..0000000
--- a/graph_traversal/header.md
+++ /dev/null
@@ -1,17 +0,0 @@
-# Graph Traversal (그래프 탐색)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-BFS, DFS 유형을 다양하게 골랐습니다.
-
-문제를 보고 어떤 알고리즘을 써야할지 잘 판단하셔야 합니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6853)
diff --git a/graph_traversal/list.md b/graph_traversal/list.md
deleted file mode 100644
index 25ef0f9..0000000
--- a/graph_traversal/list.md
+++ /dev/null
@@ -1,96 +0,0 @@
-1,1260,./../solution/graph_traversal/1260
-1,2606,./../solution/graph_traversal/2606
-,1012,./../solution/graph_traversal/1012
-,11724,./../solution/graph_traversal/11724
-,4963,./../solution/graph_traversal/4963
-,7562,
-,2644,
-1,11725,./../solution/graph_traversal/11725
-1,1325,./../solution/graph_traversal/1325
-,3184,
-,18352,
-,16928,
-,13565,
-,12761,
-,3187,
-,18232,
-,14248,
-1,2178,./../solution/graph_traversal/2178
-1,2667,./../solution/graph_traversal/2667
-1,7576,./../solution/graph_traversal/7576
-,1697,
-,2583,
-1,7569,./../solution/graph_traversal/7569
-,5567,
-,1926,
-,1743,
-,6118,
-,16953,./../solution/graph_traversal/16953
-,16948,
-1,16918,./../solution/graph_traversal/16918
-,18405,
-,15558,
-,1303,
-,17086,
-,14496,
-,11123,
-,18404,
-1,5547,./../solution/graph_traversal/5547
-1,14502,./../solution/graph_traversal/14502
-,10026,
-,3055,
-1,16234,./../solution/graph_traversal/16234
-,5014,
-,2589,./../solution/graph_traversal/2589
-,9019,
-1,2636,./../solution/graph_traversal/2636
-1,13549,./../solution/graph_traversal/13549
-,11559,
-1,1600,
-,12851,
-,17141,
-1,16954,./../solution/graph_traversal/16954
-,14716,./../solution/graph_traversal/14716
-1,17836,./../solution/graph_traversal/17836
-1,16973,
-,17129,
-,16174,./../solution/graph_traversal/16174
-1,14940,./../solution/graph_traversal/14940
-,2194,
-1,18513,./../solution/graph_traversal/18513
-1,2206,./../solution/graph_traversal/2206
-,1707,./../solution/graph_traversal/1707
-1,2573,
-,17142,
-,5427,
-,13913,
-,2638,
-,2665,
-,1726,./../solution/graph_traversal/1726
-1,4179,./../solution/graph_traversal/4179
-,2234,
-,6087,
-,2151,
-,14923,
-1,16932,
-,2146,
-,14442,
-,10711,
-,16947,
-,16988,
-,16985,
-,16956,
-,1068,
-,1058,./../solution/graph_traversal/1058
-1,2668,
-1,13023,
-,16432,
-1,9466,
-1,1967,
-,17616,
-,21937,
-,21938,
-1,22868,
-1,22946,
-1,22948,
-,22949,
diff --git a/greedy/README.md b/greedy/README.md
deleted file mode 100644
index 6821928..0000000
--- a/greedy/README.md
+++ /dev/null
@@ -1,77 +0,0 @@
-# Greedy (그리디)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-쉬운 그리디부터 조금 고민을 해야하는 그리디까지 다양하게 뽑아봤습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6833)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 14916 | 거스름돈 | | 바로가기 |
-| 01 | :heavy_check_mark: | 1343 | 폴리오미노 | | |
-| 02 | :heavy_check_mark: | 2217 | 로프 | | 바로가기 |
-| 03 | :heavy_check_mark: | 13305 | 주유소 | | 바로가기 |
-| 04 | :heavy_check_mark: | 1758 | 알바생 강호 | | 바로가기 |
-| 05 | :heavy_check_mark: | 11508 | 2+1 세일 | | 바로가기 |
-| 06 | :heavy_check_mark: | 11399 | ATM | | 바로가기 |
-| 07 | :heavy_check_mark: | 20115 | 에너지 드링크 | | 바로가기 |
-| 08 | :heavy_check_mark: | 20300 | 서강근육맨 | | 바로가기 |
-| 09 | :heavy_check_mark: | 11047 | 동전 0 | | |
-| 10 | :heavy_check_mark: | 1931 | 회의실 배정 | | 바로가기 |
-| 11 | :heavy_check_mark: | 1541 | 잃어버린 괄호 | | 바로가기 |
-| 12 | :heavy_check_mark: | 20365 | 블로그2 | | 바로가기 |
-| 13 | :heavy_check_mark: | 16953 | A → B | | |
-| 14 | :heavy_check_mark: | 21314 | 민겸 수 | | |
-| 15 | :heavy_check_mark: | 21758 | 꿀 따기 | | 바로가기 |
-| 16 | :heavy_check_mark: | 11000 | 강의실 배정 | | 바로가기 |
-| 17 | :heavy_check_mark: | 13164 | 행복 유치원 | | 바로가기 |
-| 18 | :heavy_check_mark: | 19598 | 최소 회의실 개수 | | 바로가기 |
-| 19 | :heavy_check_mark: | 2212 | 센서 | | 바로가기 |
-| 20 | :heavy_check_mark: | 1092 | 배 | | |
-| 21 | :heavy_check_mark: | 2141 | 우체국 | | 바로가기 |
-| 22 | :heavy_check_mark: | 2812 | 크게 만들기 | | 바로가기 |
-| 23 | :heavy_check_mark: | 13975 | 파일 합치기 3 | | |
-| 24 | :heavy_check_mark: | 1715 | 카드 정렬하기 | | |
-| 25 | :heavy_check_mark: | 2285 | 우체국 | | |
-| 26 | :heavy_check_mark: | 8980 | 택배 | | |
-| 27 | | 21313 | 문어 | | |
-| 28 | | 1439 | 뒤집기 | | |
-| 29 | | 17521 | Byte Coin | | |
-| 30 | | 19939 | 박 터뜨리기 | | |
-| 31 | | 16208 | 귀찮음 | | 바로가기 |
-| 32 | | 11256 | 사탕 | | |
-| 33 | | 16435 | 스네이크버드 | | 바로가기 |
-| 34 | | 1817 | 짐 챙기는 숌 | | 바로가기 |
-| 35 | | 12782 | 비트 우정지수 | | |
-| 36 | | 2847 | 게임을 만든 동준이 | | |
-| 37 | | 13413 | 오셀로 재배치 | | |
-| 38 | | 16162 | 가희와 3단 고음 | | |
-| 39 | | 1449 | 수리공 항승 | | |
-| 40 | | 14247 | 나무 자르기 | | 바로가기 |
-| 41 | | 14400 | 편의점 2 | | |
-| 42 | | 1455 | 뒤집기 II | | |
-| 43 | | 13019 | A를 B로 | | |
-| 44 | | 1080 | 행렬 | | |
-| 45 | | 2138 | 전구와 스위치 | | |
-| 46 | | 1946 | 신입 사원 | | |
-| 47 | | 17615 | 볼 모으기 | | |
-| 48 | | 19539 | 사과나무 | | |
-| 49 | | 1474 | 밑 줄 | | |
-| 50 | | 16206 | 롤케이크 | | |
-| 51 | | 20117 | 호반우 상인의 이상한 품질 계산법 | | |
-| 52 | | 11509 | 풍선 맞추기 | | |
-| 53 | | 1374 | 강의실 | | |
-| 54 | | 6068 | 시간 관리하기 | | |
-| 55 | | 1744 | 수 묶기 | | |
-| 56 | | 1082 | 방 번호 | | |
-| 57 | | 12931 | 두 배 더하기 | | |
-| 58 | | 18234 | 당근 훔쳐 먹기 | | |
-| 59 | | 2457 | 공주님의 정원 | | |
-| 60 | | 2109 | 순회강연 | | |
-| 61 | | 21925 | 짝수 팰린드롬 | | |
diff --git a/greedy/header.md b/greedy/header.md
deleted file mode 100644
index 8d27b05..0000000
--- a/greedy/header.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Greedy (그리디)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-쉬운 그리디부터 조금 고민을 해야하는 그리디까지 다양하게 뽑아봤습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6833)
diff --git a/greedy/list.md b/greedy/list.md
deleted file mode 100644
index 4679b44..0000000
--- a/greedy/list.md
+++ /dev/null
@@ -1,62 +0,0 @@
-1,11000,./../solution/greedy/11000
-1,13164,./../solution/greedy/13164
-1,1931,./../solution/greedy/1931
-1,14916,./../solution/greedy/14916
-,1439,
-,17521,
-,19939,
-,12782,
-,16208,./../solution/greedy/16208
-,11256,
-,13019,
-1,2217,./../solution/greedy/2217
-1,13305,./../solution/greedy/13305
-,2847,
-1,1343,
-,13413,
-1,1758,./../solution/greedy/1758
-,16162,
-,16435,./../solution/greedy/16435
-1,11399,./../solution/greedy/11399
-,1449,
-1,11508,./../solution/greedy/11508
-,1817,./../solution/greedy/1817
-1,20115,./../solution/greedy/20115
-1,20300,./../solution/greedy/20300
-,14247,./../solution/greedy/14247
-1,1541,./../solution/greedy/1541
-,1080,
-,2138,
-1,20365,./../solution/greedy/20365
-,14400,
-1,11047,
-,1946,
-1,16953,
-,11509,
-,17615,
-,19539,
-,1474,
-,1455,
-,16206,
-1,2141,./../solution/greedy/2141
-1,19598,./../solution/greedy/19598
-,20117,
-1,2812,./../solution/greedy/2812
-1,2212,./../solution/greedy/2212
-1,1092,
-,1374,
-1,13975,
-,6068,
-,1744,
-1,1715,
-1,8980,
-,2457,
-,2109,
-,1082,
-,12931,
-,18234,
-1,2285,
-,21313,
-1,21314,
-1,21758,./../solution/greedy/21758
-,21925,
diff --git a/implementation/README.md b/implementation/README.md
deleted file mode 100644
index 3456ade..0000000
--- a/implementation/README.md
+++ /dev/null
@@ -1,70 +0,0 @@
-# Implementation (구현)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-시뮬레이션 관련 문제는 시뮬레이션에 있습니다.
-
-(매우 [단순한 구현](https://www.acmicpc.net/problem/1000)는 추가하지 않았습니다.)
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6783)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 21608 | 상어 초등학교 | | 바로가기 |
-| 01 | :heavy_check_mark: | 21611 | 마법사 상어와 블리자드 | | |
-| 02 | :heavy_check_mark: | 2753 | 윤년 | | 바로가기 |
-| 03 | :heavy_check_mark: | 1212 | 8진수 2진수 | | 바로가기 |
-| 04 | :heavy_check_mark: | 20053 | 최소, 최대 2 | | 바로가기 |
-| 05 | :heavy_check_mark: | 5597 | 과제 안 내신 분..? | | 바로가기 |
-| 06 | :heavy_check_mark: | 21918 | 전구 | | 바로가기 |
-| 07 | :heavy_check_mark: | 20546 | 🐜 기적의 매매법 🐜 | | 바로가기 |
-| 08 | :heavy_check_mark: | 14467 | 소가 길을 건너간 이유 1 | | 바로가기 |
-| 09 | :heavy_check_mark: | 2578 | 빙고 | | 바로가기 |
-| 10 | :heavy_check_mark: | 4396 | 지뢰 찾기 | | 바로가기 |
-| 11 | :heavy_check_mark: | 1913 | 달팽이 | | 바로가기 |
-| 12 | :heavy_check_mark: | 12933 | 오리 | | 바로가기 |
-| 13 | :heavy_check_mark: | 10994 | 별 찍기 - 19 | | 바로가기 |
-| 14 | :heavy_check_mark: | 20436 | ZOAC 3 | | 바로가기 |
-| 15 | :heavy_check_mark: | 1244 | 스위치 켜고 끄기 | | 바로가기 |
-| 16 | :heavy_check_mark: | 20291 | 파일 정리 | | 바로가기 |
-| 17 | :heavy_check_mark: | 17413 | 단어 뒤집기 2 | | 바로가기 |
-| 18 | :heavy_check_mark: | 22858 | 원상 복구 (small) | | |
-| 19 | :heavy_check_mark: | 2615 | 오목 | | |
-| 20 | :heavy_check_mark: | 17276 | 배열 돌리기 | | |
-| 21 | :heavy_check_mark: | 15787 | 기차가 어둠을 헤치고 은하수를 | | 바로가기 |
-| 22 | :heavy_check_mark: | 16926 | 배열 돌리기 1 | | 바로가기 |
-| 23 | :heavy_check_mark: | 20207 | 달력 | | 바로가기 |
-| 24 | :heavy_check_mark: | 20164 | 홀수 홀릭 호석 | | |
-| 25 | :heavy_check_mark: | 14719 | 빗물 | | 바로가기 |
-| 26 | :heavy_check_mark: | 16719 | ZOAC | | |
-| 27 | :heavy_check_mark: | 22856 | 트리 순회 | | |
-| 28 | :heavy_check_mark: | 22860 | 폴더 정리 (small) | | |
-| 29 | :heavy_check_mark: | 22859 | HTML 파싱 | | |
-| 30 | | 21756 | 지우개 | | 바로가기 |
-| 31 | | 1316 | 그룹 단어 체커 | | |
-| 32 | | 18311 | 왕복 | | |
-| 33 | | 2729 | 이진수 덧셈 | | 바로가기 |
-| 34 | | 5766 | 할아버지는 유명해! | | |
-| 35 | | 10703 | 유성 | | |
-| 36 | | 17128 | 소가 정보섬에 올라온 이유 | | |
-| 37 | | 1283 | 단축키 지정 | | |
-| 38 | | 15886 | 내 선물을 받아줘 2 | | |
-| 39 | | 16935 | 배열 돌리기 3 | | 바로가기 |
-| 40 | | 9934 | 완전 이진 트리 | | |
-| 41 | | 2469 | 사다리 타기 | | |
-| 42 | | 2877 | 4와 7 | | |
-| 43 | | 9081 | 단어 맞추기 | | |
-| 44 | | 16927 | 배열 돌리기 2 | | |
-| 45 | | 17406 | 배열 돌리기 4 | | |
-| 46 | | 1022 | 소용돌이 예쁘게 출력하기 | | |
-| 47 | | 20327 | 배열 돌리기 6 | | |
-| 48 | | 21277 | 짠돌이 호석 | | |
-| 49 | | 15806 | 영우의 기숙사 청소 | | 바로가기 |
-| 50 | | 17470 | 배열 돌리기 5 | | |
diff --git a/implementation/header.md b/implementation/header.md
deleted file mode 100644
index 64f510b..0000000
--- a/implementation/header.md
+++ /dev/null
@@ -1,17 +0,0 @@
-# Implementation (구현)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-시뮬레이션 관련 문제는 시뮬레이션에 있습니다.
-
-(매우 [단순한 구현](https://www.acmicpc.net/problem/1000)는 추가하지 않았습니다.)
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6783)
diff --git a/implementation/list.md b/implementation/list.md
deleted file mode 100644
index 24a3003..0000000
--- a/implementation/list.md
+++ /dev/null
@@ -1,51 +0,0 @@
-1,1212,./../solution/implementation/1212
-1,2753,./../solution/implementation/2753
-1,20053,./../solution/implementation/20053
-1,5597,./../solution/implementation/5597
-1,20546,./../solution/implementation/20546
-,1316,
-1,1913,./../solution/implementation/1913
-1,14467,./../solution/implementation/14467
-1,12933,./../solution/implementation/12933
-1,2578,./../solution/implementation/2578
-1,4396,./../solution/implementation/4396
-,18311,
-1,1244,./../solution/implementation/1244
-1,10994,./../solution/implementation/10994
-,5766,
-1,20291,./../solution/implementation/20291
-1,20436,./../solution/implementation/20436
-1,17413,./../solution/implementation/17413
-1,2615,
-,2729,./../solution/implementation/2729
-1,17276,
-1,16926,./../solution/implementation/16926
-,16927,
-,16935,./../solution/implementation/16935
-,17406,
-,17470,
-,20327,
-,17128,
-,1283,
-,10703,
-,9934,
-,2469,
-,2877,
-1,15787,./../solution/implementation/15787
-1,20164,
-1,20207,./../solution/implementation/20207
-1,14719,./../solution/implementation/14719
-,15886,
-1,16719,
-,1022,
-,9081,
-,15806,./../solution/implementation/15806
-,21277,
-2,21611,
-2,21608,./../solution/implementation/21608
-,21756,./../solution/implementation/21756
-1,21918,./../solution/implementation/21918
-1,22860,
-1,22859,
-1,22856,
-1,22858,
diff --git a/markdown/TODO.md b/markdown/TODO.md
deleted file mode 100644
index d4533bb..0000000
--- a/markdown/TODO.md
+++ /dev/null
@@ -1,14 +0,0 @@
-
-## TODO
-
-
- 자세히
-
-- [x] 코드 리팩토링
-- [x] Contributors 추가 스크립트화
-- [ ] 문제 뽑으면 Discussions 또는 Issue에서 바로 간단한 명령어로 추가 기능(스크립트화)
-- [x] 문제 추가 방식 변경
-
-
-
-
diff --git a/markdown/codingtest_info.md b/markdown/codingtest_info.md
deleted file mode 100644
index df14351..0000000
--- a/markdown/codingtest_info.md
+++ /dev/null
@@ -1,8 +0,0 @@
-## 최근 기업 코딩테스트 알고리즘 분류 정리
-
-[바로가기](./CodingTest.md)
-
-최근 기업 코딩테스트에 나왔던 알고리즘들을 정리해보았습니다.
-
-대부분은 코딩테스트를 본 분들에게 들은거라 몇개가 누락되었거나 잘못된 부분이 있을 수도 있습니다.
-
diff --git a/markdown/contributor.json b/markdown/contributor.json
deleted file mode 100644
index 18a53c9..0000000
--- a/markdown/contributor.json
+++ /dev/null
@@ -1,169 +0,0 @@
-{
- "id": [
- "tony9402",
- "VSFe",
- "kim1109123",
- "cola314",
- "nnnlog",
- "inclue",
- "yeonjungin",
- "cpprhtn",
- "seastar105",
- "Dev-RubinJo",
- "shjeong92",
- "chj3748",
- "seung-00",
- "bn-tw2020",
- "kjh03160",
- "CoodingPenguin",
- "bsm8734",
- "gkgg123",
- "simon-hoon",
- "gusdn3477",
- "rlawngus0910",
- "tallua",
- "kyjun719",
- "chance0523",
- "lms0806",
- "zmrdltl",
- "cieske",
- "Rain3321",
- "sio2whocodes",
- "kang-hyuck",
- "witch-factory",
- "youngjun0627",
- "suinj8"
- ],
- "tony9402": {
- "githubid": "30228292",
- "baekjoon": "tony9402"
- },
- "VSFe": {
- "githubid": "4595546",
- "baekjoon": "klm03025"
- },
- "kim1109123": {
- "githubid": "66085474",
- "baekjoon": "amsminn"
- },
- "cola314": {
- "githubid": "66579357",
- "baekjoon": "18sht1710"
- },
- "nnnlog": {
- "githubid": "20399222",
- "baekjoon": "chansol"
- },
- "inclue": {
- "githubid": "13315923",
- "baekjoon": "dlstj0923"
- },
- "yeonjungin": {
- "githubid": "47666431",
- "baekjoon": "$"
- },
- "cpprhtn": {
- "githubid": "63298243",
- "baekjoon": "xkzl9830"
- },
- "seastar105": {
- "githubid": "30820469",
- "baekjoon": "seastar105"
- },
- "Dev-RubinJo": {
- "githubid": "16368650",
- "baekjoon": "jybin321"
- },
- "shjeong92": {
- "githubid": "75003424",
- "baekjoon": "shjeong92"
- },
- "chj3748": {
- "githubid": "60089817",
- "baekjoon": "chj3748"
- },
- "seung-00": {
- "githubid": "46865281",
- "baekjoon": "osy0056"
- },
- "bn-tw2020": {
- "githubid": "66770613",
- "baekjoon": "ap4o"
- },
- "kjh03160": {
- "githubid": "49090888",
- "baekjoon": "kis03160"
- },
- "CoodingPenguin": {
- "githubid": "37505775",
- "baekjoon": "unodostre"
- },
- "bsm8734": {
- "githubid": "35002768",
- "baekjoon": "bsoomin8734"
- },
- "gkgg123": {
- "githubid": "60089810",
- "baekjoon": "gkgg123"
- },
- "simon-hoon": {
- "githubid": "54058621",
- "baekjoon": "ropeiny"
- },
- "gusdn3477": {
- "githubid": "46596758",
- "baekjoon": "gusdn3477"
- },
- "rlawngus0910": {
- "githubid": "57345435",
- "baekjoon": "rlawngus0910"
- },
- "tallua": {
- "githubid": "34978069",
- "baekjoon": "tallua_y"
- },
- "kyjun719": {
- "githubid": "24643002",
- "baekjoon": "kyj1991719"
- },
- "chance0523": {
- "githubid": "51807128",
- "baekjoon": "samuel95"
- },
- "lms0806": {
- "githubid": "42136056",
- "baekjoon": "lms0806"
- },
- "zmrdltl": {
- "githubid": "22141521",
- "baekjoon": "xhdxhl"
- },
- "cieske": {
- "githubid": "36599490",
- "baekjoon": "cieske"
- },
- "Rain3321": {
- "githubid": "39397110",
- "baekjoon": "smw123123"
- },
- "sio2whocodes": {
- "githubid": "41771874",
- "baekjoon": "fltcy2039"
- },
- "kang-hyuck" : {
- "githubid": "61424701",
- "baekjoon": "bakh1"
- },
- "witch-factory": {
- "githubid": "51201821",
- "baekjoon": "dart"
- },
- "youngjun0627": {
- "githubid": "57058726",
- "baekjoon": "yj2221"
- },
- "suinj8": {
- "githubid": "90179555",
- "baekjoon": "suin8"
- }
-}
diff --git a/markdown/contributors.md b/markdown/contributors.md
deleted file mode 100644
index c1f6911..0000000
--- a/markdown/contributors.md
+++ /dev/null
@@ -1,427 +0,0 @@
-## Contributors
-
-
-
-
-
diff --git a/markdown/footer.md b/markdown/footer.md
deleted file mode 100644
index 9d10167..0000000
--- a/markdown/footer.md
+++ /dev/null
@@ -1,28 +0,0 @@
-[Backtracking]: ./backtracking
-[Binary Search]: ./binary_search
-[Data Structure]: ./data_structure
-[Data Structure2]: ./data_structure2
-[Math]: ./math
-[Greedy]: ./greedy
-[DP1]: ./dynamic_programming_1
-[DP2]: ./dynamic_programming_2
-[MST]: ./minimum_spanning_tree
-[Two Pointer]: ./two_pointer
-[Topological Sorting]: ./topological_sorting
-[Implementation]: ./implementation
-[Graph Traversal]: ./graph_traversal
-[Simulation]: ./simulation
-[DFS]: ./dfs
-[BFS]: ./bfs
-[Brute Force]: ./brute_force
-[Disjoint Set]: ./disjoint_set
-[Trie]: ./trie
-[TreeDP]: ./dynamic_programming_on_trees
-[Shortest Path]: ./shortest_path
-[Prefix Sum]: ./prefix_sum
-[Divide and conquer]: ./divide_and_conquer
-[String]: ./string
-[Tree]: ./tree
-[TODO]: https://img.shields.io/badge/-TODO-DFFD26
-[DOING]: https://img.shields.io/badge/-DOING-31AE0F
-[DONE]: https://img.shields.io/badge/-DONE-0885CC
diff --git a/markdown/header.md b/markdown/header.md
deleted file mode 100644
index e54dca8..0000000
--- a/markdown/header.md
+++ /dev/null
@@ -1,20 +0,0 @@
-# 코딩테스트 대비 문제집 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)
-[![오늘의 문제](https://img.shields.io/badge/오늘의%20문제%20%28BETA%29-바로가기-112051)](https://github.com/tony9402/baekjoon/blob/main/picked.md)
-[![Contribute](https://img.shields.io/badge/집단%20지성%20프로젝트%20-바로가기-18D6A5)](https://github.com/tony9402/baekjoon/blob/main/guideline_for_contribute.md)
-[![Email](https://img.shields.io/badge/문의하기-tony9402@naver.com-0182E0)](mailTo:tony9402@naver.com)
-
-❈ 코딩테스트을 준비하시는 분들을 위해 문제집을 만들어봤습니다. ❈
-
-❗️ 주의 ❗️
- 알고리즘을 처음 공부하시는 분들은 [알고리즘 설명 링크 모음](./link_for_study.md) 등을 활용하여 알고리즘 먼저 공부하시기 바랍니다.
-
-이 레포는 꾸준히 업데이트를 할 예정이며 문제집 어느정도 완성 후 풀이를 Python, Java, C++ 3가지 언어를 올릴 예정입니다.
-**(C++로 먼저 올릴 예정입니다.)**
-
diff --git a/markdown/list.md b/markdown/list.md
deleted file mode 100644
index c1d4ef5..0000000
--- a/markdown/list.md
+++ /dev/null
@@ -1,23 +0,0 @@
-data_structure,Data Structure,자료구조,Doing
-data_structure2,Data Structure 2,자료구조 2,Doing
-tree,Tree,트리,Doing
-math,Math,수학,Doing
-greedy,Greedy,탐욕법,Doing
-dynamic_programming_1,Dynamic Programming 1,동적계획법 1,Doing
-dynamic_programming_2,Dynamic Programming 2,동적계획법 2,Doing
-two_pointer,Two Pointer,투 포인터,Doing
-implementation,Implementation,구현,Doing
-graph_traversal,Graph Traversal,그래프 탐색,Doing
-brute_force,Brute Force,완전탐색,Doing
-simulation,Simulation,시뮬레이션,Doing
-binary_search,Binary Search,이분탐색,Doing
-backtracking,Backtracking,백트래킹,Doing
-divide_and_conquer,Divide and conquer,분할정복,Doing
-prefix_sum,Prefix Sum,누적 합,Doing
-string,String,문자열,Doing
-shortest_path,Shortest Path,최단거리,Doing
-topological_sorting,Topological Sorting,위상정렬,Doing
-disjoint_set,Disjoint Set,분리 집합,Doing
-minimum_spanning_tree,Minimum Spanning Tree(MST),최소 스패닝 트리,Doing
-trie,Trie,트라이,Doing
-dynamic_programming_on_trees,Dynamic Programming On Trees,트리디피,Doing
diff --git a/markdown/tags.md b/markdown/tags.md
deleted file mode 100644
index e69de29..0000000
diff --git a/markdown/updatelog.md b/markdown/updatelog.md
deleted file mode 100644
index e923b8f..0000000
--- a/markdown/updatelog.md
+++ /dev/null
@@ -1,68 +0,0 @@
-## 업데이트 로그
-
-뽑아야 하는 문제가 많고 이를 보기 좋게 표로 정리하는 과정은 너무 노가다성이 많기 때문에 편하게 작업할 수 있도록 업데이트 하고 있습니다.
-
-
- 자세히
-
- - 2021.04.28
- - [오늘의 문제](https://github.com/tony9402/baekjoon/blob/main/picked.md) 뽑히는 문제 난이도 변경
- - 이전 난이도
- - 1번 브론즈 5 ~ 실버 1
- - 2번 골드 5 ~ 골드 3
- - 3번 골드 5 ~ 골드 3
- - 4번 골드 2 ~ 골드 1
- - 변경된 난이도
- - 1번 브론즈 5 ~ 실버 3
- - 2번 실버 2 ~ 골드 4
- - 3번 실버 2 ~ 골드 4
- - 4번 골드 3 ~ 골드 1
- - 2021.04.22 ~ 2021.04.23
- - 코드 리팩토링 일부 완료
- - 나머지는 시간 날때마다 하나씩 할 예정
- - 문제 뽑는 방식 변경
- - 이전 방식에서 [새로운](https://raw.githubusercontent.com/tony9402/baekjoon/main/dynamic_programming_2/list.md) 방식으로 변경
- - 이전 방식 : [추천 문제 여부],[문제 이름],[문제 번호],[난이도],[솔루션 링크]
- - 새로운 방식 : [추천 문제 여부],[문제 번호],[솔루션 링크]
- - 매일 새벽에 자동으로 문제 뽑는 스크립트 제작 및 기능 추가
- - [Solved.ac](https://solved.ac/) 기준 브론즈 5 ~ 골드 1 사이인 문제가 4문제 일정 조건 안에서 랜덤하게 뽑음
- - [오늘 문제](https://github.com/tony9402/baekjoon/blob/main/picked.md) 형식으로 업데이트.
- - [문제 뽑는 스크립트](https://github.com/tony9402/baekjoon/blob/main/scripts/pick_problem.cpp)
- - [Contributors](https://github.com/tony9402/baekjoon#contributors) 정보 만드는 표 스크립트 제작
- - Contributor 정보만 [여기](https://github.com/tony9402/baekjoon/blob/main/markdown/contributor.json)에 넣으면 자동으로 표를 생성
-
- - 2021.04.20
- - [tree](./tree) 태그 추가
- - 트리와 관련된 문제 뽑았습니다.
- - [Contributors](https://github.com/tony9402/baekjoon#contributors) 디자인을 변경하였습니다.
- - [문제집](https://www.acmicpc.net/workbook/by/tony9402) 전체를 업데이트 하였습니다.
- - 각 문제집에 문제 번호를 볼 수 있도록 추가하였고 문제 번호로도 백준으로 이동할 수 있도록 업데이트 했습니다.
-
- - 2021.04.03
- - [discussions](https://github.com/tony9402/baekjoon/discussions) 추가
-
- - 2021.04.02
- - [README.md](https://github.com/tony9402/baekjoon/blob/main/README.md) 자동 생성 스크립트 제작
- - 각 알고리즘 문제는 자동으로 추가되고 [status.md](https://github.com/tony9402/baekjoon/blob/main/status.md)에 자동으로 카운팅되지만 README.md에서는 안되는 현상 발견하여 해결
- - 알고리즘 문제 제목 틀린거 자동으로 찾아 수정
- - 일정 주기마다 알고리즘 난이도 갱신
- - 문제 정보를 담는 json을 만듦
-
- - 2021.03.31
- - [Github Actions](https://github.com/tony9402/baekjoon/actions) 도입
- - [solved](http://solved.ac)의 난이도 변경을 일정 시간마다 체크하여 자동 업데이트 (백준 문제집은 X)
- - 난이도 변경은 [로그](https://github.com/tony9402/baekjoon/blob/main/change_level.log)로 남겨놓음
- - 솔루션 파일만 폴더 형식에만 맞추면 알아서 README 업데이트(솔루션 링크 연결 등)
-
- - 2021.03.27
- - README.md 업데이트를 더더욱 자동화를 위해 README.md 위에 설명 부분을 header.md로 분리
-
- - 2021.03.15
- - 추천 문제 [solution](https://github.com/tony9402/baekjoon/tree/main/solution) (C++ 기준) 완성도 정리하는 스크립트 생성
-
- - 2021.01.15
- - 문제 [이렇게](https://raw.githubusercontent.com/tony9402/baekjoon/main/math/list.md) 뽑으면 자동으로 markdown 테이블을 만들어주는 스크립트 제작
-
-
-
-
diff --git a/markdown/workbook.md b/markdown/workbook.md
deleted file mode 100644
index 9939b01..0000000
--- a/markdown/workbook.md
+++ /dev/null
@@ -1,29 +0,0 @@
-| 순번 | 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 | 64 | ![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] |
-
-
-
-
\ No newline at end of file
diff --git a/markdown/workbook_footer.md b/markdown/workbook_footer.md
deleted file mode 100644
index 0dcddb3..0000000
--- a/markdown/workbook_footer.md
+++ /dev/null
@@ -1,12 +0,0 @@
-
-[현재 진행정도](./status.md)
-
-
-## 모의 문제집
-
-***이 문제는 알고리즘 분류와 관련 없이 문제를 뽑아놓은 문제입니다.***
-
-**이 부분은 [오늘의 문제](https://github.com/tony9402/baekjoon/blob/main/picked.md)로 대체합니다**
-
-
-
diff --git a/markdown/workbook_header.md b/markdown/workbook_header.md
deleted file mode 100644
index 442bc25..0000000
--- a/markdown/workbook_header.md
+++ /dev/null
@@ -1,15 +0,0 @@
-## 각 알고리즘 문제집
-
-**❗️❗️순번은 알고리즘 공부 순서와는 무관합니다.❗️❗️**
-
-여기에서는 각 알고리즘 개념을 설명하는 것이 없습니다. [알고리즘 설명 링크 모음](./link_for_study.md)
-
-문제 뽑은 기준 : 각 태그에 해당하는 문제(코딩 테스트에 나올 정도) 들을 최대한 많이 뽑고 반드시 풀고 넘어가면 좋은 문제를 체크해놨습니다.
-
-### **❈ 중요❗️❗️ ❈**
-
-이 레포는 **코딩테스트에 나올만한 유형**에 대한 문제를 모았습니다.
-알고리즘 유형이 회사마다 다릅니다. 따라서 아래 알고리즘들을 꼭 다 안풀어도 됩니다.
-지원하시는 회사에 나오는 **유형에 맞춰** 골라 푸시기 바랍니다.
-(문제집에도 추천 문제도 골라 푸셔도 됩니다.)
-
diff --git a/math/README.md b/math/README.md
deleted file mode 100644
index 83918d6..0000000
--- a/math/README.md
+++ /dev/null
@@ -1,46 +0,0 @@
-# Math (수학)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-현재 단계는 기초 수학을 익히는 문제들로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6781)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 5618 | 공약수 | | 바로가기 |
-| 01 | :heavy_check_mark: | 22864 | 피로도 | | 바로가기 |
-| 02 | :heavy_check_mark: | 2745 | 진법 변환 | | 바로가기 |
-| 03 | :heavy_check_mark: | 1110 | 더하기 사이클 | | 바로가기 |
-| 04 | :heavy_check_mark: | 2609 | 최대공약수와 최소공배수 | | 바로가기 |
-| 05 | :heavy_check_mark: | 1934 | 최소공배수 | | 바로가기 |
-| 06 | :heavy_check_mark: | 2581 | 소수 | | 바로가기 |
-| 07 | :heavy_check_mark: | 11653 | 소인수분해 | | 바로가기 |
-| 08 | :heavy_check_mark: | 1978 | 소수 찾기 | | 바로가기 |
-| 09 | :heavy_check_mark: | 2960 | 에라토스테네스의 체 | | 바로가기 |
-| 10 | :heavy_check_mark: | 5347 | LCM | | 바로가기 |
-| 11 | :heavy_check_mark: | 4134 | 다음 소수 | | 바로가기 |
-| 12 | :heavy_check_mark: | 21920 | 서로소 평균 | | 바로가기 |
-| 13 | :heavy_check_mark: | 9613 | GCD 합 | | 바로가기 |
-| 14 | :heavy_check_mark: | 21275 | 폰 호석만 | | 바로가기 |
-| 15 | :heavy_check_mark: | 21919 | 소수 최소 공배수 | | 바로가기 |
-| 16 | :heavy_check_mark: | 1747 | 소수&팰린드롬 | | 바로가기 |
-| 17 | :heavy_check_mark: | 22943 | 수 | | |
-| 18 | | 21312 | 홀짝 칵테일 | | 바로가기 |
-| 19 | | 2553 | 마지막 팩토리얼 수 | | |
-| 20 | | 1456 | 거의 소수 | | |
-| 21 | | 2168 | 타일 위의 대각선 | | |
-| 22 | | 9421 | 소수상근수 | | |
-| 23 | | 1669 | 멍멍이 쓰다듬기 | | |
-| 24 | | 1990 | 소수인팰린드롬 | | 바로가기 |
-| 25 | | 3343 | 장미 | | |
-| 26 | | 2436 | 공약수 | | |
-| 27 | | 1188 | 음식 평론가 | | |
-| 28 | | 2824 | 최대공약수 | | |
diff --git a/math/header.md b/math/header.md
deleted file mode 100644
index 5fdfee7..0000000
--- a/math/header.md
+++ /dev/null
@@ -1,15 +0,0 @@
-# Math (수학)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-현재 단계는 기초 수학을 익히는 문제들로 뽑았습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6781)
diff --git a/math/list.md b/math/list.md
deleted file mode 100644
index 523d210..0000000
--- a/math/list.md
+++ /dev/null
@@ -1,29 +0,0 @@
-1,1978,./../solution/math/1978
-1,2609,./../solution/math/2609
-1,1934,./../solution/math/1934
-1,2581,./../solution/math/2581
-1,11653,./../solution/math/11653
-1,2960,./../solution/math/2960
-1,9613,./../solution/math/9613
-1,5347,./../solution/math/5347
-1,4134,./../solution/math/4134
-1,1110,./../solution/math/1110
-1,5618,./../solution/math/5618
-1,2745,./../solution/math/2745
-1,21275,./../solution/math/21275
-,1456,
-,2168,
-,9421,
-,1669,
-,1990,./../solution/math/1990
-,3343,
-1,1747,./../solution/math/1747
-,2436,
-,1188,
-,2824,
-,2553,
-,21312,./../solution/math/21312
-1,21920,./../solution/math/21920
-1,21919,./../solution/math/21919
-1,22864,./../solution/math/22864
-1,22943,
diff --git a/minimum_spanning_tree/README.md b/minimum_spanning_tree/README.md
deleted file mode 100644
index 1360136..0000000
--- a/minimum_spanning_tree/README.md
+++ /dev/null
@@ -1,39 +0,0 @@
-# Minimum Spanning Tree (최소 스패닝 트리)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-최소 스패닝 트리 문제를 뽑아봤습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7175)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 1197 | 최소 스패닝 트리 | | 바로가기 |
-| 01 | :heavy_check_mark: | 1922 | 네트워크 연결 | | 바로가기 |
-| 02 | :heavy_check_mark: | 1647 | 도시 분할 계획 | | 바로가기 |
-| 03 | :heavy_check_mark: | 16398 | 행성 연결 | | 바로가기 |
-| 04 | :heavy_check_mark: | 21924 | 도시 건설 | | 바로가기 |
-| 05 | :heavy_check_mark: | 1774 | 우주신과의 교감 | | 바로가기 |
-| 06 | :heavy_check_mark: | 14621 | 나만 안되는 연애 | | 바로가기 |
-| 07 | :heavy_check_mark: | 1368 | 물대기 | | 바로가기 |
-| 08 | | 4386 | 별자리 만들기 | | 바로가기 |
-| 09 | | 6497 | 전력난 | | 바로가기 |
-| 10 | | 13905 | 세부 | | |
-| 11 | | 16202 | MST 게임 | | |
-| 12 | | 18769 | 그리드 네트워크 | | |
-| 13 | | 13418 | 학교 탐방하기 | | |
-| 14 | | 14950 | 정복자 | | |
-| 15 | | 2406 | 안정적인 네트워크 | | |
-| 16 | | 1414 | 불우이웃돕기 | | |
-| 17 | | 17490 | 일감호에 다리 놓기 | | |
-| 18 | | 1944 | 복제 로봇 | | |
-| 19 | | 10423 | 전기가 부족해 | | |
-| 20 | | 20010 | 악덕 영주 혜유 | | 바로가기 |
-| 21 | | 17472 | 다리 만들기 2 | | |
-| 22 | | 2887 | 행성 터널 | | 바로가기 |
-| 23 | | 1045 | 도로 | | |
diff --git a/minimum_spanning_tree/header.md b/minimum_spanning_tree/header.md
deleted file mode 100644
index d1805fe..0000000
--- a/minimum_spanning_tree/header.md
+++ /dev/null
@@ -1,13 +0,0 @@
-# Minimum Spanning Tree (최소 스패닝 트리)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-최소 스패닝 트리 문제를 뽑아봤습니다.
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7175)
diff --git a/minimum_spanning_tree/list.md b/minimum_spanning_tree/list.md
deleted file mode 100644
index 4fd4d05..0000000
--- a/minimum_spanning_tree/list.md
+++ /dev/null
@@ -1,24 +0,0 @@
-1,1197,./../solution/minimum_spanning_tree/1197
-1,1922,./../solution/minimum_spanning_tree/1922
-1,1647,./../solution/minimum_spanning_tree/1647
-,4386,./../solution/minimum_spanning_tree/4386
-,6497,./../solution/minimum_spanning_tree/6497
-1,1774,./../solution/minimum_spanning_tree/1774
-1,16398,./../solution/minimum_spanning_tree/16398
-,13905,
-,16202,
-,18769,
-,17472,
-,13418,
-1,14621,./../solution/minimum_spanning_tree/14621
-,14950,
-,2406,
-,17490,
-,2887,./../solution/minimum_spanning_tree/2887
-,1944,
-,10423,
-1,1368,./../solution/minimum_spanning_tree/1368
-,20010,./../solution/minimum_spanning_tree/20010
-,1414,
-,1045,
-1,21924,./../solution/minimum_spanning_tree/21924
diff --git a/picked.md b/picked.md
deleted file mode 100644
index 544f6b4..0000000
--- a/picked.md
+++ /dev/null
@@ -1,2277 +0,0 @@
-## 2022/03/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11653](https://www.acmicpc.net/problem/11653) | [소인수분해](https://www.acmicpc.net/problem/11653) |
-| | [13022](https://www.acmicpc.net/problem/13022) | [늑대와 올바른 단어](https://www.acmicpc.net/problem/13022) |
-| | [8983](https://www.acmicpc.net/problem/8983) | [사냥꾼](https://www.acmicpc.net/problem/8983) |
-| | [14391](https://www.acmicpc.net/problem/14391) | [종이 조각](https://www.acmicpc.net/problem/14391) |
-
-## 2022/03/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20944](https://www.acmicpc.net/problem/20944) | [팰린드롬 척화비](https://www.acmicpc.net/problem/20944) |
-| | [10819](https://www.acmicpc.net/problem/10819) | [차이를 최대로](https://www.acmicpc.net/problem/10819) |
-| | [21317](https://www.acmicpc.net/problem/21317) | [징검다리 건너기](https://www.acmicpc.net/problem/21317) |
-| | [16437](https://www.acmicpc.net/problem/16437) | [양 구출 작전](https://www.acmicpc.net/problem/16437) |
-
-## 2021/12/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10448](https://www.acmicpc.net/problem/10448) | [유레카 이론](https://www.acmicpc.net/problem/10448) |
-| | [16918](https://www.acmicpc.net/problem/16918) | [봄버맨](https://www.acmicpc.net/problem/16918) |
-| | [16400](https://www.acmicpc.net/problem/16400) | [소수 화폐](https://www.acmicpc.net/problem/16400) |
-| | [17398](https://www.acmicpc.net/problem/17398) | [통신망 분할](https://www.acmicpc.net/problem/17398) |
-
-## 2021/12/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5534](https://www.acmicpc.net/problem/5534) | [간판](https://www.acmicpc.net/problem/5534) |
-| | [7562](https://www.acmicpc.net/problem/7562) | [나이트의 이동](https://www.acmicpc.net/problem/7562) |
-| | [1469](https://www.acmicpc.net/problem/1469) | [숌 사이 수열](https://www.acmicpc.net/problem/1469) |
-| | [16571](https://www.acmicpc.net/problem/16571) | [알파 틱택토](https://www.acmicpc.net/problem/16571) |
-
-## 2021/12/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [13702](https://www.acmicpc.net/problem/13702) | [이상한 술집](https://www.acmicpc.net/problem/13702) |
-| | [10472](https://www.acmicpc.net/problem/10472) | [십자뒤집기](https://www.acmicpc.net/problem/10472) |
-| | [3107](https://www.acmicpc.net/problem/3107) | [IPv6](https://www.acmicpc.net/problem/3107) |
-| | [14601](https://www.acmicpc.net/problem/14601) | [샤워실 바닥 깔기 (Large)](https://www.acmicpc.net/problem/14601) |
-
-## 2021/12/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18512](https://www.acmicpc.net/problem/18512) | [점프 점프](https://www.acmicpc.net/problem/18512) |
-| | [14496](https://www.acmicpc.net/problem/14496) | [그대, 그머가 되어](https://www.acmicpc.net/problem/14496) |
-| | [21314](https://www.acmicpc.net/problem/21314) | [민겸 수](https://www.acmicpc.net/problem/21314) |
-| | [18808](https://www.acmicpc.net/problem/18808) | [스티커 붙이기](https://www.acmicpc.net/problem/18808) |
-
-## 2021/12/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9094](https://www.acmicpc.net/problem/9094) | [수학적 호기심](https://www.acmicpc.net/problem/9094) |
-| | [5430](https://www.acmicpc.net/problem/5430) | [AC](https://www.acmicpc.net/problem/5430) |
-| | [14226](https://www.acmicpc.net/problem/14226) | [이모티콘](https://www.acmicpc.net/problem/14226) |
-| | [17090](https://www.acmicpc.net/problem/17090) | [미로 탈출하기](https://www.acmicpc.net/problem/17090) |
-
-## 2021/12/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [21756](https://www.acmicpc.net/problem/21756) | [지우개](https://www.acmicpc.net/problem/21756) |
-| | [11404](https://www.acmicpc.net/problem/11404) | [플로이드](https://www.acmicpc.net/problem/11404) |
-| | [16973](https://www.acmicpc.net/problem/16973) | [직사각형 탈출](https://www.acmicpc.net/problem/16973) |
-| | [20010](https://www.acmicpc.net/problem/20010) | [악덕 영주 혜유](https://www.acmicpc.net/problem/20010) |
-
-## 2021/12/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5618](https://www.acmicpc.net/problem/5618) | [공약수](https://www.acmicpc.net/problem/5618) |
-| | [21922](https://www.acmicpc.net/problem/21922) | [학부 연구생 민상](https://www.acmicpc.net/problem/21922) |
-| | [6087](https://www.acmicpc.net/problem/6087) | [레이저 통신](https://www.acmicpc.net/problem/6087) |
-| | [18809](https://www.acmicpc.net/problem/18809) | [Gaaaaaaaaaarden](https://www.acmicpc.net/problem/18809) |
-
-## 2021/12/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4690](https://www.acmicpc.net/problem/4690) | [완전 세제곱](https://www.acmicpc.net/problem/4690) |
-| | [3005](https://www.acmicpc.net/problem/3005) | [크로스워드 퍼즐 쳐다보기](https://www.acmicpc.net/problem/3005) |
-| | [20922](https://www.acmicpc.net/problem/20922) | [겹치는 건 싫어](https://www.acmicpc.net/problem/20922) |
-| | [14570](https://www.acmicpc.net/problem/14570) | [나무 위의 구슬](https://www.acmicpc.net/problem/14570) |
-
-## 2021/12/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [3029](https://www.acmicpc.net/problem/3029) | [경고](https://www.acmicpc.net/problem/3029) |
-| | [5567](https://www.acmicpc.net/problem/5567) | [결혼식](https://www.acmicpc.net/problem/5567) |
-| | [14676](https://www.acmicpc.net/problem/14676) | [영우는 사기꾼?](https://www.acmicpc.net/problem/14676) |
-| | [13460](https://www.acmicpc.net/problem/13460) | [구슬 탈출 2](https://www.acmicpc.net/problem/13460) |
-
-## 2021/12/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18258](https://www.acmicpc.net/problem/18258) | [큐 2](https://www.acmicpc.net/problem/18258) |
-| | [17836](https://www.acmicpc.net/problem/17836) | [공주님을 구해라!](https://www.acmicpc.net/problem/17836) |
-| | [22865](https://www.acmicpc.net/problem/22865) | [가장 먼 곳](https://www.acmicpc.net/problem/22865) |
-| | [12912](https://www.acmicpc.net/problem/12912) | [트리 수정](https://www.acmicpc.net/problem/12912) |
-
-## 2021/12/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14929](https://www.acmicpc.net/problem/14929) | [귀찮아 (SIB)](https://www.acmicpc.net/problem/14929) |
-| | [12919](https://www.acmicpc.net/problem/12919) | [A와 B 2](https://www.acmicpc.net/problem/12919) |
-| | [10282](https://www.acmicpc.net/problem/10282) | [해킹](https://www.acmicpc.net/problem/10282) |
-| | [4315](https://www.acmicpc.net/problem/4315) | [나무 위의 구슬](https://www.acmicpc.net/problem/4315) |
-
-## 2021/12/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1864](https://www.acmicpc.net/problem/1864) | [문어 숫자](https://www.acmicpc.net/problem/1864) |
-| | [14267](https://www.acmicpc.net/problem/14267) | [회사 문화 1](https://www.acmicpc.net/problem/14267) |
-| | [22856](https://www.acmicpc.net/problem/22856) | [트리 순회](https://www.acmicpc.net/problem/22856) |
-| | [9944](https://www.acmicpc.net/problem/9944) | [NxM 보드 완주하기](https://www.acmicpc.net/problem/9944) |
-
-## 2021/12/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [21918](https://www.acmicpc.net/problem/21918) | [전구](https://www.acmicpc.net/problem/21918) |
-| | [1455](https://www.acmicpc.net/problem/1455) | [뒤집기 II](https://www.acmicpc.net/problem/1455) |
-| | [4097](https://www.acmicpc.net/problem/4097) | [수익](https://www.acmicpc.net/problem/4097) |
-| | [2696](https://www.acmicpc.net/problem/2696) | [중앙값 구하기](https://www.acmicpc.net/problem/2696) |
-
-## 2021/12/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20053](https://www.acmicpc.net/problem/20053) | [최소, 최대 2](https://www.acmicpc.net/problem/20053) |
-| | [5212](https://www.acmicpc.net/problem/5212) | [지구 온난화](https://www.acmicpc.net/problem/5212) |
-| | [18114](https://www.acmicpc.net/problem/18114) | [블랙 프라이데이](https://www.acmicpc.net/problem/18114) |
-| | [16971](https://www.acmicpc.net/problem/16971) | [배열 B의 값](https://www.acmicpc.net/problem/16971) |
-
-## 2021/12/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1072](https://www.acmicpc.net/problem/1072) | [게임](https://www.acmicpc.net/problem/1072) |
-| | [4095](https://www.acmicpc.net/problem/4095) | [최대 정사각형](https://www.acmicpc.net/problem/4095) |
-| | [16234](https://www.acmicpc.net/problem/16234) | [인구 이동](https://www.acmicpc.net/problem/16234) |
-| | [10423](https://www.acmicpc.net/problem/10423) | [전기가 부족해](https://www.acmicpc.net/problem/10423) |
-
-## 2021/12/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15270](https://www.acmicpc.net/problem/15270) | [친구 팰린드롬](https://www.acmicpc.net/problem/15270) |
-| | [4963](https://www.acmicpc.net/problem/4963) | [섬의 개수](https://www.acmicpc.net/problem/4963) |
-| | [5547](https://www.acmicpc.net/problem/5547) | [일루미네이션](https://www.acmicpc.net/problem/5547) |
-| | [6209](https://www.acmicpc.net/problem/6209) | [제자리 멀리뛰기](https://www.acmicpc.net/problem/6209) |
-
-## 2021/12/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15779](https://www.acmicpc.net/problem/15779) | [Zigzag](https://www.acmicpc.net/problem/15779) |
-| | [21318](https://www.acmicpc.net/problem/21318) | [피아노 체조](https://www.acmicpc.net/problem/21318) |
-| | [14499](https://www.acmicpc.net/problem/14499) | [주사위 굴리기](https://www.acmicpc.net/problem/14499) |
-| | [15732](https://www.acmicpc.net/problem/15732) | [도토리 숨기기](https://www.acmicpc.net/problem/15732) |
-
-## 2021/12/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5597](https://www.acmicpc.net/problem/5597) | [과제 안 내신 분..?](https://www.acmicpc.net/problem/5597) |
-| | [19539](https://www.acmicpc.net/problem/19539) | [사과나무](https://www.acmicpc.net/problem/19539) |
-| | [12851](https://www.acmicpc.net/problem/12851) | [숨바꼭질 2](https://www.acmicpc.net/problem/12851) |
-| | [21925](https://www.acmicpc.net/problem/21925) | [짝수 팰린드롬](https://www.acmicpc.net/problem/21925) |
-
-## 2021/12/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11170](https://www.acmicpc.net/problem/11170) | [0의 개수](https://www.acmicpc.net/problem/11170) |
-| | [5052](https://www.acmicpc.net/problem/5052) | [전화번호 목록](https://www.acmicpc.net/problem/5052) |
-| | [21923](https://www.acmicpc.net/problem/21923) | [곡예 비행](https://www.acmicpc.net/problem/21923) |
-| | [19566](https://www.acmicpc.net/problem/19566) | [수열의 구간 평균](https://www.acmicpc.net/problem/19566) |
-
-## 2021/12/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1212](https://www.acmicpc.net/problem/1212) | [8진수 2진수](https://www.acmicpc.net/problem/1212) |
-| | [12761](https://www.acmicpc.net/problem/12761) | [돌다리](https://www.acmicpc.net/problem/12761) |
-| | [15927](https://www.acmicpc.net/problem/15927) | [회문은 회문아니야!!](https://www.acmicpc.net/problem/15927) |
-| | [3108](https://www.acmicpc.net/problem/3108) | [로고](https://www.acmicpc.net/problem/3108) |
-
-## 2021/12/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2753](https://www.acmicpc.net/problem/2753) | [윤년](https://www.acmicpc.net/problem/2753) |
-| | [14225](https://www.acmicpc.net/problem/14225) | [부분수열의 합](https://www.acmicpc.net/problem/14225) |
-| | [1922](https://www.acmicpc.net/problem/1922) | [네트워크 연결](https://www.acmicpc.net/problem/1922) |
-| | [8972](https://www.acmicpc.net/problem/8972) | [미친 아두이노](https://www.acmicpc.net/problem/8972) |
-
-## 2021/12/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4134](https://www.acmicpc.net/problem/4134) | [다음 소수](https://www.acmicpc.net/problem/4134) |
-| | [13019](https://www.acmicpc.net/problem/13019) | [A를 B로](https://www.acmicpc.net/problem/13019) |
-| | [1747](https://www.acmicpc.net/problem/1747) | [소수&팰린드롬](https://www.acmicpc.net/problem/1747) |
-| | [5875](https://www.acmicpc.net/problem/5875) | [오타](https://www.acmicpc.net/problem/5875) |
-
-## 2021/12/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9046](https://www.acmicpc.net/problem/9046) | [복호화](https://www.acmicpc.net/problem/9046) |
-| | [7490](https://www.acmicpc.net/problem/7490) | [0 만들기](https://www.acmicpc.net/problem/7490) |
-| | [13707](https://www.acmicpc.net/problem/13707) | [합분해 2](https://www.acmicpc.net/problem/13707) |
-| | [2887](https://www.acmicpc.net/problem/2887) | [행성 터널](https://www.acmicpc.net/problem/2887) |
-
-## 2021/12/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15721](https://www.acmicpc.net/problem/15721) | [번데기](https://www.acmicpc.net/problem/15721) |
-| | [14248](https://www.acmicpc.net/problem/14248) | [점프 점프](https://www.acmicpc.net/problem/14248) |
-| | [21938](https://www.acmicpc.net/problem/21938) | [영상처리](https://www.acmicpc.net/problem/21938) |
-| | [19236](https://www.acmicpc.net/problem/19236) | [청소년 상어](https://www.acmicpc.net/problem/19236) |
-
-## 2021/12/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2193](https://www.acmicpc.net/problem/2193) | [이친수](https://www.acmicpc.net/problem/2193) |
-| | [1527](https://www.acmicpc.net/problem/1527) | [금민수의 개수](https://www.acmicpc.net/problem/1527) |
-| | [1548](https://www.acmicpc.net/problem/1548) | [부분 삼각 수열](https://www.acmicpc.net/problem/1548) |
-| | [1553](https://www.acmicpc.net/problem/1553) | [도미노 찾기](https://www.acmicpc.net/problem/1553) |
-
-## 2021/12/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2121](https://www.acmicpc.net/problem/2121) | [넷이 놀기](https://www.acmicpc.net/problem/2121) |
-| | [11727](https://www.acmicpc.net/problem/11727) | [2×n 타일링 2](https://www.acmicpc.net/problem/11727) |
-| | [1669](https://www.acmicpc.net/problem/1669) | [멍멍이 쓰다듬기](https://www.acmicpc.net/problem/1669) |
-| | [1743](https://www.acmicpc.net/problem/1743) | [음식물 피하기](https://www.acmicpc.net/problem/1743) |
-
-## 2021/12/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2003](https://www.acmicpc.net/problem/2003) | [수들의 합 2](https://www.acmicpc.net/problem/2003) |
-| | [14889](https://www.acmicpc.net/problem/14889) | [스타트와 링크](https://www.acmicpc.net/problem/14889) |
-| | [1927](https://www.acmicpc.net/problem/1927) | [최소 힙](https://www.acmicpc.net/problem/1927) |
-| | [1932](https://www.acmicpc.net/problem/1932) | [정수 삼각형](https://www.acmicpc.net/problem/1932) |
-
-## 2021/12/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1972](https://www.acmicpc.net/problem/1972) | [놀라운 문자열](https://www.acmicpc.net/problem/1972) |
-| | [1946](https://www.acmicpc.net/problem/1946) | [신입 사원](https://www.acmicpc.net/problem/1946) |
-| | [1991](https://www.acmicpc.net/problem/1991) | [트리 순회](https://www.acmicpc.net/problem/1991) |
-| | [1992](https://www.acmicpc.net/problem/1992) | [쿼드트리](https://www.acmicpc.net/problem/1992) |
-
-## 2021/12/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1966](https://www.acmicpc.net/problem/1966) | [프린터 큐](https://www.acmicpc.net/problem/1966) |
-| | [2011](https://www.acmicpc.net/problem/2011) | [암호코드](https://www.acmicpc.net/problem/2011) |
-| | [2022](https://www.acmicpc.net/problem/2022) | [사다리](https://www.acmicpc.net/problem/2022) |
-| | [2110](https://www.acmicpc.net/problem/2110) | [공유기 설치](https://www.acmicpc.net/problem/2110) |
-
-## 2021/11/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1935](https://www.acmicpc.net/problem/1935) | [후위 표기식2](https://www.acmicpc.net/problem/1935) |
-| | [15624](https://www.acmicpc.net/problem/15624) | [피보나치 수 7](https://www.acmicpc.net/problem/15624) |
-| | [2118](https://www.acmicpc.net/problem/2118) | [두 개의 탑](https://www.acmicpc.net/problem/2118) |
-| | [2156](https://www.acmicpc.net/problem/2156) | [포도주 시식](https://www.acmicpc.net/problem/2156) |
-
-## 2021/11/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2346](https://www.acmicpc.net/problem/2346) | [풍선 터뜨리기](https://www.acmicpc.net/problem/2346) |
-| | [15649](https://www.acmicpc.net/problem/15649) | [N과 M (1)](https://www.acmicpc.net/problem/15649) |
-| | [2168](https://www.acmicpc.net/problem/2168) | [타일 위의 대각선](https://www.acmicpc.net/problem/2168) |
-| | [2178](https://www.acmicpc.net/problem/2178) | [미로 탐색](https://www.acmicpc.net/problem/2178) |
-
-## 2021/11/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1874](https://www.acmicpc.net/problem/1874) | [스택 수열](https://www.acmicpc.net/problem/1874) |
-| | [15650](https://www.acmicpc.net/problem/15650) | [N과 M (2)](https://www.acmicpc.net/problem/15650) |
-| | [15651](https://www.acmicpc.net/problem/15651) | [N과 M (3)](https://www.acmicpc.net/problem/15651) |
-| | [2294](https://www.acmicpc.net/problem/2294) | [동전 2](https://www.acmicpc.net/problem/2294) |
-
-## 2021/11/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1699](https://www.acmicpc.net/problem/1699) | [제곱수의 합](https://www.acmicpc.net/problem/1699) |
-| | [2302](https://www.acmicpc.net/problem/2302) | [극장 좌석](https://www.acmicpc.net/problem/2302) |
-| | [2343](https://www.acmicpc.net/problem/2343) | [기타 레슨](https://www.acmicpc.net/problem/2343) |
-| | [2531](https://www.acmicpc.net/problem/2531) | [회전 초밥](https://www.acmicpc.net/problem/2531) |
-
-## 2021/11/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1654](https://www.acmicpc.net/problem/1654) | [랜선 자르기](https://www.acmicpc.net/problem/1654) |
-| | [2553](https://www.acmicpc.net/problem/2553) | [마지막 팩토리얼 수](https://www.acmicpc.net/problem/2553) |
-| | [1025](https://www.acmicpc.net/problem/1025) | [제곱수 찾기](https://www.acmicpc.net/problem/1025) |
-| | [1034](https://www.acmicpc.net/problem/1034) | [램프](https://www.acmicpc.net/problem/1034) |
-
-## 2021/11/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1503](https://www.acmicpc.net/problem/1503) | [세 수 고르기](https://www.acmicpc.net/problem/1503) |
-| | [15652](https://www.acmicpc.net/problem/15652) | [N과 M (4)](https://www.acmicpc.net/problem/15652) |
-| | [2565](https://www.acmicpc.net/problem/2565) | [전깃줄](https://www.acmicpc.net/problem/2565) |
-| | [1038](https://www.acmicpc.net/problem/1038) | [감소하는 수](https://www.acmicpc.net/problem/1038) |
-
-## 2021/11/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1487](https://www.acmicpc.net/problem/1487) | [물건 팔기](https://www.acmicpc.net/problem/1487) |
-| | [2583](https://www.acmicpc.net/problem/2583) | [영역 구하기](https://www.acmicpc.net/problem/2583) |
-| | [1068](https://www.acmicpc.net/problem/1068) | [트리](https://www.acmicpc.net/problem/1068) |
-| | [1092](https://www.acmicpc.net/problem/1092) | [배](https://www.acmicpc.net/problem/1092) |
-
-## 2021/11/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1463](https://www.acmicpc.net/problem/1463) | [1로 만들기](https://www.acmicpc.net/problem/1463) |
-| | [15654](https://www.acmicpc.net/problem/15654) | [N과 M (5)](https://www.acmicpc.net/problem/15654) |
-| | [3005](https://www.acmicpc.net/problem/3005) | [크로스워드 퍼즐 쳐다보기](https://www.acmicpc.net/problem/3005) |
-| | [1107](https://www.acmicpc.net/problem/1107) | [리모컨](https://www.acmicpc.net/problem/1107) |
-
-## 2021/11/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1283](https://www.acmicpc.net/problem/1283) | [단축키 지정](https://www.acmicpc.net/problem/1283) |
-| | [2667](https://www.acmicpc.net/problem/2667) | [단지번호붙이기](https://www.acmicpc.net/problem/2667) |
-| | [1188](https://www.acmicpc.net/problem/1188) | [음식 평론가](https://www.acmicpc.net/problem/1188) |
-| | [1405](https://www.acmicpc.net/problem/1405) | [미친 로봇](https://www.acmicpc.net/problem/1405) |
-
-## 2021/11/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1166](https://www.acmicpc.net/problem/1166) | [선물](https://www.acmicpc.net/problem/1166) |
-| | [15655](https://www.acmicpc.net/problem/15655) | [N과 M (6)](https://www.acmicpc.net/problem/15655) |
-| | [15656](https://www.acmicpc.net/problem/15656) | [N과 M (7)](https://www.acmicpc.net/problem/15656) |
-| | [1759](https://www.acmicpc.net/problem/1759) | [암호 만들기](https://www.acmicpc.net/problem/1759) |
-
-## 2021/11/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1072](https://www.acmicpc.net/problem/1072) | [게임](https://www.acmicpc.net/problem/1072) |
-| | [15657](https://www.acmicpc.net/problem/15657) | [N과 M (8)](https://www.acmicpc.net/problem/15657) |
-| | [1916](https://www.acmicpc.net/problem/1916) | [최소비용 구하기](https://www.acmicpc.net/problem/1916) |
-| | [2023](https://www.acmicpc.net/problem/2023) | [신기한 소수](https://www.acmicpc.net/problem/2023) |
-
-## 2021/11/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1003](https://www.acmicpc.net/problem/1003) | [피보나치 함수](https://www.acmicpc.net/problem/1003) |
-| | [15728](https://www.acmicpc.net/problem/15728) | [에리 - 카드](https://www.acmicpc.net/problem/15728) |
-| | [16508](https://www.acmicpc.net/problem/16508) | [전공책](https://www.acmicpc.net/problem/16508) |
-| | [2073](https://www.acmicpc.net/problem/2073) | [수도배관공사](https://www.acmicpc.net/problem/2073) |
-
-## 2021/11/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20436](https://www.acmicpc.net/problem/20436) | [ZOAC 3](https://www.acmicpc.net/problem/20436) |
-| | [20291](https://www.acmicpc.net/problem/20291) | [파일 정리](https://www.acmicpc.net/problem/20291) |
-| | [2075](https://www.acmicpc.net/problem/2075) | [N번째 큰 수](https://www.acmicpc.net/problem/2075) |
-| | [2194](https://www.acmicpc.net/problem/2194) | [유닛 이동시키기](https://www.acmicpc.net/problem/2194) |
-
-## 2021/11/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [19844](https://www.acmicpc.net/problem/19844) | [단어 개수 세기](https://www.acmicpc.net/problem/19844) |
-| | [2212](https://www.acmicpc.net/problem/2212) | [센서](https://www.acmicpc.net/problem/2212) |
-| | [2225](https://www.acmicpc.net/problem/2225) | [합분해](https://www.acmicpc.net/problem/2225) |
-| | [2228](https://www.acmicpc.net/problem/2228) | [구간 나누기](https://www.acmicpc.net/problem/2228) |
-
-## 2021/11/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11561](https://www.acmicpc.net/problem/11561) | [징검다리](https://www.acmicpc.net/problem/11561) |
-| | [16922](https://www.acmicpc.net/problem/16922) | [로마 숫자 만들기](https://www.acmicpc.net/problem/16922) |
-| | [2229](https://www.acmicpc.net/problem/2229) | [조 짜기](https://www.acmicpc.net/problem/2229) |
-| | [2230](https://www.acmicpc.net/problem/2230) | [수 고르기](https://www.acmicpc.net/problem/2230) |
-
-## 2021/11/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [17626](https://www.acmicpc.net/problem/17626) | [Four Squares](https://www.acmicpc.net/problem/17626) |
-| | [16956](https://www.acmicpc.net/problem/16956) | [늑대와 양](https://www.acmicpc.net/problem/16956) |
-| | [3079](https://www.acmicpc.net/problem/3079) | [입국심사](https://www.acmicpc.net/problem/3079) |
-| | [2436](https://www.acmicpc.net/problem/2436) | [공약수](https://www.acmicpc.net/problem/2436) |
-
-## 2021/11/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11502](https://www.acmicpc.net/problem/11502) | [세 개의 소수 문제](https://www.acmicpc.net/problem/11502) |
-| | [17124](https://www.acmicpc.net/problem/17124) | [두 개의 배열](https://www.acmicpc.net/problem/17124) |
-| | [20116](https://www.acmicpc.net/problem/20116) | [상자의 균형](https://www.acmicpc.net/problem/20116) |
-| | [2467](https://www.acmicpc.net/problem/2467) | [용액](https://www.acmicpc.net/problem/2467) |
-
-## 2021/11/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16960](https://www.acmicpc.net/problem/16960) | [스위치와 램프](https://www.acmicpc.net/problem/16960) |
-| | [17615](https://www.acmicpc.net/problem/17615) | [볼 모으기](https://www.acmicpc.net/problem/17615) |
-| | [2470](https://www.acmicpc.net/problem/2470) | [두 용액](https://www.acmicpc.net/problem/2470) |
-| | [2493](https://www.acmicpc.net/problem/2493) | [탑](https://www.acmicpc.net/problem/2493) |
-
-## 2021/11/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15270](https://www.acmicpc.net/problem/15270) | [친구 팰린드롬](https://www.acmicpc.net/problem/15270) |
-| | [2589](https://www.acmicpc.net/problem/2589) | [보물섬](https://www.acmicpc.net/problem/2589) |
-| | [2624](https://www.acmicpc.net/problem/2624) | [동전 바꿔주기](https://www.acmicpc.net/problem/2624) |
-| | [2631](https://www.acmicpc.net/problem/2631) | [줄세우기](https://www.acmicpc.net/problem/2631) |
-
-## 2021/11/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16951](https://www.acmicpc.net/problem/16951) | [블록 놀이](https://www.acmicpc.net/problem/16951) |
-| | [2636](https://www.acmicpc.net/problem/2636) | [치즈](https://www.acmicpc.net/problem/2636) |
-| | [2660](https://www.acmicpc.net/problem/2660) | [회장뽑기](https://www.acmicpc.net/problem/2660) |
-| | [2668](https://www.acmicpc.net/problem/2668) | [숫자고르기](https://www.acmicpc.net/problem/2668) |
-
-## 2021/11/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16439](https://www.acmicpc.net/problem/16439) | [치킨치킨치킨](https://www.acmicpc.net/problem/16439) |
-| | [17175](https://www.acmicpc.net/problem/17175) | [피보나치는 지겨웡~](https://www.acmicpc.net/problem/17175) |
-| | [17276](https://www.acmicpc.net/problem/17276) | [배열 돌리기](https://www.acmicpc.net/problem/17276) |
-| | [2671](https://www.acmicpc.net/problem/2671) | [잠수함식별](https://www.acmicpc.net/problem/2671) |
-
-## 2021/11/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2792](https://www.acmicpc.net/problem/2792) | [보석 상자](https://www.acmicpc.net/problem/2792) |
-| | [18404](https://www.acmicpc.net/problem/18404) | [현명한 나이트](https://www.acmicpc.net/problem/18404) |
-| | [2688](https://www.acmicpc.net/problem/2688) | [줄어들지 않아](https://www.acmicpc.net/problem/2688) |
-| | [2866](https://www.acmicpc.net/problem/2866) | [문자열 잘라내기](https://www.acmicpc.net/problem/2866) |
-
-## 2021/11/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16162](https://www.acmicpc.net/problem/16162) | [가희와 3단 고음](https://www.acmicpc.net/problem/16162) |
-| | [17216](https://www.acmicpc.net/problem/17216) | [가장 큰 감소 부분 수열](https://www.acmicpc.net/problem/17216) |
-| | [1022](https://www.acmicpc.net/problem/1022) | [소용돌이 예쁘게 출력하기](https://www.acmicpc.net/problem/1022) |
-| | [1043](https://www.acmicpc.net/problem/1043) | [거짓말](https://www.acmicpc.net/problem/1043) |
-
-## 2021/11/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15970](https://www.acmicpc.net/problem/15970) | [화살표 그리기](https://www.acmicpc.net/problem/15970) |
-| | [1062](https://www.acmicpc.net/problem/1062) | [가르침](https://www.acmicpc.net/problem/1062) |
-| | [1082](https://www.acmicpc.net/problem/1082) | [방 번호](https://www.acmicpc.net/problem/1082) |
-| | [1197](https://www.acmicpc.net/problem/1197) | [최소 스패닝 트리](https://www.acmicpc.net/problem/1197) |
-
-## 2021/11/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [13413](https://www.acmicpc.net/problem/13413) | [오셀로 재배치](https://www.acmicpc.net/problem/13413) |
-| | [17212](https://www.acmicpc.net/problem/17212) | [달나라 토끼를 위한 구매대금 지불 도우미](https://www.acmicpc.net/problem/17212) |
-| | [1990](https://www.acmicpc.net/problem/1990) | [소수인팰린드롬](https://www.acmicpc.net/problem/1990) |
-| | [1261](https://www.acmicpc.net/problem/1261) | [알고스팟](https://www.acmicpc.net/problem/1261) |
-
-## 2021/11/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11508](https://www.acmicpc.net/problem/11508) | [2+1 세일](https://www.acmicpc.net/problem/11508) |
-| | [18222](https://www.acmicpc.net/problem/18222) | [투에-모스 문자열](https://www.acmicpc.net/problem/18222) |
-| | [17085](https://www.acmicpc.net/problem/17085) | [십자가 2개 놓기](https://www.acmicpc.net/problem/17085) |
-| | [1277](https://www.acmicpc.net/problem/1277) | [발전소 설치](https://www.acmicpc.net/problem/1277) |
-
-## 2021/11/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10866](https://www.acmicpc.net/problem/10866) | [덱](https://www.acmicpc.net/problem/10866) |
-| | [2824](https://www.acmicpc.net/problem/2824) | [최대공약수](https://www.acmicpc.net/problem/2824) |
-| | [3067](https://www.acmicpc.net/problem/3067) | [Coins](https://www.acmicpc.net/problem/3067) |
-| | [1301](https://www.acmicpc.net/problem/1301) | [비즈 공예](https://www.acmicpc.net/problem/1301) |
-
-## 2021/11/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10845](https://www.acmicpc.net/problem/10845) | [큐](https://www.acmicpc.net/problem/10845) |
-| | [16987](https://www.acmicpc.net/problem/16987) | [계란으로 계란치기](https://www.acmicpc.net/problem/16987) |
-| | [3107](https://www.acmicpc.net/problem/3107) | [IPv6](https://www.acmicpc.net/problem/3107) |
-| | [1477](https://www.acmicpc.net/problem/1477) | [휴게소 세우기](https://www.acmicpc.net/problem/1477) |
-
-## 2021/11/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10828](https://www.acmicpc.net/problem/10828) | [스택](https://www.acmicpc.net/problem/10828) |
-| | [16953](https://www.acmicpc.net/problem/16953) | [A → B](https://www.acmicpc.net/problem/16953) |
-| | [3190](https://www.acmicpc.net/problem/3190) | [뱀](https://www.acmicpc.net/problem/3190) |
-| | [1484](https://www.acmicpc.net/problem/1484) | [다이어트](https://www.acmicpc.net/problem/1484) |
-
-## 2021/11/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [6159](https://www.acmicpc.net/problem/6159) | [코스튬 파티](https://www.acmicpc.net/problem/6159) |
-| | [16948](https://www.acmicpc.net/problem/16948) | [데스 나이트](https://www.acmicpc.net/problem/16948) |
-| | [1493](https://www.acmicpc.net/problem/1493) | [박스 채우기](https://www.acmicpc.net/problem/1493) |
-| | [1504](https://www.acmicpc.net/problem/1504) | [특정한 최단 경로](https://www.acmicpc.net/problem/1504) |
-
-## 2021/10/31
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5883](https://www.acmicpc.net/problem/5883) | [아이폰 9S](https://www.acmicpc.net/problem/5883) |
-| | [17390](https://www.acmicpc.net/problem/17390) | [이건 꼭 풀어야 해!](https://www.acmicpc.net/problem/17390) |
-| | [21315](https://www.acmicpc.net/problem/21315) | [카드 섞기](https://www.acmicpc.net/problem/21315) |
-| | [1520](https://www.acmicpc.net/problem/1520) | [내리막 길](https://www.acmicpc.net/problem/1520) |
-
-## 2021/10/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [3986](https://www.acmicpc.net/problem/3986) | [좋은 단어](https://www.acmicpc.net/problem/3986) |
-| | [17393](https://www.acmicpc.net/problem/17393) | [다이나믹 롤러](https://www.acmicpc.net/problem/17393) |
-| | [1577](https://www.acmicpc.net/problem/1577) | [도로의 개수](https://www.acmicpc.net/problem/1577) |
-| | [1647](https://www.acmicpc.net/problem/1647) | [도시 분할 계획](https://www.acmicpc.net/problem/1647) |
-
-## 2021/10/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [3085](https://www.acmicpc.net/problem/3085) | [사탕 게임](https://www.acmicpc.net/problem/3085) |
-| | [1695](https://www.acmicpc.net/problem/1695) | [팰린드롬 만들기](https://www.acmicpc.net/problem/1695) |
-| | [1707](https://www.acmicpc.net/problem/1707) | [이분 그래프](https://www.acmicpc.net/problem/1707) |
-| | [1711](https://www.acmicpc.net/problem/1711) | [직각삼각형](https://www.acmicpc.net/problem/1711) |
-
-## 2021/10/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9461](https://www.acmicpc.net/problem/9461) | [파도반 수열](https://www.acmicpc.net/problem/9461) |
-| | [16943](https://www.acmicpc.net/problem/16943) | [숫자 재배치](https://www.acmicpc.net/problem/16943) |
-| | [18405](https://www.acmicpc.net/problem/18405) | [경쟁적 전염](https://www.acmicpc.net/problem/18405) |
-| | [1715](https://www.acmicpc.net/problem/1715) | [카드 정렬하기](https://www.acmicpc.net/problem/1715) |
-
-## 2021/10/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10816](https://www.acmicpc.net/problem/10816) | [숫자 카드 2](https://www.acmicpc.net/problem/10816) |
-| | [16928](https://www.acmicpc.net/problem/16928) | [뱀과 사다리 게임](https://www.acmicpc.net/problem/16928) |
-| | [20665](https://www.acmicpc.net/problem/20665) | [독서실 거리두기](https://www.acmicpc.net/problem/20665) |
-| | [1717](https://www.acmicpc.net/problem/1717) | [집합의 표현](https://www.acmicpc.net/problem/1717) |
-
-## 2021/10/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2960](https://www.acmicpc.net/problem/2960) | [에라토스테네스의 체](https://www.acmicpc.net/problem/2960) |
-| | [1719](https://www.acmicpc.net/problem/1719) | [택배](https://www.acmicpc.net/problem/1719) |
-| | [1726](https://www.acmicpc.net/problem/1726) | [로봇](https://www.acmicpc.net/problem/1726) |
-| | [1744](https://www.acmicpc.net/problem/1744) | [수 묶기](https://www.acmicpc.net/problem/1744) |
-
-## 2021/10/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16937](https://www.acmicpc.net/problem/16937) | [두 스티커](https://www.acmicpc.net/problem/16937) |
-| | [1058](https://www.acmicpc.net/problem/1058) | [친구](https://www.acmicpc.net/problem/1058) |
-| | [20444](https://www.acmicpc.net/problem/20444) | [색종이와 가위](https://www.acmicpc.net/problem/20444) |
-| | [1749](https://www.acmicpc.net/problem/1749) | [점수따먹기](https://www.acmicpc.net/problem/1749) |
-
-## 2021/10/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10994](https://www.acmicpc.net/problem/10994) | [별 찍기 - 19](https://www.acmicpc.net/problem/10994) |
-| | [16918](https://www.acmicpc.net/problem/16918) | [봄버맨](https://www.acmicpc.net/problem/16918) |
-| | [1757](https://www.acmicpc.net/problem/1757) | [달려달려](https://www.acmicpc.net/problem/1757) |
-| | [1774](https://www.acmicpc.net/problem/1774) | [우주신과의 교감](https://www.acmicpc.net/problem/1774) |
-
-## 2021/10/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2852](https://www.acmicpc.net/problem/2852) | [NBA 농구](https://www.acmicpc.net/problem/2852) |
-| | [16564](https://www.acmicpc.net/problem/16564) | [히오스 프로게이머](https://www.acmicpc.net/problem/16564) |
-| | [1806](https://www.acmicpc.net/problem/1806) | [부분합](https://www.acmicpc.net/problem/1806) |
-| | [1915](https://www.acmicpc.net/problem/1915) | [가장 큰 정사각형](https://www.acmicpc.net/problem/1915) |
-
-## 2021/10/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [12933](https://www.acmicpc.net/problem/12933) | [오리](https://www.acmicpc.net/problem/12933) |
-| | [17413](https://www.acmicpc.net/problem/17413) | [단어 뒤집기 2](https://www.acmicpc.net/problem/17413) |
-| | [20437](https://www.acmicpc.net/problem/20437) | [문자열 게임 2](https://www.acmicpc.net/problem/20437) |
-| | [1922](https://www.acmicpc.net/problem/1922) | [네트워크 연결](https://www.acmicpc.net/problem/1922) |
-
-## 2021/10/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2847](https://www.acmicpc.net/problem/2847) | [게임을 만든 동준이](https://www.acmicpc.net/problem/2847) |
-| | [20208](https://www.acmicpc.net/problem/20208) | [진우의 민트초코우유](https://www.acmicpc.net/problem/20208) |
-| | [1939](https://www.acmicpc.net/problem/1939) | [중량제한](https://www.acmicpc.net/problem/1939) |
-| | [1956](https://www.acmicpc.net/problem/1956) | [운동](https://www.acmicpc.net/problem/1956) |
-
-## 2021/10/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2776](https://www.acmicpc.net/problem/2776) | [암기왕](https://www.acmicpc.net/problem/2776) |
-| | [17451](https://www.acmicpc.net/problem/17451) | [평행 우주](https://www.acmicpc.net/problem/17451) |
-| | [1967](https://www.acmicpc.net/problem/1967) | [트리의 지름](https://www.acmicpc.net/problem/1967) |
-| | [1976](https://www.acmicpc.net/problem/1976) | [여행 가자](https://www.acmicpc.net/problem/1976) |
-
-## 2021/10/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2729](https://www.acmicpc.net/problem/2729) | [이진수 덧셈](https://www.acmicpc.net/problem/2729) |
-| | [2469](https://www.acmicpc.net/problem/2469) | [사다리 타기](https://www.acmicpc.net/problem/2469) |
-| | [20168](https://www.acmicpc.net/problem/20168) | [골목 대장 호석 - 기능성](https://www.acmicpc.net/problem/20168) |
-| | [1987](https://www.acmicpc.net/problem/1987) | [알파벳](https://www.acmicpc.net/problem/1987) |
-
-## 2021/10/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2670](https://www.acmicpc.net/problem/2670) | [연속부분최대곱](https://www.acmicpc.net/problem/2670) |
-| | [20165](https://www.acmicpc.net/problem/20165) | [인내의 도미노 장인 호석](https://www.acmicpc.net/problem/20165) |
-| | [20166](https://www.acmicpc.net/problem/20166) | [문자열 지옥에 빠진 호석](https://www.acmicpc.net/problem/20166) |
-| | [2056](https://www.acmicpc.net/problem/2056) | [작업](https://www.acmicpc.net/problem/2056) |
-
-## 2021/10/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2217](https://www.acmicpc.net/problem/2217) | [로프](https://www.acmicpc.net/problem/2217) |
-| | [18115](https://www.acmicpc.net/problem/18115) | [카드 놓기](https://www.acmicpc.net/problem/18115) |
-| | [2115](https://www.acmicpc.net/problem/2115) | [갤러리](https://www.acmicpc.net/problem/2115) |
-| | [2151](https://www.acmicpc.net/problem/2151) | [거울 설치](https://www.acmicpc.net/problem/2151) |
-
-## 2021/10/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2164](https://www.acmicpc.net/problem/2164) | [카드2](https://www.acmicpc.net/problem/2164) |
-| | [18429](https://www.acmicpc.net/problem/18429) | [근손실](https://www.acmicpc.net/problem/18429) |
-| | [1374](https://www.acmicpc.net/problem/1374) | [강의실](https://www.acmicpc.net/problem/1374) |
-| | [2157](https://www.acmicpc.net/problem/2157) | [여행](https://www.acmicpc.net/problem/2157) |
-
-## 2021/10/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1978](https://www.acmicpc.net/problem/1978) | [소수 찾기](https://www.acmicpc.net/problem/1978) |
-| | [16507](https://www.acmicpc.net/problem/16507) | [어두운 건 무서워](https://www.acmicpc.net/problem/16507) |
-| | [18430](https://www.acmicpc.net/problem/18430) | [무기 공학](https://www.acmicpc.net/problem/18430) |
-| | [2206](https://www.acmicpc.net/problem/2206) | [벽 부수고 이동하기](https://www.acmicpc.net/problem/2206) |
-
-## 2021/10/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16401](https://www.acmicpc.net/problem/16401) | [과자 나눠주기](https://www.acmicpc.net/problem/16401) |
-| | [19948](https://www.acmicpc.net/problem/19948) | [음유시인 영재](https://www.acmicpc.net/problem/19948) |
-| | [20164](https://www.acmicpc.net/problem/20164) | [홀수 홀릭 호석](https://www.acmicpc.net/problem/20164) |
-| | [2234](https://www.acmicpc.net/problem/2234) | [성곽](https://www.acmicpc.net/problem/2234) |
-
-## 2021/10/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1940](https://www.acmicpc.net/problem/1940) | [주몽](https://www.acmicpc.net/problem/1940) |
-| | [19949](https://www.acmicpc.net/problem/19949) | [영재의 시험](https://www.acmicpc.net/problem/19949) |
-| | [1697](https://www.acmicpc.net/problem/1697) | [숨바꼭질](https://www.acmicpc.net/problem/1697) |
-| | [2239](https://www.acmicpc.net/problem/2239) | [스도쿠](https://www.acmicpc.net/problem/2239) |
-
-## 2021/10/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1920](https://www.acmicpc.net/problem/1920) | [수 찾기](https://www.acmicpc.net/problem/1920) |
-| | [1012](https://www.acmicpc.net/problem/1012) | [유기농 배추](https://www.acmicpc.net/problem/1012) |
-| | [21317](https://www.acmicpc.net/problem/21317) | [징검다리 건너기](https://www.acmicpc.net/problem/21317) |
-| | [2253](https://www.acmicpc.net/problem/2253) | [점프](https://www.acmicpc.net/problem/2253) |
-
-## 2021/10/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20551](https://www.acmicpc.net/problem/20551) | [Sort 마스터 배지훈의 후계자](https://www.acmicpc.net/problem/20551) |
-| | [1080](https://www.acmicpc.net/problem/1080) | [행렬](https://www.acmicpc.net/problem/1080) |
-| | [2285](https://www.acmicpc.net/problem/2285) | [우체국](https://www.acmicpc.net/problem/2285) |
-| | [2374](https://www.acmicpc.net/problem/2374) | [같은 수로 만들기](https://www.acmicpc.net/problem/2374) |
-
-## 2021/10/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10815](https://www.acmicpc.net/problem/10815) | [숫자 카드](https://www.acmicpc.net/problem/10815) |
-| | [1106](https://www.acmicpc.net/problem/1106) | [호텔](https://www.acmicpc.net/problem/1106) |
-| | [17485](https://www.acmicpc.net/problem/17485) | [진우의 달 여행 (Large)](https://www.acmicpc.net/problem/17485) |
-| | [2411](https://www.acmicpc.net/problem/2411) | [아이템 먹기](https://www.acmicpc.net/problem/2411) |
-
-## 2021/10/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9536](https://www.acmicpc.net/problem/9536) | [여우는 어떻게 울지?](https://www.acmicpc.net/problem/9536) |
-| | [1411](https://www.acmicpc.net/problem/1411) | [비슷한 단어](https://www.acmicpc.net/problem/1411) |
-| | [1421](https://www.acmicpc.net/problem/1421) | [나무꾼 이다솜](https://www.acmicpc.net/problem/1421) |
-| | [2448](https://www.acmicpc.net/problem/2448) | [별 찍기 - 11](https://www.acmicpc.net/problem/2448) |
-
-## 2021/10/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1895](https://www.acmicpc.net/problem/1895) | [필터](https://www.acmicpc.net/problem/1895) |
-| | [16198](https://www.acmicpc.net/problem/16198) | [에너지 모으기](https://www.acmicpc.net/problem/16198) |
-| | [2457](https://www.acmicpc.net/problem/2457) | [공주님의 정원](https://www.acmicpc.net/problem/2457) |
-| | [2458](https://www.acmicpc.net/problem/2458) | [키 순서](https://www.acmicpc.net/problem/2458) |
-
-## 2021/10/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1817](https://www.acmicpc.net/problem/1817) | [짐 챙기는 숌](https://www.acmicpc.net/problem/1817) |
-| | [2812](https://www.acmicpc.net/problem/2812) | [크게 만들기](https://www.acmicpc.net/problem/2812) |
-| | [2473](https://www.acmicpc.net/problem/2473) | [세 용액](https://www.acmicpc.net/problem/2473) |
-| | [2573](https://www.acmicpc.net/problem/2573) | [빙산](https://www.acmicpc.net/problem/2573) |
-
-## 2021/10/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1764](https://www.acmicpc.net/problem/1764) | [듣보잡](https://www.acmicpc.net/problem/1764) |
-| | [2800](https://www.acmicpc.net/problem/2800) | [괄호 제거](https://www.acmicpc.net/problem/2800) |
-| | [2580](https://www.acmicpc.net/problem/2580) | [스도쿠](https://www.acmicpc.net/problem/2580) |
-| | [2602](https://www.acmicpc.net/problem/2602) | [돌다리 건너기](https://www.acmicpc.net/problem/2602) |
-
-## 2021/10/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14501](https://www.acmicpc.net/problem/14501) | [퇴사](https://www.acmicpc.net/problem/14501) |
-| | [20117](https://www.acmicpc.net/problem/20117) | [호반우 상인의 이상한 품질 계산법](https://www.acmicpc.net/problem/20117) |
-| | [2616](https://www.acmicpc.net/problem/2616) | [소형기관차](https://www.acmicpc.net/problem/2616) |
-| | [2638](https://www.acmicpc.net/problem/2638) | [치즈](https://www.acmicpc.net/problem/2638) |
-
-## 2021/10/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1758](https://www.acmicpc.net/problem/1758) | [알바생 강호](https://www.acmicpc.net/problem/1758) |
-| | [1455](https://www.acmicpc.net/problem/1455) | [뒤집기 II](https://www.acmicpc.net/problem/1455) |
-| | [1600](https://www.acmicpc.net/problem/1600) | [말이 되고픈 원숭이](https://www.acmicpc.net/problem/1600) |
-| | [2661](https://www.acmicpc.net/problem/2661) | [좋은수열](https://www.acmicpc.net/problem/2661) |
-
-## 2021/10/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1302](https://www.acmicpc.net/problem/1302) | [베스트셀러](https://www.acmicpc.net/problem/1302) |
-| | [1535](https://www.acmicpc.net/problem/1535) | [안녕](https://www.acmicpc.net/problem/1535) |
-| | [2665](https://www.acmicpc.net/problem/2665) | [미로만들기](https://www.acmicpc.net/problem/2665) |
-| | [2758](https://www.acmicpc.net/problem/2758) | [로또](https://www.acmicpc.net/problem/2758) |
-
-## 2021/10/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1244](https://www.acmicpc.net/problem/1244) | [스위치 켜고 끄기](https://www.acmicpc.net/problem/1244) |
-| | [1541](https://www.acmicpc.net/problem/1541) | [잃어버린 괄호](https://www.acmicpc.net/problem/1541) |
-| | [17471](https://www.acmicpc.net/problem/17471) | [게리맨더링](https://www.acmicpc.net/problem/17471) |
-| | [2922](https://www.acmicpc.net/problem/2922) | [즐거운 단어](https://www.acmicpc.net/problem/2922) |
-
-## 2021/10/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1213](https://www.acmicpc.net/problem/1213) | [팰린드롬 만들기](https://www.acmicpc.net/problem/1213) |
-| | [16927](https://www.acmicpc.net/problem/16927) | [배열 돌리기 2](https://www.acmicpc.net/problem/16927) |
-| | [3055](https://www.acmicpc.net/problem/3055) | [탈출](https://www.acmicpc.net/problem/3055) |
-| | [1005](https://www.acmicpc.net/problem/1005) | [ACM Craft](https://www.acmicpc.net/problem/1005) |
-
-## 2021/09/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5766](https://www.acmicpc.net/problem/5766) | [할아버지는 유명해!](https://www.acmicpc.net/problem/5766) |
-| | [1713](https://www.acmicpc.net/problem/1713) | [후보 추천하기](https://www.acmicpc.net/problem/1713) |
-| | [17144](https://www.acmicpc.net/problem/17144) | [미세먼지 안녕!](https://www.acmicpc.net/problem/17144) |
-| | [1030](https://www.acmicpc.net/problem/1030) | [프렉탈 평면](https://www.acmicpc.net/problem/1030) |
-
-## 2021/09/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1120](https://www.acmicpc.net/problem/1120) | [문자열](https://www.acmicpc.net/problem/1120) |
-| | [20055](https://www.acmicpc.net/problem/20055) | [컨베이어 벨트 위의 로봇](https://www.acmicpc.net/problem/20055) |
-| | [17142](https://www.acmicpc.net/problem/17142) | [연구소 3](https://www.acmicpc.net/problem/17142) |
-| | [1167](https://www.acmicpc.net/problem/1167) | [트리의 지름](https://www.acmicpc.net/problem/1167) |
-
-## 2021/09/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1065](https://www.acmicpc.net/problem/1065) | [한수](https://www.acmicpc.net/problem/1065) |
-| | [17352](https://www.acmicpc.net/problem/17352) | [여러분의 다리가 되어 드리겠습니다!](https://www.acmicpc.net/problem/17352) |
-| | [17396](https://www.acmicpc.net/problem/17396) | [백도어](https://www.acmicpc.net/problem/17396) |
-| | [1238](https://www.acmicpc.net/problem/1238) | [파티](https://www.acmicpc.net/problem/1238) |
-
-## 2021/09/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1021](https://www.acmicpc.net/problem/1021) | [회전하는 큐](https://www.acmicpc.net/problem/1021) |
-| | [16195](https://www.acmicpc.net/problem/16195) | [1, 2, 3 더하기 9](https://www.acmicpc.net/problem/16195) |
-| | [19951](https://www.acmicpc.net/problem/19951) | [태상이의 훈련소 생활](https://www.acmicpc.net/problem/19951) |
-| | [1248](https://www.acmicpc.net/problem/1248) | [Guess](https://www.acmicpc.net/problem/1248) |
-
-## 2021/09/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [19939](https://www.acmicpc.net/problem/19939) | [박 터뜨리기](https://www.acmicpc.net/problem/19939) |
-| | [1660](https://www.acmicpc.net/problem/1660) | [캡틴 이다솜](https://www.acmicpc.net/problem/1660) |
-| | [17140](https://www.acmicpc.net/problem/17140) | [이차원 배열과 연산](https://www.acmicpc.net/problem/17140) |
-| | [1516](https://www.acmicpc.net/problem/1516) | [게임 개발](https://www.acmicpc.net/problem/1516) |
-
-## 2021/09/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [17521](https://www.acmicpc.net/problem/17521) | [Byte Coin](https://www.acmicpc.net/problem/17521) |
-| | [17265](https://www.acmicpc.net/problem/17265) | [나의 인생에는 수학과 함께](https://www.acmicpc.net/problem/17265) |
-| | [17135](https://www.acmicpc.net/problem/17135) | [캐슬 디펜스](https://www.acmicpc.net/problem/17135) |
-| | [1581](https://www.acmicpc.net/problem/1581) | [락스타 락동호](https://www.acmicpc.net/problem/1581) |
-
-## 2021/09/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [3273](https://www.acmicpc.net/problem/3273) | [두 수의 합](https://www.acmicpc.net/problem/3273) |
-| | [1780](https://www.acmicpc.net/problem/1780) | [종이의 개수](https://www.acmicpc.net/problem/1780) |
-| | [1753](https://www.acmicpc.net/problem/1753) | [최단경로](https://www.acmicpc.net/problem/1753) |
-| | [1595](https://www.acmicpc.net/problem/1595) | [북쪽나라의 도로](https://www.acmicpc.net/problem/1595) |
-
-## 2021/09/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [17484](https://www.acmicpc.net/problem/17484) | [진우의 달 여행 (Small)](https://www.acmicpc.net/problem/17484) |
-| | [1890](https://www.acmicpc.net/problem/1890) | [점프](https://www.acmicpc.net/problem/1890) |
-| | [17255](https://www.acmicpc.net/problem/17255) | [N으로 만들기](https://www.acmicpc.net/problem/17255) |
-| | [1613](https://www.acmicpc.net/problem/1613) | [역사](https://www.acmicpc.net/problem/1613) |
-
-## 2021/09/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9548](https://www.acmicpc.net/problem/9548) | [무제](https://www.acmicpc.net/problem/9548) |
-| | [15993](https://www.acmicpc.net/problem/15993) | [1, 2, 3 더하기 8](https://www.acmicpc.net/problem/15993) |
-| | [20159](https://www.acmicpc.net/problem/20159) | [동작 그만. 밑장 빼기냐?](https://www.acmicpc.net/problem/20159) |
-| | [1727](https://www.acmicpc.net/problem/1727) | [커플 만들기](https://www.acmicpc.net/problem/1727) |
-
-## 2021/09/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1622](https://www.acmicpc.net/problem/1622) | [공통 순열](https://www.acmicpc.net/problem/1622) |
-| | [1912](https://www.acmicpc.net/problem/1912) | [연속합](https://www.acmicpc.net/problem/1912) |
-| | [17141](https://www.acmicpc.net/problem/17141) | [연구소 2](https://www.acmicpc.net/problem/17141) |
-| | [1823](https://www.acmicpc.net/problem/1823) | [수확](https://www.acmicpc.net/problem/1823) |
-
-## 2021/09/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5347](https://www.acmicpc.net/problem/5347) | [LCM](https://www.acmicpc.net/problem/5347) |
-| | [18290](https://www.acmicpc.net/problem/18290) | [NM과 K (1)](https://www.acmicpc.net/problem/18290) |
-| | [16938](https://www.acmicpc.net/problem/16938) | [캠프 준비](https://www.acmicpc.net/problem/16938) |
-| | [1865](https://www.acmicpc.net/problem/1865) | [웜홀](https://www.acmicpc.net/problem/1865) |
-
-## 2021/09/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [17266](https://www.acmicpc.net/problem/17266) | [어두운 굴다리](https://www.acmicpc.net/problem/17266) |
-| | [21318](https://www.acmicpc.net/problem/21318) | [피아노 체조](https://www.acmicpc.net/problem/21318) |
-| | [17129](https://www.acmicpc.net/problem/17129) | [윌리암슨수액빨이딱따구리가 정보섬에 올라온 이유](https://www.acmicpc.net/problem/17129) |
-| | [1918](https://www.acmicpc.net/problem/1918) | [후위 표기식](https://www.acmicpc.net/problem/1918) |
-
-## 2021/09/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9375](https://www.acmicpc.net/problem/9375) | [패션왕 신해빈](https://www.acmicpc.net/problem/9375) |
-| | [1931](https://www.acmicpc.net/problem/1931) | [회의실 배정](https://www.acmicpc.net/problem/1931) |
-| | [16932](https://www.acmicpc.net/problem/16932) | [모양 만들기](https://www.acmicpc.net/problem/16932) |
-| | [1937](https://www.acmicpc.net/problem/1937) | [욕심쟁이 판다](https://www.acmicpc.net/problem/1937) |
-
-## 2021/09/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16435](https://www.acmicpc.net/problem/16435) | [스네이크버드](https://www.acmicpc.net/problem/16435) |
-| | [17179](https://www.acmicpc.net/problem/17179) | [케이크 자르기](https://www.acmicpc.net/problem/17179) |
-| | [17073](https://www.acmicpc.net/problem/17073) | [나무 위의 빗물](https://www.acmicpc.net/problem/17073) |
-| | [1941](https://www.acmicpc.net/problem/1941) | [소문난 칠공주](https://www.acmicpc.net/problem/1941) |
-
-## 2021/09/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16208](https://www.acmicpc.net/problem/16208) | [귀찮음](https://www.acmicpc.net/problem/16208) |
-| | [5582](https://www.acmicpc.net/problem/5582) | [공통 부분 문자열](https://www.acmicpc.net/problem/5582) |
-| | [16236](https://www.acmicpc.net/problem/16236) | [아기 상어](https://www.acmicpc.net/problem/16236) |
-| | [1943](https://www.acmicpc.net/problem/1943) | [동전 분배](https://www.acmicpc.net/problem/1943) |
-
-## 2021/09/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14467](https://www.acmicpc.net/problem/14467) | [소가 길을 건너간 이유 1](https://www.acmicpc.net/problem/14467) |
-| | [17070](https://www.acmicpc.net/problem/17070) | [파이프 옮기기 1](https://www.acmicpc.net/problem/17070) |
-| | [17208](https://www.acmicpc.net/problem/17208) | [카우버거 알바생](https://www.acmicpc.net/problem/17208) |
-| | [1958](https://www.acmicpc.net/problem/1958) | [LCS 3](https://www.acmicpc.net/problem/1958) |
-
-## 2021/09/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [12871](https://www.acmicpc.net/problem/12871) | [무한 문자열](https://www.acmicpc.net/problem/12871) |
-| | [17406](https://www.acmicpc.net/problem/17406) | [배열 돌리기 4](https://www.acmicpc.net/problem/17406) |
-| | [18427](https://www.acmicpc.net/problem/18427) | [함께 블록 쌓기](https://www.acmicpc.net/problem/18427) |
-| | [2109](https://www.acmicpc.net/problem/2109) | [순회강연](https://www.acmicpc.net/problem/2109) |
-
-## 2021/09/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [12782](https://www.acmicpc.net/problem/12782) | [비트 우정지수](https://www.acmicpc.net/problem/12782) |
-| | [17069](https://www.acmicpc.net/problem/17069) | [파이프 옮기기 2](https://www.acmicpc.net/problem/17069) |
-| | [20056](https://www.acmicpc.net/problem/20056) | [마법사 상어와 파이어볼](https://www.acmicpc.net/problem/20056) |
-| | [2026](https://www.acmicpc.net/problem/2026) | [소풍](https://www.acmicpc.net/problem/2026) |
-
-## 2021/09/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11728](https://www.acmicpc.net/problem/11728) | [배열 합치기](https://www.acmicpc.net/problem/11728) |
-| | [1965](https://www.acmicpc.net/problem/1965) | [상자넣기](https://www.acmicpc.net/problem/1965) |
-| | [2138](https://www.acmicpc.net/problem/2138) | [전구와 스위치](https://www.acmicpc.net/problem/2138) |
-| | [2143](https://www.acmicpc.net/problem/2143) | [두 배열의 합](https://www.acmicpc.net/problem/2143) |
-
-## 2021/09/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11256](https://www.acmicpc.net/problem/11256) | [사탕](https://www.acmicpc.net/problem/11256) |
-| | [2504](https://www.acmicpc.net/problem/2504) | [괄호의 값](https://www.acmicpc.net/problem/2504) |
-| | [15992](https://www.acmicpc.net/problem/15992) | [1, 2, 3 더하기 7](https://www.acmicpc.net/problem/15992) |
-| | [2058](https://www.acmicpc.net/problem/2058) | [원자의 에너지](https://www.acmicpc.net/problem/2058) |
-
-## 2021/09/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9655](https://www.acmicpc.net/problem/9655) | [돌 게임](https://www.acmicpc.net/problem/9655) |
-| | [16235](https://www.acmicpc.net/problem/16235) | [나무 재테크](https://www.acmicpc.net/problem/16235) |
-| | [20040](https://www.acmicpc.net/problem/20040) | [사이클 게임](https://www.acmicpc.net/problem/20040) |
-| | [2146](https://www.acmicpc.net/problem/2146) | [다리 만들기](https://www.acmicpc.net/problem/2146) |
-
-## 2021/09/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5671](https://www.acmicpc.net/problem/5671) | [호텔 방 번호](https://www.acmicpc.net/problem/5671) |
-| | [21314](https://www.acmicpc.net/problem/21314) | [민겸 수](https://www.acmicpc.net/problem/21314) |
-| | [19542](https://www.acmicpc.net/problem/19542) | [전단지 돌리기](https://www.acmicpc.net/problem/19542) |
-| | [2263](https://www.acmicpc.net/problem/2263) | [트리의 순회](https://www.acmicpc.net/problem/2263) |
-
-## 2021/09/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5568](https://www.acmicpc.net/problem/5568) | [카드 놓기](https://www.acmicpc.net/problem/5568) |
-| | [15990](https://www.acmicpc.net/problem/15990) | [1, 2, 3 더하기 5](https://www.acmicpc.net/problem/15990) |
-| | [16202](https://www.acmicpc.net/problem/16202) | [MST 게임](https://www.acmicpc.net/problem/16202) |
-| | [1507](https://www.acmicpc.net/problem/1507) | [궁금한 민호](https://www.acmicpc.net/problem/1507) |
-
-## 2021/09/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14405](https://www.acmicpc.net/problem/14405) | [피카츄](https://www.acmicpc.net/problem/14405) |
-| | [15991](https://www.acmicpc.net/problem/15991) | [1, 2, 3 더하기 6](https://www.acmicpc.net/problem/15991) |
-| | [5569](https://www.acmicpc.net/problem/5569) | [출근 경로](https://www.acmicpc.net/problem/5569) |
-| | [2406](https://www.acmicpc.net/problem/2406) | [안정적인 네트워크](https://www.acmicpc.net/problem/2406) |
-
-## 2021/09/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14916](https://www.acmicpc.net/problem/14916) | [거스름돈](https://www.acmicpc.net/problem/14916) |
-| | [1633](https://www.acmicpc.net/problem/1633) | [최고의 팀 만들기](https://www.acmicpc.net/problem/1633) |
-| | [16973](https://www.acmicpc.net/problem/16973) | [직사각형 탈출](https://www.acmicpc.net/problem/16973) |
-| | [2412](https://www.acmicpc.net/problem/2412) | [암벽 등반](https://www.acmicpc.net/problem/2412) |
-
-## 2021/09/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5534](https://www.acmicpc.net/problem/5534) | [간판](https://www.acmicpc.net/problem/5534) |
-| | [2529](https://www.acmicpc.net/problem/2529) | [부등호](https://www.acmicpc.net/problem/2529) |
-| | [16168](https://www.acmicpc.net/problem/16168) | [퍼레이드](https://www.acmicpc.net/problem/16168) |
-| | [2533](https://www.acmicpc.net/problem/2533) | [사회망 서비스(SNS)](https://www.acmicpc.net/problem/2533) |
-
-## 2021/09/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4396](https://www.acmicpc.net/problem/4396) | [지뢰 찾기](https://www.acmicpc.net/problem/4396) |
-| | [1325](https://www.acmicpc.net/problem/1325) | [효율적인 해킹](https://www.acmicpc.net/problem/1325) |
-| | [2644](https://www.acmicpc.net/problem/2644) | [촌수계산](https://www.acmicpc.net/problem/2644) |
-| | [2571](https://www.acmicpc.net/problem/2571) | [색종이 - 3](https://www.acmicpc.net/problem/2571) |
-
-## 2021/09/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4134](https://www.acmicpc.net/problem/4134) | [다음 소수](https://www.acmicpc.net/problem/4134) |
-| | [2876](https://www.acmicpc.net/problem/2876) | [그래픽스 퀴즈](https://www.acmicpc.net/problem/2876) |
-| | [20057](https://www.acmicpc.net/problem/20057) | [마법사 상어와 토네이도](https://www.acmicpc.net/problem/20057) |
-| | [3108](https://www.acmicpc.net/problem/3108) | [로고](https://www.acmicpc.net/problem/3108) |
-
-## 2021/09/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [3613](https://www.acmicpc.net/problem/3613) | [Java vs C++](https://www.acmicpc.net/problem/3613) |
-| | [15989](https://www.acmicpc.net/problem/15989) | [1, 2, 3 더하기 4](https://www.acmicpc.net/problem/15989) |
-| | [1747](https://www.acmicpc.net/problem/1747) | [소수&팰린드롬](https://www.acmicpc.net/problem/1747) |
-| | [3673](https://www.acmicpc.net/problem/3673) | [나눌 수 있는 부분 수열](https://www.acmicpc.net/problem/3673) |
-
-## 2021/09/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2941](https://www.acmicpc.net/problem/2941) | [크로아티아 알파벳](https://www.acmicpc.net/problem/2941) |
-| | [15900](https://www.acmicpc.net/problem/15900) | [나무 탈출](https://www.acmicpc.net/problem/15900) |
-| | [14945](https://www.acmicpc.net/problem/14945) | [불장난](https://www.acmicpc.net/problem/14945) |
-| | [14391](https://www.acmicpc.net/problem/14391) | [종이 조각](https://www.acmicpc.net/problem/14391) |
-
-## 2021/08/31
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2635](https://www.acmicpc.net/problem/2635) | [수 이어가기](https://www.acmicpc.net/problem/2635) |
-| | [18352](https://www.acmicpc.net/problem/18352) | [특정 거리의 도시 찾기](https://www.acmicpc.net/problem/18352) |
-| | [18234](https://www.acmicpc.net/problem/18234) | [당근 훔쳐 먹기](https://www.acmicpc.net/problem/18234) |
-| | [13459](https://www.acmicpc.net/problem/13459) | [구슬 탈출](https://www.acmicpc.net/problem/13459) |
-
-## 2021/08/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2609](https://www.acmicpc.net/problem/2609) | [최대공약수와 최소공배수](https://www.acmicpc.net/problem/2609) |
-| | [15886](https://www.acmicpc.net/problem/15886) | [내 선물을 받아줘 2](https://www.acmicpc.net/problem/15886) |
-| | [14938](https://www.acmicpc.net/problem/14938) | [서강그라운드](https://www.acmicpc.net/problem/14938) |
-| | [14442](https://www.acmicpc.net/problem/14442) | [벽 부수고 이동하기 2](https://www.acmicpc.net/problem/14442) |
-
-## 2021/08/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2581](https://www.acmicpc.net/problem/2581) | [소수](https://www.acmicpc.net/problem/2581) |
-| | [13913](https://www.acmicpc.net/problem/13913) | [숨바꼭질 4](https://www.acmicpc.net/problem/13913) |
-| | [14923](https://www.acmicpc.net/problem/14923) | [미로 탈출](https://www.acmicpc.net/problem/14923) |
-| | [14621](https://www.acmicpc.net/problem/14621) | [나만 안되는 연애](https://www.acmicpc.net/problem/14621) |
-
-## 2021/08/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2578](https://www.acmicpc.net/problem/2578) | [빙고](https://www.acmicpc.net/problem/2578) |
-| | [15661](https://www.acmicpc.net/problem/15661) | [링크와 스타트](https://www.acmicpc.net/problem/15661) |
-| | [15724](https://www.acmicpc.net/problem/15724) | [주지수](https://www.acmicpc.net/problem/15724) |
-| | [13418](https://www.acmicpc.net/problem/13418) | [학교 탐방하기](https://www.acmicpc.net/problem/13418) |
-
-## 2021/08/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2503](https://www.acmicpc.net/problem/2503) | [숫자 야구](https://www.acmicpc.net/problem/2503) |
-| | [18113](https://www.acmicpc.net/problem/18113) | [그르다 김가놈](https://www.acmicpc.net/problem/18113) |
-| | [18243](https://www.acmicpc.net/problem/18243) | [Small World Network](https://www.acmicpc.net/problem/18243) |
-| | [12908](https://www.acmicpc.net/problem/12908) | [텔레포트 3](https://www.acmicpc.net/problem/12908) |
-
-## 2021/08/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2435](https://www.acmicpc.net/problem/2435) | [기상청 인턴 신현수](https://www.acmicpc.net/problem/2435) |
-| | [17829](https://www.acmicpc.net/problem/17829) | [222-풀링](https://www.acmicpc.net/problem/17829) |
-| | [2141](https://www.acmicpc.net/problem/2141) | [우체국](https://www.acmicpc.net/problem/2141) |
-| | [15659](https://www.acmicpc.net/problem/15659) | [연산자 끼워넣기 (3)](https://www.acmicpc.net/problem/15659) |
-
-## 2021/08/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2422](https://www.acmicpc.net/problem/2422) | [한윤정이 이탈리아에 가서 아이스크림을 사먹는데](https://www.acmicpc.net/problem/2422) |
-| | [15566](https://www.acmicpc.net/problem/15566) | [개구리 1](https://www.acmicpc.net/problem/15566) |
-| | [13905](https://www.acmicpc.net/problem/13905) | [세부](https://www.acmicpc.net/problem/13905) |
-| | [15789](https://www.acmicpc.net/problem/15789) | [CTP 왕국은 한솔 왕국을 이길 수 있을까?](https://www.acmicpc.net/problem/15789) |
-
-## 2021/08/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2428](https://www.acmicpc.net/problem/2428) | [표절](https://www.acmicpc.net/problem/2428) |
-| | [18353](https://www.acmicpc.net/problem/18353) | [병사 배치하기](https://www.acmicpc.net/problem/18353) |
-| | [20365](https://www.acmicpc.net/problem/20365) | [블로그2](https://www.acmicpc.net/problem/20365) |
-| | [15823](https://www.acmicpc.net/problem/15823) | [카드 팩 구매하기](https://www.acmicpc.net/problem/15823) |
-
-## 2021/08/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2417](https://www.acmicpc.net/problem/2417) | [정수 제곱근](https://www.acmicpc.net/problem/2417) |
-| | [16926](https://www.acmicpc.net/problem/16926) | [배열 돌리기 1](https://www.acmicpc.net/problem/16926) |
-| | [16954](https://www.acmicpc.net/problem/16954) | [움직이는 미로 탈출](https://www.acmicpc.net/problem/16954) |
-| | [15831](https://www.acmicpc.net/problem/15831) | [준표의 조약돌](https://www.acmicpc.net/problem/15831) |
-
-## 2021/08/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2204](https://www.acmicpc.net/problem/2204) | [도비의 난독증 테스트](https://www.acmicpc.net/problem/2204) |
-| | [15565](https://www.acmicpc.net/problem/15565) | [귀여운 라이언](https://www.acmicpc.net/problem/15565) |
-| | [16432](https://www.acmicpc.net/problem/16432) | [떡장수와 호랑이](https://www.acmicpc.net/problem/16432) |
-| | [12896](https://www.acmicpc.net/problem/12896) | [스크루지 민호](https://www.acmicpc.net/problem/12896) |
-
-## 2021/08/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1620](https://www.acmicpc.net/problem/1620) | [나는야 포켓몬 마스터 이다솜](https://www.acmicpc.net/problem/1620) |
-| | [16234](https://www.acmicpc.net/problem/16234) | [인구 이동](https://www.acmicpc.net/problem/16234) |
-| | [13902](https://www.acmicpc.net/problem/13902) | [개업 2](https://www.acmicpc.net/problem/13902) |
-| | [16438](https://www.acmicpc.net/problem/16438) | [원숭이 스포츠](https://www.acmicpc.net/problem/16438) |
-
-## 2021/08/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [13699](https://www.acmicpc.net/problem/13699) | [점화식](https://www.acmicpc.net/problem/13699) |
-| | [10653](https://www.acmicpc.net/problem/10653) | [마라톤 2](https://www.acmicpc.net/problem/10653) |
-| | [14863](https://www.acmicpc.net/problem/14863) | [서울에서 경산까지](https://www.acmicpc.net/problem/14863) |
-| | [16562](https://www.acmicpc.net/problem/16562) | [친구비](https://www.acmicpc.net/problem/16562) |
-
-## 2021/08/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2018](https://www.acmicpc.net/problem/2018) | [수들의 합 5](https://www.acmicpc.net/problem/2018) |
-| | [12101](https://www.acmicpc.net/problem/12101) | [1, 2, 3 더하기 2](https://www.acmicpc.net/problem/12101) |
-| | [6068](https://www.acmicpc.net/problem/6068) | [시간 관리하기](https://www.acmicpc.net/problem/6068) |
-| | [16637](https://www.acmicpc.net/problem/16637) | [괄호 추가하기](https://www.acmicpc.net/problem/16637) |
-
-## 2021/08/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1969](https://www.acmicpc.net/problem/1969) | [DNA](https://www.acmicpc.net/problem/1969) |
-| | [17503](https://www.acmicpc.net/problem/17503) | [맥주 축제](https://www.acmicpc.net/problem/17503) |
-| | [14925](https://www.acmicpc.net/problem/14925) | [목장 건설하기](https://www.acmicpc.net/problem/14925) |
-| | [16971](https://www.acmicpc.net/problem/16971) | [배열 B의 값](https://www.acmicpc.net/problem/16971) |
-
-## 2021/08/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1934](https://www.acmicpc.net/problem/1934) | [최소공배수](https://www.acmicpc.net/problem/1934) |
-| | [11660](https://www.acmicpc.net/problem/11660) | [구간 합 구하기 5](https://www.acmicpc.net/problem/11660) |
-| | [18223](https://www.acmicpc.net/problem/18223) | [민준이와 마산 그리고 건우](https://www.acmicpc.net/problem/18223) |
-| | [16985](https://www.acmicpc.net/problem/16985) | [Maaaaaaaaaze](https://www.acmicpc.net/problem/16985) |
-
-## 2021/08/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1913](https://www.acmicpc.net/problem/1913) | [달팽이](https://www.acmicpc.net/problem/1913) |
-| | [20207](https://www.acmicpc.net/problem/20207) | [달력](https://www.acmicpc.net/problem/20207) |
-| | [13707](https://www.acmicpc.net/problem/13707) | [합분해 2](https://www.acmicpc.net/problem/13707) |
-| | [16986](https://www.acmicpc.net/problem/16986) | [인싸들의 가위바위보](https://www.acmicpc.net/problem/16986) |
-
-## 2021/08/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14627](https://www.acmicpc.net/problem/14627) | [파닭파닭](https://www.acmicpc.net/problem/14627) |
-| | [11568](https://www.acmicpc.net/problem/11568) | [민균이의 계략](https://www.acmicpc.net/problem/11568) |
-| | [11562](https://www.acmicpc.net/problem/11562) | [백양로 브레이크](https://www.acmicpc.net/problem/11562) |
-| | [16988](https://www.acmicpc.net/problem/16988) | [Baaaaaaaaaduk2 (Easy)](https://www.acmicpc.net/problem/16988) |
-
-## 2021/08/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10546](https://www.acmicpc.net/problem/10546) | [배부른 마라토너](https://www.acmicpc.net/problem/10546) |
-| | [16206](https://www.acmicpc.net/problem/16206) | [롤케이크](https://www.acmicpc.net/problem/16206) |
-| | [14676](https://www.acmicpc.net/problem/14676) | [영우는 사기꾼?](https://www.acmicpc.net/problem/14676) |
-| | [17616](https://www.acmicpc.net/problem/17616) | [등수 찾기](https://www.acmicpc.net/problem/17616) |
-
-## 2021/08/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20115](https://www.acmicpc.net/problem/20115) | [에너지 드링크](https://www.acmicpc.net/problem/20115) |
-| | [16139](https://www.acmicpc.net/problem/16139) | [인간-컴퓨터 상호작용](https://www.acmicpc.net/problem/16139) |
-| | [15927](https://www.acmicpc.net/problem/15927) | [회문은 회문아니야!!](https://www.acmicpc.net/problem/15927) |
-| | [18116](https://www.acmicpc.net/problem/18116) | [로봇 조립](https://www.acmicpc.net/problem/18116) |
-
-## 2021/08/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9372](https://www.acmicpc.net/problem/9372) | [상근이의 여행](https://www.acmicpc.net/problem/9372) |
-| | [11265](https://www.acmicpc.net/problem/11265) | [끝나지 않는 파티](https://www.acmicpc.net/problem/11265) |
-| | [15723](https://www.acmicpc.net/problem/15723) | [n단 논법](https://www.acmicpc.net/problem/15723) |
-| | [18500](https://www.acmicpc.net/problem/18500) | [미네랄 2](https://www.acmicpc.net/problem/18500) |
-
-## 2021/08/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1789](https://www.acmicpc.net/problem/1789) | [수들의 합](https://www.acmicpc.net/problem/1789) |
-| | [20162](https://www.acmicpc.net/problem/20162) | [간식 파티](https://www.acmicpc.net/problem/20162) |
-| | [20364](https://www.acmicpc.net/problem/20364) | [부동산 다툼](https://www.acmicpc.net/problem/20364) |
-| | [18808](https://www.acmicpc.net/problem/18808) | [스티커 붙이기](https://www.acmicpc.net/problem/18808) |
-
-## 2021/08/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1439](https://www.acmicpc.net/problem/1439) | [뒤집기](https://www.acmicpc.net/problem/1439) |
-| | [15988](https://www.acmicpc.net/problem/15988) | [1, 2, 3 더하기 3](https://www.acmicpc.net/problem/15988) |
-| | [19539](https://www.acmicpc.net/problem/19539) | [사과나무](https://www.acmicpc.net/problem/19539) |
-| | [11066](https://www.acmicpc.net/problem/11066) | [파일 합치기](https://www.acmicpc.net/problem/11066) |
-
-## 2021/08/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1436](https://www.acmicpc.net/problem/1436) | [영화감독 숌](https://www.acmicpc.net/problem/1436) |
-| | [11123](https://www.acmicpc.net/problem/11123) | [양 한마리... 양 두마리...](https://www.acmicpc.net/problem/11123) |
-| | [15686](https://www.acmicpc.net/problem/15686) | [치킨 배달](https://www.acmicpc.net/problem/15686) |
-| | [19237](https://www.acmicpc.net/problem/19237) | [어른 상어](https://www.acmicpc.net/problem/19237) |
-
-## 2021/08/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1359](https://www.acmicpc.net/problem/1359) | [복권](https://www.acmicpc.net/problem/1359) |
-| | [15810](https://www.acmicpc.net/problem/15810) | [풍선 공장](https://www.acmicpc.net/problem/15810) |
-| | [11509](https://www.acmicpc.net/problem/11509) | [풍선 맞추기](https://www.acmicpc.net/problem/11509) |
-| | [19535](https://www.acmicpc.net/problem/19535) | [ㄷㄷㄷㅈ](https://www.acmicpc.net/problem/19535) |
-
-## 2021/08/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14594](https://www.acmicpc.net/problem/14594) | [동방 프로젝트 (Small)](https://www.acmicpc.net/problem/14594) |
-| | [11057](https://www.acmicpc.net/problem/11057) | [오르막 수](https://www.acmicpc.net/problem/11057) |
-| | [17404](https://www.acmicpc.net/problem/17404) | [RGB거리 2](https://www.acmicpc.net/problem/17404) |
-| | [20327](https://www.acmicpc.net/problem/20327) | [배열 돌리기 6](https://www.acmicpc.net/problem/20327) |
-
-## 2021/08/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1343](https://www.acmicpc.net/problem/1343) | [폴리오미노](https://www.acmicpc.net/problem/1343) |
-| | [1469](https://www.acmicpc.net/problem/1469) | [숌 사이 수열](https://www.acmicpc.net/problem/1469) |
-| | [15683](https://www.acmicpc.net/problem/15683) | [감시](https://www.acmicpc.net/problem/15683) |
-| | [20442](https://www.acmicpc.net/problem/20442) | [ㅋㅋ루ㅋㅋ](https://www.acmicpc.net/problem/20442) |
-
-## 2021/08/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1316](https://www.acmicpc.net/problem/1316) | [그룹 단어 체커](https://www.acmicpc.net/problem/1316) |
-| | [9489](https://www.acmicpc.net/problem/9489) | [사촌](https://www.acmicpc.net/problem/9489) |
-| | [11404](https://www.acmicpc.net/problem/11404) | [플로이드](https://www.acmicpc.net/problem/11404) |
-| | [21277](https://www.acmicpc.net/problem/21277) | [짠돌이 호석](https://www.acmicpc.net/problem/21277) |
-
-## 2021/08/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9095](https://www.acmicpc.net/problem/9095) | [1, 2, 3 더하기](https://www.acmicpc.net/problem/9095) |
-| | [15681](https://www.acmicpc.net/problem/15681) | [트리와 쿼리](https://www.acmicpc.net/problem/15681) |
-| | [7511](https://www.acmicpc.net/problem/7511) | [소셜 네트워킹 어플리케이션](https://www.acmicpc.net/problem/7511) |
-| | [1445](https://www.acmicpc.net/problem/1445) | [일요일 아침의 데이트](https://www.acmicpc.net/problem/1445) |
-
-## 2021/08/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1251](https://www.acmicpc.net/problem/1251) | [단어 나누기](https://www.acmicpc.net/problem/1251) |
-| | [17128](https://www.acmicpc.net/problem/17128) | [소가 정보섬에 올라온 이유](https://www.acmicpc.net/problem/17128) |
-| | [5624](https://www.acmicpc.net/problem/5624) | [좋은 수](https://www.acmicpc.net/problem/5624) |
-| | [11780](https://www.acmicpc.net/problem/11780) | [플로이드 2](https://www.acmicpc.net/problem/11780) |
-
-## 2021/08/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1181](https://www.acmicpc.net/problem/1181) | [단어 정렬](https://www.acmicpc.net/problem/1181) |
-| | [5972](https://www.acmicpc.net/problem/5972) | [택배 배송](https://www.acmicpc.net/problem/5972) |
-| | [16916](https://www.acmicpc.net/problem/16916) | [부분 문자열](https://www.acmicpc.net/problem/16916) |
-| | [1561](https://www.acmicpc.net/problem/1561) | [놀이 공원](https://www.acmicpc.net/problem/1561) |
-
-## 2021/08/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [19637](https://www.acmicpc.net/problem/19637) | [IF문 좀 대신 써줘](https://www.acmicpc.net/problem/19637) |
-| | [17845](https://www.acmicpc.net/problem/17845) | [수강 과목](https://www.acmicpc.net/problem/17845) |
-| | [11657](https://www.acmicpc.net/problem/11657) | [타임머신](https://www.acmicpc.net/problem/11657) |
-| | [1655](https://www.acmicpc.net/problem/1655) | [가운데를 말해요](https://www.acmicpc.net/problem/1655) |
-
-## 2021/07/31
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1158](https://www.acmicpc.net/problem/1158) | [요세푸스 문제](https://www.acmicpc.net/problem/1158) |
-| | [11052](https://www.acmicpc.net/problem/11052) | [카드 구매하기](https://www.acmicpc.net/problem/11052) |
-| | [20002](https://www.acmicpc.net/problem/20002) | [사과나무](https://www.acmicpc.net/problem/20002) |
-| | [1766](https://www.acmicpc.net/problem/1766) | [문제집](https://www.acmicpc.net/problem/1766) |
-
-## 2021/07/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1059](https://www.acmicpc.net/problem/1059) | [좋은 구간](https://www.acmicpc.net/problem/1059) |
-| | [4095](https://www.acmicpc.net/problem/4095) | [최대 정사각형](https://www.acmicpc.net/problem/4095) |
-| | [14940](https://www.acmicpc.net/problem/14940) | [쉬운 최단거리](https://www.acmicpc.net/problem/14940) |
-| | [2211](https://www.acmicpc.net/problem/2211) | [네트워크 복구](https://www.acmicpc.net/problem/2211) |
-
-## 2021/07/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18311](https://www.acmicpc.net/problem/18311) | [왕복](https://www.acmicpc.net/problem/18311) |
-| | [3343](https://www.acmicpc.net/problem/3343) | [장미](https://www.acmicpc.net/problem/3343) |
-| | [9466](https://www.acmicpc.net/problem/9466) | [텀 프로젝트](https://www.acmicpc.net/problem/9466) |
-| | [16434](https://www.acmicpc.net/problem/16434) | [드래곤 앤 던전](https://www.acmicpc.net/problem/16434) |
-
-## 2021/07/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14425](https://www.acmicpc.net/problem/14425) | [문자열 집합](https://www.acmicpc.net/problem/14425) |
-| | [19699](https://www.acmicpc.net/problem/19699) | [소-난다!](https://www.acmicpc.net/problem/19699) |
-| | [11051](https://www.acmicpc.net/problem/11051) | [이항 계수 2](https://www.acmicpc.net/problem/11051) |
-| | [2252](https://www.acmicpc.net/problem/2252) | [줄 세우기](https://www.acmicpc.net/problem/2252) |
-
-## 2021/07/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [7795](https://www.acmicpc.net/problem/7795) | [먹을 것인가 먹힐 것인가](https://www.acmicpc.net/problem/7795) |
-| | [12026](https://www.acmicpc.net/problem/12026) | [BOJ 거리](https://www.acmicpc.net/problem/12026) |
-| | [15685](https://www.acmicpc.net/problem/15685) | [드래곤 커브](https://www.acmicpc.net/problem/15685) |
-| | [2307](https://www.acmicpc.net/problem/2307) | [도로검문](https://www.acmicpc.net/problem/2307) |
-
-## 2021/07/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1018](https://www.acmicpc.net/problem/1018) | [체스판 다시 칠하기](https://www.acmicpc.net/problem/1018) |
-| | [5549](https://www.acmicpc.net/problem/5549) | [행성 탐사](https://www.acmicpc.net/problem/5549) |
-| | [20007](https://www.acmicpc.net/problem/20007) | [떡 돌리기](https://www.acmicpc.net/problem/20007) |
-| | [2613](https://www.acmicpc.net/problem/2613) | [숫자구슬](https://www.acmicpc.net/problem/2613) |
-
-## 2021/07/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1010](https://www.acmicpc.net/problem/1010) | [다리 놓기](https://www.acmicpc.net/problem/1010) |
-| | [14888](https://www.acmicpc.net/problem/14888) | [연산자 끼워넣기](https://www.acmicpc.net/problem/14888) |
-| | [21278](https://www.acmicpc.net/problem/21278) | [호석이 두 마리 치킨](https://www.acmicpc.net/problem/21278) |
-| | [2623](https://www.acmicpc.net/problem/2623) | [음악프로그램](https://www.acmicpc.net/problem/2623) |
-
-## 2021/07/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14912](https://www.acmicpc.net/problem/14912) | [숫자 빈도수](https://www.acmicpc.net/problem/14912) |
-| | [11048](https://www.acmicpc.net/problem/11048) | [이동하기](https://www.acmicpc.net/problem/11048) |
-| | [19598](https://www.acmicpc.net/problem/19598) | [최소 회의실 개수](https://www.acmicpc.net/problem/19598) |
-| | [11054](https://www.acmicpc.net/problem/11054) | [가장 긴 바이토닉 부분 수열](https://www.acmicpc.net/problem/11054) |
-
-## 2021/07/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4659](https://www.acmicpc.net/problem/4659) | [비밀번호 발음하기](https://www.acmicpc.net/problem/4659) |
-| | [15787](https://www.acmicpc.net/problem/15787) | [기차가 어둠을 헤치고 은하수를](https://www.acmicpc.net/problem/15787) |
-| | [5430](https://www.acmicpc.net/problem/5430) | [AC](https://www.acmicpc.net/problem/5430) |
-| | [11049](https://www.acmicpc.net/problem/11049) | [행렬 곱셈 순서](https://www.acmicpc.net/problem/11049) |
-
-## 2021/07/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [6996](https://www.acmicpc.net/problem/6996) | [애너그램](https://www.acmicpc.net/problem/6996) |
-| | [11725](https://www.acmicpc.net/problem/11725) | [트리의 부모 찾기](https://www.acmicpc.net/problem/11725) |
-| | [5014](https://www.acmicpc.net/problem/5014) | [스타트링크](https://www.acmicpc.net/problem/5014) |
-| | [2629](https://www.acmicpc.net/problem/2629) | [양팔저울](https://www.acmicpc.net/problem/2629) |
-
-## 2021/07/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4096](https://www.acmicpc.net/problem/4096) | [팰린드로미터](https://www.acmicpc.net/problem/4096) |
-| | [10844](https://www.acmicpc.net/problem/10844) | [쉬운 계단 수](https://www.acmicpc.net/problem/10844) |
-| | [14921](https://www.acmicpc.net/problem/14921) | [용액 합성하기](https://www.acmicpc.net/problem/14921) |
-| | [2637](https://www.acmicpc.net/problem/2637) | [장난감 조립](https://www.acmicpc.net/problem/2637) |
-
-## 2021/07/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9933](https://www.acmicpc.net/problem/9933) | [민균이의 비밀번호](https://www.acmicpc.net/problem/9933) |
-| | [1240](https://www.acmicpc.net/problem/1240) | [노드사이의 거리](https://www.acmicpc.net/problem/1240) |
-| | [13424](https://www.acmicpc.net/problem/13424) | [비밀 모임](https://www.acmicpc.net/problem/13424) |
-| | [2696](https://www.acmicpc.net/problem/2696) | [중앙값 구하기](https://www.acmicpc.net/problem/2696) |
-
-## 2021/07/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2839](https://www.acmicpc.net/problem/2839) | [설탕 배달](https://www.acmicpc.net/problem/2839) |
-| | [2407](https://www.acmicpc.net/problem/2407) | [조합](https://www.acmicpc.net/problem/2407) |
-| | [10597](https://www.acmicpc.net/problem/10597) | [순열장난](https://www.acmicpc.net/problem/10597) |
-| | [2900](https://www.acmicpc.net/problem/2900) | [프로그램](https://www.acmicpc.net/problem/2900) |
-
-## 2021/07/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10988](https://www.acmicpc.net/problem/10988) | [팰린드롬인지 확인하기](https://www.acmicpc.net/problem/10988) |
-| | [20922](https://www.acmicpc.net/problem/20922) | [겹치는 건 싫어](https://www.acmicpc.net/problem/20922) |
-| | [14728](https://www.acmicpc.net/problem/14728) | [벼락치기](https://www.acmicpc.net/problem/14728) |
-| | [1944](https://www.acmicpc.net/problem/1944) | [복제 로봇](https://www.acmicpc.net/problem/1944) |
-
-## 2021/07/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9242](https://www.acmicpc.net/problem/9242) | [폭탄 해체](https://www.acmicpc.net/problem/9242) |
-| | [11060](https://www.acmicpc.net/problem/11060) | [점프 점프](https://www.acmicpc.net/problem/11060) |
-| | [17123](https://www.acmicpc.net/problem/17123) | [배열 놀이](https://www.acmicpc.net/problem/17123) |
-| | [3687](https://www.acmicpc.net/problem/3687) | [성냥개비](https://www.acmicpc.net/problem/3687) |
-
-## 2021/07/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4446](https://www.acmicpc.net/problem/4446) | [ROT13](https://www.acmicpc.net/problem/4446) |
-| | [15666](https://www.acmicpc.net/problem/15666) | [N과 M (12)](https://www.acmicpc.net/problem/15666) |
-| | [2447](https://www.acmicpc.net/problem/2447) | [별 찍기 - 10](https://www.acmicpc.net/problem/2447) |
-| | [11437](https://www.acmicpc.net/problem/11437) | [LCA](https://www.acmicpc.net/problem/11437) |
-
-## 2021/07/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2748](https://www.acmicpc.net/problem/2748) | [피보나치 수 2](https://www.acmicpc.net/problem/2748) |
-| | [10164](https://www.acmicpc.net/problem/10164) | [격자상의 경로](https://www.acmicpc.net/problem/10164) |
-| | [1342](https://www.acmicpc.net/problem/1342) | [행운의 문자열](https://www.acmicpc.net/problem/1342) |
-| | [17090](https://www.acmicpc.net/problem/17090) | [미로 탈출하기](https://www.acmicpc.net/problem/17090) |
-
-## 2021/07/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15489](https://www.acmicpc.net/problem/15489) | [파스칼 삼각형](https://www.acmicpc.net/problem/15489) |
-| | [4811](https://www.acmicpc.net/problem/4811) | [알약](https://www.acmicpc.net/problem/4811) |
-| | [14719](https://www.acmicpc.net/problem/14719) | [빗물](https://www.acmicpc.net/problem/14719) |
-| | [16724](https://www.acmicpc.net/problem/16724) | [피리 부는 사나이](https://www.acmicpc.net/problem/16724) |
-
-## 2021/07/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11656](https://www.acmicpc.net/problem/11656) | [접미사 배열](https://www.acmicpc.net/problem/11656) |
-| | [9205](https://www.acmicpc.net/problem/9205) | [맥주 마시면서 걸어가기](https://www.acmicpc.net/problem/9205) |
-| | [13910](https://www.acmicpc.net/problem/13910) | [개업](https://www.acmicpc.net/problem/13910) |
-| | [17136](https://www.acmicpc.net/problem/17136) | [색종이 붙이기](https://www.acmicpc.net/problem/17136) |
-
-## 2021/07/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11655](https://www.acmicpc.net/problem/11655) | [ROT13](https://www.acmicpc.net/problem/11655) |
-| | [11055](https://www.acmicpc.net/problem/11055) | [가장 큰 증가 부분 수열](https://www.acmicpc.net/problem/11055) |
-| | [14567](https://www.acmicpc.net/problem/14567) | [선수과목 (Prerequisite)](https://www.acmicpc.net/problem/14567) |
-| | [17143](https://www.acmicpc.net/problem/17143) | [낚시왕](https://www.acmicpc.net/problem/17143) |
-
-## 2021/07/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2167](https://www.acmicpc.net/problem/2167) | [2차원 배열의 합](https://www.acmicpc.net/problem/2167) |
-| | [18513](https://www.acmicpc.net/problem/18513) | [샘터](https://www.acmicpc.net/problem/18513) |
-| | [13422](https://www.acmicpc.net/problem/13422) | [도둑](https://www.acmicpc.net/problem/13422) |
-| | [17472](https://www.acmicpc.net/problem/17472) | [다리 만들기 2](https://www.acmicpc.net/problem/17472) |
-
-## 2021/07/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11399](https://www.acmicpc.net/problem/11399) | [ATM](https://www.acmicpc.net/problem/11399) |
-| | [15665](https://www.acmicpc.net/problem/15665) | [N과 M (11)](https://www.acmicpc.net/problem/15665) |
-| | [13164](https://www.acmicpc.net/problem/13164) | [행복 유치원](https://www.acmicpc.net/problem/13164) |
-| | [17837](https://www.acmicpc.net/problem/17837) | [새로운 게임 2](https://www.acmicpc.net/problem/17837) |
-
-## 2021/07/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15721](https://www.acmicpc.net/problem/15721) | [번데기](https://www.acmicpc.net/problem/15721) |
-| | [5212](https://www.acmicpc.net/problem/5212) | [지구 온난화](https://www.acmicpc.net/problem/5212) |
-| | [20058](https://www.acmicpc.net/problem/20058) | [마법사 상어와 파이어스톰](https://www.acmicpc.net/problem/20058) |
-| | [13911](https://www.acmicpc.net/problem/13911) | [집 구하기](https://www.acmicpc.net/problem/13911) |
-
-## 2021/07/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1259](https://www.acmicpc.net/problem/1259) | [팰린드롬수](https://www.acmicpc.net/problem/1259) |
-| | [11403](https://www.acmicpc.net/problem/11403) | [경로 찾기](https://www.acmicpc.net/problem/11403) |
-| | [20542](https://www.acmicpc.net/problem/20542) | [받아쓰기](https://www.acmicpc.net/problem/20542) |
-| | [19236](https://www.acmicpc.net/problem/19236) | [청소년 상어](https://www.acmicpc.net/problem/19236) |
-
-## 2021/07/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1145](https://www.acmicpc.net/problem/1145) | [적어도 대부분의 배수](https://www.acmicpc.net/problem/1145) |
-| | [11286](https://www.acmicpc.net/problem/11286) | [절댓값 힙](https://www.acmicpc.net/problem/11286) |
-| | [14503](https://www.acmicpc.net/problem/14503) | [로봇 청소기](https://www.acmicpc.net/problem/14503) |
-| | [20010](https://www.acmicpc.net/problem/20010) | [악덕 영주 혜유](https://www.acmicpc.net/problem/20010) |
-
-## 2021/07/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1449](https://www.acmicpc.net/problem/1449) | [수리공 항승](https://www.acmicpc.net/problem/1449) |
-| | [11053](https://www.acmicpc.net/problem/11053) | [가장 긴 증가하는 부분 수열](https://www.acmicpc.net/problem/11053) |
-| | [13397](https://www.acmicpc.net/problem/13397) | [구간 나누기 2](https://www.acmicpc.net/problem/13397) |
-| | [20061](https://www.acmicpc.net/problem/20061) | [모노미노도미노 2](https://www.acmicpc.net/problem/20061) |
-
-## 2021/07/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1110](https://www.acmicpc.net/problem/1110) | [더하기 사이클](https://www.acmicpc.net/problem/1110) |
-| | [17086](https://www.acmicpc.net/problem/17086) | [아기 상어 2](https://www.acmicpc.net/problem/17086) |
-| | [14502](https://www.acmicpc.net/problem/14502) | [연구소](https://www.acmicpc.net/problem/14502) |
-| | [20181](https://www.acmicpc.net/problem/20181) | [꿈틀꿈틀 호석 애벌레 - 효율성](https://www.acmicpc.net/problem/20181) |
-
-## 2021/07/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1032](https://www.acmicpc.net/problem/1032) | [명령 프롬프트](https://www.acmicpc.net/problem/1032) |
-| | [15664](https://www.acmicpc.net/problem/15664) | [N과 M (10)](https://www.acmicpc.net/problem/15664) |
-| | [14500](https://www.acmicpc.net/problem/14500) | [테트로미노](https://www.acmicpc.net/problem/14500) |
-| | [20182](https://www.acmicpc.net/problem/20182) | [골목 대장 호석 - 효율성 1](https://www.acmicpc.net/problem/20182) |
-
-## 2021/07/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14929](https://www.acmicpc.net/problem/14929) | [귀찮아 (SIB)](https://www.acmicpc.net/problem/14929) |
-| | [15558](https://www.acmicpc.net/problem/15558) | [점프 게임](https://www.acmicpc.net/problem/15558) |
-| | [16194](https://www.acmicpc.net/problem/16194) | [카드 구매하기 2](https://www.acmicpc.net/problem/16194) |
-| | [1300](https://www.acmicpc.net/problem/1300) | [K번째 수](https://www.acmicpc.net/problem/1300) |
-
-## 2021/07/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14697](https://www.acmicpc.net/problem/14697) | [방 배정하기](https://www.acmicpc.net/problem/14697) |
-| | [14712](https://www.acmicpc.net/problem/14712) | [넴모넴모 (Easy)](https://www.acmicpc.net/problem/14712) |
-| | [4358](https://www.acmicpc.net/problem/4358) | [생태학](https://www.acmicpc.net/problem/4358) |
-| | [20210](https://www.acmicpc.net/problem/20210) | [파일 탐색기](https://www.acmicpc.net/problem/20210) |
-
-## 2021/07/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2160](https://www.acmicpc.net/problem/2160) | [그림 비교](https://www.acmicpc.net/problem/2160) |
-| | [11724](https://www.acmicpc.net/problem/11724) | [연결 요소의 개수](https://www.acmicpc.net/problem/11724) |
-| | [18114](https://www.acmicpc.net/problem/18114) | [블랙 프라이데이](https://www.acmicpc.net/problem/18114) |
-| | [10942](https://www.acmicpc.net/problem/10942) | [팰린드롬?](https://www.acmicpc.net/problem/10942) |
-
-## 2021/06/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18258](https://www.acmicpc.net/problem/18258) | [큐 2](https://www.acmicpc.net/problem/18258) |
-| | [5639](https://www.acmicpc.net/problem/5639) | [이진 검색 트리](https://www.acmicpc.net/problem/5639) |
-| | [5904](https://www.acmicpc.net/problem/5904) | [Moo 게임](https://www.acmicpc.net/problem/5904) |
-| | [19566](https://www.acmicpc.net/problem/19566) | [수열의 구간 평균](https://www.acmicpc.net/problem/19566) |
-
-## 2021/06/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10798](https://www.acmicpc.net/problem/10798) | [세로읽기](https://www.acmicpc.net/problem/10798) |
-| | [20438](https://www.acmicpc.net/problem/20438) | [출석체크](https://www.acmicpc.net/problem/20438) |
-| | [13022](https://www.acmicpc.net/problem/13022) | [늑대와 올바른 단어](https://www.acmicpc.net/problem/13022) |
-| | [16571](https://www.acmicpc.net/problem/16571) | [알파 틱택토](https://www.acmicpc.net/problem/16571) |
-
-## 2021/06/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [16171](https://www.acmicpc.net/problem/16171) | [나는 친구가 적다 (Small)](https://www.acmicpc.net/problem/16171) |
-| | [14499](https://www.acmicpc.net/problem/14499) | [주사위 굴리기](https://www.acmicpc.net/problem/14499) |
-| | [12931](https://www.acmicpc.net/problem/12931) | [두 배 더하기](https://www.acmicpc.net/problem/12931) |
-| | [10711](https://www.acmicpc.net/problem/10711) | [모래성](https://www.acmicpc.net/problem/10711) |
-
-## 2021/06/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [13410](https://www.acmicpc.net/problem/13410) | [거꾸로 구구단](https://www.acmicpc.net/problem/13410) |
-| | [1182](https://www.acmicpc.net/problem/1182) | [부분수열의 합](https://www.acmicpc.net/problem/1182) |
-| | [11047](https://www.acmicpc.net/problem/11047) | [동전 0](https://www.acmicpc.net/problem/11047) |
-| | [16472](https://www.acmicpc.net/problem/16472) | [고냥이](https://www.acmicpc.net/problem/16472) |
-
-## 2021/06/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11720](https://www.acmicpc.net/problem/11720) | [숫자의 합](https://www.acmicpc.net/problem/11720) |
-| | [1074](https://www.acmicpc.net/problem/1074) | [Z](https://www.acmicpc.net/problem/1074) |
-| | [14284](https://www.acmicpc.net/problem/14284) | [간선 이어가기 2](https://www.acmicpc.net/problem/14284) |
-| | [16437](https://www.acmicpc.net/problem/16437) | [양 구출 작전](https://www.acmicpc.net/problem/16437) |
-
-## 2021/06/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [14247](https://www.acmicpc.net/problem/14247) | [나무 자르기](https://www.acmicpc.net/problem/14247) |
-| | [2304](https://www.acmicpc.net/problem/2304) | [창고 다각형](https://www.acmicpc.net/problem/2304) |
-| | [13975](https://www.acmicpc.net/problem/13975) | [파일 합치기 3](https://www.acmicpc.net/problem/13975) |
-| | [20543](https://www.acmicpc.net/problem/20543) | [폭탄 던지는 태영이](https://www.acmicpc.net/problem/20543) |
-
-## 2021/06/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10870](https://www.acmicpc.net/problem/10870) | [피보나치 수 5](https://www.acmicpc.net/problem/10870) |
-| | [13549](https://www.acmicpc.net/problem/13549) | [숨바꼭질 3](https://www.acmicpc.net/problem/13549) |
-| | [14226](https://www.acmicpc.net/problem/14226) | [이모티콘](https://www.acmicpc.net/problem/14226) |
-| | [1045](https://www.acmicpc.net/problem/1045) | [도로](https://www.acmicpc.net/problem/1045) |
-
-## 2021/06/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [6236](https://www.acmicpc.net/problem/6236) | [용돈 관리](https://www.acmicpc.net/problem/6236) |
-| | [2961](https://www.acmicpc.net/problem/2961) | [도영이가 만든 맛있는 음식](https://www.acmicpc.net/problem/2961) |
-| | [5567](https://www.acmicpc.net/problem/5567) | [결혼식](https://www.acmicpc.net/problem/5567) |
-| | [16947](https://www.acmicpc.net/problem/16947) | [서울 지하철 2호선](https://www.acmicpc.net/problem/16947) |
-
-## 2021/06/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [3040](https://www.acmicpc.net/problem/3040) | [백설 공주와 일곱 난쟁이](https://www.acmicpc.net/problem/3040) |
-| | [15658](https://www.acmicpc.net/problem/15658) | [연산자 끼워넣기 (2)](https://www.acmicpc.net/problem/15658) |
-| | [2877](https://www.acmicpc.net/problem/2877) | [4와 7](https://www.acmicpc.net/problem/2877) |
-| | [2250](https://www.acmicpc.net/problem/2250) | [트리의 높이와 너비](https://www.acmicpc.net/problem/2250) |
-
-## 2021/06/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [19532](https://www.acmicpc.net/problem/19532) | [수학은 비대면강의입니다](https://www.acmicpc.net/problem/19532) |
-| | [11722](https://www.acmicpc.net/problem/11722) | [가장 긴 감소하는 부분 수열](https://www.acmicpc.net/problem/11722) |
-| | [19641](https://www.acmicpc.net/problem/19641) | [중첩 집합 모델](https://www.acmicpc.net/problem/19641) |
-| | [1414](https://www.acmicpc.net/problem/1414) | [불우이웃돕기](https://www.acmicpc.net/problem/1414) |
-
-## 2021/06/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2798](https://www.acmicpc.net/problem/2798) | [블랙잭](https://www.acmicpc.net/problem/2798) |
-| | [3020](https://www.acmicpc.net/problem/3020) | [개똥벌레](https://www.acmicpc.net/problem/3020) |
-| | [16398](https://www.acmicpc.net/problem/16398) | [행성 연결](https://www.acmicpc.net/problem/16398) |
-| | [19645](https://www.acmicpc.net/problem/19645) | [햄최몇?](https://www.acmicpc.net/problem/19645) |
-
-## 2021/06/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20546](https://www.acmicpc.net/problem/20546) | [🐜 기적의 매매법 🐜](https://www.acmicpc.net/problem/20546) |
-| | [10971](https://www.acmicpc.net/problem/10971) | [외판원 순회 2](https://www.acmicpc.net/problem/10971) |
-| | [18232](https://www.acmicpc.net/problem/18232) | [텔레포트 정거장](https://www.acmicpc.net/problem/18232) |
-| | [15732](https://www.acmicpc.net/problem/15732) | [도토리 숨기기](https://www.acmicpc.net/problem/15732) |
-
-## 2021/06/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2745](https://www.acmicpc.net/problem/2745) | [진법 변환](https://www.acmicpc.net/problem/2745) |
-| | [19583](https://www.acmicpc.net/problem/19583) | [싸이버개강총회](https://www.acmicpc.net/problem/19583) |
-| | [17610](https://www.acmicpc.net/problem/17610) | [양팔저울](https://www.acmicpc.net/problem/17610) |
-| | [1729](https://www.acmicpc.net/problem/1729) | [이차원 배열의 합](https://www.acmicpc.net/problem/1729) |
-
-## 2021/06/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10974](https://www.acmicpc.net/problem/10974) | [모든 순열](https://www.acmicpc.net/problem/10974) |
-| | [11279](https://www.acmicpc.net/problem/11279) | [최대 힙](https://www.acmicpc.net/problem/11279) |
-| | [14496](https://www.acmicpc.net/problem/14496) | [그대, 그머가 되어](https://www.acmicpc.net/problem/14496) |
-| | [1799](https://www.acmicpc.net/problem/1799) | [비숍](https://www.acmicpc.net/problem/1799) |
-
-## 2021/06/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [21313](https://www.acmicpc.net/problem/21313) | [문어](https://www.acmicpc.net/problem/21313) |
-| | [14852](https://www.acmicpc.net/problem/14852) | [타일 채우기 3](https://www.acmicpc.net/problem/14852) |
-| | [17951](https://www.acmicpc.net/problem/17951) | [흩날리는 시험지 속에서 내 평점이 느껴진거야](https://www.acmicpc.net/problem/17951) |
-| | [1949](https://www.acmicpc.net/problem/1949) | [우수 마을](https://www.acmicpc.net/problem/1949) |
-
-## 2021/06/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20152](https://www.acmicpc.net/problem/20152) | [Game Addiction](https://www.acmicpc.net/problem/20152) |
-| | [17836](https://www.acmicpc.net/problem/17836) | [공주님을 구해라!](https://www.acmicpc.net/problem/17836) |
-| | [20440](https://www.acmicpc.net/problem/20440) | [🎵니가 싫어 싫어 너무 싫어 싫어 오지 마 내게 찝쩍대지마🎵 - 1](https://www.acmicpc.net/problem/20440) |
-| | [2213](https://www.acmicpc.net/problem/2213) | [트리의 독립집합](https://www.acmicpc.net/problem/2213) |
-
-## 2021/06/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4836](https://www.acmicpc.net/problem/4836) | [춤](https://www.acmicpc.net/problem/4836) |
-| | [7562](https://www.acmicpc.net/problem/7562) | [나이트의 이동](https://www.acmicpc.net/problem/7562) |
-| | [2224](https://www.acmicpc.net/problem/2224) | [명제 증명](https://www.acmicpc.net/problem/2224) |
-| | [2233](https://www.acmicpc.net/problem/2233) | [사과나무](https://www.acmicpc.net/problem/2233) |
-
-## 2021/06/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2309](https://www.acmicpc.net/problem/2309) | [일곱 난쟁이](https://www.acmicpc.net/problem/2309) |
-| | [14400](https://www.acmicpc.net/problem/14400) | [편의점 2](https://www.acmicpc.net/problem/14400) |
-| | [17291](https://www.acmicpc.net/problem/17291) | [새끼치기](https://www.acmicpc.net/problem/17291) |
-| | [17490](https://www.acmicpc.net/problem/17490) | [일감호에 다리 놓기](https://www.acmicpc.net/problem/17490) |
-
-## 2021/06/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10809](https://www.acmicpc.net/problem/10809) | [알파벳 찾기](https://www.acmicpc.net/problem/10809) |
-| | [6497](https://www.acmicpc.net/problem/6497) | [전력난](https://www.acmicpc.net/problem/6497) |
-| | [20955](https://www.acmicpc.net/problem/20955) | [민서의 응급 수술](https://www.acmicpc.net/problem/20955) |
-| | [15653](https://www.acmicpc.net/problem/15653) | [구슬 탈출 4](https://www.acmicpc.net/problem/15653) |
-
-## 2021/06/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20300](https://www.acmicpc.net/problem/20300) | [서강근육맨](https://www.acmicpc.net/problem/20300) |
-| | [13398](https://www.acmicpc.net/problem/13398) | [연속합 2](https://www.acmicpc.net/problem/13398) |
-| | [18866](https://www.acmicpc.net/problem/18866) | [젊은 날의 생이여](https://www.acmicpc.net/problem/18866) |
-| | [21279](https://www.acmicpc.net/problem/21279) | [광부 호석](https://www.acmicpc.net/problem/21279) |
-
-## 2021/06/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [13702](https://www.acmicpc.net/problem/13702) | [이상한 술집](https://www.acmicpc.net/problem/13702) |
-| | [12893](https://www.acmicpc.net/problem/12893) | [적의 적](https://www.acmicpc.net/problem/12893) |
-| | [13023](https://www.acmicpc.net/problem/13023) | [ABCDE](https://www.acmicpc.net/problem/13023) |
-| | [4315](https://www.acmicpc.net/problem/4315) | [나무 위의 구슬](https://www.acmicpc.net/problem/4315) |
-
-## 2021/06/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [7568](https://www.acmicpc.net/problem/7568) | [덩치](https://www.acmicpc.net/problem/7568) |
-| | [6603](https://www.acmicpc.net/problem/6603) | [로또](https://www.acmicpc.net/problem/6603) |
-| | [3151](https://www.acmicpc.net/problem/3151) | [합이 0](https://www.acmicpc.net/problem/3151) |
-| | [17822](https://www.acmicpc.net/problem/17822) | [원판 돌리기](https://www.acmicpc.net/problem/17822) |
-
-## 2021/06/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2231](https://www.acmicpc.net/problem/2231) | [분해합](https://www.acmicpc.net/problem/2231) |
-| | [14699](https://www.acmicpc.net/problem/14699) | [관악산 등산](https://www.acmicpc.net/problem/14699) |
-| | [5052](https://www.acmicpc.net/problem/5052) | [전화번호 목록](https://www.acmicpc.net/problem/5052) |
-| | [17470](https://www.acmicpc.net/problem/17470) | [배열 돌리기 5](https://www.acmicpc.net/problem/17470) |
-
-## 2021/06/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11365](https://www.acmicpc.net/problem/11365) | [!밀비 급일](https://www.acmicpc.net/problem/11365) |
-| | [10472](https://www.acmicpc.net/problem/10472) | [십자뒤집기](https://www.acmicpc.net/problem/10472) |
-| | [12865](https://www.acmicpc.net/problem/12865) | [평범한 배낭](https://www.acmicpc.net/problem/12865) |
-| | [15644](https://www.acmicpc.net/problem/15644) | [구슬 탈출 3](https://www.acmicpc.net/problem/15644) |
-
-## 2021/06/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1718](https://www.acmicpc.net/problem/1718) | [암호](https://www.acmicpc.net/problem/1718) |
-| | [10421](https://www.acmicpc.net/problem/10421) | [수식 완성하기](https://www.acmicpc.net/problem/10421) |
-| | [9007](https://www.acmicpc.net/problem/9007) | [카누 선수](https://www.acmicpc.net/problem/9007) |
-| | [20183](https://www.acmicpc.net/problem/20183) | [골목 대장 호석 - 효율성 2](https://www.acmicpc.net/problem/20183) |
-
-## 2021/06/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1668](https://www.acmicpc.net/problem/1668) | [트로피 진열](https://www.acmicpc.net/problem/1668) |
-| | [4963](https://www.acmicpc.net/problem/4963) | [섬의 개수](https://www.acmicpc.net/problem/4963) |
-| | [6087](https://www.acmicpc.net/problem/6087) | [레이저 통신](https://www.acmicpc.net/problem/6087) |
-| | [3165](https://www.acmicpc.net/problem/3165) | [5](https://www.acmicpc.net/problem/3165) |
-
-## 2021/06/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18511](https://www.acmicpc.net/problem/18511) | [큰 수 구성하기](https://www.acmicpc.net/problem/18511) |
-| | [9084](https://www.acmicpc.net/problem/9084) | [동전](https://www.acmicpc.net/problem/9084) |
-| | [10026](https://www.acmicpc.net/problem/10026) | [적록색약](https://www.acmicpc.net/problem/10026) |
-| | [20667](https://www.acmicpc.net/problem/20667) | [크롬](https://www.acmicpc.net/problem/20667) |
-
-## 2021/06/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1159](https://www.acmicpc.net/problem/1159) | [농구 경기](https://www.acmicpc.net/problem/1159) |
-| | [9663](https://www.acmicpc.net/problem/9663) | [N-Queen](https://www.acmicpc.net/problem/9663) |
-| | [20924](https://www.acmicpc.net/problem/20924) | [트리의 기둥과 가지](https://www.acmicpc.net/problem/20924) |
-| | [12764](https://www.acmicpc.net/problem/12764) | [싸지방에 간 준하](https://www.acmicpc.net/problem/12764) |
-
-## 2021/06/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1269](https://www.acmicpc.net/problem/1269) | [대칭 차집합](https://www.acmicpc.net/problem/1269) |
-| | [9251](https://www.acmicpc.net/problem/9251) | [LCS](https://www.acmicpc.net/problem/9251) |
-| | [11687](https://www.acmicpc.net/problem/11687) | [팩토리얼 0의 개수](https://www.acmicpc.net/problem/11687) |
-| | [16118](https://www.acmicpc.net/problem/16118) | [달빛 여우](https://www.acmicpc.net/problem/16118) |
-
-## 2021/06/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1543](https://www.acmicpc.net/problem/1543) | [문서 검색](https://www.acmicpc.net/problem/1543) |
-| | [11000](https://www.acmicpc.net/problem/11000) | [강의실 배정](https://www.acmicpc.net/problem/11000) |
-| | [12851](https://www.acmicpc.net/problem/12851) | [숨바꼭질 2](https://www.acmicpc.net/problem/12851) |
-| | [14725](https://www.acmicpc.net/problem/14725) | [개미굴](https://www.acmicpc.net/problem/14725) |
-
-## 2021/05/31
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1152](https://www.acmicpc.net/problem/1152) | [단어의 개수](https://www.acmicpc.net/problem/1152) |
-| | [10819](https://www.acmicpc.net/problem/10819) | [차이를 최대로](https://www.acmicpc.net/problem/10819) |
-| | [19238](https://www.acmicpc.net/problem/19238) | [스타트 택시](https://www.acmicpc.net/problem/19238) |
-| | [19581](https://www.acmicpc.net/problem/19581) | [두 번째 트리의 지름](https://www.acmicpc.net/problem/19581) |
-
-## 2021/05/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11653](https://www.acmicpc.net/problem/11653) | [소인수분해](https://www.acmicpc.net/problem/11653) |
-| | [9934](https://www.acmicpc.net/problem/9934) | [완전 이진 트리](https://www.acmicpc.net/problem/9934) |
-| | [15918](https://www.acmicpc.net/problem/15918) | [랭퍼든 수열쟁이야!!](https://www.acmicpc.net/problem/15918) |
-| | [9470](https://www.acmicpc.net/problem/9470) | [Strahler 순서](https://www.acmicpc.net/problem/9470) |
-
-## 2021/05/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1942](https://www.acmicpc.net/problem/1942) | [디지털시계](https://www.acmicpc.net/problem/1942) |
-| | [13565](https://www.acmicpc.net/problem/13565) | [침투](https://www.acmicpc.net/problem/13565) |
-| | [12757](https://www.acmicpc.net/problem/12757) | [전설의 JBNU](https://www.acmicpc.net/problem/12757) |
-| | [11085](https://www.acmicpc.net/problem/11085) | [군사 이동](https://www.acmicpc.net/problem/11085) |
-
-## 2021/05/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [6550](https://www.acmicpc.net/problem/6550) | [부분 문자열](https://www.acmicpc.net/problem/6550) |
-| | [12919](https://www.acmicpc.net/problem/12919) | [A와 B 2](https://www.acmicpc.net/problem/12919) |
-| | [14675](https://www.acmicpc.net/problem/14675) | [단절점과 단절선](https://www.acmicpc.net/problem/14675) |
-| | [8980](https://www.acmicpc.net/problem/8980) | [택배](https://www.acmicpc.net/problem/8980) |
-
-## 2021/05/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15779](https://www.acmicpc.net/problem/15779) | [Zigzag](https://www.acmicpc.net/problem/15779) |
-| | [10427](https://www.acmicpc.net/problem/10427) | [빚](https://www.acmicpc.net/problem/10427) |
-| | [10713](https://www.acmicpc.net/problem/10713) | [기차 여행](https://www.acmicpc.net/problem/10713) |
-| | [14950](https://www.acmicpc.net/problem/14950) | [정복자](https://www.acmicpc.net/problem/14950) |
-
-## 2021/05/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4949](https://www.acmicpc.net/problem/4949) | [균형잡힌 세상](https://www.acmicpc.net/problem/4949) |
-| | [7576](https://www.acmicpc.net/problem/7576) | [토마토](https://www.acmicpc.net/problem/7576) |
-| | [20495](https://www.acmicpc.net/problem/20495) | [수열과 헌팅](https://www.acmicpc.net/problem/20495) |
-| | [3665](https://www.acmicpc.net/problem/3665) | [최종 순위](https://www.acmicpc.net/problem/3665) |
-
-## 2021/05/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [21275](https://www.acmicpc.net/problem/21275) | [폰 호석만](https://www.acmicpc.net/problem/21275) |
-| | [16719](https://www.acmicpc.net/problem/16719) | [ZOAC](https://www.acmicpc.net/problem/16719) |
-| | [10986](https://www.acmicpc.net/problem/10986) | [나머지 합](https://www.acmicpc.net/problem/10986) |
-| | [7579](https://www.acmicpc.net/problem/7579) | [앱](https://www.acmicpc.net/problem/7579) |
-
-## 2021/05/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10025](https://www.acmicpc.net/problem/10025) | [게으른 백곰](https://www.acmicpc.net/problem/10025) |
-| | [9081](https://www.acmicpc.net/problem/9081) | [단어 맞추기](https://www.acmicpc.net/problem/9081) |
-| | [14267](https://www.acmicpc.net/problem/14267) | [회사 문화 1](https://www.acmicpc.net/problem/14267) |
-| | [17780](https://www.acmicpc.net/problem/17780) | [새로운 게임](https://www.acmicpc.net/problem/17780) |
-
-## 2021/05/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [11170](https://www.acmicpc.net/problem/11170) | [0의 개수](https://www.acmicpc.net/problem/11170) |
-| | [3187](https://www.acmicpc.net/problem/3187) | [양치기 꿍](https://www.acmicpc.net/problem/3187) |
-| | [4386](https://www.acmicpc.net/problem/4386) | [별자리 만들기](https://www.acmicpc.net/problem/4386) |
-| | [10159](https://www.acmicpc.net/problem/10159) | [저울](https://www.acmicpc.net/problem/10159) |
-
-## 2021/05/22
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [13019](https://www.acmicpc.net/problem/13019) | [A를 B로](https://www.acmicpc.net/problem/13019) |
-| | [14430](https://www.acmicpc.net/problem/14430) | [자원 캐기](https://www.acmicpc.net/problem/14430) |
-| | [9024](https://www.acmicpc.net/problem/9024) | [두 수의 합](https://www.acmicpc.net/problem/9024) |
-| | [1644](https://www.acmicpc.net/problem/1644) | [소수의 연속합](https://www.acmicpc.net/problem/1644) |
-
-## 2021/05/21
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [3029](https://www.acmicpc.net/problem/3029) | [경고](https://www.acmicpc.net/problem/3029) |
-| | [1260](https://www.acmicpc.net/problem/1260) | [DFS와 BFS](https://www.acmicpc.net/problem/1260) |
-| | [19622](https://www.acmicpc.net/problem/19622) | [회의실 배정 3](https://www.acmicpc.net/problem/19622) |
-| | [1368](https://www.acmicpc.net/problem/1368) | [물대기](https://www.acmicpc.net/problem/1368) |
-
-## 2021/05/20
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18312](https://www.acmicpc.net/problem/18312) | [시각](https://www.acmicpc.net/problem/18312) |
-| | [3184](https://www.acmicpc.net/problem/3184) | [양](https://www.acmicpc.net/problem/3184) |
-| | [7682](https://www.acmicpc.net/problem/7682) | [틱택토](https://www.acmicpc.net/problem/7682) |
-| | [10775](https://www.acmicpc.net/problem/10775) | [공항](https://www.acmicpc.net/problem/10775) |
-
-## 2021/05/19
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10808](https://www.acmicpc.net/problem/10808) | [알파벳 개수](https://www.acmicpc.net/problem/10808) |
-| | [1926](https://www.acmicpc.net/problem/1926) | [그림](https://www.acmicpc.net/problem/1926) |
-| | [14891](https://www.acmicpc.net/problem/14891) | [톱니바퀴](https://www.acmicpc.net/problem/14891) |
-| | [11779](https://www.acmicpc.net/problem/11779) | [최소비용 구하기 2](https://www.acmicpc.net/problem/11779) |
-
-## 2021/05/18
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [19947](https://www.acmicpc.net/problem/19947) | [투자의 귀재 배주형](https://www.acmicpc.net/problem/19947) |
-| | [5557](https://www.acmicpc.net/problem/5557) | [1학년](https://www.acmicpc.net/problem/5557) |
-| | [17779](https://www.acmicpc.net/problem/17779) | [게리맨더링 2](https://www.acmicpc.net/problem/17779) |
-| | [17398](https://www.acmicpc.net/problem/17398) | [통신망 분할](https://www.acmicpc.net/problem/17398) |
-
-## 2021/05/17
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9342](https://www.acmicpc.net/problem/9342) | [염색체](https://www.acmicpc.net/problem/9342) |
-| | [4097](https://www.acmicpc.net/problem/4097) | [수익](https://www.acmicpc.net/problem/4097) |
-| | [14248](https://www.acmicpc.net/problem/14248) | [점프 점프](https://www.acmicpc.net/problem/14248) |
-| | [2887](https://www.acmicpc.net/problem/2887) | [행성 터널](https://www.acmicpc.net/problem/2887) |
-
-## 2021/05/16
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9046](https://www.acmicpc.net/problem/9046) | [복호화](https://www.acmicpc.net/problem/9046) |
-| | [17609](https://www.acmicpc.net/problem/17609) | [회문](https://www.acmicpc.net/problem/17609) |
-| | [11985](https://www.acmicpc.net/problem/11985) | [오렌지 출하](https://www.acmicpc.net/problem/11985) |
-| | [9944](https://www.acmicpc.net/problem/9944) | [NxM 보드 완주하기](https://www.acmicpc.net/problem/9944) |
-
-## 2021/05/15
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2753](https://www.acmicpc.net/problem/2753) | [윤년](https://www.acmicpc.net/problem/2753) |
-| | [1802](https://www.acmicpc.net/problem/1802) | [종이 접기](https://www.acmicpc.net/problem/1802) |
-| | [7662](https://www.acmicpc.net/problem/7662) | [이중 우선순위 큐](https://www.acmicpc.net/problem/7662) |
-| | [10423](https://www.acmicpc.net/problem/10423) | [전기가 부족해](https://www.acmicpc.net/problem/10423) |
-
-## 2021/05/14
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4690](https://www.acmicpc.net/problem/4690) | [완전 세제곱](https://www.acmicpc.net/problem/4690) |
-| | [16935](https://www.acmicpc.net/problem/16935) | [배열 돌리기 3](https://www.acmicpc.net/problem/16935) |
-| | [11909](https://www.acmicpc.net/problem/11909) | [배열 탈출](https://www.acmicpc.net/problem/11909) |
-| | [16939](https://www.acmicpc.net/problem/16939) | [2×2×2 큐브](https://www.acmicpc.net/problem/16939) |
-
-## 2021/05/13
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5397](https://www.acmicpc.net/problem/5397) | [키로거](https://www.acmicpc.net/problem/5397) |
-| | [14716](https://www.acmicpc.net/problem/14716) | [현수막](https://www.acmicpc.net/problem/14716) |
-| | [16174](https://www.acmicpc.net/problem/16174) | [점프왕 쩰리 (Large)](https://www.acmicpc.net/problem/16174) |
-| | [15806](https://www.acmicpc.net/problem/15806) | [영우의 기숙사 청소](https://www.acmicpc.net/problem/15806) |
-
-## 2021/05/12
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5618](https://www.acmicpc.net/problem/5618) | [공약수](https://www.acmicpc.net/problem/5618) |
-| | [20950](https://www.acmicpc.net/problem/20950) | [미술가 미미](https://www.acmicpc.net/problem/20950) |
-| | [16890](https://www.acmicpc.net/problem/16890) | [창업](https://www.acmicpc.net/problem/16890) |
-| | [14657](https://www.acmicpc.net/problem/14657) | [준오는 최종인재야!!](https://www.acmicpc.net/problem/14657) |
-
-## 2021/05/11
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [21312](https://www.acmicpc.net/problem/21312) | [홀짝 칵테일](https://www.acmicpc.net/problem/21312) |
-| | [4256](https://www.acmicpc.net/problem/4256) | [트리](https://www.acmicpc.net/problem/4256) |
-| | [4933](https://www.acmicpc.net/problem/4933) | [뉴턴의 사과](https://www.acmicpc.net/problem/4933) |
-| | [20366](https://www.acmicpc.net/problem/20366) | [같이 눈사람 만들래?](https://www.acmicpc.net/problem/20366) |
-
-## 2021/05/10
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [5597](https://www.acmicpc.net/problem/5597) | [과제 안 내신 분..?](https://www.acmicpc.net/problem/5597) |
-| | [11559](https://www.acmicpc.net/problem/11559) | [Puyo Puyo](https://www.acmicpc.net/problem/11559) |
-| | [10282](https://www.acmicpc.net/problem/10282) | [해킹](https://www.acmicpc.net/problem/10282) |
-| | [2933](https://www.acmicpc.net/problem/2933) | [미네랄](https://www.acmicpc.net/problem/2933) |
-
-## 2021/05/09
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [4779](https://www.acmicpc.net/problem/4779) | [칸토어 집합](https://www.acmicpc.net/problem/4779) |
-| | [15663](https://www.acmicpc.net/problem/15663) | [N과 M (9)](https://www.acmicpc.net/problem/15663) |
-| | [6416](https://www.acmicpc.net/problem/6416) | [트리인가?](https://www.acmicpc.net/problem/6416) |
-| | [14601](https://www.acmicpc.net/problem/14601) | [샤워실 바닥 깔기 (Large)](https://www.acmicpc.net/problem/14601) |
-
-## 2021/05/08
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18512](https://www.acmicpc.net/problem/18512) | [점프 점프](https://www.acmicpc.net/problem/18512) |
-| | [14575](https://www.acmicpc.net/problem/14575) | [뒤풀이](https://www.acmicpc.net/problem/14575) |
-| | [8983](https://www.acmicpc.net/problem/8983) | [사냥꾼](https://www.acmicpc.net/problem/8983) |
-| | [6443](https://www.acmicpc.net/problem/6443) | [애너그램](https://www.acmicpc.net/problem/6443) |
-
-## 2021/05/07
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20944](https://www.acmicpc.net/problem/20944) | [팰린드롬 척화비](https://www.acmicpc.net/problem/20944) |
-| | [5547](https://www.acmicpc.net/problem/5547) | [일루미네이션](https://www.acmicpc.net/problem/5547) |
-| | [7569](https://www.acmicpc.net/problem/7569) | [토마토](https://www.acmicpc.net/problem/7569) |
-| | [9370](https://www.acmicpc.net/problem/9370) | [미확인 도착지](https://www.acmicpc.net/problem/9370) |
-
-## 2021/05/06
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10799](https://www.acmicpc.net/problem/10799) | [쇠막대기](https://www.acmicpc.net/problem/10799) |
-| | [12761](https://www.acmicpc.net/problem/12761) | [돌다리](https://www.acmicpc.net/problem/12761) |
-| | [4803](https://www.acmicpc.net/problem/4803) | [트리](https://www.acmicpc.net/problem/4803) |
-| | [7453](https://www.acmicpc.net/problem/7453) | [합이 0인 네 정수](https://www.acmicpc.net/problem/7453) |
-
-## 2021/05/05
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [10448](https://www.acmicpc.net/problem/10448) | [유레카 이론](https://www.acmicpc.net/problem/10448) |
-| | [19942](https://www.acmicpc.net/problem/19942) | [다이어트](https://www.acmicpc.net/problem/19942) |
-| | [2015](https://www.acmicpc.net/problem/2015) | [수들의 합 4](https://www.acmicpc.net/problem/2015) |
-| | [2982](https://www.acmicpc.net/problem/2982) | [국왕의 방문](https://www.acmicpc.net/problem/2982) |
-
-## 2021/05/04
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [2744](https://www.acmicpc.net/problem/2744) | [대소문자 바꾸기](https://www.acmicpc.net/problem/2744) |
-| | [4179](https://www.acmicpc.net/problem/4179) | [불!](https://www.acmicpc.net/problem/4179) |
-| | [4485](https://www.acmicpc.net/problem/4485) | [녹색 옷 입은 애가 젤다지?](https://www.acmicpc.net/problem/4485) |
-| | [6209](https://www.acmicpc.net/problem/6209) | [제자리 멀리뛰기](https://www.acmicpc.net/problem/6209) |
-
-## 2021/05/03
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [18868](https://www.acmicpc.net/problem/18868) | [멀티버스 Ⅰ](https://www.acmicpc.net/problem/18868) |
-| | [9465](https://www.acmicpc.net/problem/9465) | [스티커](https://www.acmicpc.net/problem/9465) |
-| | [14620](https://www.acmicpc.net/problem/14620) | [꽃길](https://www.acmicpc.net/problem/14620) |
-| | [4195](https://www.acmicpc.net/problem/4195) | [친구 네트워크](https://www.acmicpc.net/problem/4195) |
-
-## 2021/05/02
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9012](https://www.acmicpc.net/problem/9012) | [괄호](https://www.acmicpc.net/problem/9012) |
-| | [14722](https://www.acmicpc.net/problem/14722) | [우유 도시](https://www.acmicpc.net/problem/14722) |
-| | [15684](https://www.acmicpc.net/problem/15684) | [사다리 조작](https://www.acmicpc.net/problem/15684) |
-| | [6137](https://www.acmicpc.net/problem/6137) | [문자열 생성](https://www.acmicpc.net/problem/6137) |
-
-## 2021/05/01
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20154](https://www.acmicpc.net/problem/20154) | [이 구역의 승자는 누구야?!](https://www.acmicpc.net/problem/20154) |
-| | [2293](https://www.acmicpc.net/problem/2293) | [동전 1](https://www.acmicpc.net/problem/2293) |
-| | [21276](https://www.acmicpc.net/problem/21276) | [계보 복원가 호석](https://www.acmicpc.net/problem/21276) |
-| | [14595](https://www.acmicpc.net/problem/14595) | [동방 프로젝트 (Large)](https://www.acmicpc.net/problem/14595) |
-
-## 2021/04/30
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [1212](https://www.acmicpc.net/problem/1212) | [8진수 2진수](https://www.acmicpc.net/problem/1212) |
-| | [3980](https://www.acmicpc.net/problem/3980) | [선발 명단](https://www.acmicpc.net/problem/3980) |
-| | [14600](https://www.acmicpc.net/problem/14600) | [샤워실 바닥 깔기 (Small)](https://www.acmicpc.net/problem/14600) |
-| | [14570](https://www.acmicpc.net/problem/14570) | [나무 위의 구슬](https://www.acmicpc.net/problem/14570) |
-
-## 2021/04/29
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20053](https://www.acmicpc.net/problem/20053) | [최소, 최대 2](https://www.acmicpc.net/problem/20053) |
-| | [9421](https://www.acmicpc.net/problem/9421) | [소수상근수](https://www.acmicpc.net/problem/9421) |
-| | [14425](https://www.acmicpc.net/problem/14425) | [문자열 집합](https://www.acmicpc.net/problem/14425) |
-| | [20119](https://www.acmicpc.net/problem/20119) | [클레어와 물약](https://www.acmicpc.net/problem/20119) |
-
-## 2021/04/28
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [20114](https://www.acmicpc.net/problem/20114) | [미아 노트](https://www.acmicpc.net/problem/20114) |
-| | [6987](https://www.acmicpc.net/problem/6987) | [월드컵](https://www.acmicpc.net/problem/6987) |
-| | [9019](https://www.acmicpc.net/problem/9019) | [DSLR](https://www.acmicpc.net/problem/9019) |
-| | [14476](https://www.acmicpc.net/problem/14476) | [최대공약수 하나 빼기](https://www.acmicpc.net/problem/14476) |
-
-## 2021/04/27
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9079](https://www.acmicpc.net/problem/9079) | [동전 게임](https://www.acmicpc.net/problem/9079) |
-| | [16400](https://www.acmicpc.net/problem/16400) | [소수 화폐](https://www.acmicpc.net/problem/16400) |
-| | [3584](https://www.acmicpc.net/problem/3584) | [가장 가까운 공통 조상](https://www.acmicpc.net/problem/3584) |
-| | [1219](https://www.acmicpc.net/problem/1219) | [오민식의 고민](https://www.acmicpc.net/problem/1219) |
-
-## 2021/04/26
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [9094](https://www.acmicpc.net/problem/9094) | [수학적 호기심](https://www.acmicpc.net/problem/9094) |
-| | [5427](https://www.acmicpc.net/problem/5427) | [불](https://www.acmicpc.net/problem/5427) |
-| | [8972](https://www.acmicpc.net/problem/8972) | [미친 아두이노](https://www.acmicpc.net/problem/8972) |
-| | [13460](https://www.acmicpc.net/problem/13460) | [구슬 탈출 2](https://www.acmicpc.net/problem/13460) |
-
-## 2021/04/25
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [6118](https://www.acmicpc.net/problem/6118) | [숨바꼭질](https://www.acmicpc.net/problem/6118) |
-| | [13302](https://www.acmicpc.net/problem/13302) | [리조트](https://www.acmicpc.net/problem/13302) |
-| | [15961](https://www.acmicpc.net/problem/15961) | [회전 초밥](https://www.acmicpc.net/problem/15961) |
-| | [12978](https://www.acmicpc.net/problem/12978) | [스크루지 민호 2](https://www.acmicpc.net/problem/12978) |
-
-## 2021/04/24
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [13305](https://www.acmicpc.net/problem/13305) | [주유소](https://www.acmicpc.net/problem/13305) |
-| | [13908](https://www.acmicpc.net/problem/13908) | [비밀번호](https://www.acmicpc.net/problem/13908) |
-| | [18769](https://www.acmicpc.net/problem/18769) | [그리드 네트워크](https://www.acmicpc.net/problem/18769) |
-| | [12912](https://www.acmicpc.net/problem/12912) | [트리 수정](https://www.acmicpc.net/problem/12912) |
-
-## 2021/04/23
-
-| 난이도 | 번호 | 문제 이름 |
-|:------:|:----:|:---------:|
-| | [15486](https://www.acmicpc.net/problem/15486) | [퇴사 2](https://www.acmicpc.net/problem/15486) |
-| | [7490](https://www.acmicpc.net/problem/7490) | [0 만들기](https://www.acmicpc.net/problem/7490) |
-| | [5875](https://www.acmicpc.net/problem/5875) | [오타](https://www.acmicpc.net/problem/5875) |
-| | [18809](https://www.acmicpc.net/problem/18809) | [Gaaaaaaaaaarden](https://www.acmicpc.net/problem/18809) |
-
diff --git a/prefix_sum/README.md b/prefix_sum/README.md
deleted file mode 100644
index 7ef674f..0000000
--- a/prefix_sum/README.md
+++ /dev/null
@@ -1,49 +0,0 @@
-# Prefix Sum (누적 합)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-누적합은 단순히 이 알고리즘만 사용하는 문제보다 누적합과 다른 알고리즘을 섞어 쓰는 경우가 많습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7274)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 2167 | 2차원 배열의 합 | | 바로가기 |
-| 01 | :heavy_check_mark: | 14929 | 귀찮아 (SIB) | | 바로가기 |
-| 02 | :heavy_check_mark: | 20438 | 출석체크 | | 바로가기 |
-| 03 | :heavy_check_mark: | 11660 | 구간 합 구하기 5 | | 바로가기 |
-| 04 | :heavy_check_mark: | 21318 | 피아노 체조 | | 바로가기 |
-| 05 | :heavy_check_mark: | 2015 | 수들의 합 4 | | 바로가기 |
-| 06 | :heavy_check_mark: | 1749 | 점수따먹기 | | 바로가기 |
-| 07 | :heavy_check_mark: | 20440 | 🎵니가 싫어 싫어 너무 싫어 싫어 오지 마 내게 찝쩍대지마🎵 - 1 | | 바로가기 |
-| 08 | :heavy_check_mark: | 10986 | 나머지 합 | | 바로가기 |
-| 09 | :heavy_check_mark: | 21757 | 나누기 | | 바로가기 |
-| 10 | :heavy_check_mark: | 20543 | 폭탄 던지는 태영이 | | 바로가기 |
-| 11 | | 20116 | 상자의 균형 | | |
-| 12 | | 11659 | 구간 합 구하기 4 | | 바로가기 |
-| 13 | | 11441 | 합 구하기 | | |
-| 14 | | 17390 | 이건 꼭 풀어야 해! | | |
-| 15 | | 16139 | 인간-컴퓨터 상호작용 | | |
-| 16 | | 17123 | 배열 놀이 | | |
-| 17 | | 16507 | 어두운 건 무서워 | | |
-| 18 | | 19951 | 태상이의 훈련소 생활 | | |
-| 19 | | 10427 | 빚 | | |
-| 20 | | 10713 | 기차 여행 | | |
-| 21 | | 20002 | 사과나무 | | |
-| 22 | | 20159 | 동작 그만. 밑장 빼기냐? | | |
-| 23 | | 18866 | 젊은 날의 생이여 | | |
-| 24 | | 5549 | 행성 탐사 | | |
-| 25 | | 2571 | 색종이 - 3 | | |
-| 26 | | 3673 | 나눌 수 있는 부분 수열 | | |
-| 27 | | 5875 | 오타 | | |
-| 28 | | 16971 | 배열 B의 값 | | 바로가기 |
-| 29 | | 2900 | 프로그램 | | |
-| 30 | | 14476 | 최대공약수 하나 빼기 | | |
-| 31 | | 19566 | 수열의 구간 평균 | | |
diff --git a/prefix_sum/header.md b/prefix_sum/header.md
deleted file mode 100644
index 345ce3f..0000000
--- a/prefix_sum/header.md
+++ /dev/null
@@ -1,15 +0,0 @@
-# Prefix Sum (누적 합)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-누적합은 단순히 이 알고리즘만 사용하는 문제보다 누적합과 다른 알고리즘을 섞어 쓰는 경우가 많습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7274)
diff --git a/prefix_sum/list.md b/prefix_sum/list.md
deleted file mode 100644
index 6373399..0000000
--- a/prefix_sum/list.md
+++ /dev/null
@@ -1,32 +0,0 @@
-1,14929,./../solution/prefix_sum/14929
-1,2167,./../solution/prefix_sum/2167
-,20116,
-,11659,./../solution/prefix_sum/11659
-,11441,
-,17390,
-,16139,
-1,20438,./../solution/prefix_sum/20438
-,17123,
-1,11660,./../solution/prefix_sum/11660
-,16507,
-,19951,
-,10427,
-1,2015,./../solution/prefix_sum/2015
-,10713,
-,20002,
-,20159,
-,18866,
-1,10986,./../solution/prefix_sum/10986
-,5549,
-,2571,
-1,1749,./../solution/prefix_sum/1749
-1,20440,./../solution/prefix_sum/20440
-,3673,
-,5875,
-,14476,
-,19566,
-,16971,./../solution/prefix_sum/16971
-,2900,
-1,20543,./../solution/prefix_sum/20543
-1,21318,./../solution/prefix_sum/21318
-1,21757,./../solution/prefix_sum/21757
diff --git a/scripts/API.py b/scripts/API.py
deleted file mode 100644
index 8d85337..0000000
--- a/scripts/API.py
+++ /dev/null
@@ -1,224 +0,0 @@
-from urllib import request
-import ssl
-import json
-import atexit
-import time
-import datetime
-import pytz
-
-# ProblemId : [str] 문제 번호
-# ProblemName : [str] 문제 이름
-# ProblemTier : [int] 문제 난이도 (SolvedAC)
-# lastupdate : [float] 업데이트 로그 (ex 1618947707.736831 [minute])
-
-def changeLevel(level):
- ALPHA = [ 'B', 'S', 'G', 'P', 'D', 'R' ]
- level -= 1
- return f"{ALPHA[level // 5]}{5 - level % 5}"
-
-
-# Database + request
-class SolvedAPI:
- def __init__(self, config):
- assert type(config) == dict
- self.ssl_context = ssl._create_unverified_context()
- self.config = config
- self.database = dict()
- self.changeLevelLog = list()
-
- # Load Database
- self.__load_database()
- self.__all_update()
-
- # For saving Database
- atexit.register(self.__save_database)
- atexit.register(self.__save_change_log)
-
- def __all_update(self):
- problemList = list()
- problemIds = list(self.database.keys())
- L = 0
- R = 100
- N = len(problemIds)
-
- while L < N:
- Ids = problemIds[L : R]
- L += 100
- R += 100
- R = min(R, N)
-
- # 임시, 반드시 업데이트 해야함.
- URL = f"https://solved.ac/api/v3/problem/lookup?problemIds={','.join(Ids)}"
- req = request.Request(URL, headers = {'User-Agent': 'Mozilla/5.0'})
- response = request.urlopen(req, context=self.ssl_context)
- try:
- JSON = json.loads(response.read().decode(self.config.get('encoding')))
- except:
- assert False, "[*** API Error] Failed"
-
- for INFO in JSON:
- data = {
- "problemId": str(INFO.get('problemId')), # int -> str
- "problemLevel": INFO.get('level'),
- "problemName": INFO.get('titleKo'),
- "average_try": INFO.get('averageTries'),
- "solvedtags": list()
- }
-
- for tag in INFO.get('tags', [ ]):
- solvedtags = dict()
- for config_tags in self.config.get('solvedtags'):
- solvedtags[ config_tags ] = tag[ config_tags ]
- data['solvedtags'].append(solvedtags)
- self.saveInformation(data)
-
- def __save_change_log(self):
-
- if len(self.changeLevelLog) == 0:
- return
-
- self.changeLevelLog.append('##############################\n')
- with open("./change_level.log", "a+") as f:
- f.writelines(self.changeLevelLog)
- f.close()
-
- def __load_database(self):
- option = "database"
- File = self.config.get(option)
-
- # Must Be str (string)
- assert type(File) == str, f"[*** Config Error] Not Found {option}, Check config.json"
-
- with open(File, 'r') as f:
- self.database = json.load(f)
- f.close()
-
- def __save_database(self):
- option = "database"
- File = self.config.get(option)
-
- # Must Be str (string)
- assert type(File) == str, f"[*** Config Error] Not Found {option}, Check config.json"
-
- with open(File, 'w') as f:
- f.write(json.dumps(self.database, indent=4, ensure_ascii=False))
- f.close()
-
- # using SolvedAPI
- def __request(self, problemId):
- URL = f"{self.config['targeturl']}/{self.config['route']['problemid']}{problemId}"
- req = request.Request(URL, headers={'User-Agent': 'Mozilla/5.0'})
- response = request.urlopen(req, context=self.ssl_context)
- try:
- JSON = json.loads(response.read().decode(self.config.get('encoding')))
- except:
- assert False, "[*** API Error] Failed"
- INFO = JSON
-
- data = {
- "problemId": str(INFO.get('problemId')), # int -> str
- "problemLevel": INFO.get('level'),
- "problemName": INFO.get('titleKo'),
- "average_try": INFO.get('averageTries'),
- "solvedtags": list()
- }
-
- for tag in INFO.get('tags', [ ]):
- solvedtags = dict()
- for config_tags in self.config.get('solvedtags'):
- solvedtags[ config_tags ] = tag[ config_tags ]
- data['solvedtags'].append(solvedtags)
-
- return data
-
- # lazy update
- def request(self, problemId):
-
- if type(problemId) == int:
- problemId = str(problemId)
-
- # Check problemId Type
- assert type(problemId) == str, f"[*** Type Error] problemId type is {type(problemId)}.\n It must be string"
-
- # information : (in database)
- exist, information = self.getProblemInformation(problemId)
- if exist:
- lastupdate = information.get('lastupdate', 0.0)
-
- assert type(lastupdate) == float, "[*** Type Error] lastupdate type is {type(lastupdate)}.\n It must be float"
-
- timestamp = datetime.datetime.now(pytz.timezone('Asia/Seoul')).timestamp()
- if lastupdate + self.config.get('update') > timestamp:
- return information
-
- # update
- newData = self.__request(problemId)
- self.saveInformation(newData)
- return newData
-
- # update force
- def requestForce(self, problemId):
-
- if type(problemId) == int:
- problemId = str(problemId)
-
- # Check ProblemId Type
- assert type(problemId) == str, f"[*** Type Error] problemId type is {type(ProblemId)}.\n It must be string"
- # newData = self.__request(problemId)
- newData = self.request(problemId)
-
- exist, information = self.getProblemInformation(problemId)
-
- update = False
- updateLog = ""
- if exist:
- beforeLevel = information.get('problemLevel')
- newLevel = newData.get('problemLevel')
- if beforeLevel != newLevel:
- updateLog = f"[{problemId}] {changeLevel(beforeLevel)} -> {changeLevel(newLevel)} https://www.acmicpc.net/problem/{problemId}"
- update = True
- else:
- updateLog = f"[{problemId}] Not Exist -> {changeLevel(newLevel)} https://www.acmicpc.net/problem/{problemId}"
- update = True
-
- if update:
- self.changeLevelLog.append(f"{updateLog}\n")
-
- self.saveInformation(newData)
- return newData
-
- def getProblemInformation(self, problemId):
-
- if type(problemId) == int:
- problemId = str(problemId)
-
- # Check Database
- assert type(problemId) == str, f"[*** Type Error] problemId type is {type(problemId)}.\n It must be string"
-
- if not problemId in self.database.keys():
- return False, dict()
-
- return True, self.database.get(problemId)
-
- def saveInformation(self, data):
-
- # Check data type
- assert type(data) == dict, f"[*** Type Error] data type is {type(data)}.\n It must be dict"
-
- timestamp = datetime.datetime.now(pytz.timezone('Asia/Seoul')).timestamp()
- data['lastupdate'] = timestamp
- problemId = data.get('problemId')
-
- if problemId in self.database.keys():
- del self.database[problemId]
- self.database.update({problemId: data})
-
-# Example
-if __name__=="__main__":
- config = dict()
- with open("config.json", "r") as f:
- config = json.load(f)
- f.close()
- api = SolvedAPI(config.get("API"))
- data = api.request('1001')
- api.saveInformation(data)
diff --git a/scripts/__pycache__/API.cpython-310.pyc b/scripts/__pycache__/API.cpython-310.pyc
deleted file mode 100644
index 8259146..0000000
Binary files a/scripts/__pycache__/API.cpython-310.pyc and /dev/null differ
diff --git a/scripts/__pycache__/make_table.cpython-310.pyc b/scripts/__pycache__/make_table.cpython-310.pyc
deleted file mode 100644
index dcb363d..0000000
Binary files a/scripts/__pycache__/make_table.cpython-310.pyc and /dev/null differ
diff --git a/scripts/arrange.py b/scripts/arrange.py
deleted file mode 100644
index 4888568..0000000
--- a/scripts/arrange.py
+++ /dev/null
@@ -1,132 +0,0 @@
-# python3 arrange.py > status.md
-# 리팩토링 해야함
-
-import subprocess as sp
-import os
-import time
-
-EXCEPT_FOLDER = [ 'solution', '.git', 'solutions', '.github', '__pycache__', 'markdown', 'scripts', 'assets']
-
-def getProblem(Dir):
- ret = list()
- with open(f"{Dir}/list.md", 'r') as f:
- ret = f.readlines()
- f.close()
- return ret
-
-def Assemble(*args):
- problems = set()
- for i in args:
- for problem in i:
- problemID = problem.split(',')[-2]
- problems.add(problemID)
- return problems
-
-def Status(tags, *args): # Problems, Folders
- for idx, problems in enumerate(args):
- print(f"| {idx:02d} | [{tags[idx]}](./../../tree/main/{tags[idx]}) | ", end='')
- totalProblem = 0 # Only ✔️
- hasEditoral = 0
- for problem in problems:
- info = problem.split(',')
-
- rec = info[0].strip()
- link = info[-1].strip()
- if not link == '' and not rec == '':
- hasEditoral += 1
- if not rec == '':
- totalProblem += 1
-
- if totalProblem == 0: # Except 0 / 0
- totalProblem = 1 # Make 0 / 1
-
- # https://img.shields.io/badge/-{1}-31AE0F
- # DFFD26 0885CC
- percent = hasEditoral / totalProblem * 100.
- color = "DFFD26"
-
- if percent == 100.0:
- color = "0885CC"
- elif percent != 0.0:
- color = "31AE0F"
-
- print(f"{totalProblem - hasEditoral} |", end='')
- print(f"![status](https://img.shields.io/badge/-{percent:.2f}%25-{color}) | ")
-
-def getTier(Str):
- if len(Str) == 2: # Ex p2, P2...
- return Str.upper()
- else: # Gold5...
- return Str[0].upper() + Str[-1]
-
-def getRecommend(*args):
- ret = list() # Not Set, Get Problem Info (ProblemID, Problem Name, Tier)
- for i in args:
- for problem in i:
- info = problem.split(",")
- rec = info[0].strip()
- if not rec == '':
- ret.append(info[-2])
- return ret
-
-# Clean Code 생각 X
-# TODO
-def calPercentageOfRec(*args):
- total = 0
- hasSolution = 0
-
- for i in args:
- for problem in i:
- info = problem.split(",")
- rec = info[0].strip()
- link = info[-1].strip()
- if rec == '':
- continue
- total += 1
-
- if not link == '':
- hasSolution += 1
-
- return total - hasSolution, float(hasSolution) / total * 100
-
-
-# Get Folders
-Folders = sorted([ _ for _ in os.listdir('./') if os.path.isdir(_) and not _ in EXCEPT_FOLDER and not _.startswith('.') ])
-Problems = [ getProblem(_) for _ in Folders ]
-TotalProblem = Assemble(*Problems)
-
-# getStatus(Folders, *Problems)
-Recommend_List = getRecommend(*Problems)
-
-print("""# Status
-
-간단하게 파이썬으로 진행사항 및 문제 수를 알아보기 위해 만들어 보았습니다.
-
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-
-""")
-
-print(f"총 문제 수 : {len(TotalProblem)} ")
-print(f"총 추천 문제 수 : {len(Recommend_List)} ({len(Recommend_List) / len(TotalProblem) * 100. :.2f}%) ")
-print(f"알고리즘 Tag 개수 : {len(Folders)} ")
-print("\n") # lnln
-
-print("
")
-_a, _b = calPercentageOfRec(*Problems)
-print(f"각 알고리즘 Tag 진행 사항 (Tag는 사전순) {_b:.2f}%
\n")
-print(f"남은 문제 수 {_a}/{len(Recommend_List)}\n")
-
-# Make Table (Markdown)
-
-print("| Index | Tag(Folder Name) | 남은 문제 수 | Solution 진행도 |")
-print("| :--: | :--------------- | :----------: | :------------: |")
-Status(Folders, *Problems)
-
-import datetime
-import pytz
-
-timeformat = datetime.datetime.now(pytz.timezone('Asia/Seoul'))
-
-print(f"\n\n**실행한 날짜(log) : {timeformat.strftime('%Y/%m/%d %H:%M:%S %Z')}**")
diff --git a/scripts/auto_update.py b/scripts/auto_update.py
deleted file mode 100644
index ca0cb70..0000000
--- a/scripts/auto_update.py
+++ /dev/null
@@ -1,121 +0,0 @@
-from API import SolvedAPI
-from make_table import Table
-import json
-import argparse
-import os
-
-config = dict()
-solution_list = dict()
-changeLevel_list = list()
-api = None
-table = None
-
-def getFolder(path, EXCEPT=list()):
- return [ folder for folder in os.listdir(path) \
- if os.path.isdir(f"{path}/{folder}") and folder not in EXCEPT ]
-
-# New Problem Update
-def updateProblems():
- print("update start")
- table.run()
- print("update end")
-
-# Solution Update
-def updateSolution():
- rootFolder = "./solution"
- tagFolder = getFolder(rootFolder) # in ./solution
- for tag in tagFolder:
- solution_list[tag] = set()
- problemPath = f"{rootFolder}/{tag}"
- problems = getFolder(problemPath)
- for problem in problems:
- solution_list[tag].add(problem)
-
-# List.md 정리 (Solution Link)
-def updateList():
- solutionRPATH = "./../solution"
- rootFolder = "./"
- tagFolder = config.get('tags')
- for tag in tagFolder:
- currentPath = f"{rootFolder}/{tag}"
- INFO = None
-
- with open(f"{currentPath}/list.md", 'r') as f:
- INFO = f.readlines()
- f.close()
-
- update = False
- NEWINFO = list()
- for line in INFO:
- split_line = line.split(",")
- problemId = split_line[-2]
-
- if tag in solution_list and problemId in solution_list[tag]:
- split_line[-1] = f"{solutionRPATH}/{tag}/{problemId}\n"
- update = True
-
- line = ",".join(split_line)
- NEWINFO.append(line)
-
- if update:
- with open(f"{currentPath}/list.md", 'w') as f:
- f.writelines(NEWINFO)
- f.close()
-
-def updateStatus():
- os.system('python3 ./scripts/arrange.py > status.md')
-
-def updateLevel():
- table.run(force = True)
-
-if __name__=="__main__":
-
- # Read Config
- with open('./scripts/config.json', 'r') as f:
- config = json.load(f)
- f.close()
-
- api = SolvedAPI(config.get('API'))
- table = Table(api, config)
-
- parser = argparse.ArgumentParser('Auto Update')
- arg = parser.add_argument
-
- arg('--all', dest='updateAll', action='store_true')
- parser.set_defaults(updateAll=False)
-
- arg('--solution', dest='updateSolution', action='store_true')
- parser.set_defaults(updateSolution=False)
-
- arg('--level', dest='updateLevel', action='store_true')
- parser.set_defaults(updateLevel=False)
-
- arg('--problem-update', dest='updateProblem', action='store_true')
- parser.set_defaults(updateProblem=False)
-
- arg('--push', dest='pushEvent', action='store_true')
- parser.set_defaults(pushEvent=False)
-
-
- args = parser.parse_args()
-
- print("START")
-
- if args.pushEvent:
- args.updateSolution = True
- args.updateProblem = True
-
- if args.pushEvent or args.updateAll or args.updateSolution:
- os.system('python3 ./scripts/make_main_readme.py')
-
- if args.updateAll or args.updateLevel:
- updateLevel()
-
- if args.updateAll or args.updateSolution:
- updateSolution()
- updateList()
-
- if args.updateProblem:
- updateProblems()
-
- updateStatus()
diff --git a/scripts/check_pull_request.py b/scripts/check_pull_request.py
deleted file mode 100644
index 8d08e8f..0000000
--- a/scripts/check_pull_request.py
+++ /dev/null
@@ -1,145 +0,0 @@
-import os
-import sys
-import subprocess
-import argparse
-from bs4 import BeautifulSoup as bs
-import requests
-
-EXTENSION = [("py", "python", "main"), ("cpp", "cpp", "main"), ("java", "java", "Main")]
-
-def run(command):
- ret = subprocess.check_output(command, shell=True).decode('utf8')
- return ret
-
-def load_arg():
- parser = argparse.ArgumentParser()
- arg = parser.add_argument
- arg('--pr_number', type=int, help="Pull Request Number")
- arg('--check_solution', action='store_true')
- parser.set_defaults(check_solution=False)
- return parser.parse_args()
-
-def check_alreay_exist_solution(path):
- if os.path.exists(path):
- raise Exception("Alread Exists Solution")
-
- print("It is a new Solution!!")
-
-def get_pr_file(pr_number):
- run(f"git fetch origin +refs/pull/{pr_number}/merge")
- files = run(f"git --no-pager diff --name-only FETCH_HEAD $(git merge-base FETCH_HEAD main)")
- files = [file.strip() for file in files.split() if file.strip() != ""]
-
- if len(files) != 1:
- raise Exception("No 1 PR 1 Solution")
-
- return files[0]
-
-def get_solution_language(path):
- filename, extension = path.split('/')[-1].split('.')
- for info in EXTENSION:
- if info[0] == extension:
- if filename == info[2]:
- print(f"Found {info[1]} Language")
- return info[1]
- else:
- raise Exception(f"Wrong File name {filename}")
-
- raise Exception(f"No Found {extension} Language")
-
-def detect_tab(path):
- with open(path, 'r') as f:
- solution = f.readlines()
- f.close()
-
- for line in solution:
- if '\t' in line:
- raise Exception("Detected Tab in this solution")
-
- print("No Detect Tab")
-
-def get_example(problem_id):
- url = f"https://www.acmicpc.net/problem/{problem_id}"
- req = requests.get(url)
- html = bs(req.text, 'html.parser')
- spj = True if html.find('span', 'problem-label-spj') else False
-
- if spj:
- print("Found Special Judge")
-
- examples = []
-
- try:
- sample_id = 1
- while True:
- sample_input = html.select(f'#sample-input-{sample_id}')[0].text
- sample_output = html.select(f'#sample-output-{sample_id}')[0].text
- examples.append((sample_input, sample_output))
- sample_id += 1
- except:
- pass
- return spj, examples
-
-def compile_test(path):
- try:
- extension = get_solution_language(path)
- if extension == 'cpp':
- run(f"g++ -std=c++17 {path} -o Main")
- elif extension == 'java':
- run(f"javac {path} -d .")
- except:
- raise RuntimeError("Compile Error")
-
- return extension
-
-def judge_test(path):
- detect_tab(path)
- problem = path.split('/')[-2]
- spj, samples = get_example(problem)
-
- extension = compile_test(path)
-
- print(f"Found {len(samples)} examples in {problem} problem")
-
- for idx, (data_input, data_output) in enumerate(samples):
- with open("example.in", 'w') as f:
- f.write(data_input)
- f.close()
-
- try:
- if extension == 'cpp':
- result = run(f"./Main < example.in")
- elif extension == 'python':
- result = run(f"python3 {path} < example.in")
- elif extension == 'java':
- result = run(f"java Main < example.in")
- except:
- raise Exception("Runtime Error")
-
- if spj:
- continue
-
- result = [ line.strip() for line in result if line.strip() != '']
- data_output = [ line.strip() for line in data_output if line.strip() != '' ]
-
- if result != data_output:
- raise Exception("Wrong Solution")
-
- print(f"Example {idx + 1} Correct !")
-
- print(f"{problem} Judge Success")
-
-if __name__ == "__main__":
- args = load_arg()
-
- if args.check_solution:
- file = get_pr_file(args.pr_number)
- lang = get_solution_language(file)
- with open("result", 'w') as f:
- f.write(lang)
- f.close()
- else:
- file = get_pr_file(args.pr_number)
- check_alreay_exist_solution(file)
- run(f"git checkout FETCH_HEAD")
- judge_test(file)
diff --git a/scripts/config.json b/scripts/config.json
deleted file mode 100644
index f04ffbf..0000000
--- a/scripts/config.json
+++ /dev/null
@@ -1,86 +0,0 @@
-{
- "API": {
- "database": "./scripts/database.json",
- "targeturl": "https://solved.ac/api/v3",
- "route": {
- "problemid": "problem/show?problemId="
- },
- "encoding": "UTF-8",
- "update": 86400,
- "solvedtags": [
- "bojTagId",
- "key"
- ]
- },
- "tags": [
- "backtracking",
- "binary_search",
- "brute_force",
- "data_structure",
- "data_structure2",
- "disjoint_set",
- "divide_and_conquer",
- "dynamic_programming_1",
- "dynamic_programming_2",
- "dynamic_programming_on_trees",
- "graph_traversal",
- "greedy",
- "implementation",
- "math",
- "minimum_spanning_tree",
- "prefix_sum",
- "shortest_path",
- "simulation",
- "string",
- "topological_sorting",
- "tree",
- "trie",
- "two_pointer"
- ],
- "ignore": {
- "all": [
- "solution",
- "scripts",
- "markdown",
- ".git",
- ".gitigore",
- "LICENSE",
- "CodingTest.md",
- "README.md",
- "algorithm_list.md",
- "arrange.py",
- "assemble.py",
- "change_level.log",
- "database.json",
- "link_for_study.md",
- "make_table.py",
- "minidatabase.py",
- "status.md",
- "assets",
- "guideline_for_contribute.md"
- ],
- "folder": [
- "solution",
- "scripts",
- "markdown",
- "assets",
- ".git"
- ],
- "file": [
- ".gitigore",
- "LICENSE",
- "CodingTest.md",
- "README.md",
- "algorithm_list.md",
- "arrange.py",
- "assemble.py",
- "change_level.log",
- "database.json",
- "link_for_study.md",
- "make_table.py",
- "minidatabase.py",
- "status.md",
- "guideline_for_contribute.md"
- ]
- }
-}
diff --git a/scripts/database.json b/scripts/database.json
deleted file mode 100644
index b4e1648..0000000
--- a/scripts/database.json
+++ /dev/null
@@ -1,19037 +0,0 @@
-{
- "1864": {
- "problemId": "1864",
- "problemLevel": 4,
- "problemName": "문어 숫자",
- "average_try": 1.3803,
- "solvedtags": [
- {
- "bojTagId": 121,
- "key": "arithmetic"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236945.45283
- },
- "15649": {
- "problemId": "15649",
- "problemLevel": 8,
- "problemName": "N과 M (1)",
- "average_try": 1.6388,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124379
- },
- "15650": {
- "problemId": "15650",
- "problemLevel": 8,
- "problemName": "N과 M (2)",
- "average_try": 1.3407,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124429
- },
- "15651": {
- "problemId": "15651",
- "problemLevel": 8,
- "problemName": "N과 M (3)",
- "average_try": 1.5077,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124459
- },
- "15652": {
- "problemId": "15652",
- "problemLevel": 8,
- "problemName": "N과 M (4)",
- "average_try": 1.2615,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124485
- },
- "15654": {
- "problemId": "15654",
- "problemLevel": 8,
- "problemName": "N과 M (5)",
- "average_try": 1.3693,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.12451
- },
- "15655": {
- "problemId": "15655",
- "problemLevel": 8,
- "problemName": "N과 M (6)",
- "average_try": 1.1674,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124535
- },
- "15656": {
- "problemId": "15656",
- "problemLevel": 8,
- "problemName": "N과 M (7)",
- "average_try": 1.2564,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124558
- },
- "15657": {
- "problemId": "15657",
- "problemLevel": 8,
- "problemName": "N과 M (8)",
- "average_try": 1.1889,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124582
- },
- "15663": {
- "problemId": "15663",
- "problemLevel": 9,
- "problemName": "N과 M (9)",
- "average_try": 2.0179,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124606
- },
- "15664": {
- "problemId": "15664",
- "problemLevel": 9,
- "problemName": "N과 M (10)",
- "average_try": 1.2373,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.12463
- },
- "15665": {
- "problemId": "15665",
- "problemLevel": 9,
- "problemName": "N과 M (11)",
- "average_try": 1.3195,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124654
- },
- "15666": {
- "problemId": "15666",
- "problemLevel": 9,
- "problemName": "N과 M (12)",
- "average_try": 1.2366,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.124678
- },
- "14889": {
- "problemId": "14889",
- "problemLevel": 9,
- "problemName": "스타트와 링크",
- "average_try": 2.1233,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.124707
- },
- "10974": {
- "problemId": "10974",
- "problemLevel": 8,
- "problemName": "모든 순열",
- "average_try": 1.6223,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.124732
- },
- "15658": {
- "problemId": "15658",
- "problemLevel": 9,
- "problemName": "연산자 끼워넣기 (2)",
- "average_try": 1.898,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.124761
- },
- "16922": {
- "problemId": "16922",
- "problemLevel": 8,
- "problemName": "로마 숫자 만들기",
- "average_try": 1.8056,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.124788
- },
- "18429": {
- "problemId": "18429",
- "problemLevel": 8,
- "problemName": "근손실",
- "average_try": 1.6624,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.124813
- },
- "1553": {
- "problemId": "1553",
- "problemLevel": 10,
- "problemName": "도미노 찾기",
- "average_try": 1.8462,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.124861
- },
- "20950": {
- "problemId": "20950",
- "problemLevel": 9,
- "problemName": "미술가 미미",
- "average_try": 2.5405,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.124885
- },
- "6603": {
- "problemId": "6603",
- "problemLevel": 9,
- "problemName": "로또",
- "average_try": 1.8287,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.124911
- },
- "1182": {
- "problemId": "1182",
- "problemLevel": 9,
- "problemName": "부분수열의 합",
- "average_try": 2.2618,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.124934
- },
- "10819": {
- "problemId": "10819",
- "problemLevel": 9,
- "problemName": "차이를 최대로",
- "average_try": 1.5519,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.124959
- },
- "10971": {
- "problemId": "10971",
- "problemLevel": 9,
- "problemName": "외판원 순회 2",
- "average_try": 2.9331,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 138,
- "key": "tsp"
- }
- ],
- "lastupdate": 1648236948.124982
- },
- "2529": {
- "problemId": "2529",
- "problemLevel": 9,
- "problemName": "부등호",
- "average_try": 1.938,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125006
- },
- "6987": {
- "problemId": "6987",
- "problemLevel": 11,
- "problemName": "월드컵",
- "average_try": 3.2083,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125029
- },
- "16987": {
- "problemId": "16987",
- "problemLevel": 10,
- "problemName": "계란으로 계란치기",
- "average_try": 1.8929,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125054
- },
- "19699": {
- "problemId": "19699",
- "problemLevel": 9,
- "problemName": "소-난다!",
- "average_try": 2.4227,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.125078
- },
- "14712": {
- "problemId": "14712",
- "problemLevel": 10,
- "problemName": "넴모넴모 (Easy)",
- "average_try": 1.6215,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.125102
- },
- "14888": {
- "problemId": "14888",
- "problemLevel": 10,
- "problemName": "연산자 끼워넣기",
- "average_try": 2.0217,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125127
- },
- "16198": {
- "problemId": "16198",
- "problemLevel": 10,
- "problemName": "에너지 모으기",
- "average_try": 1.3041,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.12515
- },
- "10597": {
- "problemId": "10597",
- "problemLevel": 10,
- "problemName": "순열장난",
- "average_try": 3.1944,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.125199
- },
- "1174": {
- "problemId": "1174",
- "problemLevel": 11,
- "problemName": "줄어드는 수",
- "average_try": 2.447,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125223
- },
- "1189": {
- "problemId": "1189",
- "problemLevel": 10,
- "problemName": "컴백홈",
- "average_try": 1.8273,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125246
- },
- "19942": {
- "problemId": "19942",
- "problemLevel": 11,
- "problemName": "다이어트",
- "average_try": 3.7421,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125269
- },
- "18290": {
- "problemId": "18290",
- "problemLevel": 10,
- "problemName": "NM과 K (1)",
- "average_try": 3.8701,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125291
- },
- "1497": {
- "problemId": "1497",
- "problemLevel": 10,
- "problemName": "기타콘서트",
- "average_try": 4.0675,
- "solvedtags": [
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.125315
- },
- "18430": {
- "problemId": "18430",
- "problemLevel": 11,
- "problemName": "무기 공학",
- "average_try": 2.2091,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.125338
- },
- "15566": {
- "problemId": "15566",
- "problemLevel": 10,
- "problemName": "개구리 1",
- "average_try": 2.9444,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125361
- },
- "9663": {
- "problemId": "9663",
- "problemLevel": 11,
- "problemName": "N-Queen",
- "average_try": 2.0396,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125384
- },
- "1759": {
- "problemId": "1759",
- "problemLevel": 11,
- "problemName": "암호 만들기",
- "average_try": 2.2328,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.125411
- },
- "15684": {
- "problemId": "15684",
- "problemLevel": 12,
- "problemName": "사다리 조작",
- "average_try": 4.6314,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.125435
- },
- "1038": {
- "problemId": "1038",
- "problemLevel": 11,
- "problemName": "감소하는 수",
- "average_try": 3.1862,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125458
- },
- "2023": {
- "problemId": "2023",
- "problemLevel": 11,
- "problemName": "신기한 소수",
- "average_try": 2.1691,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- }
- ],
- "lastupdate": 1648236948.125481
- },
- "1405": {
- "problemId": "1405",
- "problemLevel": 11,
- "problemName": "미친 로봇",
- "average_try": 2.8105,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.125504
- },
- "1342": {
- "problemId": "1342",
- "problemLevel": 10,
- "problemName": "행운의 문자열",
- "average_try": 2.4121,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.125528
- },
- "7490": {
- "problemId": "7490",
- "problemLevel": 11,
- "problemName": "0 만들기",
- "average_try": 2.223,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.125553
- },
- "13908": {
- "problemId": "13908",
- "problemLevel": 10,
- "problemName": "비밀번호",
- "average_try": 2.1894,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.125576
- },
- "7682": {
- "problemId": "7682",
- "problemLevel": 11,
- "problemName": "틱택토",
- "average_try": 3.3604,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.125599
- },
- "20208": {
- "problemId": "20208",
- "problemLevel": 11,
- "problemName": "진우의 민트초코우유",
- "average_try": 2.1506,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125623
- },
- "1469": {
- "problemId": "1469",
- "problemLevel": 12,
- "problemName": "숌 사이 수열",
- "average_try": 3.6216,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125646
- },
- "10421": {
- "problemId": "10421",
- "problemLevel": 11,
- "problemName": "수식 완성하기",
- "average_try": 4.0196,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125668
- },
- "1987": {
- "problemId": "1987",
- "problemLevel": 12,
- "problemName": "알파벳",
- "average_try": 3.419,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.125691
- },
- "2580": {
- "problemId": "2580",
- "problemLevel": 12,
- "problemName": "스도쿠",
- "average_try": 3.6745,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.125714
- },
- "1062": {
- "problemId": "1062",
- "problemLevel": 12,
- "problemName": "가르침",
- "average_try": 3.9809,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125737
- },
- "2661": {
- "problemId": "2661",
- "problemLevel": 12,
- "problemName": "좋은수열",
- "average_try": 1.9668,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.125759
- },
- "2239": {
- "problemId": "2239",
- "problemLevel": 12,
- "problemName": "스도쿠",
- "average_try": 2.085,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.125782
- },
- "3980": {
- "problemId": "3980",
- "problemLevel": 11,
- "problemName": "선발 명단",
- "average_try": 2.37,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125804
- },
- "16938": {
- "problemId": "16938",
- "problemLevel": 11,
- "problemName": "캠프 준비",
- "average_try": 1.4793,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.125827
- },
- "2922": {
- "problemId": "2922",
- "problemLevel": 11,
- "problemName": "즐거운 단어",
- "average_try": 2.2043,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.125849
- },
- "15918": {
- "problemId": "15918",
- "problemLevel": 12,
- "problemName": "랭퍼든 수열쟁이야!!",
- "average_try": 1.3016,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.125872
- },
- "1941": {
- "problemId": "1941",
- "problemLevel": 13,
- "problemName": "소문난 칠공주",
- "average_try": 2.0774,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.125894
- },
- "1248": {
- "problemId": "1248",
- "problemLevel": 13,
- "problemName": "Guess",
- "average_try": 2.7868,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.125918
- },
- "9944": {
- "problemId": "9944",
- "problemLevel": 13,
- "problemName": "NxM 보드 완주하기",
- "average_try": 3.2851,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.125941
- },
- "6443": {
- "problemId": "6443",
- "problemLevel": 11,
- "problemName": "애너그램",
- "average_try": 2.757,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.125964
- },
- "2026": {
- "problemId": "2026",
- "problemLevel": 13,
- "problemName": "소풍",
- "average_try": 4.295,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.125987
- },
- "15659": {
- "problemId": "15659",
- "problemLevel": 13,
- "problemName": "연산자 끼워넣기 (3)",
- "average_try": 1.7688,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.126009
- },
- "12908": {
- "problemId": "12908",
- "problemLevel": 12,
- "problemName": "텔레포트 3",
- "average_try": 2.2028,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.126031
- },
- "1729": {
- "problemId": "1729",
- "problemLevel": 15,
- "problemName": "이차원 배열의 합",
- "average_try": 2.68,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.126054
- },
- "17136": {
- "problemId": "17136",
- "problemLevel": 14,
- "problemName": "색종이 붙이기",
- "average_try": 2.9863,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.126076
- },
- "1799": {
- "problemId": "1799",
- "problemLevel": 15,
- "problemName": "비숍",
- "average_try": 4.1833,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- }
- ],
- "lastupdate": 1648236948.126099
- },
- "16571": {
- "problemId": "16571",
- "problemLevel": 14,
- "problemName": "알파 틱택토",
- "average_try": 2.2692,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 140,
- "key": "game_theory"
- }
- ],
- "lastupdate": 1648236948.126123
- },
- "3165": {
- "problemId": "3165",
- "problemLevel": 14,
- "problemName": "5",
- "average_try": 3.0364,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.126145
- },
- "1789": {
- "problemId": "1789",
- "problemLevel": 6,
- "problemName": "수들의 합",
- "average_try": 2.3129,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.127419
- },
- "2417": {
- "problemId": "2417",
- "problemLevel": 7,
- "problemName": "정수 제곱근",
- "average_try": 3.3127,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.127456
- },
- "17266": {
- "problemId": "17266",
- "problemLevel": 7,
- "problemName": "어두운 굴다리",
- "average_try": 2.4242,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.127483
- },
- "1920": {
- "problemId": "1920",
- "problemLevel": 7,
- "problemName": "수 찾기",
- "average_try": 3.3251,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.127508
- },
- "10815": {
- "problemId": "10815",
- "problemLevel": 7,
- "problemName": "숫자 카드",
- "average_try": 2.0459,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.127533
- },
- "10816": {
- "problemId": "10816",
- "problemLevel": 7,
- "problemName": "숫자 카드 2",
- "average_try": 2.8206,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.127558
- },
- "20551": {
- "problemId": "20551",
- "problemLevel": 7,
- "problemName": "Sort 마스터 배지훈의 후계자",
- "average_try": 2.8161,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.127602
- },
- "2805": {
- "problemId": "2805",
- "problemLevel": 8,
- "problemName": "나무 자르기",
- "average_try": 3.9165,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.127627
- },
- "1654": {
- "problemId": "1654",
- "problemLevel": 8,
- "problemName": "랜선 자르기",
- "average_try": 4.7599,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.127652
- },
- "2512": {
- "problemId": "2512",
- "problemLevel": 8,
- "problemName": "예산",
- "average_try": 3.0491,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.127676
- },
- "1072": {
- "problemId": "1072",
- "problemLevel": 8,
- "problemName": "게임",
- "average_try": 4.3683,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.127699
- },
- "6236": {
- "problemId": "6236",
- "problemLevel": 9,
- "problemName": "용돈 관리",
- "average_try": 3.3945,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.127748
- },
- "7795": {
- "problemId": "7795",
- "problemLevel": 8,
- "problemName": "먹을 것인가 먹힐 것인가",
- "average_try": 1.9702,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.127771
- },
- "2792": {
- "problemId": "2792",
- "problemLevel": 9,
- "problemName": "보석 상자",
- "average_try": 2.7811,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.127794
- },
- "16401": {
- "problemId": "16401",
- "problemLevel": 8,
- "problemName": "과자 나눠주기",
- "average_try": 2.4651,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.127816
- },
- "13702": {
- "problemId": "13702",
- "problemLevel": 8,
- "problemName": "이상한 술집",
- "average_try": 2.983,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.127841
- },
- "11561": {
- "problemId": "11561",
- "problemLevel": 8,
- "problemName": "징검다리",
- "average_try": 3.4293,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.127865
- },
- "14627": {
- "problemId": "14627",
- "problemLevel": 8,
- "problemName": "파닭파닭",
- "average_try": 5.2762,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.127889
- },
- "1166": {
- "problemId": "1166",
- "problemLevel": 8,
- "problemName": "선물",
- "average_try": 5.7897,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.127912
- },
- "17451": {
- "problemId": "17451",
- "problemLevel": 8,
- "problemName": "평행 우주",
- "average_try": 2.6434,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.127935
- },
- "19637": {
- "problemId": "19637",
- "problemLevel": 8,
- "problemName": "IF문 좀 대신 써줘",
- "average_try": 2.8622,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.127959
- },
- "17393": {
- "problemId": "17393",
- "problemLevel": 8,
- "problemName": "다이나믹 롤러",
- "average_try": 2.4792,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.127982
- },
- "17124": {
- "problemId": "17124",
- "problemLevel": 8,
- "problemName": "두 개의 배열",
- "average_try": 2.8819,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.128005
- },
- "11663": {
- "problemId": "11663",
- "problemLevel": 8,
- "problemName": "선분 위의 점",
- "average_try": 2.7322,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.128028
- },
- "15810": {
- "problemId": "15810",
- "problemLevel": 9,
- "problemName": "풍선 공장",
- "average_try": 3.7523,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128051
- },
- "17503": {
- "problemId": "17503",
- "problemLevel": 9,
- "problemName": "맥주 축제",
- "average_try": 3.1773,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.128073
- },
- "18113": {
- "problemId": "18113",
- "problemLevel": 9,
- "problemName": "그르다 김가놈",
- "average_try": 3.4861,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.128095
- },
- "2121": {
- "problemId": "2121",
- "problemLevel": 8,
- "problemName": "넷이 놀기",
- "average_try": 2.3133,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- }
- ],
- "lastupdate": 1648236948.128118
- },
- "2110": {
- "problemId": "2110",
- "problemLevel": 11,
- "problemName": "공유기 설치",
- "average_try": 2.6001,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128141
- },
- "2343": {
- "problemId": "2343",
- "problemLevel": 10,
- "problemName": "기타 레슨",
- "average_try": 3.2763,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128164
- },
- "3079": {
- "problemId": "3079",
- "problemLevel": 11,
- "problemName": "입국심사",
- "average_try": 3.7239,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128186
- },
- "2022": {
- "problemId": "2022",
- "problemLevel": 10,
- "problemName": "사다리",
- "average_try": 1.8639,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 60,
- "key": "pythagoras"
- }
- ],
- "lastupdate": 1648236948.12821
- },
- "16564": {
- "problemId": "16564",
- "problemLevel": 10,
- "problemName": "히오스 프로게이머",
- "average_try": 2.0597,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.128232
- },
- "11687": {
- "problemId": "11687",
- "problemLevel": 11,
- "problemName": "팩토리얼 0의 개수",
- "average_try": 2.2444,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.128255
- },
- "18114": {
- "problemId": "18114",
- "problemLevel": 10,
- "problemName": "블랙 프라이데이",
- "average_try": 4.0048,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.128278
- },
- "14575": {
- "problemId": "14575",
- "problemLevel": 10,
- "problemName": "뒤풀이",
- "average_try": 2.993,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.128301
- },
- "17179": {
- "problemId": "17179",
- "problemLevel": 10,
- "problemName": "케이크 자르기",
- "average_try": 3.0207,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.128324
- },
- "16960": {
- "problemId": "16960",
- "problemLevel": 7,
- "problemName": "스위치와 램프",
- "average_try": 1.9,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.128348
- },
- "20495": {
- "problemId": "20495",
- "problemLevel": 10,
- "problemName": "수열과 헌팅",
- "average_try": 2.16,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.12837
- },
- "3020": {
- "problemId": "3020",
- "problemLevel": 11,
- "problemName": "개똥벌레",
- "average_try": 2.3444,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.128417
- },
- "1477": {
- "problemId": "1477",
- "problemLevel": 12,
- "problemName": "휴게소 세우기",
- "average_try": 3.212,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128464
- },
- "2866": {
- "problemId": "2866",
- "problemLevel": 11,
- "problemName": "문자열 잘라내기",
- "average_try": 2.9461,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.128486
- },
- "20444": {
- "problemId": "20444",
- "problemLevel": 11,
- "problemName": "색종이와 가위",
- "average_try": 2.6566,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.128509
- },
- "1939": {
- "problemId": "1939",
- "problemLevel": 12,
- "problemName": "중량제한",
- "average_try": 4.0291,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.128558
- },
- "8983": {
- "problemId": "8983",
- "problemLevel": 12,
- "problemName": "사냥꾼",
- "average_try": 3.2022,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.128581
- },
- "13397": {
- "problemId": "13397",
- "problemLevel": 12,
- "problemName": "구간 나누기 2",
- "average_try": 1.5361,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128627
- },
- "9007": {
- "problemId": "9007",
- "problemLevel": 13,
- "problemName": "카누 선수",
- "average_try": 4.0021,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 46,
- "key": "mitm"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.12865
- },
- "2412": {
- "problemId": "2412",
- "problemLevel": 13,
- "problemName": "암벽 등반",
- "average_try": 3.4123,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.128673
- },
- "17951": {
- "problemId": "17951",
- "problemLevel": 12,
- "problemName": "흩날리는 시험지 속에서 내 평점이 느껴진거야",
- "average_try": 2.1697,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.128696
- },
- "12757": {
- "problemId": "12757",
- "problemLevel": 13,
- "problemName": "전설의 JBNU",
- "average_try": 3.1083,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- }
- ],
- "lastupdate": 1648236948.128719
- },
- "1300": {
- "problemId": "1300",
- "problemLevel": 14,
- "problemName": "K번째 수",
- "average_try": 2.6565,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128741
- },
- "2143": {
- "problemId": "2143",
- "problemLevel": 13,
- "problemName": "두 배열의 합",
- "average_try": 3.3361,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.128764
- },
- "16434": {
- "problemId": "16434",
- "problemLevel": 12,
- "problemName": "드래곤 앤 던전",
- "average_try": 3.4547,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.128788
- },
- "15823": {
- "problemId": "15823",
- "problemLevel": 14,
- "problemName": "카드 팩 구매하기",
- "average_try": 3.4754,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.12881
- },
- "2613": {
- "problemId": "2613",
- "problemLevel": 14,
- "problemName": "숫자구슬",
- "average_try": 3.6032,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.128855
- },
- "1561": {
- "problemId": "1561",
- "problemLevel": 14,
- "problemName": "놀이 공원",
- "average_try": 4.1608,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128878
- },
- "15732": {
- "problemId": "15732",
- "problemLevel": 14,
- "problemName": "도토리 숨기기",
- "average_try": 3.6004,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- }
- ],
- "lastupdate": 1648236948.128901
- },
- "6209": {
- "problemId": "6209",
- "problemLevel": 14,
- "problemName": "제자리 멀리뛰기",
- "average_try": 2.5627,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 170,
- "key": "parametric_search"
- }
- ],
- "lastupdate": 1648236948.128924
- },
- "9094": {
- "problemId": "9094",
- "problemLevel": 3,
- "problemName": "수학적 호기심",
- "average_try": 1.5604,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.129862
- },
- "4690": {
- "problemId": "4690",
- "problemLevel": 3,
- "problemName": "완전 세제곱",
- "average_try": 2.5373,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 172,
- "key": "precomputation"
- }
- ],
- "lastupdate": 1648236948.129894
- },
- "3040": {
- "problemId": "3040",
- "problemLevel": 4,
- "problemName": "백설 공주와 일곱 난쟁이",
- "average_try": 1.4129,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.129921
- },
- "10448": {
- "problemId": "10448",
- "problemLevel": 4,
- "problemName": "유레카 이론",
- "average_try": 1.7062,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.129957
- },
- "2798": {
- "problemId": "2798",
- "problemLevel": 4,
- "problemName": "블랙잭",
- "average_try": 2.159,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.129981
- },
- "2309": {
- "problemId": "2309",
- "problemLevel": 4,
- "problemName": "일곱 난쟁이",
- "average_try": 2.3351,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.130006
- },
- "2231": {
- "problemId": "2231",
- "problemLevel": 4,
- "problemName": "분해합",
- "average_try": 2.1831,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.13003
- },
- "14697": {
- "problemId": "14697",
- "problemLevel": 4,
- "problemName": "방 배정하기",
- "average_try": 2.313,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.130055
- },
- "1668": {
- "problemId": "1668",
- "problemLevel": 4,
- "problemName": "트로피 진열",
- "average_try": 2.0872,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.13008
- },
- "13410": {
- "problemId": "13410",
- "problemLevel": 4,
- "problemName": "거꾸로 구구단",
- "average_try": 1.6389,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.130104
- },
- "19532": {
- "problemId": "19532",
- "problemLevel": 4,
- "problemName": "수학은 비대면강의입니다",
- "average_try": 2.0232,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.130127
- },
- "18312": {
- "problemId": "18312",
- "problemLevel": 4,
- "problemName": "시각",
- "average_try": 2.4757,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.13015
- },
- "1145": {
- "problemId": "1145",
- "problemLevel": 5,
- "problemName": "적어도 대부분의 배수",
- "average_try": 1.7014,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.130175
- },
- "2160": {
- "problemId": "2160",
- "problemLevel": 5,
- "problemName": "그림 비교",
- "average_try": 1.9556,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.130199
- },
- "18512": {
- "problemId": "18512",
- "problemLevel": 5,
- "problemName": "점프 점프",
- "average_try": 2.146,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.130222
- },
- "18868": {
- "problemId": "18868",
- "problemLevel": 5,
- "problemName": "멀티버스 Ⅰ",
- "average_try": 1.641,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.130245
- },
- "15721": {
- "problemId": "15721",
- "problemLevel": 5,
- "problemName": "번데기",
- "average_try": 2.1108,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.130268
- },
- "1969": {
- "problemId": "1969",
- "problemLevel": 6,
- "problemName": "DNA",
- "average_try": 1.7471,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.130292
- },
- "2503": {
- "problemId": "2503",
- "problemLevel": 7,
- "problemName": "숫자 야구",
- "average_try": 2.154,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.130317
- },
- "1436": {
- "problemId": "1436",
- "problemLevel": 6,
- "problemName": "영화감독 숌",
- "average_try": 2.0725,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.13034
- },
- "1018": {
- "problemId": "1018",
- "problemLevel": 6,
- "problemName": "체스판 다시 칠하기",
- "average_try": 2.1274,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.130364
- },
- "7568": {
- "problemId": "7568",
- "problemLevel": 6,
- "problemName": "덩치",
- "average_try": 1.7742,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.130387
- },
- "2422": {
- "problemId": "2422",
- "problemLevel": 6,
- "problemName": "한윤정이 이탈리아에 가서 아이스크림을 사먹는데",
- "average_try": 2.4683,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.130411
- },
- "2435": {
- "problemId": "2435",
- "problemLevel": 6,
- "problemName": "기상청 인턴 신현수",
- "average_try": 2.1371,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.130434
- },
- "2635": {
- "problemId": "2635",
- "problemLevel": 6,
- "problemName": "수 이어가기",
- "average_try": 2.6855,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.130482
- },
- "1059": {
- "problemId": "1059",
- "problemLevel": 6,
- "problemName": "좋은 구간",
- "average_try": 3.7852,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.130507
- },
- "5568": {
- "problemId": "5568",
- "problemLevel": 7,
- "problemName": "카드 놓기",
- "average_try": 1.67,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.130532
- },
- "11170": {
- "problemId": "11170",
- "problemLevel": 6,
- "problemName": "0의 개수",
- "average_try": 1.2611,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.130567
- },
- "1251": {
- "problemId": "1251",
- "problemLevel": 6,
- "problemName": "단어 나누기",
- "average_try": 2.2198,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.130591
- },
- "14912": {
- "problemId": "14912",
- "problemLevel": 6,
- "problemName": "숫자 빈도수",
- "average_try": 1.2581,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.130615
- },
- "19947": {
- "problemId": "19947",
- "problemLevel": 6,
- "problemName": "투자의 귀재 배주형",
- "average_try": 2.6711,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.130661
- },
- "1359": {
- "problemId": "1359",
- "problemLevel": 7,
- "problemName": "복권",
- "average_try": 3.0372,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 177,
- "key": "probability"
- }
- ],
- "lastupdate": 1648236948.130685
- },
- "15779": {
- "problemId": "15779",
- "problemLevel": 6,
- "problemName": "Zigzag",
- "average_try": 2.3949,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.130708
- },
- "18511": {
- "problemId": "18511",
- "problemLevel": 6,
- "problemName": "큰 수 구성하기",
- "average_try": 3.4095,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.130731
- },
- "17484": {
- "problemId": "17484",
- "problemLevel": 7,
- "problemName": "진우의 달 여행 (Small)",
- "average_try": 1.6416,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.130755
- },
- "9079": {
- "problemId": "9079",
- "problemLevel": 7,
- "problemName": "동전 게임",
- "average_try": 1.4111,
- "solvedtags": [
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.130778
- },
- "4096": {
- "problemId": "4096",
- "problemLevel": 5,
- "problemName": "팰린드로미터",
- "average_try": 2.0299,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.130801
- },
- "1065": {
- "problemId": "1065",
- "problemLevel": 7,
- "problemName": "한수",
- "average_try": 1.8822,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.130825
- },
- "1120": {
- "problemId": "1120",
- "problemLevel": 7,
- "problemName": "문자열",
- "average_try": 1.8436,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.130871
- },
- "3085": {
- "problemId": "3085",
- "problemLevel": 8,
- "problemName": "사탕 게임",
- "average_try": 3.1348,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.130893
- },
- "1543": {
- "problemId": "1543",
- "problemLevel": 7,
- "problemName": "문서 검색",
- "average_try": 2.5221,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.130916
- },
- "15970": {
- "problemId": "15970",
- "problemLevel": 7,
- "problemName": "화살표 그리기",
- "average_try": 1.9239,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.130939
- },
- "5671": {
- "problemId": "5671",
- "problemLevel": 6,
- "problemName": "호텔 방 번호",
- "average_try": 1.5966,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.130962
- },
- "16937": {
- "problemId": "16937",
- "problemLevel": 7,
- "problemName": "두 스티커",
- "average_try": 2.6561,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.130985
- },
- "5883": {
- "problemId": "5883",
- "problemLevel": 7,
- "problemName": "아이폰 9S",
- "average_try": 2.3298,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.131008
- },
- "16951": {
- "problemId": "16951",
- "problemLevel": 7,
- "problemName": "블록 놀이",
- "average_try": 2.9114,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.13103
- },
- "1487": {
- "problemId": "1487",
- "problemLevel": 7,
- "problemName": "물건 팔기",
- "average_try": 2.6818,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131053
- },
- "15270": {
- "problemId": "15270",
- "problemLevel": 8,
- "problemName": "친구 팰린드롬",
- "average_try": 3.6,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.131077
- },
- "11502": {
- "problemId": "11502",
- "problemLevel": 7,
- "problemName": "세 개의 소수 문제",
- "average_try": 1.6797,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.131123
- },
- "9996": {
- "problemId": "9996",
- "problemLevel": 8,
- "problemName": "한국이 그리울 땐 서버에 접속하지",
- "average_try": 3.5716,
- "solvedtags": [
- {
- "bojTagId": 63,
- "key": "regex"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.131147
- },
- "10472": {
- "problemId": "10472",
- "problemLevel": 10,
- "problemName": "십자뒤집기",
- "average_try": 2.4493,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.13117
- },
- "1895": {
- "problemId": "1895",
- "problemLevel": 7,
- "problemName": "필터",
- "average_try": 1.2299,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.131193
- },
- "16439": {
- "problemId": "16439",
- "problemLevel": 8,
- "problemName": "치킨치킨치킨",
- "average_try": 1.3299,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131215
- },
- "19949": {
- "problemId": "19949",
- "problemLevel": 8,
- "problemName": "영재의 시험",
- "average_try": 1.2,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131238
- },
- "15728": {
- "problemId": "15728",
- "problemLevel": 8,
- "problemName": "에리 - 카드",
- "average_try": 2.8958,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.13126
- },
- "16508": {
- "problemId": "16508",
- "problemLevel": 8,
- "problemName": "전공책",
- "average_try": 2.4528,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131283
- },
- "1503": {
- "problemId": "1503",
- "problemLevel": 8,
- "problemName": "세 수 고르기",
- "average_try": 4.873,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131305
- },
- "14620": {
- "problemId": "14620",
- "problemLevel": 9,
- "problemName": "꽃길",
- "average_try": 1.9672,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131328
- },
- "12919": {
- "problemId": "12919",
- "problemLevel": 11,
- "problemName": "A와 B 2",
- "average_try": 2.7759,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.131351
- },
- "1421": {
- "problemId": "1421",
- "problemLevel": 9,
- "problemName": "나무꾼 이다솜",
- "average_try": 4.4773,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.131375
- },
- "1411": {
- "problemId": "1411",
- "problemLevel": 9,
- "problemName": "비슷한 단어",
- "average_try": 1.7364,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.131398
- },
- "1548": {
- "problemId": "1548",
- "problemLevel": 11,
- "problemName": "부분 삼각 수열",
- "average_try": 2.9405,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.13142
- },
- "1254": {
- "problemId": "1254",
- "problemLevel": 10,
- "problemName": "팰린드롬 만들기",
- "average_try": 2.3327,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.131443
- },
- "2961": {
- "problemId": "2961",
- "problemLevel": 9,
- "problemName": "도영이가 만든 맛있는 음식",
- "average_try": 2.0971,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131465
- },
- "15661": {
- "problemId": "15661",
- "problemLevel": 10,
- "problemName": "링크와 스타트",
- "average_try": 2.056,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131488
- },
- "1527": {
- "problemId": "1527",
- "problemLevel": 10,
- "problemName": "금민수의 개수",
- "average_try": 2.6203,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131511
- },
- "17610": {
- "problemId": "17610",
- "problemLevel": 10,
- "problemName": "양팔저울",
- "average_try": 2.4335,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131534
- },
- "16943": {
- "problemId": "16943",
- "problemLevel": 10,
- "problemName": "숫자 재배치",
- "average_try": 2.3102,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.131558
- },
- "1025": {
- "problemId": "1025",
- "problemLevel": 11,
- "problemName": "제곱수 찾기",
- "average_try": 3.3724,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131581
- },
- "17085": {
- "problemId": "17085",
- "problemLevel": 11,
- "problemName": "십자가 2개 놓기",
- "average_try": 2.8528,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.131604
- },
- "14500": {
- "problemId": "14500",
- "problemLevel": 11,
- "problemName": "테트로미노",
- "average_try": 2.8139,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.131627
- },
- "15686": {
- "problemId": "15686",
- "problemLevel": 11,
- "problemName": "치킨 배달",
- "average_try": 2.2464,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.13165
- },
- "1107": {
- "problemId": "1107",
- "problemLevel": 11,
- "problemName": "리모컨",
- "average_try": 4.4464,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131674
- },
- "17471": {
- "problemId": "17471",
- "problemLevel": 12,
- "problemName": "게리맨더링",
- "average_try": 2.616,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.131697
- },
- "14225": {
- "problemId": "14225",
- "problemLevel": 10,
- "problemName": "부분수열의 합",
- "average_try": 2.2489,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131743
- },
- "1034": {
- "problemId": "1034",
- "problemLevel": 11,
- "problemName": "램프",
- "average_try": 2.7915,
- "solvedtags": [
- {
- "bojTagId": 109,
- "key": "ad_hoc"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131766
- },
- "16637": {
- "problemId": "16637",
- "problemLevel": 13,
- "problemName": "괄호 추가하기",
- "average_try": 2.605,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131788
- },
- "14391": {
- "problemId": "14391",
- "problemLevel": 13,
- "problemName": "종이 조각",
- "average_try": 1.7977,
- "solvedtags": [
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.131812
- },
- "16986": {
- "problemId": "16986",
- "problemLevel": 13,
- "problemName": "인싸들의 가위바위보",
- "average_try": 2.4318,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.131858
- },
- "1711": {
- "problemId": "1711",
- "problemLevel": 10,
- "problemName": "직각삼각형",
- "average_try": 2.6948,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 60,
- "key": "pythagoras"
- }
- ],
- "lastupdate": 1648236948.131882
- },
- "1581": {
- "problemId": "1581",
- "problemLevel": 12,
- "problemName": "락스타 락동호",
- "average_try": 3.7986,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 137,
- "key": "case_work"
- }
- ],
- "lastupdate": 1648236948.131904
- },
- "21278": {
- "problemId": "21278",
- "problemLevel": 11,
- "problemName": "호석이 두 마리 치킨",
- "average_try": 1.9499,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.131927
- },
- "21315": {
- "problemId": "21315",
- "problemLevel": 11,
- "problemName": "카드 섞기",
- "average_try": 2.2459,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.13195
- },
- "2304": {
- "problemId": "2304",
- "problemLevel": 9,
- "problemName": "창고 다각형",
- "average_try": 2.3928,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.131977
- },
- "21943": {
- "problemId": "21943",
- "problemLevel": 14,
- "problemName": "연산 최대로",
- "average_try": 1.6444,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.132
- },
- "22944": {
- "problemId": "22944",
- "problemLevel": 13,
- "problemName": "죽음의 비",
- "average_try": 6.2459,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.132047
- },
- "22947": {
- "problemId": "22947",
- "problemLevel": 14,
- "problemName": "실행 시간",
- "average_try": 2.7222,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.13207
- },
- "10828": {
- "problemId": "10828",
- "problemLevel": 7,
- "problemName": "스택",
- "average_try": 2.6222,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133205
- },
- "9012": {
- "problemId": "9012",
- "problemLevel": 7,
- "problemName": "괄호",
- "average_try": 2.2701,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.133236
- },
- "1874": {
- "problemId": "1874",
- "problemLevel": 8,
- "problemName": "스택 수열",
- "average_try": 2.7841,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133262
- },
- "1935": {
- "problemId": "1935",
- "problemLevel": 8,
- "problemName": "후위 표기식2",
- "average_try": 2.0968,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133287
- },
- "10799": {
- "problemId": "10799",
- "problemLevel": 8,
- "problemName": "쇠막대기",
- "average_try": 1.5773,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133311
- },
- "2504": {
- "problemId": "2504",
- "problemLevel": 9,
- "problemName": "괄호의 값",
- "average_try": 3.5403,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133335
- },
- "2800": {
- "problemId": "2800",
- "problemLevel": 11,
- "problemName": "괄호 제거",
- "average_try": 2.8873,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.13336
- },
- "2493": {
- "problemId": "2493",
- "problemLevel": 11,
- "problemName": "탑",
- "average_try": 3.356,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133385
- },
- "1918": {
- "problemId": "1918",
- "problemLevel": 13,
- "problemName": "후위 표기식",
- "average_try": 2.9972,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133408
- },
- "18258": {
- "problemId": "18258",
- "problemLevel": 7,
- "problemName": "큐 2",
- "average_try": 3.2039,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 72,
- "key": "queue"
- }
- ],
- "lastupdate": 1648236948.133445
- },
- "1158": {
- "problemId": "1158",
- "problemLevel": 7,
- "problemName": "요세푸스 문제",
- "average_try": 2.0743,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 72,
- "key": "queue"
- }
- ],
- "lastupdate": 1648236948.133469
- },
- "2164": {
- "problemId": "2164",
- "problemLevel": 7,
- "problemName": "카드2",
- "average_try": 1.9022,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 72,
- "key": "queue"
- }
- ],
- "lastupdate": 1648236948.133492
- },
- "1966": {
- "problemId": "1966",
- "problemLevel": 8,
- "problemName": "프린터 큐",
- "average_try": 1.7461,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 72,
- "key": "queue"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.133515
- },
- "10866": {
- "problemId": "10866",
- "problemLevel": 7,
- "problemName": "덱",
- "average_try": 1.7774,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 73,
- "key": "deque"
- }
- ],
- "lastupdate": 1648236948.133538
- },
- "2346": {
- "problemId": "2346",
- "problemLevel": 8,
- "problemName": "풍선 터뜨리기",
- "average_try": 2.4284,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 73,
- "key": "deque"
- }
- ],
- "lastupdate": 1648236948.13356
- },
- "10845": {
- "problemId": "10845",
- "problemLevel": 7,
- "problemName": "큐",
- "average_try": 2.0387,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 72,
- "key": "queue"
- }
- ],
- "lastupdate": 1648236948.133583
- },
- "4949": {
- "problemId": "4949",
- "problemLevel": 7,
- "problemName": "균형잡힌 세상",
- "average_try": 3.0881,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.133607
- },
- "3986": {
- "problemId": "3986",
- "problemLevel": 7,
- "problemName": "좋은 단어",
- "average_try": 1.934,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.13363
- },
- "1021": {
- "problemId": "1021",
- "problemLevel": 7,
- "problemName": "회전하는 큐",
- "average_try": 1.7511,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 73,
- "key": "deque"
- }
- ],
- "lastupdate": 1648236948.133654
- },
- "5397": {
- "problemId": "5397",
- "problemLevel": 8,
- "problemName": "키로거",
- "average_try": 3.9645,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 154,
- "key": "linked_list"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133677
- },
- "18115": {
- "problemId": "18115",
- "problemLevel": 8,
- "problemName": "카드 놓기",
- "average_try": 1.7188,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 73,
- "key": "deque"
- }
- ],
- "lastupdate": 1648236948.1337
- },
- "5430": {
- "problemId": "5430",
- "problemLevel": 11,
- "problemName": "AC",
- "average_try": 5.0079,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 73,
- "key": "deque"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.133723
- },
- "1863": {
- "problemId": "1863",
- "problemLevel": 11,
- "problemName": "스카이라인 쉬운거",
- "average_try": 2.5173,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.133747
- },
- "22866": {
- "problemId": "22866",
- "problemLevel": 12,
- "problemName": "탑 보기",
- "average_try": 3.2923,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.13377
- },
- "22942": {
- "problemId": "22942",
- "problemLevel": 12,
- "problemName": "데이터 체커",
- "average_try": 3.3542,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- },
- {
- "bojTagId": 106,
- "key": "sweeping"
- }
- ],
- "lastupdate": 1648236948.133793
- },
- "11279": {
- "problemId": "11279",
- "problemLevel": 9,
- "problemName": "최대 힙",
- "average_try": 2.188,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.134291
- },
- "11286": {
- "problemId": "11286",
- "problemLevel": 10,
- "problemName": "절댓값 힙",
- "average_try": 1.7436,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.134317
- },
- "7662": {
- "problemId": "7662",
- "problemLevel": 11,
- "problemName": "이중 우선순위 큐",
- "average_try": 4.3408,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.134342
- },
- "2075": {
- "problemId": "2075",
- "problemLevel": 11,
- "problemName": "N번째 큰 수",
- "average_try": 2.5245,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.134366
- },
- "2696": {
- "problemId": "2696",
- "problemLevel": 14,
- "problemName": "중앙값 구하기",
- "average_try": 1.9486,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.134413
- },
- "9375": {
- "problemId": "9375",
- "problemLevel": 8,
- "problemName": "패션왕 신해빈",
- "average_try": 1.8264,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.134436
- },
- "1927": {
- "problemId": "1927",
- "problemLevel": 9,
- "problemName": "최소 힙",
- "average_try": 2.0433,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.134459
- },
- "12764": {
- "problemId": "12764",
- "problemLevel": 13,
- "problemName": "싸지방에 간 준하",
- "average_try": 3.4791,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.134528
- },
- "1655": {
- "problemId": "1655",
- "problemLevel": 14,
- "problemName": "가운데를 말해요",
- "average_try": 3.2232,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.134582
- },
- "2776": {
- "problemId": "2776",
- "problemLevel": 7,
- "problemName": "암기왕",
- "average_try": 3.3814,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.134607
- },
- "1269": {
- "problemId": "1269",
- "problemLevel": 8,
- "problemName": "대칭 차집합",
- "average_try": 1.8125,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.134629
- },
- "10546": {
- "problemId": "10546",
- "problemLevel": 7,
- "problemName": "배부른 마라토너",
- "average_try": 2.1944,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- }
- ],
- "lastupdate": 1648236948.134653
- },
- "1302": {
- "problemId": "1302",
- "problemLevel": 7,
- "problemName": "베스트셀러",
- "average_try": 2.064,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.134676
- },
- "21939": {
- "problemId": "21939",
- "problemLevel": 12,
- "problemName": "문제 추천 시스템 Version 1",
- "average_try": 3.2341,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.134699
- },
- "21942": {
- "problemId": "21942",
- "problemLevel": 14,
- "problemName": "부품 대여장",
- "average_try": 4.5294,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.134722
- },
- "21944": {
- "problemId": "21944",
- "problemLevel": 13,
- "problemName": "문제 추천 시스템 Version 2",
- "average_try": 4.1395,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.134745
- },
- "1717": {
- "problemId": "1717",
- "problemLevel": 12,
- "problemName": "집합의 표현",
- "average_try": 3.5143,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- }
- ],
- "lastupdate": 1648236948.13513
- },
- "1976": {
- "problemId": "1976",
- "problemLevel": 12,
- "problemName": "여행 가자",
- "average_try": 2.647,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135174
- },
- "16562": {
- "problemId": "16562",
- "problemLevel": 13,
- "problemName": "친구비",
- "average_try": 2.336,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135201
- },
- "4195": {
- "problemId": "4195",
- "problemLevel": 14,
- "problemName": "친구 네트워크",
- "average_try": 3.9505,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- }
- ],
- "lastupdate": 1648236948.135227
- },
- "10775": {
- "problemId": "10775",
- "problemLevel": 14,
- "problemName": "공항",
- "average_try": 2.7699,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.13525
- },
- "20040": {
- "problemId": "20040",
- "problemLevel": 12,
- "problemName": "사이클 게임",
- "average_try": 1.8784,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- }
- ],
- "lastupdate": 1648236948.135273
- },
- "11085": {
- "problemId": "11085",
- "problemLevel": 13,
- "problemName": "군사 이동",
- "average_try": 1.6233,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135297
- },
- "17398": {
- "problemId": "17398",
- "problemLevel": 15,
- "problemName": "통신망 분할",
- "average_try": 2.8687,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- }
- ],
- "lastupdate": 1648236948.13532
- },
- "17352": {
- "problemId": "17352",
- "problemLevel": 11,
- "problemName": "여러분의 다리가 되어 드리겠습니다!",
- "average_try": 1.9227,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135344
- },
- "12893": {
- "problemId": "12893",
- "problemLevel": 12,
- "problemName": "적의 적",
- "average_try": 2.8439,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135367
- },
- "1043": {
- "problemId": "1043",
- "problemLevel": 12,
- "problemName": "거짓말",
- "average_try": 2.3713,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.13539
- },
- "16168": {
- "problemId": "16168",
- "problemLevel": 12,
- "problemName": "퍼레이드",
- "average_try": 3.0461,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 93,
- "key": "eulerian_path"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135413
- },
- "7511": {
- "problemId": "7511",
- "problemLevel": 11,
- "problemName": "소셜 네트워킹 어플리케이션",
- "average_try": 2.265,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135436
- },
- "3108": {
- "problemId": "3108",
- "problemLevel": 13,
- "problemName": "로고",
- "average_try": 3.4225,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135483
- },
- "15789": {
- "problemId": "15789",
- "problemLevel": 12,
- "problemName": "CTP 왕국은 한솔 왕국을 이길 수 있을까?",
- "average_try": 2.2824,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.135506
- },
- "18116": {
- "problemId": "18116",
- "problemLevel": 12,
- "problemName": "로봇 조립",
- "average_try": 3.4799,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- }
- ],
- "lastupdate": 1648236948.13553
- },
- "17090": {
- "problemId": "17090",
- "problemLevel": 14,
- "problemName": "미로 탈출하기",
- "average_try": 3.0242,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135553
- },
- "16724": {
- "problemId": "16724",
- "problemLevel": 14,
- "problemName": "피리 부는 사나이",
- "average_try": 2.3884,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.135576
- },
- "14595": {
- "problemId": "14595",
- "problemLevel": 14,
- "problemName": "동방 프로젝트 (Large)",
- "average_try": 2.581,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- }
- ],
- "lastupdate": 1648236948.135599
- },
- "2630": {
- "problemId": "2630",
- "problemLevel": 8,
- "problemName": "색종이 만들기",
- "average_try": 1.4409,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.135988
- },
- "4779": {
- "problemId": "4779",
- "problemLevel": 8,
- "problemName": "칸토어 집합",
- "average_try": 2.1654,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136019
- },
- "1780": {
- "problemId": "1780",
- "problemLevel": 9,
- "problemName": "종이의 개수",
- "average_try": 1.6934,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136044
- },
- "17829": {
- "problemId": "17829",
- "problemLevel": 9,
- "problemName": "222-풀링",
- "average_try": 1.3375,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.136068
- },
- "18222": {
- "problemId": "18222",
- "problemLevel": 9,
- "problemName": "투에-모스 문자열",
- "average_try": 2.5348,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136093
- },
- "1802": {
- "problemId": "1802",
- "problemLevel": 9,
- "problemName": "종이 접기",
- "average_try": 2.843,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.136117
- },
- "2447": {
- "problemId": "2447",
- "problemLevel": 10,
- "problemName": "별 찍기 - 10",
- "average_try": 1.895,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.13614
- },
- "1992": {
- "problemId": "1992",
- "problemLevel": 10,
- "problemName": "쿼드트리",
- "average_try": 1.6419,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136174
- },
- "1074": {
- "problemId": "1074",
- "problemLevel": 10,
- "problemName": "Z",
- "average_try": 2.644,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136197
- },
- "5904": {
- "problemId": "5904",
- "problemLevel": 10,
- "problemName": "Moo 게임",
- "average_try": 2.6952,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136221
- },
- "1493": {
- "problemId": "1493",
- "problemLevel": 12,
- "problemName": "박스 채우기",
- "average_try": 3.8316,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.136244
- },
- "2374": {
- "problemId": "2374",
- "problemLevel": 12,
- "problemName": "같은 수로 만들기",
- "average_try": 2.7348,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.136268
- },
- "14600": {
- "problemId": "14600",
- "problemLevel": 11,
- "problemName": "샤워실 바닥 깔기 (Small)",
- "average_try": 1.4167,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.136315
- },
- "1030": {
- "problemId": "1030",
- "problemLevel": 13,
- "problemName": "프렉탈 평면",
- "average_try": 2.2616,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136338
- },
- "16438": {
- "problemId": "16438",
- "problemLevel": 13,
- "problemName": "원숭이 스포츠",
- "average_try": 2.0417,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- }
- ],
- "lastupdate": 1648236948.13636
- },
- "14601": {
- "problemId": "14601",
- "problemLevel": 15,
- "problemName": "샤워실 바닥 깔기 (Large)",
- "average_try": 1.7095,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136383
- },
- "2448": {
- "problemId": "2448",
- "problemLevel": 12,
- "problemName": "별 찍기 - 11",
- "average_try": 2.5717,
- "solvedtags": [
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.136407
- },
- "10870": {
- "problemId": "10870",
- "problemLevel": 4,
- "problemName": "피보나치 수 5",
- "average_try": 1.5911,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.136785
- },
- "2839": {
- "problemId": "2839",
- "problemLevel": 5,
- "problemName": "설탕 배달",
- "average_try": 2.8803,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.136815
- },
- "2748": {
- "problemId": "2748",
- "problemLevel": 5,
- "problemName": "피보나치 수 2",
- "average_try": 2.5116,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.13684
- },
- "1010": {
- "problemId": "1010",
- "problemLevel": 6,
- "problemName": "다리 놓기",
- "average_try": 2.0741,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.136865
- },
- "9655": {
- "problemId": "9655",
- "problemLevel": 6,
- "problemName": "돌 게임",
- "average_try": 1.493,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 140,
- "key": "game_theory"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.136889
- },
- "17626": {
- "problemId": "17626",
- "problemLevel": 7,
- "problemName": "Four Squares",
- "average_try": 2.1204,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.136924
- },
- "15489": {
- "problemId": "15489",
- "problemLevel": 6,
- "problemName": "파스칼 삼각형",
- "average_try": 1.6959,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.136947
- },
- "14501": {
- "problemId": "14501",
- "problemLevel": 8,
- "problemName": "퇴사",
- "average_try": 2.0564,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.136971
- },
- "2670": {
- "problemId": "2670",
- "problemLevel": 7,
- "problemName": "연속부분최대곱",
- "average_try": 2.7848,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.136994
- },
- "13699": {
- "problemId": "13699",
- "problemLevel": 7,
- "problemName": "점화식",
- "average_try": 1.3451,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137017
- },
- "1463": {
- "problemId": "1463",
- "problemLevel": 8,
- "problemName": "1로 만들기",
- "average_try": 3.1233,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137041
- },
- "9095": {
- "problemId": "9095",
- "problemLevel": 8,
- "problemName": "1, 2, 3 더하기",
- "average_try": 1.5808,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137065
- },
- "1003": {
- "problemId": "1003",
- "problemLevel": 8,
- "problemName": "피보나치 함수",
- "average_try": 3.2045,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137088
- },
- "11726": {
- "problemId": "11726",
- "problemLevel": 8,
- "problemName": "2×n 타일링",
- "average_try": 2.8153,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137112
- },
- "2579": {
- "problemId": "2579",
- "problemLevel": 8,
- "problemName": "계단 오르기",
- "average_try": 2.9128,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137134
- },
- "2193": {
- "problemId": "2193",
- "problemLevel": 8,
- "problemName": "이친수",
- "average_try": 2.5346,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137157
- },
- "11727": {
- "problemId": "11727",
- "problemLevel": 8,
- "problemName": "2×n 타일링 2",
- "average_try": 1.6863,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.13718
- },
- "9461": {
- "problemId": "9461",
- "problemLevel": 8,
- "problemName": "파도반 수열",
- "average_try": 2.3936,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.137204
- },
- "1699": {
- "problemId": "1699",
- "problemLevel": 8,
- "problemName": "제곱수의 합",
- "average_try": 2.5537,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.137226
- },
- "15990": {
- "problemId": "15990",
- "problemLevel": 9,
- "problemName": "1, 2, 3 더하기 5",
- "average_try": 3.2121,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137249
- },
- "10211": {
- "problemId": "10211",
- "problemLevel": 8,
- "problemName": "Maximum Subarray",
- "average_try": 2.3758,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.137272
- },
- "17175": {
- "problemId": "17175",
- "problemLevel": 8,
- "problemName": "피보나치는 지겨웡~",
- "average_try": 2.297,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137295
- },
- "15624": {
- "problemId": "15624",
- "problemLevel": 7,
- "problemName": "피보나치 수 7",
- "average_try": 1.8235,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.137318
- },
- "17212": {
- "problemId": "17212",
- "problemLevel": 8,
- "problemName": "달나라 토끼를 위한 구매대금 지불 도우미",
- "average_try": 2.0187,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137341
- },
- "2876": {
- "problemId": "2876",
- "problemLevel": 9,
- "problemName": "그래픽스 퀴즈",
- "average_try": 2.1336,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137363
- },
- "20152": {
- "problemId": "20152",
- "problemLevel": 9,
- "problemName": "Game Addiction",
- "average_try": 2.1546,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.137386
- },
- "11053": {
- "problemId": "11053",
- "problemLevel": 9,
- "problemName": "가장 긴 증가하는 부분 수열",
- "average_try": 2.6898,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137409
- },
- "1912": {
- "problemId": "1912",
- "problemLevel": 9,
- "problemName": "연속합",
- "average_try": 3.0316,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137432
- },
- "9465": {
- "problemId": "9465",
- "problemLevel": 10,
- "problemName": "스티커",
- "average_try": 2.1172,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137455
- },
- "11055": {
- "problemId": "11055",
- "problemLevel": 9,
- "problemName": "가장 큰 증가 부분 수열",
- "average_try": 2.2116,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137478
- },
- "11722": {
- "problemId": "11722",
- "problemLevel": 9,
- "problemName": "가장 긴 감소하는 부분 수열",
- "average_try": 1.5529,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137501
- },
- "1890": {
- "problemId": "1890",
- "problemLevel": 9,
- "problemName": "점프",
- "average_try": 3.4451,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137524
- },
- "1965": {
- "problemId": "1965",
- "problemLevel": 9,
- "problemName": "상자넣기",
- "average_try": 2.0539,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137547
- },
- "2407": {
- "problemId": "2407",
- "problemLevel": 8,
- "problemName": "조합",
- "average_try": 2.5597,
- "solvedtags": [
- {
- "bojTagId": 117,
- "key": "arbitrary_precision"
- },
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.13757
- },
- "11060": {
- "problemId": "11060",
- "problemLevel": 9,
- "problemName": "점프 점프",
- "average_try": 2.8522,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.137592
- },
- "15988": {
- "problemId": "15988",
- "problemLevel": 9,
- "problemName": "1, 2, 3 더하기 3",
- "average_try": 2.8437,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137615
- },
- "2491": {
- "problemId": "2491",
- "problemLevel": 7,
- "problemName": "수열",
- "average_try": 3.1569,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.137638
- },
- "15486": {
- "problemId": "15486",
- "problemLevel": 10,
- "problemName": "퇴사 2",
- "average_try": 2.6051,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137662
- },
- "1660": {
- "problemId": "1660",
- "problemLevel": 9,
- "problemName": "캡틴 이다솜",
- "average_try": 3.0086,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137686
- },
- "14852": {
- "problemId": "14852",
- "problemLevel": 11,
- "problemName": "타일 채우기 3",
- "average_try": 3.9436,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137709
- },
- "14430": {
- "problemId": "14430",
- "problemLevel": 9,
- "problemName": "자원 캐기",
- "average_try": 1.8521,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137732
- },
- "1633": {
- "problemId": "1633",
- "problemLevel": 10,
- "problemName": "최고의 팀 만들기",
- "average_try": 2.2808,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137755
- },
- "18353": {
- "problemId": "18353",
- "problemLevel": 9,
- "problemName": "병사 배치하기",
- "average_try": 2.4404,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 43,
- "key": "lis"
- }
- ],
- "lastupdate": 1648236948.137778
- },
- "1106": {
- "problemId": "1106",
- "problemLevel": 10,
- "problemName": "호텔",
- "average_try": 3.2668,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.1378
- },
- "17291": {
- "problemId": "17291",
- "problemLevel": 9,
- "problemName": "새끼치기",
- "average_try": 2.2524,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.137824
- },
- "4097": {
- "problemId": "4097",
- "problemLevel": 9,
- "problemName": "수익",
- "average_try": 2.0264,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137847
- },
- "20162": {
- "problemId": "20162",
- "problemLevel": 9,
- "problemName": "간식 파티",
- "average_try": 1.8736,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.13787
- },
- "1149": {
- "problemId": "1149",
- "problemLevel": 10,
- "problemName": "RGB거리",
- "average_try": 1.9884,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137893
- },
- "1932": {
- "problemId": "1932",
- "problemLevel": 10,
- "problemName": "정수 삼각형",
- "average_try": 1.7061,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137916
- },
- "2156": {
- "problemId": "2156",
- "problemLevel": 10,
- "problemName": "포도주 시식",
- "average_try": 3.0535,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137939
- },
- "10844": {
- "problemId": "10844",
- "problemLevel": 10,
- "problemName": "쉬운 계단 수",
- "average_try": 3.4193,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137961
- },
- "11052": {
- "problemId": "11052",
- "problemLevel": 10,
- "problemName": "카드 구매하기",
- "average_try": 1.6415,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.137984
- },
- "11057": {
- "problemId": "11057",
- "problemLevel": 10,
- "problemName": "오르막 수",
- "average_try": 2.1098,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138007
- },
- "2293": {
- "problemId": "2293",
- "problemLevel": 11,
- "problemName": "동전 1",
- "average_try": 2.2185,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.13803
- },
- "11051": {
- "problemId": "11051",
- "problemLevel": 10,
- "problemName": "이항 계수 2",
- "average_try": 2.6065,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.138052
- },
- "11048": {
- "problemId": "11048",
- "problemLevel": 10,
- "problemName": "이동하기",
- "average_try": 1.7334,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138075
- },
- "2294": {
- "problemId": "2294",
- "problemLevel": 10,
- "problemName": "동전 2",
- "average_try": 3.4878,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138098
- },
- "1309": {
- "problemId": "1309",
- "problemLevel": 10,
- "problemName": "동물원",
- "average_try": 2.0759,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138122
- },
- "2565": {
- "problemId": "2565",
- "problemLevel": 11,
- "problemName": "전깃줄",
- "average_try": 2.1345,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138144
- },
- "2011": {
- "problemId": "2011",
- "problemLevel": 11,
- "problemName": "암호코드",
- "average_try": 5.0778,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138167
- },
- "10164": {
- "problemId": "10164",
- "problemLevel": 10,
- "problemName": "격자상의 경로",
- "average_try": 2.8792,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.138212
- },
- "16194": {
- "problemId": "16194",
- "problemLevel": 10,
- "problemName": "카드 구매하기 2",
- "average_try": 1.318,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138234
- },
- "19622": {
- "problemId": "19622",
- "problemLevel": 9,
- "problemName": "회의실 배정 3",
- "average_try": 2.3152,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138257
- },
- "15989": {
- "problemId": "15989",
- "problemLevel": 10,
- "problemName": "1, 2, 3 더하기 4",
- "average_try": 1.5295,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.13828
- },
- "12101": {
- "problemId": "12101",
- "problemLevel": 10,
- "problemName": "1, 2, 3 더하기 2",
- "average_try": 1.5819,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- }
- ],
- "lastupdate": 1648236948.138304
- },
- "15992": {
- "problemId": "15992",
- "problemLevel": 10,
- "problemName": "1, 2, 3 더하기 7",
- "average_try": 1.8372,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138327
- },
- "15991": {
- "problemId": "15991",
- "problemLevel": 10,
- "problemName": "1, 2, 3 더하기 6",
- "average_try": 2.0774,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138349
- },
- "16195": {
- "problemId": "16195",
- "problemLevel": 10,
- "problemName": "1, 2, 3 더하기 9",
- "average_try": 1.8127,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138372
- },
- "15993": {
- "problemId": "15993",
- "problemLevel": 10,
- "problemName": "1, 2, 3 더하기 8",
- "average_try": 1.7514,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138395
- },
- "1495": {
- "problemId": "1495",
- "problemLevel": 10,
- "problemName": "기타리스트",
- "average_try": 2.8661,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138418
- },
- "2302": {
- "problemId": "2302",
- "problemLevel": 10,
- "problemName": "극장 좌석",
- "average_try": 2.3232,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138441
- },
- "11568": {
- "problemId": "11568",
- "problemLevel": 9,
- "problemName": "민균이의 계략",
- "average_try": 1.7721,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 43,
- "key": "lis"
- }
- ],
- "lastupdate": 1648236948.138464
- },
- "12026": {
- "problemId": "12026",
- "problemLevel": 10,
- "problemName": "BOJ 거리",
- "average_try": 1.6195,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138487
- },
- "14722": {
- "problemId": "14722",
- "problemLevel": 12,
- "problemName": "우유 도시",
- "average_try": 3.1617,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138509
- },
- "13910": {
- "problemId": "13910",
- "problemLevel": 10,
- "problemName": "개업",
- "average_try": 2.9614,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138535
- },
- "21317": {
- "problemId": "21317",
- "problemLevel": 10,
- "problemName": "징검다리 건너기",
- "average_try": 2.9295,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.13857
- },
- "22857": {
- "problemId": "22857",
- "problemLevel": 8,
- "problemName": "가장 긴 짝수 연속한 부분 수열 (small)",
- "average_try": 2.1387,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.138595
- },
- "22869": {
- "problemId": "22869",
- "problemLevel": 10,
- "problemName": "징검다리 건너기 (small)",
- "average_try": 2.8716,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138618
- },
- "22871": {
- "problemId": "22871",
- "problemLevel": 10,
- "problemName": "징검다리 건너기 (large)",
- "average_try": 3.2857,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.138644
- },
- "1535": {
- "problemId": "1535",
- "problemLevel": 9,
- "problemName": "안녕",
- "average_try": 1.9562,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139625
- },
- "9084": {
- "problemId": "9084",
- "problemLevel": 11,
- "problemName": "동전",
- "average_try": 1.5409,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.13967
- },
- "3067": {
- "problemId": "3067",
- "problemLevel": 11,
- "problemName": "Coins",
- "average_try": 1.3532,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139696
- },
- "12865": {
- "problemId": "12865",
- "problemLevel": 11,
- "problemName": "평범한 배낭",
- "average_try": 2.8346,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.13972
- },
- "14728": {
- "problemId": "14728",
- "problemLevel": 11,
- "problemName": "벼락치기",
- "average_try": 2.1217,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139744
- },
- "17845": {
- "problemId": "17845",
- "problemLevel": 11,
- "problemName": "수강 과목",
- "average_try": 1.7092,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139768
- },
- "17208": {
- "problemId": "17208",
- "problemLevel": 12,
- "problemName": "카우버거 알바생",
- "average_try": 2.4979,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139792
- },
- "18427": {
- "problemId": "18427",
- "problemLevel": 12,
- "problemName": "함께 블록 쌓기",
- "average_try": 2.5781,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139815
- },
- "7579": {
- "problemId": "7579",
- "problemLevel": 13,
- "problemName": "앱",
- "average_try": 2.6923,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139839
- },
- "2629": {
- "problemId": "2629",
- "problemLevel": 13,
- "problemName": "양팔저울",
- "average_try": 3.3299,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139862
- },
- "19645": {
- "problemId": "19645",
- "problemLevel": 15,
- "problemName": "햄최몇?",
- "average_try": 2.3558,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139885
- },
- "20667": {
- "problemId": "20667",
- "problemLevel": 15,
- "problemName": "크롬",
- "average_try": 5.5122,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.139908
- },
- "9251": {
- "problemId": "9251",
- "problemLevel": 11,
- "problemName": "LCS",
- "average_try": 2.4711,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.139932
- },
- "2225": {
- "problemId": "2225",
- "problemLevel": 11,
- "problemName": "합분해",
- "average_try": 2.371,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.139956
- },
- "1915": {
- "problemId": "1915",
- "problemLevel": 12,
- "problemName": "가장 큰 정사각형",
- "average_try": 3.4129,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.13998
- },
- "17070": {
- "problemId": "17070",
- "problemLevel": 11,
- "problemName": "파이프 옮기기 1",
- "average_try": 2.1126,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.140003
- },
- "5557": {
- "problemId": "5557",
- "problemLevel": 11,
- "problemName": "1학년",
- "average_try": 2.4787,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140026
- },
- "2631": {
- "problemId": "2631",
- "problemLevel": 11,
- "problemName": "줄세우기",
- "average_try": 1.5511,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.14005
- },
- "14226": {
- "problemId": "14226",
- "problemLevel": 11,
- "problemName": "이모티콘",
- "average_try": 2.913,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.140073
- },
- "5582": {
- "problemId": "5582",
- "problemLevel": 11,
- "problemName": "공통 부분 문자열",
- "average_try": 2.3164,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.140097
- },
- "13398": {
- "problemId": "13398",
- "problemLevel": 11,
- "problemName": "연속합 2",
- "average_try": 3.4621,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140119
- },
- "4811": {
- "problemId": "4811",
- "problemLevel": 11,
- "problemName": "알약",
- "average_try": 1.5406,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140142
- },
- "2688": {
- "problemId": "2688",
- "problemLevel": 11,
- "problemName": "줄어들지 않아",
- "average_try": 1.9298,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140165
- },
- "2624": {
- "problemId": "2624",
- "problemLevel": 11,
- "problemName": "동전 바꿔주기",
- "average_try": 2.0527,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140189
- },
- "13302": {
- "problemId": "13302",
- "problemLevel": 11,
- "problemName": "리조트",
- "average_try": 2.2181,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140212
- },
- "2228": {
- "problemId": "2228",
- "problemLevel": 12,
- "problemName": "구간 나누기",
- "average_try": 3.3715,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140235
- },
- "17069": {
- "problemId": "17069",
- "problemLevel": 11,
- "problemName": "파이프 옮기기 2",
- "average_try": 1.7652,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140258
- },
- "2229": {
- "problemId": "2229",
- "problemLevel": 11,
- "problemName": "조 짜기",
- "average_try": 1.6583,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140282
- },
- "5569": {
- "problemId": "5569",
- "problemLevel": 12,
- "problemName": "출근 경로",
- "average_try": 2.0766,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140304
- },
- "5624": {
- "problemId": "5624",
- "problemLevel": 12,
- "problemName": "좋은 수",
- "average_try": 3.0943,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140327
- },
- "14925": {
- "problemId": "14925",
- "problemLevel": 12,
- "problemName": "목장 건설하기",
- "average_try": 2.4873,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140349
- },
- "14699": {
- "problemId": "14699",
- "problemLevel": 11,
- "problemName": "관악산 등산",
- "average_try": 2.11,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.140372
- },
- "17265": {
- "problemId": "17265",
- "problemLevel": 11,
- "problemName": "나의 인생에는 수학과 함께",
- "average_try": 1.9484,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.140419
- },
- "1757": {
- "problemId": "1757",
- "problemLevel": 12,
- "problemName": "달려달려",
- "average_try": 2.6178,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140442
- },
- "4095": {
- "problemId": "4095",
- "problemLevel": 11,
- "problemName": "최대 정사각형",
- "average_try": 2.4153,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140465
- },
- "2758": {
- "problemId": "2758",
- "problemLevel": 12,
- "problemName": "로또",
- "average_try": 4.2413,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140487
- },
- "10653": {
- "problemId": "10653",
- "problemLevel": 12,
- "problemName": "마라톤 2",
- "average_try": 2.6224,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.14051
- },
- "16400": {
- "problemId": "16400",
- "problemLevel": 11,
- "problemName": "소수 화폐",
- "average_try": 2.0696,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.140533
- },
- "17216": {
- "problemId": "17216",
- "problemLevel": 10,
- "problemName": "가장 큰 감소 부분 수열",
- "average_try": 1.7695,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140556
- },
- "11985": {
- "problemId": "11985",
- "problemLevel": 11,
- "problemName": "오렌지 출하",
- "average_try": 1.9652,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140578
- },
- "17485": {
- "problemId": "17485",
- "problemLevel": 11,
- "problemName": "진우의 달 여행 (Large)",
- "average_try": 2.2664,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140601
- },
- "15724": {
- "problemId": "15724",
- "problemLevel": 10,
- "problemName": "주지수",
- "average_try": 2.389,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.140624
- },
- "17255": {
- "problemId": "17255",
- "problemLevel": 12,
- "problemName": "N으로 만들기",
- "average_try": 2.2526,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.14067
- },
- "2073": {
- "problemId": "2073",
- "problemLevel": 12,
- "problemName": "수도배관공사",
- "average_try": 2.8689,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.140692
- },
- "1520": {
- "problemId": "1520",
- "problemLevel": 12,
- "problemName": "내리막 길",
- "average_try": 3.5554,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.140715
- },
- "2602": {
- "problemId": "2602",
- "problemLevel": 12,
- "problemName": "돌다리 건너기",
- "average_try": 2.0716,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140761
- },
- "2616": {
- "problemId": "2616",
- "problemLevel": 12,
- "problemName": "소형기관차",
- "average_try": 2.3346,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.140783
- },
- "17404": {
- "problemId": "17404",
- "problemLevel": 12,
- "problemName": "RGB거리 2",
- "average_try": 1.7887,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140805
- },
- "1695": {
- "problemId": "1695",
- "problemLevel": 12,
- "problemName": "팰린드롬 만들기",
- "average_try": 2.7606,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140828
- },
- "2157": {
- "problemId": "2157",
- "problemLevel": 12,
- "problemName": "여행",
- "average_try": 4.8274,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.14085
- },
- "14863": {
- "problemId": "14863",
- "problemLevel": 12,
- "problemName": "서울에서 경산까지",
- "average_try": 3.3722,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140873
- },
- "1577": {
- "problemId": "1577",
- "problemLevel": 12,
- "problemName": "도로의 개수",
- "average_try": 3.6281,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140895
- },
- "2411": {
- "problemId": "2411",
- "problemLevel": 12,
- "problemName": "아이템 먹기",
- "average_try": 2.434,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.14094
- },
- "1301": {
- "problemId": "1301",
- "problemLevel": 12,
- "problemName": "비즈 공예",
- "average_try": 3.3521,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140963
- },
- "2253": {
- "problemId": "2253",
- "problemLevel": 12,
- "problemName": "점프",
- "average_try": 4.0036,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.140986
- },
- "13902": {
- "problemId": "13902",
- "problemLevel": 12,
- "problemName": "개업 2",
- "average_try": 4.4286,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141009
- },
- "13707": {
- "problemId": "13707",
- "problemLevel": 12,
- "problemName": "합분해 2",
- "average_try": 2.1216,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.141031
- },
- "14945": {
- "problemId": "14945",
- "problemLevel": 12,
- "problemName": "불장난",
- "average_try": 1.6667,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141054
- },
- "1943": {
- "problemId": "1943",
- "problemLevel": 13,
- "problemName": "동전 분배",
- "average_try": 5.1828,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 148,
- "key": "knapsack"
- }
- ],
- "lastupdate": 1648236948.141076
- },
- "20542": {
- "problemId": "20542",
- "problemLevel": 13,
- "problemName": "받아쓰기",
- "average_try": 2.3689,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.141099
- },
- "11054": {
- "problemId": "11054",
- "problemLevel": 13,
- "problemName": "가장 긴 바이토닉 부분 수열",
- "average_try": 1.9655,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141121
- },
- "1937": {
- "problemId": "1937",
- "problemLevel": 13,
- "problemName": "욕심쟁이 판다",
- "average_try": 3.347,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.141167
- },
- "11066": {
- "problemId": "11066",
- "problemLevel": 13,
- "problemName": "파일 합치기",
- "average_try": 1.97,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141189
- },
- "11049": {
- "problemId": "11049",
- "problemLevel": 13,
- "problemName": "행렬 곱셈 순서",
- "average_try": 2.2502,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141212
- },
- "1958": {
- "problemId": "1958",
- "problemLevel": 13,
- "problemName": "LCS 3",
- "average_try": 1.9732,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.141257
- },
- "1727": {
- "problemId": "1727",
- "problemLevel": 13,
- "problemName": "커플 만들기",
- "average_try": 3.371,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.14128
- },
- "1823": {
- "problemId": "1823",
- "problemLevel": 13,
- "problemName": "수확",
- "average_try": 2.1074,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141303
- },
- "10942": {
- "problemId": "10942",
- "problemLevel": 13,
- "problemName": "팰린드롬?",
- "average_try": 3.4126,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141327
- },
- "3687": {
- "problemId": "3687",
- "problemLevel": 14,
- "problemName": "성냥개비",
- "average_try": 2.9005,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.141372
- },
- "12015": {
- "problemId": "12015",
- "problemLevel": 14,
- "problemName": "가장 긴 증가하는 부분 수열 2",
- "average_try": 2.3552,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 43,
- "key": "lis"
- }
- ],
- "lastupdate": 1648236948.141395
- },
- "11909": {
- "problemId": "11909",
- "problemLevel": 11,
- "problemName": "배열 탈출",
- "average_try": 2.1982,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.141418
- },
- "21923": {
- "problemId": "21923",
- "problemLevel": 12,
- "problemName": "곡예 비행",
- "average_try": 1.9167,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- }
- ],
- "lastupdate": 1648236948.141465
- },
- "21941": {
- "problemId": "21941",
- "problemLevel": 11,
- "problemName": "문자열 제거",
- "average_try": 2.8714,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.141487
- },
- "17831": {
- "problemId": "17831",
- "problemLevel": 16,
- "problemName": "대기업 승범이네",
- "average_try": 2.2105,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.142653
- },
- "1135": {
- "problemId": "1135",
- "problemLevel": 15,
- "problemName": "뉴스 전하기",
- "average_try": 2.3892,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.142677
- },
- "1260": {
- "problemId": "1260",
- "problemLevel": 9,
- "problemName": "DFS와 BFS",
- "average_try": 2.8582,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143
- },
- "2606": {
- "problemId": "2606",
- "problemLevel": 8,
- "problemName": "바이러스",
- "average_try": 2.1897,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143041
- },
- "1012": {
- "problemId": "1012",
- "problemLevel": 9,
- "problemName": "유기농 배추",
- "average_try": 2.7175,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143067
- },
- "11724": {
- "problemId": "11724",
- "problemLevel": 9,
- "problemName": "연결 요소의 개수",
- "average_try": 2.303,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143092
- },
- "4963": {
- "problemId": "4963",
- "problemLevel": 9,
- "problemName": "섬의 개수",
- "average_try": 2.0315,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143116
- },
- "7562": {
- "problemId": "7562",
- "problemLevel": 10,
- "problemName": "나이트의 이동",
- "average_try": 2.0569,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.14314
- },
- "2644": {
- "problemId": "2644",
- "problemLevel": 9,
- "problemName": "촌수계산",
- "average_try": 2.1182,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143164
- },
- "1325": {
- "problemId": "1325",
- "problemLevel": 10,
- "problemName": "효율적인 해킹",
- "average_try": 5.0533,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143211
- },
- "3184": {
- "problemId": "3184",
- "problemLevel": 9,
- "problemName": "양",
- "average_try": 1.5884,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143235
- },
- "16928": {
- "problemId": "16928",
- "problemLevel": 11,
- "problemName": "뱀과 사다리 게임",
- "average_try": 2.8753,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143282
- },
- "13565": {
- "problemId": "13565",
- "problemLevel": 9,
- "problemName": "침투",
- "average_try": 2.2558,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143304
- },
- "12761": {
- "problemId": "12761",
- "problemLevel": 10,
- "problemName": "돌다리",
- "average_try": 1.937,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143327
- },
- "3187": {
- "problemId": "3187",
- "problemLevel": 9,
- "problemName": "양치기 꿍",
- "average_try": 1.5174,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143349
- },
- "18232": {
- "problemId": "18232",
- "problemLevel": 9,
- "problemName": "텔레포트 정거장",
- "average_try": 2.9734,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143372
- },
- "14248": {
- "problemId": "14248",
- "problemLevel": 9,
- "problemName": "점프 점프",
- "average_try": 1.5731,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143394
- },
- "2178": {
- "problemId": "2178",
- "problemLevel": 10,
- "problemName": "미로 탐색",
- "average_try": 2.4659,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143417
- },
- "2667": {
- "problemId": "2667",
- "problemLevel": 10,
- "problemName": "단지번호붙이기",
- "average_try": 2.4763,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.14344
- },
- "7576": {
- "problemId": "7576",
- "problemLevel": 11,
- "problemName": "토마토",
- "average_try": 2.8917,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143463
- },
- "1697": {
- "problemId": "1697",
- "problemLevel": 10,
- "problemName": "숨바꼭질",
- "average_try": 4.0022,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143487
- },
- "2583": {
- "problemId": "2583",
- "problemLevel": 10,
- "problemName": "영역 구하기",
- "average_try": 1.767,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143509
- },
- "7569": {
- "problemId": "7569",
- "problemLevel": 11,
- "problemName": "토마토",
- "average_try": 2.4364,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143531
- },
- "5567": {
- "problemId": "5567",
- "problemLevel": 9,
- "problemName": "결혼식",
- "average_try": 2.3728,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143556
- },
- "1926": {
- "problemId": "1926",
- "problemLevel": 10,
- "problemName": "그림",
- "average_try": 2.3639,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143579
- },
- "1743": {
- "problemId": "1743",
- "problemLevel": 10,
- "problemName": "음식물 피하기",
- "average_try": 2.1135,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143603
- },
- "6118": {
- "problemId": "6118",
- "problemLevel": 10,
- "problemName": "숨바꼭질",
- "average_try": 1.9641,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143626
- },
- "16948": {
- "problemId": "16948",
- "problemLevel": 10,
- "problemName": "데스 나이트",
- "average_try": 1.4433,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143671
- },
- "16918": {
- "problemId": "16918",
- "problemLevel": 10,
- "problemName": "봄버맨",
- "average_try": 2.4119,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.143693
- },
- "18405": {
- "problemId": "18405",
- "problemLevel": 10,
- "problemName": "경쟁적 전염",
- "average_try": 3.5002,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.143716
- },
- "15558": {
- "problemId": "15558",
- "problemLevel": 10,
- "problemName": "점프 게임",
- "average_try": 3.1648,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143739
- },
- "1303": {
- "problemId": "1303",
- "problemLevel": 10,
- "problemName": "전쟁 - 전투",
- "average_try": 2.64,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143761
- },
- "17086": {
- "problemId": "17086",
- "problemLevel": 9,
- "problemName": "아기 상어 2",
- "average_try": 2.0708,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143784
- },
- "14496": {
- "problemId": "14496",
- "problemLevel": 10,
- "problemName": "그대, 그머가 되어",
- "average_try": 2.2186,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143806
- },
- "11123": {
- "problemId": "11123",
- "problemLevel": 10,
- "problemName": "양 한마리... 양 두마리...",
- "average_try": 1.505,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143829
- },
- "18404": {
- "problemId": "18404",
- "problemLevel": 10,
- "problemName": "현명한 나이트",
- "average_try": 1.9931,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143851
- },
- "5547": {
- "problemId": "5547",
- "problemLevel": 11,
- "problemName": "일루미네이션",
- "average_try": 1.652,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143874
- },
- "14502": {
- "problemId": "14502",
- "problemLevel": 11,
- "problemName": "연구소",
- "average_try": 1.8072,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143897
- },
- "10026": {
- "problemId": "10026",
- "problemLevel": 11,
- "problemName": "적록색약",
- "average_try": 1.7418,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143919
- },
- "3055": {
- "problemId": "3055",
- "problemLevel": 12,
- "problemName": "탈출",
- "average_try": 3.1619,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143942
- },
- "5014": {
- "problemId": "5014",
- "problemLevel": 11,
- "problemName": "스타트링크",
- "average_try": 2.9917,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.143987
- },
- "2589": {
- "problemId": "2589",
- "problemLevel": 11,
- "problemName": "보물섬",
- "average_try": 2.6584,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144009
- },
- "9019": {
- "problemId": "9019",
- "problemLevel": 12,
- "problemName": "DSLR",
- "average_try": 4.6723,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144031
- },
- "2636": {
- "problemId": "2636",
- "problemLevel": 11,
- "problemName": "치즈",
- "average_try": 1.9085,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.144054
- },
- "11559": {
- "problemId": "11559",
- "problemLevel": 12,
- "problemName": "Puyo Puyo",
- "average_try": 2.6834,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.1441
- },
- "1600": {
- "problemId": "1600",
- "problemLevel": 12,
- "problemName": "말이 되고픈 원숭이",
- "average_try": 5.411,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144122
- },
- "12851": {
- "problemId": "12851",
- "problemLevel": 11,
- "problemName": "숨바꼭질 2",
- "average_try": 3.8358,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144144
- },
- "17141": {
- "problemId": "17141",
- "problemLevel": 12,
- "problemName": "연구소 2",
- "average_try": 2.2207,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144166
- },
- "16954": {
- "problemId": "16954",
- "problemLevel": 12,
- "problemName": "움직이는 미로 탈출",
- "average_try": 3.734,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144187
- },
- "14716": {
- "problemId": "14716",
- "problemLevel": 10,
- "problemName": "현수막",
- "average_try": 1.6391,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.14421
- },
- "17836": {
- "problemId": "17836",
- "problemLevel": 11,
- "problemName": "공주님을 구해라!",
- "average_try": 4.2373,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144232
- },
- "16973": {
- "problemId": "16973",
- "problemLevel": 12,
- "problemName": "직사각형 탈출",
- "average_try": 3.9609,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.144254
- },
- "17129": {
- "problemId": "17129",
- "problemLevel": 11,
- "problemName": "윌리암슨수액빨이딱따구리가 정보섬에 올라온 이유",
- "average_try": 2.7676,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144276
- },
- "16174": {
- "problemId": "16174",
- "problemLevel": 10,
- "problemName": "점프왕 쩰리 (Large)",
- "average_try": 2.207,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144298
- },
- "14940": {
- "problemId": "14940",
- "problemLevel": 11,
- "problemName": "쉬운 최단거리",
- "average_try": 2.4564,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144321
- },
- "2194": {
- "problemId": "2194",
- "problemLevel": 11,
- "problemName": "유닛 이동시키기",
- "average_try": 3.5594,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144343
- },
- "18513": {
- "problemId": "18513",
- "problemLevel": 11,
- "problemName": "샘터",
- "average_try": 5.0667,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144365
- },
- "2206": {
- "problemId": "2206",
- "problemLevel": 12,
- "problemName": "벽 부수고 이동하기",
- "average_try": 4.3788,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144387
- },
- "1707": {
- "problemId": "1707",
- "problemLevel": 12,
- "problemName": "이분 그래프",
- "average_try": 4.2999,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144409
- },
- "2573": {
- "problemId": "2573",
- "problemLevel": 12,
- "problemName": "빙산",
- "average_try": 3.8612,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.144432
- },
- "17142": {
- "problemId": "17142",
- "problemLevel": 12,
- "problemName": "연구소 3",
- "average_try": 3.904,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144454
- },
- "5427": {
- "problemId": "5427",
- "problemLevel": 12,
- "problemName": "불",
- "average_try": 4.2719,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.144477
- },
- "13913": {
- "problemId": "13913",
- "problemLevel": 12,
- "problemName": "숨바꼭질 4",
- "average_try": 3.0874,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144499
- },
- "2638": {
- "problemId": "2638",
- "problemLevel": 12,
- "problemName": "치즈",
- "average_try": 2.2091,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.144521
- },
- "2665": {
- "problemId": "2665",
- "problemLevel": 12,
- "problemName": "미로만들기",
- "average_try": 1.8293,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144542
- },
- "1726": {
- "problemId": "1726",
- "problemLevel": 13,
- "problemName": "로봇",
- "average_try": 3.9927,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144566
- },
- "4179": {
- "problemId": "4179",
- "problemLevel": 12,
- "problemName": "불!",
- "average_try": 4.5171,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144588
- },
- "2234": {
- "problemId": "2234",
- "problemLevel": 12,
- "problemName": "성곽",
- "average_try": 2.234,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144611
- },
- "6087": {
- "problemId": "6087",
- "problemLevel": 13,
- "problemName": "레이저 통신",
- "average_try": 3.139,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144634
- },
- "2151": {
- "problemId": "2151",
- "problemLevel": 12,
- "problemName": "거울 설치",
- "average_try": 4.1285,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144657
- },
- "14923": {
- "problemId": "14923",
- "problemLevel": 12,
- "problemName": "미로 탈출",
- "average_try": 2.6426,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.14468
- },
- "16932": {
- "problemId": "16932",
- "problemLevel": 12,
- "problemName": "모양 만들기",
- "average_try": 3.0135,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144702
- },
- "2146": {
- "problemId": "2146",
- "problemLevel": 13,
- "problemName": "다리 만들기",
- "average_try": 3.0095,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144724
- },
- "14442": {
- "problemId": "14442",
- "problemLevel": 13,
- "problemName": "벽 부수고 이동하기 2",
- "average_try": 3.3655,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144747
- },
- "10711": {
- "problemId": "10711",
- "problemLevel": 13,
- "problemName": "모래성",
- "average_try": 3.463,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144769
- },
- "16947": {
- "problemId": "16947",
- "problemLevel": 13,
- "problemName": "서울 지하철 2호선",
- "average_try": 2.1031,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144791
- },
- "16988": {
- "problemId": "16988",
- "problemLevel": 13,
- "problemName": "Baaaaaaaaaduk2 (Easy)",
- "average_try": 2.0426,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144813
- },
- "16985": {
- "problemId": "16985",
- "problemLevel": 13,
- "problemName": "Maaaaaaaaaze",
- "average_try": 1.7812,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.144836
- },
- "16956": {
- "problemId": "16956",
- "problemLevel": 8,
- "problemName": "늑대와 양",
- "average_try": 2.208,
- "solvedtags": [
- {
- "bojTagId": 109,
- "key": "ad_hoc"
- },
- {
- "bojTagId": 128,
- "key": "constructive"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144858
- },
- "2668": {
- "problemId": "2668",
- "problemLevel": 11,
- "problemName": "숫자고르기",
- "average_try": 2.2236,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144925
- },
- "13023": {
- "problemId": "13023",
- "problemLevel": 11,
- "problemName": "ABCDE",
- "average_try": 3.4174,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144947
- },
- "16432": {
- "problemId": "16432",
- "problemLevel": 11,
- "problemName": "떡장수와 호랑이",
- "average_try": 3.5487,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.14497
- },
- "9466": {
- "problemId": "9466",
- "problemLevel": 13,
- "problemName": "텀 프로젝트",
- "average_try": 4.0947,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.144991
- },
- "17616": {
- "problemId": "17616",
- "problemLevel": 13,
- "problemName": "등수 찾기",
- "average_try": 2.2117,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.145036
- },
- "21937": {
- "problemId": "21937",
- "problemLevel": 10,
- "problemName": "작업",
- "average_try": 2.0864,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.145058
- },
- "21938": {
- "problemId": "21938",
- "problemLevel": 9,
- "problemName": "영상처리",
- "average_try": 2.6313,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.145081
- },
- "22868": {
- "problemId": "22868",
- "problemLevel": 13,
- "problemName": "산책 (small)",
- "average_try": 3.25,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.145107
- },
- "22946": {
- "problemId": "22946",
- "problemLevel": 14,
- "problemName": "원 이동하기 1",
- "average_try": 4.1818,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.145129
- },
- "22948": {
- "problemId": "22948",
- "problemLevel": 14,
- "problemName": "원 이동하기 2",
- "average_try": 1.1818,
- "solvedtags": [
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 106,
- "key": "sweeping"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.145151
- },
- "22949": {
- "problemId": "22949",
- "problemLevel": 15,
- "problemName": "회전 미로 탐색",
- "average_try": 2.8571,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.145174
- },
- "11000": {
- "problemId": "11000",
- "problemLevel": 11,
- "problemName": "강의실 배정",
- "average_try": 3.3816,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146314
- },
- "13164": {
- "problemId": "13164",
- "problemLevel": 11,
- "problemName": "행복 유치원",
- "average_try": 1.811,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146346
- },
- "1931": {
- "problemId": "1931",
- "problemLevel": 9,
- "problemName": "회의실 배정",
- "average_try": 3.4089,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146372
- },
- "14916": {
- "problemId": "14916",
- "problemLevel": 6,
- "problemName": "거스름돈",
- "average_try": 2.0124,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.146396
- },
- "1439": {
- "problemId": "1439",
- "problemLevel": 6,
- "problemName": "뒤집기",
- "average_try": 1.8774,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.146419
- },
- "17521": {
- "problemId": "17521",
- "problemLevel": 6,
- "problemName": "Byte Coin",
- "average_try": 2.5006,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146443
- },
- "19939": {
- "problemId": "19939",
- "problemLevel": 6,
- "problemName": "박 터뜨리기",
- "average_try": 2.6205,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.146467
- },
- "12782": {
- "problemId": "12782",
- "problemLevel": 7,
- "problemName": "비트 우정지수",
- "average_try": 1.4937,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.146489
- },
- "16208": {
- "problemId": "16208",
- "problemLevel": 6,
- "problemName": "귀찮음",
- "average_try": 2.0603,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146513
- },
- "11256": {
- "problemId": "11256",
- "problemLevel": 6,
- "problemName": "사탕",
- "average_try": 1.468,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146537
- },
- "13019": {
- "problemId": "13019",
- "problemLevel": 10,
- "problemName": "A를 B로",
- "average_try": 2.427,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146571
- },
- "2217": {
- "problemId": "2217",
- "problemLevel": 7,
- "problemName": "로프",
- "average_try": 2.3642,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146595
- },
- "13305": {
- "problemId": "13305",
- "problemLevel": 7,
- "problemName": "주유소",
- "average_try": 2.653,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146619
- },
- "2847": {
- "problemId": "2847",
- "problemLevel": 7,
- "problemName": "게임을 만든 동준이",
- "average_try": 2.0372,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146641
- },
- "1343": {
- "problemId": "1343",
- "problemLevel": 6,
- "problemName": "폴리오미노",
- "average_try": 1.9417,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146664
- },
- "13413": {
- "problemId": "13413",
- "problemLevel": 7,
- "problemName": "오셀로 재배치",
- "average_try": 1.7793,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.146687
- },
- "1758": {
- "problemId": "1758",
- "problemLevel": 7,
- "problemName": "알바생 강호",
- "average_try": 2.4826,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146709
- },
- "16162": {
- "problemId": "16162",
- "problemLevel": 7,
- "problemName": "가희와 3단 고음",
- "average_try": 1.7426,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146733
- },
- "16435": {
- "problemId": "16435",
- "problemLevel": 6,
- "problemName": "스네이크버드",
- "average_try": 1.4284,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146755
- },
- "11399": {
- "problemId": "11399",
- "problemLevel": 8,
- "problemName": "ATM",
- "average_try": 1.4996,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146777
- },
- "1449": {
- "problemId": "1449",
- "problemLevel": 8,
- "problemName": "수리공 항승",
- "average_try": 2.3591,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.1468
- },
- "11508": {
- "problemId": "11508",
- "problemLevel": 7,
- "problemName": "2+1 세일",
- "average_try": 1.6526,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146822
- },
- "1817": {
- "problemId": "1817",
- "problemLevel": 6,
- "problemName": "짐 챙기는 숌",
- "average_try": 2.9797,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.146845
- },
- "20115": {
- "problemId": "20115",
- "problemLevel": 8,
- "problemName": "에너지 드링크",
- "average_try": 1.3641,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146867
- },
- "20300": {
- "problemId": "20300",
- "problemLevel": 8,
- "problemName": "서강근육맨",
- "average_try": 2.6088,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146889
- },
- "14247": {
- "problemId": "14247",
- "problemLevel": 8,
- "problemName": "나무 자르기",
- "average_try": 2.3853,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.146912
- },
- "1541": {
- "problemId": "1541",
- "problemLevel": 9,
- "problemName": "잃어버린 괄호",
- "average_try": 2.0296,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.146934
- },
- "1080": {
- "problemId": "1080",
- "problemLevel": 10,
- "problemName": "행렬",
- "average_try": 2.4992,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146957
- },
- "2138": {
- "problemId": "2138",
- "problemLevel": 10,
- "problemName": "전구와 스위치",
- "average_try": 2.7262,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.146979
- },
- "20365": {
- "problemId": "20365",
- "problemLevel": 9,
- "problemName": "블로그2",
- "average_try": 2.123,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.147002
- },
- "14400": {
- "problemId": "14400",
- "problemLevel": 9,
- "problemName": "편의점 2",
- "average_try": 1.8834,
- "solvedtags": [
- {
- "bojTagId": 100,
- "key": "geometry"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147024
- },
- "11047": {
- "problemId": "11047",
- "problemLevel": 8,
- "problemName": "동전 0",
- "average_try": 1.9264,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147046
- },
- "1946": {
- "problemId": "1946",
- "problemLevel": 10,
- "problemName": "신입 사원",
- "average_try": 3.1653,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147069
- },
- "16953": {
- "problemId": "16953",
- "problemLevel": 10,
- "problemName": "A → B",
- "average_try": 2.4608,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147091
- },
- "11509": {
- "problemId": "11509",
- "problemLevel": 11,
- "problemName": "풍선 맞추기",
- "average_try": 2.5789,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147112
- },
- "17615": {
- "problemId": "17615",
- "problemLevel": 10,
- "problemName": "볼 모으기",
- "average_try": 2.4949,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147134
- },
- "19539": {
- "problemId": "19539",
- "problemLevel": 10,
- "problemName": "사과나무",
- "average_try": 2.1917,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.147157
- },
- "1474": {
- "problemId": "1474",
- "problemLevel": 10,
- "problemName": "밑 줄",
- "average_try": 2.5349,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.147179
- },
- "1455": {
- "problemId": "1455",
- "problemLevel": 9,
- "problemName": "뒤집기 II",
- "average_try": 1.5057,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147202
- },
- "16206": {
- "problemId": "16206",
- "problemLevel": 10,
- "problemName": "롤케이크",
- "average_try": 3.4843,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147224
- },
- "2141": {
- "problemId": "2141",
- "problemLevel": 12,
- "problemName": "우체국",
- "average_try": 3.8432,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147246
- },
- "19598": {
- "problemId": "19598",
- "problemLevel": 11,
- "problemName": "최소 회의실 개수",
- "average_try": 2.4735,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 106,
- "key": "sweeping"
- }
- ],
- "lastupdate": 1648236948.147269
- },
- "20117": {
- "problemId": "20117",
- "problemLevel": 10,
- "problemName": "호반우 상인의 이상한 품질 계산법",
- "average_try": 1.5683,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147291
- },
- "2812": {
- "problemId": "2812",
- "problemLevel": 12,
- "problemName": "크게 만들기",
- "average_try": 4.0432,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- }
- ],
- "lastupdate": 1648236948.147313
- },
- "2212": {
- "problemId": "2212",
- "problemLevel": 11,
- "problemName": "센서",
- "average_try": 2.1782,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147335
- },
- "1092": {
- "problemId": "1092",
- "problemLevel": 11,
- "problemName": "배",
- "average_try": 4.171,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147357
- },
- "1374": {
- "problemId": "1374",
- "problemLevel": 11,
- "problemName": "강의실",
- "average_try": 2.4567,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147379
- },
- "13975": {
- "problemId": "13975",
- "problemLevel": 12,
- "problemName": "파일 합치기 3",
- "average_try": 2.0258,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.147401
- },
- "6068": {
- "problemId": "6068",
- "problemLevel": 11,
- "problemName": "시간 관리하기",
- "average_try": 1.9614,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147423
- },
- "1744": {
- "problemId": "1744",
- "problemLevel": 12,
- "problemName": "수 묶기",
- "average_try": 3.5795,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147444
- },
- "1715": {
- "problemId": "1715",
- "problemLevel": 12,
- "problemName": "카드 정렬하기",
- "average_try": 2.9405,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.147466
- },
- "8980": {
- "problemId": "8980",
- "problemLevel": 13,
- "problemName": "택배",
- "average_try": 2.5761,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147488
- },
- "2457": {
- "problemId": "2457",
- "problemLevel": 13,
- "problemName": "공주님의 정원",
- "average_try": 4.0632,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.14751
- },
- "2109": {
- "problemId": "2109",
- "problemLevel": 13,
- "problemName": "순회강연",
- "average_try": 2.7507,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147532
- },
- "1082": {
- "problemId": "1082",
- "problemLevel": 12,
- "problemName": "방 번호",
- "average_try": 3.5691,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147555
- },
- "12931": {
- "problemId": "12931",
- "problemLevel": 12,
- "problemName": "두 배 더하기",
- "average_try": 1.6133,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147577
- },
- "18234": {
- "problemId": "18234",
- "problemLevel": 12,
- "problemName": "당근 훔쳐 먹기",
- "average_try": 2.3873,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.147598
- },
- "2285": {
- "problemId": "2285",
- "problemLevel": 12,
- "problemName": "우체국",
- "average_try": 3.0427,
- "solvedtags": [
- {
- "bojTagId": 117,
- "key": "arbitrary_precision"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.14762
- },
- "21313": {
- "problemId": "21313",
- "problemLevel": 4,
- "problemName": "문어",
- "average_try": 1.3766,
- "solvedtags": [
- {
- "bojTagId": 109,
- "key": "ad_hoc"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147642
- },
- "21314": {
- "problemId": "21314",
- "problemLevel": 10,
- "problemName": "민겸 수",
- "average_try": 2.9614,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.147664
- },
- "21758": {
- "problemId": "21758",
- "problemLevel": 10,
- "problemName": "꿀 따기",
- "average_try": 2.7965,
- "solvedtags": [
- {
- "bojTagId": 137,
- "key": "case_work"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.147686
- },
- "21925": {
- "problemId": "21925",
- "problemLevel": 13,
- "problemName": "짝수 팰린드롬",
- "average_try": 2.4688,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- }
- ],
- "lastupdate": 1648236948.147708
- },
- "1212": {
- "problemId": "1212",
- "problemLevel": 3,
- "problemName": "8진수 2진수",
- "average_try": 2.8758,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.148509
- },
- "2753": {
- "problemId": "2753",
- "problemLevel": 2,
- "problemName": "윤년",
- "average_try": 1.8808,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.148544
- },
- "20053": {
- "problemId": "20053",
- "problemLevel": 3,
- "problemName": "최소, 최대 2",
- "average_try": 1.6536,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148581
- },
- "5597": {
- "problemId": "5597",
- "problemLevel": 4,
- "problemName": "과제 안 내신 분..?",
- "average_try": 1.4966,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148605
- },
- "20546": {
- "problemId": "20546",
- "problemLevel": 5,
- "problemName": "🐜 기적의 매매법 🐜",
- "average_try": 2.1732,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.148628
- },
- "1913": {
- "problemId": "1913",
- "problemLevel": 7,
- "problemName": "달팽이",
- "average_try": 2.0644,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148675
- },
- "14467": {
- "problemId": "14467",
- "problemLevel": 6,
- "problemName": "소가 길을 건너간 이유 1",
- "average_try": 1.6539,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148699
- },
- "2578": {
- "problemId": "2578",
- "problemLevel": 6,
- "problemName": "빙고",
- "average_try": 2.1585,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148746
- },
- "18311": {
- "problemId": "18311",
- "problemLevel": 6,
- "problemName": "왕복",
- "average_try": 2.8983,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148792
- },
- "1244": {
- "problemId": "1244",
- "problemLevel": 8,
- "problemName": "스위치 켜고 끄기",
- "average_try": 5.1167,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.148814
- },
- "10994": {
- "problemId": "10994",
- "problemLevel": 7,
- "problemName": "별 찍기 - 19",
- "average_try": 1.4932,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.148837
- },
- "5766": {
- "problemId": "5766",
- "problemLevel": 7,
- "problemName": "할아버지는 유명해!",
- "average_try": 1.6694,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148859
- },
- "2615": {
- "problemId": "2615",
- "problemLevel": 9,
- "problemName": "오목",
- "average_try": 5.068,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.14895
- },
- "2729": {
- "problemId": "2729",
- "problemLevel": 6,
- "problemName": "이진수 덧셈",
- "average_try": 2.4878,
- "solvedtags": [
- {
- "bojTagId": 121,
- "key": "arithmetic"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.148972
- },
- "17276": {
- "problemId": "17276",
- "problemLevel": 9,
- "problemName": "배열 돌리기",
- "average_try": 1.6534,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.148994
- },
- "16926": {
- "problemId": "16926",
- "problemLevel": 10,
- "problemName": "배열 돌리기 1",
- "average_try": 2.061,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149017
- },
- "16927": {
- "problemId": "16927",
- "problemLevel": 11,
- "problemName": "배열 돌리기 2",
- "average_try": 2.8996,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.14904
- },
- "16935": {
- "problemId": "16935",
- "problemLevel": 10,
- "problemName": "배열 돌리기 3",
- "average_try": 1.997,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149062
- },
- "17406": {
- "problemId": "17406",
- "problemLevel": 12,
- "problemName": "배열 돌리기 4",
- "average_try": 2.5593,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149084
- },
- "17470": {
- "problemId": "17470",
- "problemLevel": 16,
- "problemName": "배열 돌리기 5",
- "average_try": 5.9211,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149107
- },
- "20327": {
- "problemId": "20327",
- "problemLevel": 13,
- "problemName": "배열 돌리기 6",
- "average_try": 1.8257,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.149129
- },
- "17128": {
- "problemId": "17128",
- "problemLevel": 9,
- "problemName": "소가 정보섬에 올라온 이유",
- "average_try": 2.0653,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.14915
- },
- "1283": {
- "problemId": "1283",
- "problemLevel": 9,
- "problemName": "단축키 지정",
- "average_try": 2.9513,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.149172
- },
- "10703": {
- "problemId": "10703",
- "problemLevel": 8,
- "problemName": "유성",
- "average_try": 4.4414,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149195
- },
- "2469": {
- "problemId": "2469",
- "problemLevel": 10,
- "problemName": "사다리 타기",
- "average_try": 2.6471,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.14924
- },
- "2877": {
- "problemId": "2877",
- "problemLevel": 10,
- "problemName": "4와 7",
- "average_try": 1.6781,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.149262
- },
- "15787": {
- "problemId": "15787",
- "problemLevel": 9,
- "problemName": "기차가 어둠을 헤치고 은하수를",
- "average_try": 3.5644,
- "solvedtags": [
- {
- "bojTagId": 14,
- "key": "bitmask"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149285
- },
- "20164": {
- "problemId": "20164",
- "problemLevel": 11,
- "problemName": "홀수 홀릭 호석",
- "average_try": 1.4604,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.149307
- },
- "20207": {
- "problemId": "20207",
- "problemLevel": 10,
- "problemName": "달력",
- "average_try": 2.2178,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.149329
- },
- "14719": {
- "problemId": "14719",
- "problemLevel": 11,
- "problemName": "빗물",
- "average_try": 1.8197,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.149351
- },
- "15886": {
- "problemId": "15886",
- "problemLevel": 9,
- "problemName": "내 선물을 받아줘 2",
- "average_try": 1.5013,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.149373
- },
- "16719": {
- "problemId": "16719",
- "problemLevel": 11,
- "problemName": "ZOAC",
- "average_try": 1.8786,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- }
- ],
- "lastupdate": 1648236948.149395
- },
- "1022": {
- "problemId": "1022",
- "problemLevel": 12,
- "problemName": "소용돌이 예쁘게 출력하기",
- "average_try": 3.4885,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149417
- },
- "9081": {
- "problemId": "9081",
- "problemLevel": 10,
- "problemName": "단어 맞추기",
- "average_try": 1.961,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.149438
- },
- "15806": {
- "problemId": "15806",
- "problemLevel": 15,
- "problemName": "영우의 기숙사 청소",
- "average_try": 4.9535,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.14946
- },
- "21277": {
- "problemId": "21277",
- "problemLevel": 13,
- "problemName": "짠돌이 호석",
- "average_try": 4.4767,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149483
- },
- "21611": {
- "problemId": "21611",
- "problemLevel": 15,
- "problemName": "마법사 상어와 블리자드",
- "average_try": 4.0894,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.149505
- },
- "21608": {
- "problemId": "21608",
- "problemLevel": 10,
- "problemName": "상어 초등학교",
- "average_try": 2.501,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.149527
- },
- "21756": {
- "problemId": "21756",
- "problemLevel": 4,
- "problemName": "지우개",
- "average_try": 1.6852,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.149549
- },
- "21918": {
- "problemId": "21918",
- "problemLevel": 4,
- "problemName": "전구",
- "average_try": 1.6037,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.149572
- },
- "22860": {
- "problemId": "22860",
- "problemLevel": 13,
- "problemName": "폴더 정리 (small)",
- "average_try": 2.7,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.149594
- },
- "22859": {
- "problemId": "22859",
- "problemLevel": 13,
- "problemName": "HTML 파싱",
- "average_try": 6.102,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.149616
- },
- "22856": {
- "problemId": "22856",
- "problemLevel": 12,
- "problemName": "트리 순회",
- "average_try": 3.1124,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.149639
- },
- "22858": {
- "problemId": "22858",
- "problemLevel": 8,
- "problemName": "원상 복구 (small)",
- "average_try": 1.6311,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.14966
- },
- "1978": {
- "problemId": "1978",
- "problemLevel": 7,
- "problemName": "소수 찾기",
- "average_try": 2.1058,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.150309
- },
- "2609": {
- "problemId": "2609",
- "problemLevel": 6,
- "problemName": "최대공약수와 최소공배수",
- "average_try": 1.669,
- "solvedtags": [
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150339
- },
- "1934": {
- "problemId": "1934",
- "problemLevel": 6,
- "problemName": "최소공배수",
- "average_try": 1.7059,
- "solvedtags": [
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150377
- },
- "2581": {
- "problemId": "2581",
- "problemLevel": 6,
- "problemName": "소수",
- "average_try": 2.5687,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- }
- ],
- "lastupdate": 1648236948.150402
- },
- "11653": {
- "problemId": "11653",
- "problemLevel": 6,
- "problemName": "소인수분해",
- "average_try": 1.9091,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- }
- ],
- "lastupdate": 1648236948.150425
- },
- "2960": {
- "problemId": "2960",
- "problemLevel": 7,
- "problemName": "에라토스테네스의 체",
- "average_try": 1.8567,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.150449
- },
- "9613": {
- "problemId": "9613",
- "problemLevel": 8,
- "problemName": "GCD 합",
- "average_try": 2.553,
- "solvedtags": [
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150472
- },
- "5347": {
- "problemId": "5347",
- "problemLevel": 7,
- "problemName": "LCM",
- "average_try": 1.8702,
- "solvedtags": [
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150495
- },
- "4134": {
- "problemId": "4134",
- "problemLevel": 7,
- "problemName": "다음 소수",
- "average_try": 3.5907,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- }
- ],
- "lastupdate": 1648236948.150517
- },
- "1110": {
- "problemId": "1110",
- "problemLevel": 5,
- "problemName": "더하기 사이클",
- "average_try": 2.1456,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.15054
- },
- "5618": {
- "problemId": "5618",
- "problemLevel": 3,
- "problemName": "공약수",
- "average_try": 1.8629,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150599
- },
- "2745": {
- "problemId": "2745",
- "problemLevel": 4,
- "problemName": "진법 변환",
- "average_try": 1.7577,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.150623
- },
- "21275": {
- "problemId": "21275",
- "problemLevel": 8,
- "problemName": "폰 호석만",
- "average_try": 2.791,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.150646
- },
- "1456": {
- "problemId": "1456",
- "problemLevel": 10,
- "problemName": "거의 소수",
- "average_try": 4.4862,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.150669
- },
- "2168": {
- "problemId": "2168",
- "problemLevel": 10,
- "problemName": "타일 위의 대각선",
- "average_try": 1.8231,
- "solvedtags": [
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150691
- },
- "9421": {
- "problemId": "9421",
- "problemLevel": 10,
- "problemName": "소수상근수",
- "average_try": 1.9499,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.150714
- },
- "1669": {
- "problemId": "1669",
- "problemLevel": 10,
- "problemName": "멍멍이 쓰다듬기",
- "average_try": 2.6376,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.150736
- },
- "1990": {
- "problemId": "1990",
- "problemLevel": 11,
- "problemName": "소수인팰린드롬",
- "average_try": 4.1794,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.150758
- },
- "3343": {
- "problemId": "3343",
- "problemLevel": 11,
- "problemName": "장미",
- "average_try": 5.6628,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150781
- },
- "1747": {
- "problemId": "1747",
- "problemLevel": 10,
- "problemName": "소수&팰린드롬",
- "average_try": 3.3873,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.150804
- },
- "2436": {
- "problemId": "2436",
- "problemLevel": 11,
- "problemName": "공약수",
- "average_try": 3.5714,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150827
- },
- "1188": {
- "problemId": "1188",
- "problemLevel": 11,
- "problemName": "음식 평론가",
- "average_try": 2.1279,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.15085
- },
- "2824": {
- "problemId": "2824",
- "problemLevel": 11,
- "problemName": "최대공약수",
- "average_try": 4.1992,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- }
- ],
- "lastupdate": 1648236948.150871
- },
- "2553": {
- "problemId": "2553",
- "problemLevel": 9,
- "problemName": "마지막 팩토리얼 수",
- "average_try": 3.1058,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150893
- },
- "21312": {
- "problemId": "21312",
- "problemLevel": 3,
- "problemName": "홀짝 칵테일",
- "average_try": 1.5924,
- "solvedtags": [
- {
- "bojTagId": 121,
- "key": "arithmetic"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- }
- ],
- "lastupdate": 1648236948.150915
- },
- "21920": {
- "problemId": "21920",
- "problemLevel": 7,
- "problemName": "서로소 평균",
- "average_try": 2.4706,
- "solvedtags": [
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- }
- ],
- "lastupdate": 1648236948.150939
- },
- "21919": {
- "problemId": "21919",
- "problemLevel": 8,
- "problemName": "소수 최소 공배수",
- "average_try": 3.9176,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.150962
- },
- "22864": {
- "problemId": "22864",
- "problemLevel": 3,
- "problemName": "피로도",
- "average_try": 2.25,
- "solvedtags": [
- {
- "bojTagId": 121,
- "key": "arithmetic"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.150985
- },
- "22943": {
- "problemId": "22943",
- "problemLevel": 10,
- "problemName": "수",
- "average_try": 5.0455,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- }
- ],
- "lastupdate": 1648236948.151008
- },
- "1197": {
- "problemId": "1197",
- "problemLevel": 12,
- "problemName": "최소 스패닝 트리",
- "average_try": 2.4932,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151504
- },
- "1922": {
- "problemId": "1922",
- "problemLevel": 12,
- "problemName": "네트워크 연결",
- "average_try": 1.6498,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151534
- },
- "1647": {
- "problemId": "1647",
- "problemLevel": 12,
- "problemName": "도시 분할 계획",
- "average_try": 2.0118,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.15156
- },
- "4386": {
- "problemId": "4386",
- "problemLevel": 12,
- "problemName": "별자리 만들기",
- "average_try": 1.7796,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151595
- },
- "6497": {
- "problemId": "6497",
- "problemLevel": 12,
- "problemName": "전력난",
- "average_try": 3.0317,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151619
- },
- "1774": {
- "problemId": "1774",
- "problemLevel": 13,
- "problemName": "우주신과의 교감",
- "average_try": 3.2792,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151643
- },
- "16398": {
- "problemId": "16398",
- "problemLevel": 12,
- "problemName": "행성 연결",
- "average_try": 2.4018,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151667
- },
- "13905": {
- "problemId": "13905",
- "problemLevel": 12,
- "problemName": "세부",
- "average_try": 3.0825,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.15169
- },
- "16202": {
- "problemId": "16202",
- "problemLevel": 12,
- "problemName": "MST 게임",
- "average_try": 1.7013,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.151714
- },
- "18769": {
- "problemId": "18769",
- "problemLevel": 12,
- "problemName": "그리드 네트워크",
- "average_try": 2.5806,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151737
- },
- "17472": {
- "problemId": "17472",
- "problemLevel": 15,
- "problemName": "다리 만들기 2",
- "average_try": 3.2038,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.15176
- },
- "13418": {
- "problemId": "13418",
- "problemLevel": 13,
- "problemName": "학교 탐방하기",
- "average_try": 2.7594,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151783
- },
- "14621": {
- "problemId": "14621",
- "problemLevel": 13,
- "problemName": "나만 안되는 연애",
- "average_try": 2.072,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151805
- },
- "14950": {
- "problemId": "14950",
- "problemLevel": 13,
- "problemName": "정복자",
- "average_try": 1.7425,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151828
- },
- "2406": {
- "problemId": "2406",
- "problemLevel": 13,
- "problemName": "안정적인 네트워크",
- "average_try": 2.7438,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.15185
- },
- "17490": {
- "problemId": "17490",
- "problemLevel": 14,
- "problemName": "일감호에 다리 놓기",
- "average_try": 5.1754,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151872
- },
- "2887": {
- "problemId": "2887",
- "problemLevel": 15,
- "problemName": "행성 터널",
- "average_try": 2.8126,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.151894
- },
- "1944": {
- "problemId": "1944",
- "problemLevel": 14,
- "problemName": "복제 로봇",
- "average_try": 3.9452,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151916
- },
- "10423": {
- "problemId": "10423",
- "problemLevel": 14,
- "problemName": "전기가 부족해",
- "average_try": 1.4188,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151938
- },
- "1368": {
- "problemId": "1368",
- "problemLevel": 14,
- "problemName": "물대기",
- "average_try": 2.4466,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151961
- },
- "20010": {
- "problemId": "20010",
- "problemLevel": 14,
- "problemName": "악덕 영주 혜유",
- "average_try": 1.7076,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.151984
- },
- "1414": {
- "problemId": "1414",
- "problemLevel": 13,
- "problemName": "불우이웃돕기",
- "average_try": 3.2129,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.152006
- },
- "1045": {
- "problemId": "1045",
- "problemLevel": 15,
- "problemName": "도로",
- "average_try": 4.5157,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.152028
- },
- "21924": {
- "problemId": "21924",
- "problemLevel": 12,
- "problemName": "도시 건설",
- "average_try": 2.2997,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 49,
- "key": "mst"
- }
- ],
- "lastupdate": 1648236948.152051
- },
- "14929": {
- "problemId": "14929",
- "problemLevel": 6,
- "problemName": "귀찮아 (SIB)",
- "average_try": 2.3392,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152489
- },
- "2167": {
- "problemId": "2167",
- "problemLevel": 5,
- "problemName": "2차원 배열의 합",
- "average_try": 1.7088,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152519
- },
- "20116": {
- "problemId": "20116",
- "problemLevel": 8,
- "problemName": "상자의 균형",
- "average_try": 2.9,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 116,
- "key": "physics"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152555
- },
- "11659": {
- "problemId": "11659",
- "problemLevel": 8,
- "problemName": "구간 합 구하기 4",
- "average_try": 2.1372,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.15258
- },
- "11441": {
- "problemId": "11441",
- "problemLevel": 8,
- "problemName": "합 구하기",
- "average_try": 1.9665,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152605
- },
- "17390": {
- "problemId": "17390",
- "problemLevel": 8,
- "problemName": "이건 꼭 풀어야 해!",
- "average_try": 2.1645,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.15263
- },
- "16139": {
- "problemId": "16139",
- "problemLevel": 9,
- "problemName": "인간-컴퓨터 상호작용",
- "average_try": 2.3822,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152653
- },
- "20438": {
- "problemId": "20438",
- "problemLevel": 9,
- "problemName": "출석체크",
- "average_try": 3.325,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152675
- },
- "17123": {
- "problemId": "17123",
- "problemLevel": 9,
- "problemName": "배열 놀이",
- "average_try": 1.7609,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152698
- },
- "11660": {
- "problemId": "11660",
- "problemLevel": 10,
- "problemName": "구간 합 구하기 5",
- "average_try": 2.0296,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152722
- },
- "16507": {
- "problemId": "16507",
- "problemLevel": 10,
- "problemName": "어두운 건 무서워",
- "average_try": 1.5165,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152746
- },
- "19951": {
- "problemId": "19951",
- "problemLevel": 11,
- "problemName": "태상이의 훈련소 생활",
- "average_try": 1.812,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152769
- },
- "10427": {
- "problemId": "10427",
- "problemLevel": 11,
- "problemName": "빚",
- "average_try": 1.7183,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.152792
- },
- "2015": {
- "problemId": "2015",
- "problemLevel": 11,
- "problemName": "수들의 합 4",
- "average_try": 2.9074,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.152815
- },
- "10713": {
- "problemId": "10713",
- "problemLevel": 11,
- "problemName": "기차 여행",
- "average_try": 2.396,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152838
- },
- "20002": {
- "problemId": "20002",
- "problemLevel": 11,
- "problemName": "사과나무",
- "average_try": 1.9429,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.15286
- },
- "20159": {
- "problemId": "20159",
- "problemLevel": 11,
- "problemName": "동작 그만. 밑장 빼기냐?",
- "average_try": 4.1392,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152882
- },
- "18866": {
- "problemId": "18866",
- "problemLevel": 11,
- "problemName": "젊은 날의 생이여",
- "average_try": 3.6716,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152905
- },
- "10986": {
- "problemId": "10986",
- "problemLevel": 13,
- "problemName": "나머지 합",
- "average_try": 3.0083,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152927
- },
- "5549": {
- "problemId": "5549",
- "problemLevel": 12,
- "problemName": "행성 탐사",
- "average_try": 2.2625,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152949
- },
- "2571": {
- "problemId": "2571",
- "problemLevel": 13,
- "problemName": "색종이 - 3",
- "average_try": 1.9589,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152972
- },
- "1749": {
- "problemId": "1749",
- "problemLevel": 12,
- "problemName": "점수따먹기",
- "average_try": 3.2356,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.152995
- },
- "20440": {
- "problemId": "20440",
- "problemLevel": 12,
- "problemName": "🎵니가 싫어 싫어 너무 싫어 싫어 오지 마 내게 찝쩍대지마🎵 - 1",
- "average_try": 2.9886,
- "solvedtags": [
- {
- "bojTagId": 161,
- "key": "coordinate_compression"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.153017
- },
- "3673": {
- "problemId": "3673",
- "problemLevel": 13,
- "problemName": "나눌 수 있는 부분 수열",
- "average_try": 2.3867,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.15304
- },
- "5875": {
- "problemId": "5875",
- "problemLevel": 13,
- "problemName": "오타",
- "average_try": 2.6222,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.153062
- },
- "14476": {
- "problemId": "14476",
- "problemLevel": 14,
- "problemName": "최대공약수 하나 빼기",
- "average_try": 1.8966,
- "solvedtags": [
- {
- "bojTagId": 26,
- "key": "euclidean"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.153084
- },
- "19566": {
- "problemId": "19566",
- "problemLevel": 14,
- "problemName": "수열의 구간 평균",
- "average_try": 1.854,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.153106
- },
- "16971": {
- "problemId": "16971",
- "problemLevel": 13,
- "problemName": "배열 B의 값",
- "average_try": 2.9861,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.153128
- },
- "2900": {
- "problemId": "2900",
- "problemLevel": 13,
- "problemName": "프로그램",
- "average_try": 3.252,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.153151
- },
- "20543": {
- "problemId": "20543",
- "problemLevel": 14,
- "problemName": "폭탄 던지는 태영이",
- "average_try": 3.5238,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.153173
- },
- "21318": {
- "problemId": "21318",
- "problemLevel": 10,
- "problemName": "피아노 체조",
- "average_try": 2.1145,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.153196
- },
- "21757": {
- "problemId": "21757",
- "problemLevel": 13,
- "problemName": "나누기",
- "average_try": 4.8506,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- }
- ],
- "lastupdate": 1648236948.153218
- },
- "18352": {
- "problemId": "18352",
- "problemLevel": 9,
- "problemName": "특정 거리의 도시 찾기",
- "average_try": 3.5103,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.153719
- },
- "1753": {
- "problemId": "1753",
- "problemLevel": 11,
- "problemName": "최단경로",
- "average_try": 4.1457,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.15375
- },
- "1916": {
- "problemId": "1916",
- "problemLevel": 11,
- "problemName": "최소비용 구하기",
- "average_try": 3.1038,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153786
- },
- "13549": {
- "problemId": "13549",
- "problemLevel": 11,
- "problemName": "숨바꼭질 3",
- "average_try": 3.8827,
- "solvedtags": [
- {
- "bojTagId": 176,
- "key": "0_1_bfs"
- },
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.15381
- },
- "1446": {
- "problemId": "1446",
- "problemLevel": 10,
- "problemName": "지름길",
- "average_try": 2.1653,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153833
- },
- "13424": {
- "problemId": "13424",
- "problemLevel": 12,
- "problemName": "비밀 모임",
- "average_try": 1.9699,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153857
- },
- "17396": {
- "problemId": "17396",
- "problemLevel": 11,
- "problemName": "백도어",
- "average_try": 3.9679,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.15388
- },
- "5972": {
- "problemId": "5972",
- "problemLevel": 11,
- "problemName": "택배 배송",
- "average_try": 1.5562,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153903
- },
- "14284": {
- "problemId": "14284",
- "problemLevel": 11,
- "problemName": "간선 이어가기 2",
- "average_try": 1.757,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153926
- },
- "20168": {
- "problemId": "20168",
- "problemLevel": 11,
- "problemName": "골목 대장 호석 - 기능성",
- "average_try": 2.8011,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153949
- },
- "20182": {
- "problemId": "20182",
- "problemLevel": 13,
- "problemName": "골목 대장 호석 - 효율성 1",
- "average_try": 2.2114,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153971
- },
- "20183": {
- "problemId": "20183",
- "problemLevel": 15,
- "problemName": "골목 대장 호석 - 효율성 2",
- "average_try": 4.3478,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.153993
- },
- "1261": {
- "problemId": "1261",
- "problemLevel": 12,
- "problemName": "알고스팟",
- "average_try": 2.4169,
- "solvedtags": [
- {
- "bojTagId": 176,
- "key": "0_1_bfs"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154016
- },
- "1504": {
- "problemId": "1504",
- "problemLevel": 12,
- "problemName": "특정한 최단 경로",
- "average_try": 4.0414,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154038
- },
- "4485": {
- "problemId": "4485",
- "problemLevel": 12,
- "problemName": "녹색 옷 입은 애가 젤다지?",
- "average_try": 1.9627,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154059
- },
- "10282": {
- "problemId": "10282",
- "problemLevel": 12,
- "problemName": "해킹",
- "average_try": 2.5941,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154082
- },
- "14938": {
- "problemId": "14938",
- "problemLevel": 12,
- "problemName": "서강그라운드",
- "average_try": 1.9985,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154105
- },
- "1719": {
- "problemId": "1719",
- "problemLevel": 12,
- "problemName": "택배",
- "average_try": 1.7723,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154129
- },
- "18223": {
- "problemId": "18223",
- "problemLevel": 12,
- "problemName": "민준이와 마산 그리고 건우",
- "average_try": 2.0692,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154151
- },
- "20007": {
- "problemId": "20007",
- "problemLevel": 12,
- "problemName": "떡 돌리기",
- "average_try": 2.8333,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154173
- },
- "1277": {
- "problemId": "1277",
- "problemLevel": 12,
- "problemName": "발전소 설치",
- "average_try": 3.5294,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154195
- },
- "1238": {
- "problemId": "1238",
- "problemLevel": 13,
- "problemName": "파티",
- "average_try": 2.1356,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154218
- },
- "11779": {
- "problemId": "11779",
- "problemLevel": 13,
- "problemName": "최소비용 구하기 2",
- "average_try": 2.6668,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.15424
- },
- "13911": {
- "problemId": "13911",
- "problemLevel": 14,
- "problemName": "집 구하기",
- "average_try": 3.9871,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154262
- },
- "2982": {
- "problemId": "2982",
- "problemLevel": 14,
- "problemName": "국왕의 방문",
- "average_try": 2.4587,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154284
- },
- "9370": {
- "problemId": "9370",
- "problemLevel": 14,
- "problemName": "미확인 도착지",
- "average_try": 4.0016,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154306
- },
- "2211": {
- "problemId": "2211",
- "problemLevel": 14,
- "problemName": "네트워크 복구",
- "average_try": 2.1006,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154329
- },
- "16118": {
- "problemId": "16118",
- "problemLevel": 15,
- "problemName": "달빛 여우",
- "average_try": 5.3728,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154351
- },
- "1445": {
- "problemId": "1445",
- "problemLevel": 14,
- "problemName": "일요일 아침의 데이트",
- "average_try": 4.2778,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- }
- ],
- "lastupdate": 1648236948.154373
- },
- "2307": {
- "problemId": "2307",
- "problemLevel": 14,
- "problemName": "도로검문",
- "average_try": 2.7466,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154396
- },
- "18243": {
- "problemId": "18243",
- "problemLevel": 9,
- "problemName": "Small World Network",
- "average_try": 2.1661,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154419
- },
- "11403": {
- "problemId": "11403",
- "problemLevel": 10,
- "problemName": "경로 찾기",
- "average_try": 1.763,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154441
- },
- "1389": {
- "problemId": "1389",
- "problemLevel": 10,
- "problemName": "케빈 베이컨의 6단계 법칙",
- "average_try": 1.7947,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154463
- },
- "9205": {
- "problemId": "9205",
- "problemLevel": 10,
- "problemName": "맥주 마시면서 걸어가기",
- "average_try": 2.6429,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154485
- },
- "1058": {
- "problemId": "1058",
- "problemLevel": 9,
- "problemName": "친구",
- "average_try": 2.5423,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154508
- },
- "2224": {
- "problemId": "2224",
- "problemLevel": 11,
- "problemName": "명제 증명",
- "average_try": 3.3795,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.15453
- },
- "11265": {
- "problemId": "11265",
- "problemLevel": 10,
- "problemName": "끝나지 않는 파티",
- "average_try": 1.8571,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154568
- },
- "2660": {
- "problemId": "2660",
- "problemLevel": 11,
- "problemName": "회장뽑기",
- "average_try": 1.8524,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154592
- },
- "15723": {
- "problemId": "15723",
- "problemLevel": 11,
- "problemName": "n단 논법",
- "average_try": 1.6733,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154614
- },
- "11404": {
- "problemId": "11404",
- "problemLevel": 12,
- "problemName": "플로이드",
- "average_try": 2.3875,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154637
- },
- "2458": {
- "problemId": "2458",
- "problemLevel": 12,
- "problemName": "키 순서",
- "average_try": 1.8989,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154659
- },
- "1956": {
- "problemId": "1956",
- "problemLevel": 12,
- "problemName": "운동",
- "average_try": 2.3012,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154682
- },
- "11562": {
- "problemId": "11562",
- "problemLevel": 12,
- "problemName": "백양로 브레이크",
- "average_try": 2.0095,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154704
- },
- "10159": {
- "problemId": "10159",
- "problemLevel": 13,
- "problemName": "저울",
- "average_try": 1.5527,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154726
- },
- "1507": {
- "problemId": "1507",
- "problemLevel": 13,
- "problemName": "궁금한 민호",
- "average_try": 2.0306,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154748
- },
- "1613": {
- "problemId": "1613",
- "problemLevel": 13,
- "problemName": "역사",
- "average_try": 2.9092,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.15477
- },
- "11780": {
- "problemId": "11780",
- "problemLevel": 14,
- "problemName": "플로이드 2",
- "average_try": 2.1487,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154792
- },
- "11657": {
- "problemId": "11657",
- "problemLevel": 12,
- "problemName": "타임머신",
- "average_try": 4.6786,
- "solvedtags": [
- {
- "bojTagId": 10,
- "key": "bellman_ford"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154813
- },
- "1865": {
- "problemId": "1865",
- "problemLevel": 13,
- "problemName": "웜홀",
- "average_try": 4.4923,
- "solvedtags": [
- {
- "bojTagId": 10,
- "key": "bellman_ford"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154835
- },
- "1219": {
- "problemId": "1219",
- "problemLevel": 15,
- "problemName": "오민식의 고민",
- "average_try": 6.3627,
- "solvedtags": [
- {
- "bojTagId": 10,
- "key": "bellman_ford"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154857
- },
- "21940": {
- "problemId": "21940",
- "problemLevel": 12,
- "problemName": "가운데에서 만나기",
- "average_try": 2.2797,
- "solvedtags": [
- {
- "bojTagId": 31,
- "key": "floyd_warshall"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.154878
- },
- "22865": {
- "problemId": "22865",
- "problemLevel": 12,
- "problemName": "가장 먼 곳",
- "average_try": 3.1863,
- "solvedtags": [
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- }
- ],
- "lastupdate": 1648236948.1549
- },
- "22870": {
- "problemId": "22870",
- "problemLevel": 16,
- "problemName": "산책 (large)",
- "average_try": 5.3103,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 22,
- "key": "dijkstra"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- }
- ],
- "lastupdate": 1648236948.154921
- },
- "20436": {
- "problemId": "20436",
- "problemLevel": 7,
- "problemName": "ZOAC 3",
- "average_try": 1.9971,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 172,
- "key": "precomputation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.15564
- },
- "14594": {
- "problemId": "14594",
- "problemLevel": 8,
- "problemName": "동방 프로젝트 (Small)",
- "average_try": 1.6291,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.15567
- },
- "5212": {
- "problemId": "5212",
- "problemLevel": 9,
- "problemName": "지구 온난화",
- "average_try": 1.8194,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155706
- },
- "14891": {
- "problemId": "14891",
- "problemLevel": 11,
- "problemName": "톱니바퀴",
- "average_try": 1.8635,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.15573
- },
- "1713": {
- "problemId": "1713",
- "problemLevel": 9,
- "problemName": "후보 추천하기",
- "average_try": 3.2273,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155753
- },
- "20055": {
- "problemId": "20055",
- "problemLevel": 11,
- "problemName": "컨베이어 벨트 위의 로봇",
- "average_try": 1.8016,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155777
- },
- "20665": {
- "problemId": "20665",
- "problemLevel": 11,
- "problemName": "독서실 거리두기",
- "average_try": 4.24,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155799
- },
- "14503": {
- "problemId": "14503",
- "problemLevel": 11,
- "problemName": "로봇 청소기",
- "average_try": 1.868,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155821
- },
- "3190": {
- "problemId": "3190",
- "problemLevel": 11,
- "problemName": "뱀",
- "average_try": 2.563,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 73,
- "key": "deque"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 72,
- "key": "queue"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155844
- },
- "14499": {
- "problemId": "14499",
- "problemLevel": 12,
- "problemName": "주사위 굴리기",
- "average_try": 2.3256,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155867
- },
- "15683": {
- "problemId": "15683",
- "problemLevel": 12,
- "problemName": "감시",
- "average_try": 2.3291,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.15589
- },
- "16234": {
- "problemId": "16234",
- "problemLevel": 11,
- "problemName": "인구 이동",
- "average_try": 2.7864,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155912
- },
- "17144": {
- "problemId": "17144",
- "problemLevel": 12,
- "problemName": "미세먼지 안녕!",
- "average_try": 1.8434,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155934
- },
- "20056": {
- "problemId": "20056",
- "problemLevel": 12,
- "problemName": "마법사 상어와 파이어볼",
- "average_try": 2.9333,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155957
- },
- "20165": {
- "problemId": "20165",
- "problemLevel": 11,
- "problemName": "인내의 도미노 장인 호석",
- "average_try": 2.5458,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.155978
- },
- "16236": {
- "problemId": "16236",
- "problemLevel": 13,
- "problemName": "아기 상어",
- "average_try": 2.4276,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156
- },
- "15685": {
- "problemId": "15685",
- "problemLevel": 12,
- "problemName": "드래곤 커브",
- "average_try": 1.8529,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156022
- },
- "16235": {
- "problemId": "16235",
- "problemLevel": 12,
- "problemName": "나무 재테크",
- "average_try": 4.6391,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156045
- },
- "17135": {
- "problemId": "17135",
- "problemLevel": 12,
- "problemName": "캐슬 디펜스",
- "average_try": 3.2324,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156067
- },
- "17140": {
- "problemId": "17140",
- "problemLevel": 12,
- "problemName": "이차원 배열과 연산",
- "average_try": 2.311,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.15609
- },
- "17779": {
- "problemId": "17779",
- "problemLevel": 12,
- "problemName": "게리맨더링 2",
- "average_try": 1.7715,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156112
- },
- "19238": {
- "problemId": "19238",
- "problemLevel": 13,
- "problemName": "스타트 택시",
- "average_try": 5.0781,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156134
- },
- "20057": {
- "problemId": "20057",
- "problemLevel": 13,
- "problemName": "마법사 상어와 토네이도",
- "average_try": 1.3977,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156156
- },
- "20058": {
- "problemId": "20058",
- "problemLevel": 12,
- "problemName": "마법사 상어와 파이어스톰",
- "average_try": 2.5252,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156177
- },
- "8972": {
- "problemId": "8972",
- "problemLevel": 12,
- "problemName": "미친 아두이노",
- "average_try": 3.6643,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156199
- },
- "17822": {
- "problemId": "17822",
- "problemLevel": 13,
- "problemName": "원판 돌리기",
- "average_try": 3.162,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156223
- },
- "19236": {
- "problemId": "19236",
- "problemLevel": 14,
- "problemName": "청소년 상어",
- "average_try": 1.5738,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156245
- },
- "13459": {
- "problemId": "13459",
- "problemLevel": 14,
- "problemName": "구슬 탈출",
- "average_try": 3.0363,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156269
- },
- "2933": {
- "problemId": "2933",
- "problemLevel": 14,
- "problemName": "미네랄",
- "average_try": 4.0231,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156291
- },
- "19237": {
- "problemId": "19237",
- "problemLevel": 13,
- "problemName": "어른 상어",
- "average_try": 2.5954,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156313
- },
- "18808": {
- "problemId": "18808",
- "problemLevel": 13,
- "problemName": "스티커 붙이기",
- "average_try": 1.5541,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156334
- },
- "18500": {
- "problemId": "18500",
- "problemLevel": 14,
- "problemName": "미네랄 2",
- "average_try": 2.9036,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156356
- },
- "17143": {
- "problemId": "17143",
- "problemLevel": 14,
- "problemName": "낚시왕",
- "average_try": 4.031,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156377
- },
- "17837": {
- "problemId": "17837",
- "problemLevel": 14,
- "problemName": "새로운 게임 2",
- "average_try": 2.1668,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156399
- },
- "15653": {
- "problemId": "15653",
- "problemLevel": 15,
- "problemName": "구슬 탈출 4",
- "average_try": 2.2859,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156421
- },
- "17780": {
- "problemId": "17780",
- "problemLevel": 14,
- "problemName": "새로운 게임",
- "average_try": 2.1621,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156444
- },
- "20061": {
- "problemId": "20061",
- "problemLevel": 14,
- "problemName": "모노미노도미노 2",
- "average_try": 2.8349,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156465
- },
- "5373": {
- "problemId": "5373",
- "problemLevel": 16,
- "problemName": "큐빙",
- "average_try": 2.6471,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156488
- },
- "18809": {
- "problemId": "18809",
- "problemLevel": 15,
- "problemName": "Gaaaaaaaaaarden",
- "average_try": 2.3678,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.15651
- },
- "16939": {
- "problemId": "16939",
- "problemLevel": 14,
- "problemName": "2×2×2 큐브",
- "average_try": 2.2907,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- }
- ],
- "lastupdate": 1648236948.156532
- },
- "19235": {
- "problemId": "19235",
- "problemLevel": 16,
- "problemName": "모노미노도미노",
- "average_try": 5.137,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156554
- },
- "3025": {
- "problemId": "3025",
- "problemLevel": 17,
- "problemName": "돌 던지기",
- "average_try": 6.297,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156576
- },
- "13460": {
- "problemId": "13460",
- "problemLevel": 15,
- "problemName": "구슬 탈출 2",
- "average_try": 3.7536,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156599
- },
- "15644": {
- "problemId": "15644",
- "problemLevel": 15,
- "problemName": "구슬 탈출 3",
- "average_try": 1.7692,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156621
- },
- "21609": {
- "problemId": "21609",
- "problemLevel": 14,
- "problemName": "상어 중학교",
- "average_try": 3.0062,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156644
- },
- "21610": {
- "problemId": "21610",
- "problemLevel": 11,
- "problemName": "마법사 상어와 비바라기",
- "average_try": 1.9366,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156666
- },
- "21922": {
- "problemId": "21922",
- "problemLevel": 11,
- "problemName": "학부 연구생 민상",
- "average_try": 3.8836,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- }
- ],
- "lastupdate": 1648236948.156688
- },
- "22861": {
- "problemId": "22861",
- "problemLevel": 14,
- "problemName": "폴더 정리 (large)",
- "average_try": 4.7826,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.156711
- },
- "3029": {
- "problemId": "3029",
- "problemLevel": 3,
- "problemName": "경고",
- "average_try": 2.6012,
- "solvedtags": [
- {
- "bojTagId": 121,
- "key": "arithmetic"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157342
- },
- "1942": {
- "problemId": "1942",
- "problemLevel": 4,
- "problemName": "디지털시계",
- "average_try": 1.9749,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 141,
- "key": "simulation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157383
- },
- "20944": {
- "problemId": "20944",
- "problemLevel": 3,
- "problemName": "팰린드롬 척화비",
- "average_try": 1.2566,
- "solvedtags": [
- {
- "bojTagId": 109,
- "key": "ad_hoc"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157409
- },
- "11720": {
- "problemId": "11720",
- "problemLevel": 4,
- "problemName": "숫자의 합",
- "average_try": 1.8397,
- "solvedtags": [
- {
- "bojTagId": 121,
- "key": "arithmetic"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157433
- },
- "1152": {
- "problemId": "1152",
- "problemLevel": 4,
- "problemName": "단어의 개수",
- "average_try": 3.27,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157457
- },
- "10809": {
- "problemId": "10809",
- "problemLevel": 4,
- "problemName": "알파벳 찾기",
- "average_try": 1.881,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157481
- },
- "10808": {
- "problemId": "10808",
- "problemLevel": 4,
- "problemName": "알파벳 개수",
- "average_try": 1.4295,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157504
- },
- "11365": {
- "problemId": "11365",
- "problemLevel": 4,
- "problemName": "!밀비 급일",
- "average_try": 1.5662,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157526
- },
- "1159": {
- "problemId": "1159",
- "problemLevel": 4,
- "problemName": "농구 경기",
- "average_try": 1.9377,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157549
- },
- "2744": {
- "problemId": "2744",
- "problemLevel": 4,
- "problemName": "대소문자 바꾸기",
- "average_try": 1.2608,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157573
- },
- "1718": {
- "problemId": "1718",
- "problemLevel": 4,
- "problemName": "암호",
- "average_try": 1.8863,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157596
- },
- "9046": {
- "problemId": "9046",
- "problemLevel": 5,
- "problemName": "복호화",
- "average_try": 2.045,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157618
- },
- "1032": {
- "problemId": "1032",
- "problemLevel": 5,
- "problemName": "명령 프롬프트",
- "average_try": 1.8885,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.15764
- },
- "10798": {
- "problemId": "10798",
- "problemLevel": 5,
- "problemName": "세로읽기",
- "average_try": 1.7495,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157663
- },
- "10988": {
- "problemId": "10988",
- "problemLevel": 5,
- "problemName": "팰린드롬인지 확인하기",
- "average_try": 1.4709,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157686
- },
- "11655": {
- "problemId": "11655",
- "problemLevel": 5,
- "problemName": "ROT13",
- "average_try": 1.6027,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157708
- },
- "1259": {
- "problemId": "1259",
- "problemLevel": 5,
- "problemName": "팰린드롬수",
- "average_try": 1.672,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.15773
- },
- "9933": {
- "problemId": "9933",
- "problemLevel": 5,
- "problemName": "민균이의 비밀번호",
- "average_try": 2.7478,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157752
- },
- "6996": {
- "problemId": "6996",
- "problemLevel": 5,
- "problemName": "애너그램",
- "average_try": 1.9472,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157776
- },
- "20154": {
- "problemId": "20154",
- "problemLevel": 5,
- "problemName": "이 구역의 승자는 누구야?!",
- "average_try": 1.5234,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157799
- },
- "1316": {
- "problemId": "1316",
- "problemLevel": 6,
- "problemName": "그룹 단어 체커",
- "average_try": 1.9145,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157821
- },
- "2941": {
- "problemId": "2941",
- "problemLevel": 6,
- "problemName": "크로아티아 알파벳",
- "average_try": 2.2335,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157844
- },
- "1181": {
- "problemId": "1181",
- "problemLevel": 6,
- "problemName": "단어 정렬",
- "average_try": 2.4762,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157866
- },
- "3613": {
- "problemId": "3613",
- "problemLevel": 7,
- "problemName": "Java vs C++",
- "average_try": 5.1477,
- "solvedtags": [
- {
- "bojTagId": 137,
- "key": "case_work"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157888
- },
- "9536": {
- "problemId": "9536",
- "problemLevel": 7,
- "problemName": "여우는 어떻게 울지?",
- "average_try": 2.5466,
- "solvedtags": [
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157911
- },
- "14405": {
- "problemId": "14405",
- "problemLevel": 6,
- "problemName": "피카츄",
- "average_try": 2.0773,
- "solvedtags": [
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157933
- },
- "4659": {
- "problemId": "4659",
- "problemLevel": 6,
- "problemName": "비밀번호 발음하기",
- "average_try": 1.8913,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157956
- },
- "16171": {
- "problemId": "16171",
- "problemLevel": 6,
- "problemName": "나는 친구가 적다 (Small)",
- "average_try": 1.8856,
- "solvedtags": [
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.157978
- },
- "12871": {
- "problemId": "12871",
- "problemLevel": 6,
- "problemName": "무한 문자열",
- "average_try": 2.7648,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158
- },
- "2204": {
- "problemId": "2204",
- "problemLevel": 6,
- "problemName": "도비의 난독증 테스트",
- "average_try": 1.8625,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158022
- },
- "4446": {
- "problemId": "4446",
- "problemLevel": 6,
- "problemName": "ROT13",
- "average_try": 3.4922,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158044
- },
- "9342": {
- "problemId": "9342",
- "problemLevel": 7,
- "problemName": "염색체",
- "average_try": 1.4302,
- "solvedtags": [
- {
- "bojTagId": 63,
- "key": "regex"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158066
- },
- "20114": {
- "problemId": "20114",
- "problemLevel": 6,
- "problemName": "미아 노트",
- "average_try": 1.2912,
- "solvedtags": [
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158088
- },
- "12933": {
- "problemId": "12933",
- "problemLevel": 7,
- "problemName": "오리",
- "average_try": 2.9391,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.15811
- },
- "5534": {
- "problemId": "5534",
- "problemLevel": 6,
- "problemName": "간판",
- "average_try": 1.9536,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158132
- },
- "6550": {
- "problemId": "6550",
- "problemLevel": 6,
- "problemName": "부분 문자열",
- "average_try": 2.7643,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158155
- },
- "4396": {
- "problemId": "4396",
- "problemLevel": 6,
- "problemName": "지뢰 찾기",
- "average_try": 3.245,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158177
- },
- "9242": {
- "problemId": "9242",
- "problemLevel": 6,
- "problemName": "폭탄 해체",
- "average_try": 1.9706,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158199
- },
- "4836": {
- "problemId": "4836",
- "problemLevel": 7,
- "problemName": "춤",
- "average_try": 2.82,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158221
- },
- "1764": {
- "problemId": "1764",
- "problemLevel": 7,
- "problemName": "듣보잡",
- "average_try": 2.4962,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158244
- },
- "11656": {
- "problemId": "11656",
- "problemLevel": 7,
- "problemName": "접미사 배열",
- "average_try": 1.4287,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158266
- },
- "1620": {
- "problemId": "1620",
- "problemLevel": 7,
- "problemName": "나는야 포켓몬 마스터 이다솜",
- "average_try": 2.9916,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- }
- ],
- "lastupdate": 1648236948.158288
- },
- "1213": {
- "problemId": "1213",
- "problemLevel": 7,
- "problemName": "팰린드롬 만들기",
- "average_try": 2.6955,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158311
- },
- "20291": {
- "problemId": "20291",
- "problemLevel": 8,
- "problemName": "파일 정리",
- "average_try": 1.4622,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158333
- },
- "19844": {
- "problemId": "19844",
- "problemLevel": 7,
- "problemName": "단어 개수 세기",
- "average_try": 2.8295,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158355
- },
- "1622": {
- "problemId": "1622",
- "problemLevel": 7,
- "problemName": "공통 순열",
- "average_try": 4.1789,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158377
- },
- "17413": {
- "problemId": "17413",
- "problemLevel": 8,
- "problemName": "단어 뒤집기 2",
- "average_try": 1.7591,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158399
- },
- "11478": {
- "problemId": "11478",
- "problemLevel": 8,
- "problemName": "서로 다른 부분 문자열의 개수",
- "average_try": 1.6828,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.158421
- },
- "2852": {
- "problemId": "2852",
- "problemLevel": 7,
- "problemName": "NBA 농구",
- "average_try": 2.8703,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158444
- },
- "1972": {
- "problemId": "1972",
- "problemLevel": 8,
- "problemName": "놀라운 문자열",
- "average_try": 1.6883,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158465
- },
- "19948": {
- "problemId": "19948",
- "problemLevel": 8,
- "problemName": "음유시인 영재",
- "average_try": 3.7947,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158488
- },
- "9548": {
- "problemId": "9548",
- "problemLevel": 20,
- "problemName": "무제",
- "average_try": 2.1667,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 159,
- "key": "rope"
- },
- {
- "bojTagId": 69,
- "key": "splay_tree"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.15851
- },
- "17609": {
- "problemId": "17609",
- "problemLevel": 10,
- "problemName": "회문",
- "average_try": 3.5829,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.158532
- },
- "3005": {
- "problemId": "3005",
- "problemLevel": 9,
- "problemName": "크로스워드 퍼즐 쳐다보기",
- "average_try": 2.0456,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158579
- },
- "19583": {
- "problemId": "19583",
- "problemLevel": 9,
- "problemName": "싸이버개강총회",
- "average_try": 2.6109,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 96,
- "key": "parsing"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158604
- },
- "13022": {
- "problemId": "13022",
- "problemLevel": 9,
- "problemName": "늑대와 올바른 단어",
- "average_try": 3.2661,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158626
- },
- "15927": {
- "problemId": "15927",
- "problemLevel": 11,
- "problemName": "회문은 회문아니야!!",
- "average_try": 2.3291,
- "solvedtags": [
- {
- "bojTagId": 109,
- "key": "ad_hoc"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158648
- },
- "3107": {
- "problemId": "3107",
- "problemLevel": 11,
- "problemName": "IPv6",
- "average_try": 2.815,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158672
- },
- "2671": {
- "problemId": "2671",
- "problemLevel": 11,
- "problemName": "잠수함식별",
- "average_try": 2.6225,
- "solvedtags": [
- {
- "bojTagId": 63,
- "key": "regex"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158695
- },
- "20437": {
- "problemId": "20437",
- "problemLevel": 11,
- "problemName": "문자열 게임 2",
- "average_try": 2.2749,
- "solvedtags": [
- {
- "bojTagId": 68,
- "key": "sliding_window"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158718
- },
- "16916": {
- "problemId": "16916",
- "problemLevel": 13,
- "problemName": "부분 문자열",
- "average_try": 2.7522,
- "solvedtags": [
- {
- "bojTagId": 40,
- "key": "kmp"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158741
- },
- "2115": {
- "problemId": "2115",
- "problemLevel": 11,
- "problemName": "갤러리",
- "average_try": 1.3303,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158763
- },
- "16890": {
- "problemId": "16890",
- "problemLevel": 13,
- "problemName": "창업",
- "average_try": 5.8667,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158785
- },
- "20210": {
- "problemId": "20210",
- "problemLevel": 14,
- "problemName": "파일 탐색기",
- "average_try": 4.2268,
- "solvedtags": [
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.158807
- },
- "14567": {
- "problemId": "14567",
- "problemLevel": 11,
- "problemName": "선수과목 (Prerequisite)",
- "average_try": 1.5205,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159584
- },
- "2056": {
- "problemId": "2056",
- "problemLevel": 12,
- "problemName": "작업",
- "average_try": 2.3407,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159614
- },
- "14676": {
- "problemId": "14676",
- "problemLevel": 13,
- "problemName": "영우는 사기꾼?",
- "average_try": 3.0906,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 102,
- "key": "implementation"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.15964
- },
- "1005": {
- "problemId": "1005",
- "problemLevel": 13,
- "problemName": "ACM Craft",
- "average_try": 3.9625,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159663
- },
- "1516": {
- "problemId": "1516",
- "problemLevel": 13,
- "problemName": "게임 개발",
- "average_try": 2.0796,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159697
- },
- "9470": {
- "problemId": "9470",
- "problemLevel": 13,
- "problemName": "Strahler 순서",
- "average_try": 2.5319,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159721
- },
- "2252": {
- "problemId": "2252",
- "problemLevel": 13,
- "problemName": "줄 세우기",
- "average_try": 1.8195,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159744
- },
- "1766": {
- "problemId": "1766",
- "problemLevel": 14,
- "problemName": "문제집",
- "average_try": 2.1068,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159767
- },
- "2623": {
- "problemId": "2623",
- "problemLevel": 14,
- "problemName": "음악프로그램",
- "average_try": 2.0164,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.15979
- },
- "2637": {
- "problemId": "2637",
- "problemLevel": 14,
- "problemName": "장난감 조립",
- "average_try": 2.1264,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159813
- },
- "20119": {
- "problemId": "20119",
- "problemLevel": 15,
- "problemName": "클레어와 물약",
- "average_try": 3.3092,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159836
- },
- "3665": {
- "problemId": "3665",
- "problemLevel": 15,
- "problemName": "최종 순위",
- "average_try": 2.7316,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159859
- },
- "1948": {
- "problemId": "1948",
- "problemLevel": 16,
- "problemName": "임계경로",
- "average_try": 3.338,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- }
- ],
- "lastupdate": 1648236948.159881
- },
- "1991": {
- "problemId": "1991",
- "problemLevel": 10,
- "problemName": "트리 순회",
- "average_try": 1.5276,
- "solvedtags": [
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.16023
- },
- "9372": {
- "problemId": "9372",
- "problemLevel": 8,
- "problemName": "상근이의 여행",
- "average_try": 1.6355,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160261
- },
- "9934": {
- "problemId": "9934",
- "problemLevel": 10,
- "problemName": "완전 이진 트리",
- "average_try": 1.4511,
- "solvedtags": [
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160298
- },
- "11725": {
- "problemId": "11725",
- "problemLevel": 9,
- "problemName": "트리의 부모 찾기",
- "average_try": 2.3611,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160324
- },
- "20364": {
- "problemId": "20364",
- "problemLevel": 9,
- "problemName": "부동산 다툼",
- "average_try": 3.3769,
- "solvedtags": [
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160347
- },
- "1068": {
- "problemId": "1068",
- "problemLevel": 11,
- "problemName": "트리",
- "average_try": 3.6719,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160371
- },
- "5639": {
- "problemId": "5639",
- "problemLevel": 11,
- "problemName": "이진 검색 트리",
- "average_try": 2.6293,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160394
- },
- "15900": {
- "problemId": "15900",
- "problemLevel": 10,
- "problemName": "나무 탈출",
- "average_try": 2.5273,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 140,
- "key": "game_theory"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160417
- },
- "6416": {
- "problemId": "6416",
- "problemLevel": 11,
- "problemName": "트리인가?",
- "average_try": 4.948,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.16044
- },
- "14675": {
- "problemId": "14675",
- "problemLevel": 11,
- "problemName": "단절점과 단절선",
- "average_try": 1.9203,
- "solvedtags": [
- {
- "bojTagId": 4,
- "key": "articulation"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160463
- },
- "15681": {
- "problemId": "15681",
- "problemLevel": 11,
- "problemName": "트리와 쿼리",
- "average_try": 2.1156,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160485
- },
- "17073": {
- "problemId": "17073",
- "problemLevel": 11,
- "problemName": "나무 위의 빗물",
- "average_try": 2.5233,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160508
- },
- "19641": {
- "problemId": "19641",
- "problemLevel": 11,
- "problemName": "중첩 집합 모델",
- "average_try": 2.5862,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.16053
- },
- "1240": {
- "problemId": "1240",
- "problemLevel": 11,
- "problemName": "노드사이의 거리",
- "average_try": 1.8555,
- "solvedtags": [
- {
- "bojTagId": 126,
- "key": "bfs"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160552
- },
- "1967": {
- "problemId": "1967",
- "problemLevel": 12,
- "problemName": "트리의 지름",
- "average_try": 2.3103,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160575
- },
- "3584": {
- "problemId": "3584",
- "problemLevel": 12,
- "problemName": "가장 가까운 공통 조상",
- "average_try": 1.8768,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 41,
- "key": "lca"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160598
- },
- "4256": {
- "problemId": "4256",
- "problemLevel": 13,
- "problemName": "트리",
- "average_try": 1.8559,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160621
- },
- "4803": {
- "problemId": "4803",
- "problemLevel": 12,
- "problemName": "트리",
- "average_try": 3.0512,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160644
- },
- "4933": {
- "problemId": "4933",
- "problemLevel": 13,
- "problemName": "뉴턴의 사과",
- "average_try": 1.8857,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160666
- },
- "9489": {
- "problemId": "9489",
- "problemLevel": 12,
- "problemName": "사촌",
- "average_try": 3.3484,
- "solvedtags": [
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.16069
- },
- "14267": {
- "problemId": "14267",
- "problemLevel": 12,
- "problemName": "회사 문화 1",
- "average_try": 2.6567,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160713
- },
- "19542": {
- "problemId": "19542",
- "problemLevel": 12,
- "problemName": "전단지 돌리기",
- "average_try": 2.4402,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160735
- },
- "20924": {
- "problemId": "20924",
- "problemLevel": 12,
- "problemName": "트리의 기둥과 가지",
- "average_try": 2.9758,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160758
- },
- "20955": {
- "problemId": "20955",
- "problemLevel": 12,
- "problemName": "민서의 응급 수술",
- "average_try": 2.5841,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 81,
- "key": "disjoint_set"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.16078
- },
- "21276": {
- "problemId": "21276",
- "problemLevel": 13,
- "problemName": "계보 복원가 호석",
- "average_try": 2.0407,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160803
- },
- "1167": {
- "problemId": "1167",
- "problemLevel": 13,
- "problemName": "트리의 지름",
- "average_try": 2.9479,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160826
- },
- "1595": {
- "problemId": "1595",
- "problemLevel": 13,
- "problemName": "북쪽나라의 도로",
- "average_try": 3.1391,
- "solvedtags": [
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160848
- },
- "2058": {
- "problemId": "2058",
- "problemLevel": 13,
- "problemName": "원자의 에너지",
- "average_try": 3.45,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160871
- },
- "2263": {
- "problemId": "2263",
- "problemLevel": 14,
- "problemName": "트리의 순회",
- "average_try": 2.9403,
- "solvedtags": [
- {
- "bojTagId": 24,
- "key": "divide_and_conquer"
- },
- {
- "bojTagId": 62,
- "key": "recursion"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160894
- },
- "2533": {
- "problemId": "2533",
- "problemLevel": 13,
- "problemName": "사회망 서비스(SNS)",
- "average_try": 2.8053,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160916
- },
- "11437": {
- "problemId": "11437",
- "problemLevel": 13,
- "problemName": "LCA",
- "average_try": 2.3364,
- "solvedtags": [
- {
- "bojTagId": 41,
- "key": "lca"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160939
- },
- "12896": {
- "problemId": "12896",
- "problemLevel": 13,
- "problemName": "스크루지 민호",
- "average_try": 2.5616,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160962
- },
- "19535": {
- "problemId": "19535",
- "problemLevel": 13,
- "problemName": "ㄷㄷㄷㅈ",
- "average_try": 3.2779,
- "solvedtags": [
- {
- "bojTagId": 6,
- "key": "combinatorics"
- },
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.160984
- },
- "2250": {
- "problemId": "2250",
- "problemLevel": 14,
- "problemName": "트리의 높이와 너비",
- "average_try": 3.6241,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161007
- },
- "4315": {
- "problemId": "4315",
- "problemLevel": 15,
- "problemName": "나무 위의 구슬",
- "average_try": 2.4872,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 78,
- "key": "topological_sorting"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161029
- },
- "14657": {
- "problemId": "14657",
- "problemLevel": 14,
- "problemName": "준오는 최종인재야!!",
- "average_try": 3.713,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161051
- },
- "16437": {
- "problemId": "16437",
- "problemLevel": 14,
- "problemName": "양 구출 작전",
- "average_try": 3.5399,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161073
- },
- "1949": {
- "problemId": "1949",
- "problemLevel": 14,
- "problemName": "우수 마을",
- "average_try": 1.9553,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161096
- },
- "2213": {
- "problemId": "2213",
- "problemLevel": 15,
- "problemName": "트리의 독립집합",
- "average_try": 2.0484,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161118
- },
- "2233": {
- "problemId": "2233",
- "problemLevel": 15,
- "problemName": "사과나무",
- "average_try": 3.0656,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 41,
- "key": "lca"
- },
- {
- "bojTagId": 71,
- "key": "stack"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161141
- },
- "12912": {
- "problemId": "12912",
- "problemLevel": 14,
- "problemName": "트리 수정",
- "average_try": 2.0278,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161163
- },
- "12978": {
- "problemId": "12978",
- "problemLevel": 13,
- "problemName": "스크루지 민호 2",
- "average_try": 2.1692,
- "solvedtags": [
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 92,
- "key": "dp_tree"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161185
- },
- "14570": {
- "problemId": "14570",
- "problemLevel": 14,
- "problemName": "나무 위의 구슬",
- "average_try": 3.1944,
- "solvedtags": [
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161207
- },
- "19581": {
- "problemId": "19581",
- "problemLevel": 15,
- "problemName": "두 번째 트리의 지름",
- "average_try": 2.2093,
- "solvedtags": [
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- }
- ],
- "lastupdate": 1648236948.161229
- },
- "14425": {
- "problemId": "14425",
- "problemLevel": 8,
- "problemName": "문자열 집합",
- "average_try": 1.8082,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- },
- {
- "bojTagId": 79,
- "key": "trie"
- }
- ],
- "lastupdate": 1648236948.161829
- },
- "5052": {
- "problemId": "5052",
- "problemLevel": 12,
- "problemName": "전화번호 목록",
- "average_try": 3.3814,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 79,
- "key": "trie"
- }
- ],
- "lastupdate": 1648236948.161859
- },
- "4358": {
- "problemId": "4358",
- "problemLevel": 10,
- "problemName": "생태학",
- "average_try": 2.731,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 74,
- "key": "tree_set"
- }
- ],
- "lastupdate": 1648236948.161895
- },
- "14725": {
- "problemId": "14725",
- "problemLevel": 14,
- "problemName": "개미굴",
- "average_try": 1.4858,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 79,
- "key": "trie"
- }
- ],
- "lastupdate": 1648236948.16192
- },
- "20166": {
- "problemId": "20166",
- "problemLevel": 11,
- "problemName": "문자열 지옥에 빠진 호석",
- "average_try": 2.7977,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 136,
- "key": "hash_set"
- },
- {
- "bojTagId": 158,
- "key": "string"
- }
- ],
- "lastupdate": 1648236948.161943
- },
- "9202": {
- "problemId": "9202",
- "problemLevel": 16,
- "problemName": "Boggle",
- "average_try": 3.8881,
- "solvedtags": [
- {
- "bojTagId": 5,
- "key": "backtracking"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 127,
- "key": "dfs"
- },
- {
- "bojTagId": 7,
- "key": "graphs"
- },
- {
- "bojTagId": 11,
- "key": "graph_traversal"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 79,
- "key": "trie"
- }
- ],
- "lastupdate": 1648236948.161968
- },
- "5670": {
- "problemId": "5670",
- "problemLevel": 17,
- "problemName": "휴대폰 자판",
- "average_try": 3.2672,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 79,
- "key": "trie"
- }
- ],
- "lastupdate": 1648236948.161992
- },
- "5446": {
- "problemId": "5446",
- "problemLevel": 18,
- "problemName": "용량 부족",
- "average_try": 2.7751,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 79,
- "key": "trie"
- }
- ],
- "lastupdate": 1648236948.162015
- },
- "19585": {
- "problemId": "19585",
- "problemLevel": 18,
- "problemName": "전설",
- "average_try": 6.9526,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 120,
- "key": "trees"
- },
- {
- "bojTagId": 79,
- "key": "trie"
- }
- ],
- "lastupdate": 1648236948.162037
- },
- "2470": {
- "problemId": "2470",
- "problemLevel": 11,
- "problemName": "두 용액",
- "average_try": 3.2678,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162334
- },
- "15961": {
- "problemId": "15961",
- "problemLevel": 12,
- "problemName": "회전 초밥",
- "average_try": 2.6519,
- "solvedtags": [
- {
- "bojTagId": 68,
- "key": "sliding_window"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162364
- },
- "1806": {
- "problemId": "1806",
- "problemLevel": 12,
- "problemName": "부분합",
- "average_try": 3.9631,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.16239
- },
- "7453": {
- "problemId": "7453",
- "problemLevel": 14,
- "problemName": "합이 0인 네 정수",
- "average_try": 4.4375,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 46,
- "key": "mitm"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162425
- },
- "15565": {
- "problemId": "15565",
- "problemLevel": 10,
- "problemName": "귀여운 라이언",
- "average_try": 2.4694,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162449
- },
- "2467": {
- "problemId": "2467",
- "problemLevel": 11,
- "problemName": "용액",
- "average_try": 2.8014,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162472
- },
- "2473": {
- "problemId": "2473",
- "problemLevel": 12,
- "problemName": "세 용액",
- "average_try": 3.8482,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162495
- },
- "1644": {
- "problemId": "1644",
- "problemLevel": 13,
- "problemName": "소수의 연속합",
- "average_try": 2.3817,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 9,
- "key": "primality_test"
- },
- {
- "bojTagId": 67,
- "key": "sieve"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162519
- },
- "20181": {
- "problemId": "20181",
- "problemLevel": 14,
- "problemName": "꿈틀꿈틀 호석 애벌레 - 효율성",
- "average_try": 2.363,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 25,
- "key": "dp"
- },
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162542
- },
- "16472": {
- "problemId": "16472",
- "problemLevel": 12,
- "problemName": "고냥이",
- "average_try": 2.4603,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.16258
- },
- "11728": {
- "problemId": "11728",
- "problemLevel": 6,
- "problemName": "배열 합치기",
- "average_try": 2.2339,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162605
- },
- "2018": {
- "problemId": "2018",
- "problemLevel": 6,
- "problemName": "수들의 합 5",
- "average_try": 1.9079,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162629
- },
- "1940": {
- "problemId": "1940",
- "problemLevel": 7,
- "problemName": "주몽",
- "average_try": 2.034,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162652
- },
- "3273": {
- "problemId": "3273",
- "problemLevel": 8,
- "problemName": "두 수의 합",
- "average_try": 2.7219,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162675
- },
- "10025": {
- "problemId": "10025",
- "problemLevel": 7,
- "problemName": "게으른 백곰",
- "average_try": 3.1136,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 68,
- "key": "sliding_window"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162697
- },
- "6159": {
- "problemId": "6159",
- "problemLevel": 7,
- "problemName": "코스튬 파티",
- "average_try": 1.6014,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162719
- },
- "2003": {
- "problemId": "2003",
- "problemLevel": 8,
- "problemName": "수들의 합 2",
- "average_try": 2.0454,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162741
- },
- "2559": {
- "problemId": "2559",
- "problemLevel": 8,
- "problemName": "수열",
- "average_try": 2.8919,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 68,
- "key": "sliding_window"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162764
- },
- "2531": {
- "problemId": "2531",
- "problemLevel": 10,
- "problemName": "회전 초밥",
- "average_try": 2.6239,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162786
- },
- "2118": {
- "problemId": "2118",
- "problemLevel": 10,
- "problemName": "두 개의 탑",
- "average_try": 2.5018,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162808
- },
- "20922": {
- "problemId": "20922",
- "problemLevel": 10,
- "problemName": "겹치는 건 싫어",
- "average_try": 3.1242,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162831
- },
- "2230": {
- "problemId": "2230",
- "problemLevel": 11,
- "problemName": "수 고르기",
- "average_try": 3.3632,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162853
- },
- "14921": {
- "problemId": "14921",
- "problemLevel": 11,
- "problemName": "용액 합성하기",
- "average_try": 2.6653,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162875
- },
- "9024": {
- "problemId": "9024",
- "problemLevel": 11,
- "problemName": "두 수의 합",
- "average_try": 2.2573,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162897
- },
- "1484": {
- "problemId": "1484",
- "problemLevel": 12,
- "problemName": "다이어트",
- "average_try": 2.8065,
- "solvedtags": [
- {
- "bojTagId": 124,
- "key": "math"
- },
- {
- "bojTagId": 95,
- "key": "number_theory"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.16292
- },
- "13422": {
- "problemId": "13422",
- "problemLevel": 12,
- "problemName": "도둑",
- "average_try": 3.4628,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162942
- },
- "15831": {
- "problemId": "15831",
- "problemLevel": 12,
- "problemName": "준표의 조약돌",
- "average_try": 3,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162964
- },
- "20366": {
- "problemId": "20366",
- "problemLevel": 13,
- "problemName": "같이 눈사람 만들래?",
- "average_try": 3.5,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.162987
- },
- "6137": {
- "problemId": "6137",
- "problemLevel": 12,
- "problemName": "문자열 생성",
- "average_try": 4.112,
- "solvedtags": [
- {
- "bojTagId": 33,
- "key": "greedy"
- },
- {
- "bojTagId": 158,
- "key": "string"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.163009
- },
- "3151": {
- "problemId": "3151",
- "problemLevel": 12,
- "problemName": "합이 0",
- "average_try": 4.9527,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 125,
- "key": "bruteforcing"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.163031
- },
- "20442": {
- "problemId": "20442",
- "problemLevel": 13,
- "problemName": "ㅋㅋ루ㅋㅋ",
- "average_try": 2.8981,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.163054
- },
- "21279": {
- "problemId": "21279",
- "problemLevel": 16,
- "problemName": "광부 호석",
- "average_try": 4.3182,
- "solvedtags": [
- {
- "bojTagId": 175,
- "key": "data_structures"
- },
- {
- "bojTagId": 59,
- "key": "priority_queue"
- },
- {
- "bojTagId": 65,
- "key": "segtree"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.163076
- },
- "2428": {
- "problemId": "2428",
- "problemLevel": 7,
- "problemName": "표절",
- "average_try": 3.5714,
- "solvedtags": [
- {
- "bojTagId": 12,
- "key": "binary_search"
- },
- {
- "bojTagId": 97,
- "key": "sorting"
- }
- ],
- "lastupdate": 1648236948.163098
- },
- "21921": {
- "problemId": "21921",
- "problemLevel": 8,
- "problemName": "블로그",
- "average_try": 2.4644,
- "solvedtags": [
- {
- "bojTagId": 139,
- "key": "prefix_sum"
- },
- {
- "bojTagId": 68,
- "key": "sliding_window"
- }
- ],
- "lastupdate": 1648236948.16312
- },
- "22862": {
- "problemId": "22862",
- "problemLevel": 10,
- "problemName": "가장 긴 짝수 연속한 부분 수열 (large)",
- "average_try": 2.3483,
- "solvedtags": [
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.163142
- },
- "22945": {
- "problemId": "22945",
- "problemLevel": 12,
- "problemName": "팀 빌딩",
- "average_try": 1.9724,
- "solvedtags": [
- {
- "bojTagId": 97,
- "key": "sorting"
- },
- {
- "bojTagId": 80,
- "key": "two_pointer"
- }
- ],
- "lastupdate": 1648236948.163164
- }
-}
\ No newline at end of file
diff --git a/scripts/make_contributor.py b/scripts/make_contributor.py
deleted file mode 100644
index 18e834b..0000000
--- a/scripts/make_contributor.py
+++ /dev/null
@@ -1,64 +0,0 @@
-import json
-import os
-
-data = dict()
-contributors = list()
-
-with open('./markdown/contributor.json', 'r') as f:
- data = json.load(f)
- contributors = data.get('id')
- f.close()
-
-LIST = list()
-LN = "\n"
-
-# Header
-LIST.append("## Contributors")
-LIST.append(LN)
-
-LIST.append("")
-
-idx = 0
-columns = 5
-SP = " "
-N = len(contributors)
-
-while idx < N:
- cur = contributors[idx:idx + columns]
-
- # TOP
- LIST.append(f"{SP}")
- for ID in cur:
- GITHUBID = data[ID]["githubid"]
- LIST.append(f"{SP}{SP}")
- LIST.append(f"{SP}{SP}{SP}")
- LIST.append(f"{SP}{SP}{SP} ")
- LIST.append(f"{SP}{SP}{SP}{ID}")
- LIST.append(f"{SP}{SP} | ")
- LIST.append(f"{SP}
")
-
- # BOTTOM
- LIST.append(f"{SP}")
- for ID in cur:
- baekjoon = data[ID]["baekjoon"]
- LIST.append(f"{SP}{SP}")
- if baekjoon == "$":
- LIST.append(f"{SP}{SP}{SP}PRIVATE")
- else:
- LIST.append(f"{SP}{SP}{SP}")
- LIST.append(f"{SP}{SP}{SP} ")
- LIST.append(f"{SP}{SP}{SP}Baekjoon")
- LIST.append(f"{SP}{SP}{SP} ")
- LIST.append(f"{SP}{SP}{SP}solved.ac")
- LIST.append(f"{SP}{SP} | ")
- LIST.append(f"{SP}
")
- idx = idx + columns
-
-LIST.append("
")
-LIST.append("\n")
-
-LIST = [ f"{_}\n" for _ in LIST ]
-
-with open('./markdown/contributors.md', 'w') as f:
- f.writelines(LIST)
- f.close()
diff --git a/scripts/make_main_readme.py b/scripts/make_main_readme.py
deleted file mode 100644
index cee6f6d..0000000
--- a/scripts/make_main_readme.py
+++ /dev/null
@@ -1,57 +0,0 @@
-import os
-import subprocess as sp
-
-seq = [ "header.md", "codingtest_info.md", "workbook_header.md", "workbook.md", "workbook_footer.md", "contributors.md", "updatelog.md", "TODO.md", "footer.md" ]
-
-EXCEPT_FOLDER = [ 'solution', '.git', 'solutions', '.github', '__pycache__', 'markdown', "scripts" ]
-
-def getCount(folder):
- lines = list()
- with open(f'./{folder}/list.md', 'r') as f:
- lines = f.readlines()
- f.close()
-
- total = 0
- cnt = 0
- for line in lines:
- S = line.split(",")[0]
- total += 1
- if S != '':
- cnt += 1
-
- return cnt, total
-
-def make_table(file="./markdown/list.md"):
- lines = list()
- with open(file, 'r') as f:
- lines = f.readlines()
- f.close()
-
- ret = "| 순번 | Tag | 태그 | 문제집 | 추천 문제 수 | 총 문제 수 | 상태 |\n"
- ret += "| :--: | :--------------------------: | :-----------------: | :------: | :---------: | :------: |:---------------:|\n"
- for idx, line in enumerate(lines):
- folder, tag_en, tag_kr, status = line.strip().split(',')
- rec_cnt, total = getCount(folder)
- curLine = f"| {idx:02d} | {tag_en} | {tag_kr} | [바로가기](./{folder}) | {rec_cnt:02d} | {total:02d} | ![status][{status}] |\n"
- ret += curLine
-
- ret += ' \n \n\n '
-
- with open('./markdown/workbook.md', 'w') as f:
- f.write(ret)
- f.close()
-
-def assemble():
- with open('./README.md', 'w') as f:
- f.close()
-
- for md in seq:
- os.system(f"cat ./markdown/{md} >> ./README.md")
-
-def make_contributors():
- os.system('python3 ./scripts/make_contributor.py')
-
-if __name__=="__main__":
- make_contributors()
- make_table()
- assemble()
diff --git a/scripts/make_table.py b/scripts/make_table.py
deleted file mode 100644
index f9f4ccd..0000000
--- a/scripts/make_table.py
+++ /dev/null
@@ -1,177 +0,0 @@
-from API import SolvedAPI
-import json
-
-def urlProblem(number, name):
- FORMAT = f"{name}"
- return FORMAT
-
-def urlSolution(link):
- if link == "":
- return ""
- FORMAT = f"바로가기"
- return FORMAT
-
-def urlLevel(level):
- url = f"https://static.solved.ac/tier_small/{level}.svg"
- ret = f""
- return ret
-
-class DataForm:
- def __init__(self):
- self.data = {
- "id" : "",
- "rec" : "",
- "problemId" : "",
- "name" : "",
- "level" : "",
- "url" : "",
- "average_try" : ""
- }
-
- def __lt__(self, other):
- if self.data['rec'] == other.getItem('rec'):
- LeftData = int( self.data['level'][73:][:-7])
- RightData = int(other.data['level'][73:][:-7])
- if LeftData == RightData:
- return self.data['average_try'] < other.data['average_try']
- else:
- return LeftData < RightData
-
- return self.data['rec'] != ''
-
- def __repr__(self):
- ID = self.data['id']
- REC = ":heavy_check_mark:" if self.data['rec'] != "" else " "
- PROBLEMID = self.data['problemId']
- NAME = self.data['name']
- LEVEL = self.data['level']
- URL = self.data['url']
- FORMATING = f"| {ID:02} | {REC:^20} | {PROBLEMID:^7} | {NAME:^20} | {LEVEL:^15} | {URL:^20} |"
- return FORMATING
-
- def format(self):
- return self.__repr__()
-
- def putItem(self, key, value):
- assert key in self.data.keys(), f"[*** Key Error] {key}"
- self.data[key] = value
-
- def getItem(self, key):
- assert key in self.data.keys(), f"[*** Key Error] {key}"
- return self.data[key]
-
-
-class Table:
- title = [ "순번", "추천 문제", "문제 번호", "문제 이름", "난이도", "풀이 링크" ]
- keys = [ "id", "rec", "problemId", "name", "level", "url" ]
-
- def __init__(self, api, config):
- self.config = config
- self.api = api
- self.data = list()
- self.Line = list()
-
- def __read(self, File):
-
- assert type(File) == str, f"[*** Type Error] File type is {type(File)}.\n It must be str"
-
- self.data = list()
- self.Line = list()
-
- with open(File, 'r') as f:
- self.data = [ _.strip() for _ in f.readlines() ]
- f.close()
-
- def __write(self, File):
-
- assert type(File) == str, f"[*** Type Error] File type is {type(File)}.\n It must be str"
-
- with open(File, 'w') as f:
- f.writelines([ f"{_}\n" for _ in self.data ])
- f.close()
-
- def __writeREADME(self, tag):
- READMEFile = f"./{tag}/README.md"
- HEADERFile = f"./{tag}/header.md"
-
- headerData = None
- # Read header
- with open(HEADERFile, 'r') as f:
- headerData = f.readlines()
- f.close()
-
- # Make New
- with open(READMEFile, 'w') as f:
- f.writelines(headerData)
- f.close()
-
- # Put Table
- TableFormat = list()
- A,B,C,D,E,F = self.title
- TableFormat.append(f"| {A:^20} | {B:^20} | {C:^20} | {D:^20} | {E:^20} | {F:^20} |\n")
- TableFormat.append(f"| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |\n")
- for line in self.Line:
- TableFormat.append(f"{line.format()}\n")
- with open(READMEFile, 'a+') as f:
- f.writelines(TableFormat)
- f.close()
-
- def makeForm(self, data, force=False):
- # data -> rec, problemId, solution link
- ret = dict()
- recommend = data[0]
- problemId = data[1]
- solutionLink = data[2]
- problemInfo = dict()
- if force:
- problemInfo = self.api.requestForce(problemId)
- else:
- problemInfo = self.api.request(problemId)
- problemName = problemInfo.get('problemName')
- problemLevel = problemInfo.get('problemLevel')
-
- ret[self.keys[1]] = data[0]
- ret[self.keys[2]] = urlProblem(problemId, problemId)
- ret[self.keys[3]] = urlProblem(problemId, problemName)
- ret[self.keys[4]] = urlLevel(problemLevel)
- ret[self.keys[5]] = urlSolution(solutionLink)
-
- return ret
-
- def sort(self):
- self.Line = sorted(self.Line)
- N = len(self.data)
- for i in range(N):
- self.Line[i].putItem("id", i)
-
- def putLine(self, data):
-
- assert type(data) == dict, f"[*** Type Error] data type is {type(data)}.\n It must be dict"
-
- newData = DataForm()
- for k, v in data.items():
- newData.putItem(k, v)
- self.Line.append(newData)
-
- def run(self, force=False):
-
- for tag in self.config.get('tags'):
- self.__read( f"./{tag}/list.md")
- for data in self.data:
- splitData = list(map(str, data.strip().split(',')))
- form = self.makeForm(splitData, force)
- self.putLine(form)
-
- self.sort()
- self.__writeREADME(tag)
- self.__write(f"{tag}/list.md")
-
-if __name__ == "__main__":
- config = dict()
- with open('./scripts/config.json', 'r') as f:
- config = json.load(f)
- f.close()
-
- api = SolvedAPI(config.get('API'))
- table = Table(api, config)
- table.run()
diff --git a/scripts/pick.problem b/scripts/pick.problem
deleted file mode 100755
index ba808b3..0000000
Binary files a/scripts/pick.problem and /dev/null differ
diff --git a/scripts/pick_data.in b/scripts/pick_data.in
deleted file mode 100644
index 319dd21..0000000
--- a/scripts/pick_data.in
+++ /dev/null
@@ -1,879 +0,0 @@
-1038$11
-1062$12
-1166$8
-1174$11
-1182$9
-1189$10
-1248$13
-1342$10
-1405$11
-1497$10
-1553$10
-1654$8
-1729$15
-1759$11
-1789$6
-1799$15
-1920$7
-1941$13
-1987$12
-2023$11
-2026$13
-2239$12
-2417$7
-2512$8
-2529$9
-2580$12
-2661$12
-2792$9
-2805$8
-2922$11
-3165$14
-3980$11
-6236$9
-6443$11
-6603$9
-6987$11
-7682$11
-7795$8
-9663$11
-10421$11
-10597$10
-10815$7
-10816$7
-10971$9
-10974$8
-11561$8
-11663$8
-12908$12
-13908$10
-14627$8
-14712$10
-14888$10
-14889$9
-15566$10
-15649$8
-15650$8
-15651$8
-15652$8
-15654$8
-15655$8
-15656$8
-15657$8
-15658$9
-15659$13
-15663$9
-15664$9
-15665$9
-15666$9
-15684$12
-15810$9
-15918$12
-16198$10
-16401$8
-16922$8
-16938$11
-16987$10
-17124$8
-17136$14
-17266$7
-17393$8
-17451$8
-17503$9
-18113$9
-18290$10
-18429$8
-18430$11
-19637$8
-19699$9
-19942$11
-20208$11
-20551$7
-20950$9
-1018$6
-1025$11
-1059$6
-1065$7
-1120$7
-1145$5
-1251$6
-1254$10
-1300$14
-1359$7
-1411$9
-1421$9
-1436$6
-1477$12
-1487$7
-1503$8
-1527$10
-1543$7
-1548$11
-1561$14
-1668$4
-1895$7
-1939$12
-1969$6
-2022$10
-2110$11
-2121$8
-2143$13
-2160$5
-2231$4
-2309$4
-2343$10
-2412$13
-2422$6
-2435$6
-2503$7
-2613$14
-2635$6
-2798$4
-2866$11
-2961$9
-3020$11
-3040$4
-3079$11
-3085$8
-4096$5
-5568$7
-5671$6
-5883$7
-7568$6
-9007$13
-9079$7
-9996$8
-11502$7
-11687$11
-12757$13
-13397$12
-13410$4
-14575$10
-14620$9
-14697$4
-14912$6
-15661$10
-15728$8
-15823$14
-15970$7
-16434$12
-16439$8
-16508$8
-16564$10
-16937$7
-16943$10
-16951$7
-16960$7
-17179$10
-17484$7
-17610$10
-17951$12
-18312$4
-18511$6
-18868$5
-19532$4
-19947$6
-19949$8
-20444$11
-20495$10
-1010$6
-1021$7
-1030$13
-1034$11
-1043$12
-1074$10
-1107$11
-1158$7
-1269$8
-1302$7
-1493$12
-1581$12
-1655$14
-1711$10
-1717$12
-1780$9
-1802$9
-1863$11
-1874$8
-1918$13
-1927$9
-1935$8
-1966$8
-1976$12
-1992$10
-2075$11
-2164$7
-2304$9
-2346$8
-2374$12
-2447$10
-2448$12
-2493$11
-2504$9
-2630$8
-2748$5
-2776$7
-2800$11
-2839$5
-3986$7
-4195$14
-4779$8
-4949$7
-5397$8
-5904$10
-7511$11
-7662$11
-9012$7
-9375$8
-9655$6
-10546$7
-10775$14
-10799$8
-10828$7
-10845$7
-10866$7
-10870$4
-11085$13
-11279$9
-11286$10
-12764$13
-12893$12
-14500$11
-14595$14
-14600$11
-15686$11
-15789$12
-16168$12
-16438$13
-16562$13
-16637$13
-16724$14
-16986$13
-17085$11
-17352$11
-17471$12
-17626$7
-17829$9
-18115$8
-18116$12
-18222$9
-20040$12
-21278$11
-21315$11
-21939$12
-21943$14
-21944$13
-22866$12
-22942$12
-22944$13
-22947$14
-1003$8
-1106$10
-1149$10
-1309$10
-1463$8
-1495$10
-1535$9
-1633$10
-1660$9
-1699$8
-1890$9
-1912$9
-1915$12
-1932$10
-1965$9
-2011$11
-2156$10
-2193$8
-2225$11
-2228$12
-2293$11
-2294$10
-2302$10
-2407$8
-2491$7
-2565$11
-2579$8
-2624$11
-2629$13
-2631$11
-2670$7
-2688$11
-2876$9
-3067$11
-4811$11
-5557$11
-5582$11
-7579$13
-9084$11
-9095$8
-9251$11
-9461$8
-9465$10
-10164$10
-10211$8
-10844$10
-11048$10
-11051$10
-11052$10
-11053$9
-11055$9
-11057$10
-11060$9
-11568$9
-11722$9
-11726$8
-11727$8
-12026$10
-12101$10
-12865$11
-13302$11
-13398$11
-13699$7
-13910$10
-14430$9
-14501$8
-14722$12
-14728$11
-14852$11
-15486$10
-15489$6
-15624$7
-15988$9
-15989$10
-15990$9
-15991$10
-15992$10
-15993$10
-16194$10
-16195$10
-17069$11
-17070$11
-17175$8
-17208$12
-17212$8
-17291$9
-17845$11
-18353$9
-18427$12
-19622$9
-19645$15
-20152$9
-20162$9
-20667$15
-22857$8
-22869$10
-22871$10
-1012$9
-1135$15
-1260$9
-1301$12
-1303$10
-1325$10
-1520$12
-1577$12
-1600$12
-1695$12
-1697$10
-1727$13
-1743$10
-1757$12
-1823$13
-1926$10
-1937$13
-1943$13
-1958$13
-2073$12
-2157$12
-2178$10
-2229$11
-2253$12
-2411$12
-2583$10
-2589$11
-2602$12
-2606$8
-2616$12
-2636$11
-2644$9
-2667$10
-2758$12
-3055$12
-3184$9
-3187$9
-3687$14
-5014$11
-5569$12
-5624$12
-6118$10
-7569$11
-7576$11
-9019$12
-10026$11
-10653$12
-10942$13
-11049$13
-11054$13
-11066$13
-11123$10
-11559$12
-11724$9
-11909$11
-11985$11
-12015$14
-13565$9
-13902$12
-14502$11
-14699$11
-14716$10
-14863$12
-14925$12
-14940$11
-14945$12
-15558$10
-15724$10
-16174$10
-16928$11
-16948$10
-16954$12
-17086$9
-17129$11
-17141$12
-17216$10
-17255$12
-17265$11
-17404$12
-17485$11
-18232$9
-18404$10
-18405$10
-20542$13
-1080$10
-1082$12
-1092$11
-1343$6
-1374$11
-1439$6
-1449$8
-1474$10
-1541$9
-1707$12
-1715$12
-1726$13
-1744$12
-1758$7
-1817$6
-1931$9
-1946$10
-2109$13
-2138$10
-2141$12
-2146$13
-2151$12
-2194$11
-2206$12
-2212$11
-2217$7
-2234$12
-2285$12
-2457$13
-2573$12
-2638$12
-2665$12
-2668$11
-2812$12
-2847$7
-4179$12
-5427$12
-6068$11
-8980$13
-9466$13
-10711$13
-11000$11
-11047$8
-11256$6
-11399$8
-11508$7
-11509$11
-12782$7
-12931$12
-13023$11
-13164$11
-13305$7
-13413$7
-13913$12
-13975$12
-14247$8
-14400$9
-14442$13
-14916$6
-14923$12
-16162$7
-16206$10
-16208$6
-16432$11
-16435$6
-16932$12
-16947$13
-16953$10
-16956$8
-16985$13
-16988$13
-17142$12
-17521$6
-17615$10
-17616$13
-18234$12
-18513$11
-19598$11
-19939$6
-20115$8
-20117$10
-20300$8
-20365$9
-21313$4
-21758$10
-21937$10
-22868$13
-22946$14
-22948$14
-22949$15
-1022$12
-1045$15
-1110$5
-1188$11
-1197$12
-1244$8
-1283$9
-1368$14
-1414$13
-1456$10
-1647$12
-1669$10
-1774$13
-1913$7
-1934$6
-1944$14
-1978$7
-1990$11
-2167$5
-2168$10
-2406$13
-2436$11
-2469$10
-2553$9
-2578$6
-2581$6
-2609$6
-2615$9
-2729$6
-2745$4
-2824$11
-2877$10
-2960$7
-3343$11
-4386$12
-5347$7
-5766$7
-6497$12
-9081$10
-9421$10
-9613$8
-10703$8
-10994$7
-11441$8
-13418$13
-13905$12
-14467$6
-14621$13
-14719$11
-14950$13
-15787$9
-15806$15
-15886$9
-16139$9
-16202$12
-16398$12
-16719$11
-16926$10
-16927$11
-16935$10
-17128$9
-17276$9
-17390$8
-17406$12
-17472$15
-17490$14
-18311$6
-18769$12
-20116$8
-20164$11
-20207$10
-20327$13
-20546$5
-21275$8
-21277$13
-21312$3
-21608$10
-21611$15
-21919$8
-21920$7
-21924$12
-22858$8
-22859$13
-22860$13
-22864$3
-22943$10
-1058$9
-1219$15
-1238$13
-1261$12
-1277$12
-1389$10
-1445$14
-1446$10
-1504$12
-1507$13
-1613$13
-1713$9
-1719$12
-1749$12
-1753$11
-1865$13
-1916$11
-1956$12
-2015$11
-2211$14
-2224$11
-2307$14
-2458$12
-2571$13
-2660$11
-2900$13
-2982$14
-3190$11
-3673$13
-4485$12
-5549$12
-5972$11
-9205$10
-9370$14
-10159$13
-10427$11
-10713$11
-10986$13
-11265$10
-11403$10
-11562$12
-11657$12
-11660$10
-11779$13
-11780$14
-13424$12
-13549$11
-13911$14
-14284$11
-14476$14
-14503$11
-14594$8
-14891$11
-14938$12
-15683$12
-15685$12
-15723$11
-16118$15
-16235$12
-16236$13
-16507$10
-17123$9
-17135$12
-17140$12
-17144$12
-17396$11
-17779$12
-18223$12
-18243$9
-18352$9
-18866$11
-19238$13
-19951$11
-20002$11
-20007$12
-20055$11
-20056$12
-20159$11
-20165$11
-20168$11
-20182$13
-20183$15
-20436$7
-20438$9
-20440$12
-20543$14
-20665$11
-21757$13
-21940$12
-1005$13
-1032$5
-1152$4
-1159$4
-1181$6
-1213$7
-1259$5
-1316$6
-1516$13
-1620$7
-1622$7
-1718$4
-1764$7
-1766$14
-1942$4
-1972$8
-2056$12
-2115$11
-2204$6
-2252$13
-2623$14
-2671$11
-2744$4
-2852$7
-2933$14
-2941$6
-3613$7
-4396$6
-4446$6
-4659$6
-4836$7
-6550$6
-6996$5
-9242$6
-9342$7
-9470$13
-9536$7
-9548$20
-9933$5
-10798$5
-10808$4
-10809$4
-10988$5
-11365$4
-11478$8
-11655$5
-11656$7
-11720$4
-12871$6
-12933$7
-13459$14
-14405$6
-14567$11
-15644$15
-15653$15
-16171$6
-16890$13
-16916$13
-16939$14
-17143$14
-17413$8
-17609$10
-17780$14
-17822$13
-17837$14
-18500$14
-19237$13
-19583$9
-19844$7
-19948$8
-20057$13
-20058$12
-20061$14
-20114$6
-20154$5
-20210$14
-20291$8
-20437$11
-21609$14
-21610$11
-21942$14
-22861$14
-1068$11
-1167$13
-1240$11
-1484$12
-1595$13
-1644$13
-1806$12
-1940$7
-1949$14
-1967$12
-1991$10
-2003$8
-2018$6
-2058$13
-2118$10
-2213$15
-2230$11
-2233$15
-2250$14
-2263$14
-2428$7
-2467$11
-2470$11
-2473$12
-2531$10
-2533$13
-2559$8
-2637$14
-3151$12
-3273$8
-3584$12
-3665$15
-4256$13
-4358$10
-4803$12
-4933$13
-5639$11
-6137$12
-6159$7
-6416$11
-7453$14
-9024$11
-9372$8
-9489$12
-9934$10
-10025$7
-11437$13
-11659$8
-11725$9
-11728$6
-12896$13
-12978$13
-13422$12
-14425$8
-14657$14
-14675$11
-14725$14
-14921$11
-15565$10
-15681$11
-15831$12
-15900$10
-15961$12
-16472$12
-17073$11
-19535$13
-19542$12
-19581$15
-19641$11
-20119$15
-20166$11
-20181$14
-20364$9
-20366$13
-20442$13
-20924$12
-20955$12
-21276$13
-21279$16
-21921$8
-22862$10
-22945$12
diff --git a/scripts/pick_problem.cpp b/scripts/pick_problem.cpp
deleted file mode 100644
index 6168809..0000000
--- a/scripts/pick_problem.cpp
+++ /dev/null
@@ -1,173 +0,0 @@
-/****************************************************************************************************************************/
-/************************************* My Template Begin *************************************/
-/************************************* *************************************/
-/************************************* Template Version : 2.0.0 *************************************/
-/************************************* Made By : tony9402(Minsang Kim) *************************************/
-/****************************************************************************************************************************/
-#ifndef LOCAL
-#pragma GCC optimize("O3")
-#pragma GCC optimize("Ofast")
-#pragma GCC optimize("unroll-loops")
-#endif
-
-#include
-
-using namespace std;
-
-/******** #define BEGIN ********/
-#define all(x) (x).begin(),(x).end()
-#define sortall(x) sort(all(x))
-#define reverseall(x) reverse(all(x))
-#define siz(x) (int)(x).size()
-#define rep(i, n) for(int i=0;i<(n);i++)
-#define repi(i, l, r) for(int i=l;i<=(r);i++)
-#define rrep(i, n) for(int i=(n)-1;i>=0;i--)
-#define rrepi(i, r, l) for(int i=r;i>=l;i--)
-#define pb push_back
-#define pf push_front
-#define eb emplace_back
-#define ef emplace_front
-#define ppb pop_back
-#define ppf pop_front
-#define fi first
-#define se second
-/******** #define END ********/
-
-/******** type define BEGIN ********/
-using ull = unsigned long long;
-using ll = long long;
-using ld = long double;
-using pii = pair;
-using pll = pair;
-using pil = pair;
-using pli = pair;
-using vi = vector;
-using vd = vector;
-using vl = vector;
-using vii = vector;
-using vll = vector;
-/******** type define END ********/
-
-/******** const BEGIN ********/
-constexpr char ln = '\n';
-constexpr char sp = ' ';
-constexpr ld PI = 3.141592653589793238462643383279502884197169399375105820974944;
-// 0 ~ 3 -> UDLR, 4 ~ 7 -> (diag)UDLR, 8 ~ 15 -> knight
-constexpr int dy[] = {-1,1,0,0,-1,-1,1,1,-2,-1,1,2,2,1,-1,-2};
-constexpr int dx[] = {0,0,-1,1,-1,1,-1,1,1,2,2,1,-1,-2,-2,-1};
-/******** const END ********/
-
-/******** DEBUG TEMPLATE BEGIN ********/
-#ifdef LOCAL
-void _DEBUG_S(string _s="") { cerr << "\n[------- " << _s << " ---------]\n"; }
-template void _DEBUG(Type arg) { cerr << arg; }
-template void _DEBUG(Type arg, Types ...args) { cerr << arg << ", ", _DEBUG(args...); }
-#define debug(...) cerr << "[ " << #__VA_ARGS__ << " ] : ", _DEBUG(__VA_ARGS__)
-#define debug2(...) _DEBUG_S("DEBUG BEGIN") debug(__VA_ARGS__) _DEBUG_S("DEBUG END")
-
-#else
-#define debug(...)
-#define debug2(...)
-#endif
-/******** DEBUG TEMPLATE END ********/
-
-/******** I/O TEMPLATE BEGIN ********/
-template struct fastio{ fastio(){
-#ifndef LOCAL
- if(fp>=0) { ios::sync_with_stdio(false); cin.tie(0); }
-#endif
- if(fp>0)cout << fixed << setprecision(fp);
-} };
-
-template void input(Type &arg){cin >> arg;}
-template void input(Type &arg, Types &...args){cin>>arg;input(args...);}
-template void output(Type arg){cout< void output(Type arg, Types ...args){cout< inline istream& operator>>(istream &in, pair &_p) { in >> _p.first >> _p.second; return in; }
-template inline ostream& operator<<(ostream &out, const pair &_p) { out << _p.first << ' ' << _p.second; return out; }
-template inline ostream& operator<<(ostream &out, const vector &v) { for(auto &i: v) out< inline istream& operator>>(istream &in, vector &v) { for(auto &i: v) in>>i; return in; }
-template inline ostream& operator<<(ostream &out, const deque &v) { for(auto &i: v) out< inline istream& operator>>(istream &in, deque &v) { for(auto &i: v) in>>i; return in; }
-/******** I/O TEMPLATE END ********/
-
-template
-T power(T a, T b, T mod=numeric_limits::max()){
- if(b == 0)return 1;
- if(b % 2)return a * power(a, b-1, mod) % mod;
- return power(a * a % mod, b >> 1, mod);
-}
-ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
-ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
-ll extgcd(ll a, ll b, ll &x, ll &y){
- if(b) {
- ll d = extgcd(b, a % b, y, x);
- return y -= a / b * x, d;
- }
- return x = 1, y = 0, a;
-}
-/****************************************************************************************************************************/
-/************************************* My Template End *************************************/
-/****************************************************************************************************************************/
-
-#include
-long getSeed() {
- struct timeval tick;
- gettimeofday(&tick, 0);
- return tick.tv_usec;
-}
-
-int gen(int mn, int mx){
- assert(mn <= mx);
- return rand() % (mx - mn + 1) + mn;
-}
-
-string gen(int len){
- string ret = "";
- while(len--){
- ret += (char)('a' + gen(0, 25));
- }
- return ret;
-}
-
-set> problems;
-
-int main(){
- fastio<>();
-
- srand(getSeed());
- string s;
- int mx = 0;
- while(cin >> s){
- // 1 ~ 15
- auto it = s.find("$", 0);
- int number = stoi(s.substr(0, it));
- int level = stoi(s.substr(it + 1));
- mx = max(mx, number);
- if(1 <= level && level <= 15) problems.emplace(level, number);
- }
-
- // 1 ~ 8 1
- // 9 ~ 12 2
- // 13 ~ 15 1
-
- vector> L;
- L.emplace_back( 1, 8); // B5 ~ S3
- L.emplace_back( 9, 12); // S2 ~ G4
- L.emplace_back( 9, 12); // S2 ~ G4
- L.emplace_back(13, 15); // G3 ~ G1
-
- vector> output;
- for(auto &[l, r]: L){
- int level = gen(l, r);
- int problem = gen(1000, mx);
- auto it = problems.lower_bound(make_pair(level, problem));
- if(it->first != level && it != problems.begin()) it--;
- output.emplace_back(it->first, it->second);
- problems.erase(it);
- }
- sortall(output);
- for(auto &i: output) cout << i.second << '\n';
-
- return 0;
-}
diff --git a/scripts/pick_problem.py b/scripts/pick_problem.py
deleted file mode 100644
index 3bcaa1d..0000000
--- a/scripts/pick_problem.py
+++ /dev/null
@@ -1,135 +0,0 @@
-from API import SolvedAPI
-import json
-import subprocess as sp
-import os
-import datetime
-import pytz
-
-def reset():
- database = dict()
- with open('./scripts/database.json', 'r') as f:
- database = json.load(f)
- f.close()
-
- pick_data = list()
- for key, data in database.items():
- if 1 <= data.get('problemLevel') <= 15:
- line = f"{key}${data.get('problemLevel')}\n"
- pick_data.append(line)
-
- with open('./scripts/pick_data.in', 'w') as f:
- f.writelines(pick_data)
- f.close()
-
- return pick_data
-
-def update():
- data = None
- with open('./scripts/pick_data.in', 'r') as f:
- data = f.readlines()
- f.close()
-
- if len(data) <= 30:
- data = reset()
-
- problem_database = None
- with open('./scripts/database.json', 'r') as f:
- problem_database = json.load(f)
- f.close()
-
- newdata = list()
- for line in data:
- problemId, problemLevel = line.split('$')
- problemInfo = api.request(problemId)
- problemLevel = problemInfo["problemLevel"]
- newdata.append(f"{problemId}${problemLevel}\n")
-
- with open('./scripts/pick_data.in', 'w') as f:
- f.writelines(newdata)
- f.close()
-
-def make_table():
- data = dict()
- with open('./scripts/picked.json', 'r') as f:
- data = json.load(f)
- f.close()
-
- saveline = []
- keys = data.keys()
- for key in keys:
- saveline.append(f"## {key} \n")
- saveline.append('\n')
- saveline.append("| 난이도 | 번호 | 문제 이름 |\n")
- saveline.append("|:------:|:----:|:---------:|\n")
- for problem in data[key]:
- problemInfo = api.request(problem)
- problemName = problemInfo.get('problemName')
- problemLevel = problemInfo.get('problemLevel')
- imageurl = f""
- line = f"| {imageurl} | [{problem}](https://www.acmicpc.net/problem/{problem}) | [{problemName}](https://www.acmicpc.net/problem/{problem}) |\n"
- saveline.append(line)
-
- saveline.append('\n')
-
- with open('./picked.md', 'w') as f:
- f.writelines(saveline)
- f.close()
-
-def pick():
- os.system('g++ -std=c++17 ./scripts/pick_problem.cpp -o ./scripts/pick.problem')
-
- data = None
- with open('./scripts/pick_data.in', 'r') as f:
- data = f.readlines()
- f.close()
-
- os.system('./scripts/pick.problem < ./scripts/pick_data.in > ./scripts/today_problem.out')
- with open("./scripts/today_problem.out", "r") as f:
- ret = [ _.strip() + '$' for _ in f.readlines() ]
- f.close()
-
- remain = list()
- picked = list()
- for v in ret:
- for idx, line in enumerate(data):
- if line.startswith(v):
- picked.append(line)
- del data[idx]
- break
-
- remain = data
-
- picked_json = dict()
- with open('./scripts/picked.json', 'r') as f:
- picked_json = json.load(f)
- f.close()
-
- timeformat = datetime.datetime.now(pytz.timezone('Asia/Seoul'))
- timeformat = f"{timeformat.strftime('%Y/%m/%d')}"
- new_data = dict()
- new_data[timeformat] = list()
- for problem in picked:
- problemId, problemLevel = problem.strip().split('$')
- new_data[timeformat].append(problemId)
-
- new_data.update(picked_json)
-
- with open('./scripts/picked.json', 'w') as f:
- f.write(json.dumps(new_data, indent=4, ensure_ascii=False))
- f.close()
-
- with open('./scripts/pick_data.in', 'w') as f:
- f.writelines(remain)
- f.close()
-
-if __name__ == "__main__":
- config = None
- with open('./scripts/config.json', 'r') as f:
- config = json.load(f)
- f.close()
-
- api = SolvedAPI(config.get("API"))
-
- update()
- pick()
- make_table()
diff --git a/scripts/picked.json b/scripts/picked.json
deleted file mode 100644
index 306949e..0000000
--- a/scripts/picked.json
+++ /dev/null
@@ -1,1520 +0,0 @@
-{
- "2022/03/26": [
- "11653",
- "13022",
- "8983",
- "14391"
- ],
- "2022/03/25": [
- "20944",
- "10819",
- "21317",
- "16437"
- ],
- "2021/12/29": [
- "10448",
- "16918",
- "16400",
- "17398"
- ],
- "2021/12/28": [
- "5534",
- "7562",
- "1469",
- "16571"
- ],
- "2021/12/27": [
- "13702",
- "10472",
- "3107",
- "14601"
- ],
- "2021/12/26": [
- "18512",
- "14496",
- "21314",
- "18808"
- ],
- "2021/12/25": [
- "9094",
- "5430",
- "14226",
- "17090"
- ],
- "2021/12/24": [
- "21756",
- "11404",
- "16973",
- "20010"
- ],
- "2021/12/23": [
- "5618",
- "21922",
- "6087",
- "18809"
- ],
- "2021/12/22": [
- "4690",
- "3005",
- "20922",
- "14570"
- ],
- "2021/12/21": [
- "3029",
- "5567",
- "14676",
- "13460"
- ],
- "2021/12/20": [
- "18258",
- "17836",
- "22865",
- "12912"
- ],
- "2021/12/19": [
- "14929",
- "12919",
- "10282",
- "4315"
- ],
- "2021/12/18": [
- "1864",
- "14267",
- "22856",
- "9944"
- ],
- "2021/12/17": [
- "21918",
- "1455",
- "4097",
- "2696"
- ],
- "2021/12/16": [
- "20053",
- "5212",
- "18114",
- "16971"
- ],
- "2021/12/15": [
- "1072",
- "4095",
- "16234",
- "10423"
- ],
- "2021/12/14": [
- "15270",
- "4963",
- "5547",
- "6209"
- ],
- "2021/12/13": [
- "15779",
- "21318",
- "14499",
- "15732"
- ],
- "2021/12/12": [
- "5597",
- "19539",
- "12851",
- "21925"
- ],
- "2021/12/11": [
- "11170",
- "5052",
- "21923",
- "19566"
- ],
- "2021/12/10": [
- "1212",
- "12761",
- "15927",
- "3108"
- ],
- "2021/12/09": [
- "2753",
- "14225",
- "1922",
- "8972"
- ],
- "2021/12/08": [
- "4134",
- "13019",
- "1747",
- "5875"
- ],
- "2021/12/07": [
- "9046",
- "7490",
- "13707",
- "2887"
- ],
- "2021/12/06": [
- "15721",
- "14248",
- "21938",
- "19236"
- ],
- "2021/12/05": [
- "2193",
- "1527",
- "1548",
- "1553"
- ],
- "2021/12/04": [
- "2121",
- "11727",
- "1669",
- "1743"
- ],
- "2021/12/03": [
- "2003",
- "14889",
- "1927",
- "1932"
- ],
- "2021/12/02": [
- "1972",
- "1946",
- "1991",
- "1992"
- ],
- "2021/12/01": [
- "1966",
- "2011",
- "2022",
- "2110"
- ],
- "2021/11/30": [
- "1935",
- "15624",
- "2118",
- "2156"
- ],
- "2021/11/29": [
- "2346",
- "15649",
- "2168",
- "2178"
- ],
- "2021/11/28": [
- "1874",
- "15650",
- "15651",
- "2294"
- ],
- "2021/11/27": [
- "1699",
- "2302",
- "2343",
- "2531"
- ],
- "2021/11/26": [
- "1654",
- "2553",
- "1025",
- "1034"
- ],
- "2021/11/25": [
- "1503",
- "15652",
- "2565",
- "1038"
- ],
- "2021/11/24": [
- "1487",
- "2583",
- "1068",
- "1092"
- ],
- "2021/11/23": [
- "1463",
- "15654",
- "3005",
- "1107"
- ],
- "2021/11/22": [
- "1283",
- "2667",
- "1188",
- "1405"
- ],
- "2021/11/21": [
- "1166",
- "15655",
- "15656",
- "1759"
- ],
- "2021/11/20": [
- "1072",
- "15657",
- "1916",
- "2023"
- ],
- "2021/11/19": [
- "1003",
- "15728",
- "16508",
- "2073"
- ],
- "2021/11/18": [
- "20436",
- "20291",
- "2075",
- "2194"
- ],
- "2021/11/17": [
- "19844",
- "2212",
- "2225",
- "2228"
- ],
- "2021/11/16": [
- "11561",
- "16922",
- "2229",
- "2230"
- ],
- "2021/11/15": [
- "17626",
- "16956",
- "3079",
- "2436"
- ],
- "2021/11/14": [
- "11502",
- "17124",
- "20116",
- "2467"
- ],
- "2021/11/13": [
- "16960",
- "17615",
- "2470",
- "2493"
- ],
- "2021/11/12": [
- "15270",
- "2589",
- "2624",
- "2631"
- ],
- "2021/11/11": [
- "16951",
- "2636",
- "2660",
- "2668"
- ],
- "2021/11/10": [
- "16439",
- "17175",
- "17276",
- "2671"
- ],
- "2021/11/09": [
- "2792",
- "18404",
- "2688",
- "2866"
- ],
- "2021/11/08": [
- "16162",
- "17216",
- "1022",
- "1043"
- ],
- "2021/11/07": [
- "15970",
- "1062",
- "1082",
- "1197"
- ],
- "2021/11/06": [
- "13413",
- "17212",
- "1990",
- "1261"
- ],
- "2021/11/05": [
- "11508",
- "18222",
- "17085",
- "1277"
- ],
- "2021/11/04": [
- "10866",
- "2824",
- "3067",
- "1301"
- ],
- "2021/11/03": [
- "10845",
- "16987",
- "3107",
- "1477"
- ],
- "2021/11/02": [
- "10828",
- "16953",
- "3190",
- "1484"
- ],
- "2021/11/01": [
- "6159",
- "16948",
- "1493",
- "1504"
- ],
- "2021/10/31": [
- "5883",
- "17390",
- "21315",
- "1520"
- ],
- "2021/10/30": [
- "3986",
- "17393",
- "1577",
- "1647"
- ],
- "2021/10/29": [
- "3085",
- "1695",
- "1707",
- "1711"
- ],
- "2021/10/28": [
- "9461",
- "16943",
- "18405",
- "1715"
- ],
- "2021/10/27": [
- "10816",
- "16928",
- "20665",
- "1717"
- ],
- "2021/10/26": [
- "2960",
- "1719",
- "1726",
- "1744"
- ],
- "2021/10/25": [
- "16937",
- "1058",
- "20444",
- "1749"
- ],
- "2021/10/24": [
- "10994",
- "16918",
- "1757",
- "1774"
- ],
- "2021/10/23": [
- "2852",
- "16564",
- "1806",
- "1915"
- ],
- "2021/10/22": [
- "12933",
- "17413",
- "20437",
- "1922"
- ],
- "2021/10/21": [
- "2847",
- "20208",
- "1939",
- "1956"
- ],
- "2021/10/20": [
- "2776",
- "17451",
- "1967",
- "1976"
- ],
- "2021/10/19": [
- "2729",
- "2469",
- "20168",
- "1987"
- ],
- "2021/10/18": [
- "2670",
- "20165",
- "20166",
- "2056"
- ],
- "2021/10/17": [
- "2217",
- "18115",
- "2115",
- "2151"
- ],
- "2021/10/16": [
- "2164",
- "18429",
- "1374",
- "2157"
- ],
- "2021/10/15": [
- "1978",
- "16507",
- "18430",
- "2206"
- ],
- "2021/10/14": [
- "16401",
- "19948",
- "20164",
- "2234"
- ],
- "2021/10/13": [
- "1940",
- "19949",
- "1697",
- "2239"
- ],
- "2021/10/12": [
- "1920",
- "1012",
- "21317",
- "2253"
- ],
- "2021/10/11": [
- "20551",
- "1080",
- "2285",
- "2374"
- ],
- "2021/10/10": [
- "10815",
- "1106",
- "17485",
- "2411"
- ],
- "2021/10/09": [
- "9536",
- "1411",
- "1421",
- "2448"
- ],
- "2021/10/08": [
- "1895",
- "16198",
- "2457",
- "2458"
- ],
- "2021/10/07": [
- "1817",
- "2812",
- "2473",
- "2573"
- ],
- "2021/10/06": [
- "1764",
- "2800",
- "2580",
- "2602"
- ],
- "2021/10/05": [
- "14501",
- "20117",
- "2616",
- "2638"
- ],
- "2021/10/04": [
- "1758",
- "1455",
- "1600",
- "2661"
- ],
- "2021/10/03": [
- "1302",
- "1535",
- "2665",
- "2758"
- ],
- "2021/10/02": [
- "1244",
- "1541",
- "17471",
- "2922"
- ],
- "2021/10/01": [
- "1213",
- "16927",
- "3055",
- "1005"
- ],
- "2021/09/30": [
- "5766",
- "1713",
- "17144",
- "1030"
- ],
- "2021/09/29": [
- "1120",
- "20055",
- "17142",
- "1167"
- ],
- "2021/09/28": [
- "1065",
- "17352",
- "17396",
- "1238"
- ],
- "2021/09/27": [
- "1021",
- "16195",
- "19951",
- "1248"
- ],
- "2021/09/26": [
- "19939",
- "1660",
- "17140",
- "1516"
- ],
- "2021/09/25": [
- "17521",
- "17265",
- "17135",
- "1581"
- ],
- "2021/09/24": [
- "3273",
- "1780",
- "1753",
- "1595"
- ],
- "2021/09/23": [
- "17484",
- "1890",
- "17255",
- "1613"
- ],
- "2021/09/22": [
- "9548",
- "15993",
- "20159",
- "1727"
- ],
- "2021/09/21": [
- "1622",
- "1912",
- "17141",
- "1823"
- ],
- "2021/09/20": [
- "5347",
- "18290",
- "16938",
- "1865"
- ],
- "2021/09/19": [
- "17266",
- "21318",
- "17129",
- "1918"
- ],
- "2021/09/18": [
- "9375",
- "1931",
- "16932",
- "1937"
- ],
- "2021/09/17": [
- "16435",
- "17179",
- "17073",
- "1941"
- ],
- "2021/09/16": [
- "16208",
- "5582",
- "16236",
- "1943"
- ],
- "2021/09/15": [
- "14467",
- "17070",
- "17208",
- "1958"
- ],
- "2021/09/14": [
- "12871",
- "17406",
- "18427",
- "2109"
- ],
- "2021/09/13": [
- "12782",
- "17069",
- "20056",
- "2026"
- ],
- "2021/09/12": [
- "11728",
- "1965",
- "2138",
- "2143"
- ],
- "2021/09/11": [
- "11256",
- "2504",
- "15992",
- "2058"
- ],
- "2021/09/10": [
- "9655",
- "16235",
- "20040",
- "2146"
- ],
- "2021/09/09": [
- "5671",
- "21314",
- "19542",
- "2263"
- ],
- "2021/09/08": [
- "5568",
- "15990",
- "16202",
- "1507"
- ],
- "2021/09/07": [
- "14405",
- "15991",
- "5569",
- "2406"
- ],
- "2021/09/06": [
- "14916",
- "1633",
- "16973",
- "2412"
- ],
- "2021/09/05": [
- "5534",
- "2529",
- "16168",
- "2533"
- ],
- "2021/09/04": [
- "4396",
- "1325",
- "2644",
- "2571"
- ],
- "2021/09/03": [
- "4134",
- "2876",
- "20057",
- "3108"
- ],
- "2021/09/02": [
- "3613",
- "15989",
- "1747",
- "3673"
- ],
- "2021/09/01": [
- "2941",
- "15900",
- "14945",
- "14391"
- ],
- "2021/08/31": [
- "2635",
- "18352",
- "18234",
- "13459"
- ],
- "2021/08/30": [
- "2609",
- "15886",
- "14938",
- "14442"
- ],
- "2021/08/29": [
- "2581",
- "13913",
- "14923",
- "14621"
- ],
- "2021/08/28": [
- "2578",
- "15661",
- "15724",
- "13418"
- ],
- "2021/08/27": [
- "2503",
- "18113",
- "18243",
- "12908"
- ],
- "2021/08/26": [
- "2435",
- "17829",
- "2141",
- "15659"
- ],
- "2021/08/25": [
- "2422",
- "15566",
- "13905",
- "15789"
- ],
- "2021/08/24": [
- "2428",
- "18353",
- "20365",
- "15823"
- ],
- "2021/08/23": [
- "2417",
- "16926",
- "16954",
- "15831"
- ],
- "2021/08/22": [
- "2204",
- "15565",
- "16432",
- "12896"
- ],
- "2021/08/21": [
- "1620",
- "16234",
- "13902",
- "16438"
- ],
- "2021/08/20": [
- "13699",
- "10653",
- "14863",
- "16562"
- ],
- "2021/08/19": [
- "2018",
- "12101",
- "6068",
- "16637"
- ],
- "2021/08/18": [
- "1969",
- "17503",
- "14925",
- "16971"
- ],
- "2021/08/17": [
- "1934",
- "11660",
- "18223",
- "16985"
- ],
- "2021/08/16": [
- "1913",
- "20207",
- "13707",
- "16986"
- ],
- "2021/08/15": [
- "14627",
- "11568",
- "11562",
- "16988"
- ],
- "2021/08/14": [
- "10546",
- "16206",
- "14676",
- "17616"
- ],
- "2021/08/13": [
- "20115",
- "16139",
- "15927",
- "18116"
- ],
- "2021/08/12": [
- "9372",
- "11265",
- "15723",
- "18500"
- ],
- "2021/08/11": [
- "1789",
- "20162",
- "20364",
- "18808"
- ],
- "2021/08/10": [
- "1439",
- "15988",
- "19539",
- "11066"
- ],
- "2021/08/09": [
- "1436",
- "11123",
- "15686",
- "19237"
- ],
- "2021/08/08": [
- "1359",
- "15810",
- "11509",
- "19535"
- ],
- "2021/08/07": [
- "14594",
- "11057",
- "17404",
- "20327"
- ],
- "2021/08/06": [
- "1343",
- "1469",
- "15683",
- "20442"
- ],
- "2021/08/05": [
- "1316",
- "9489",
- "11404",
- "21277"
- ],
- "2021/08/04": [
- "9095",
- "15681",
- "7511",
- "1445"
- ],
- "2021/08/03": [
- "1251",
- "17128",
- "5624",
- "11780"
- ],
- "2021/08/02": [
- "1181",
- "5972",
- "16916",
- "1561"
- ],
- "2021/08/01": [
- "19637",
- "17845",
- "11657",
- "1655"
- ],
- "2021/07/31": [
- "1158",
- "11052",
- "20002",
- "1766"
- ],
- "2021/07/30": [
- "1059",
- "4095",
- "14940",
- "2211"
- ],
- "2021/07/29": [
- "18311",
- "3343",
- "9466",
- "16434"
- ],
- "2021/07/28": [
- "14425",
- "19699",
- "11051",
- "2252"
- ],
- "2021/07/27": [
- "7795",
- "12026",
- "15685",
- "2307"
- ],
- "2021/07/26": [
- "1018",
- "5549",
- "20007",
- "2613"
- ],
- "2021/07/25": [
- "1010",
- "14888",
- "21278",
- "2623"
- ],
- "2021/07/24": [
- "14912",
- "11048",
- "19598",
- "11054"
- ],
- "2021/07/23": [
- "4659",
- "15787",
- "5430",
- "11049"
- ],
- "2021/07/22": [
- "6996",
- "11725",
- "5014",
- "2629"
- ],
- "2021/07/21": [
- "4096",
- "10844",
- "14921",
- "2637"
- ],
- "2021/07/20": [
- "9933",
- "1240",
- "13424",
- "2696"
- ],
- "2021/07/19": [
- "2839",
- "2407",
- "10597",
- "2900"
- ],
- "2021/07/18": [
- "10988",
- "20922",
- "14728",
- "1944"
- ],
- "2021/07/17": [
- "9242",
- "11060",
- "17123",
- "3687"
- ],
- "2021/07/16": [
- "4446",
- "15666",
- "2447",
- "11437"
- ],
- "2021/07/15": [
- "2748",
- "10164",
- "1342",
- "17090"
- ],
- "2021/07/14": [
- "15489",
- "4811",
- "14719",
- "16724"
- ],
- "2021/07/13": [
- "11656",
- "9205",
- "13910",
- "17136"
- ],
- "2021/07/12": [
- "11655",
- "11055",
- "14567",
- "17143"
- ],
- "2021/07/11": [
- "2167",
- "18513",
- "13422",
- "17472"
- ],
- "2021/07/10": [
- "11399",
- "15665",
- "13164",
- "17837"
- ],
- "2021/07/09": [
- "15721",
- "5212",
- "20058",
- "13911"
- ],
- "2021/07/08": [
- "1259",
- "11403",
- "20542",
- "19236"
- ],
- "2021/07/07": [
- "1145",
- "11286",
- "14503",
- "20010"
- ],
- "2021/07/06": [
- "1449",
- "11053",
- "13397",
- "20061"
- ],
- "2021/07/05": [
- "1110",
- "17086",
- "14502",
- "20181"
- ],
- "2021/07/04": [
- "1032",
- "15664",
- "14500",
- "20182"
- ],
- "2021/07/03": [
- "14929",
- "15558",
- "16194",
- "1300"
- ],
- "2021/07/02": [
- "14697",
- "14712",
- "4358",
- "20210"
- ],
- "2021/07/01": [
- "2160",
- "11724",
- "18114",
- "10942"
- ],
- "2021/06/30": [
- "18258",
- "5639",
- "5904",
- "19566"
- ],
- "2021/06/29": [
- "10798",
- "20438",
- "13022",
- "16571"
- ],
- "2021/06/28": [
- "16171",
- "14499",
- "12931",
- "10711"
- ],
- "2021/06/27": [
- "13410",
- "1182",
- "11047",
- "16472"
- ],
- "2021/06/26": [
- "11720",
- "1074",
- "14284",
- "16437"
- ],
- "2021/06/25": [
- "14247",
- "2304",
- "13975",
- "20543"
- ],
- "2021/06/24": [
- "10870",
- "13549",
- "14226",
- "1045"
- ],
- "2021/06/23": [
- "6236",
- "2961",
- "5567",
- "16947"
- ],
- "2021/06/22": [
- "3040",
- "15658",
- "2877",
- "2250"
- ],
- "2021/06/21": [
- "19532",
- "11722",
- "19641",
- "1414"
- ],
- "2021/06/20": [
- "2798",
- "3020",
- "16398",
- "19645"
- ],
- "2021/06/19": [
- "20546",
- "10971",
- "18232",
- "15732"
- ],
- "2021/06/18": [
- "2745",
- "19583",
- "17610",
- "1729"
- ],
- "2021/06/17": [
- "10974",
- "11279",
- "14496",
- "1799"
- ],
- "2021/06/16": [
- "21313",
- "14852",
- "17951",
- "1949"
- ],
- "2021/06/15": [
- "20152",
- "17836",
- "20440",
- "2213"
- ],
- "2021/06/14": [
- "4836",
- "7562",
- "2224",
- "2233"
- ],
- "2021/06/13": [
- "2309",
- "14400",
- "17291",
- "17490"
- ],
- "2021/06/12": [
- "10809",
- "6497",
- "20955",
- "15653"
- ],
- "2021/06/11": [
- "20300",
- "13398",
- "18866",
- "21279"
- ],
- "2021/06/10": [
- "13702",
- "12893",
- "13023",
- "4315"
- ],
- "2021/06/09": [
- "7568",
- "6603",
- "3151",
- "17822"
- ],
- "2021/06/08": [
- "2231",
- "14699",
- "5052",
- "17470"
- ],
- "2021/06/07": [
- "11365",
- "10472",
- "12865",
- "15644"
- ],
- "2021/06/06": [
- "1718",
- "10421",
- "9007",
- "20183"
- ],
- "2021/06/05": [
- "1668",
- "4963",
- "6087",
- "3165"
- ],
- "2021/06/04": [
- "18511",
- "9084",
- "10026",
- "20667"
- ],
- "2021/06/03": [
- "1159",
- "9663",
- "20924",
- "12764"
- ],
- "2021/06/02": [
- "1269",
- "9251",
- "11687",
- "16118"
- ],
- "2021/06/01": [
- "1543",
- "11000",
- "12851",
- "14725"
- ],
- "2021/05/31": [
- "1152",
- "10819",
- "19238",
- "19581"
- ],
- "2021/05/30": [
- "11653",
- "9934",
- "15918",
- "9470"
- ],
- "2021/05/29": [
- "1942",
- "13565",
- "12757",
- "11085"
- ],
- "2021/05/28": [
- "6550",
- "12919",
- "14675",
- "8980"
- ],
- "2021/05/27": [
- "15779",
- "10427",
- "10713",
- "14950"
- ],
- "2021/05/26": [
- "4949",
- "7576",
- "20495",
- "3665"
- ],
- "2021/05/25": [
- "21275",
- "16719",
- "10986",
- "7579"
- ],
- "2021/05/24": [
- "10025",
- "9081",
- "14267",
- "17780"
- ],
- "2021/05/23": [
- "11170",
- "3187",
- "4386",
- "10159"
- ],
- "2021/05/22": [
- "13019",
- "14430",
- "9024",
- "1644"
- ],
- "2021/05/21": [
- "3029",
- "1260",
- "19622",
- "1368"
- ],
- "2021/05/20": [
- "18312",
- "3184",
- "7682",
- "10775"
- ],
- "2021/05/19": [
- "10808",
- "1926",
- "14891",
- "11779"
- ],
- "2021/05/18": [
- "19947",
- "5557",
- "17779",
- "17398"
- ],
- "2021/05/17": [
- "9342",
- "4097",
- "14248",
- "2887"
- ],
- "2021/05/16": [
- "9046",
- "17609",
- "11985",
- "9944"
- ],
- "2021/05/15": [
- "2753",
- "1802",
- "7662",
- "10423"
- ],
- "2021/05/14": [
- "4690",
- "16935",
- "11909",
- "16939"
- ],
- "2021/05/13": [
- "5397",
- "14716",
- "16174",
- "15806"
- ],
- "2021/05/12": [
- "5618",
- "20950",
- "16890",
- "14657"
- ],
- "2021/05/11": [
- "21312",
- "4256",
- "4933",
- "20366"
- ],
- "2021/05/10": [
- "5597",
- "11559",
- "10282",
- "2933"
- ],
- "2021/05/09": [
- "4779",
- "15663",
- "6416",
- "14601"
- ],
- "2021/05/08": [
- "18512",
- "14575",
- "8983",
- "6443"
- ],
- "2021/05/07": [
- "20944",
- "5547",
- "7569",
- "9370"
- ],
- "2021/05/06": [
- "10799",
- "12761",
- "4803",
- "7453"
- ],
- "2021/05/05": [
- "10448",
- "19942",
- "2015",
- "2982"
- ],
- "2021/05/04": [
- "2744",
- "4179",
- "4485",
- "6209"
- ],
- "2021/05/03": [
- "18868",
- "9465",
- "14620",
- "4195"
- ],
- "2021/05/02": [
- "9012",
- "14722",
- "15684",
- "6137"
- ],
- "2021/05/01": [
- "20154",
- "2293",
- "21276",
- "14595"
- ],
- "2021/04/30": [
- "1212",
- "3980",
- "14600",
- "14570"
- ],
- "2021/04/29": [
- "20053",
- "9421",
- "14425",
- "20119"
- ],
- "2021/04/28": [
- "20114",
- "6987",
- "9019",
- "14476"
- ],
- "2021/04/27": [
- "9079",
- "16400",
- "3584",
- "1219"
- ],
- "2021/04/26": [
- "9094",
- "5427",
- "8972",
- "13460"
- ],
- "2021/04/25": [
- "6118",
- "13302",
- "15961",
- "12978"
- ],
- "2021/04/24": [
- "13305",
- "13908",
- "18769",
- "12912"
- ],
- "2021/04/23": [
- "15486",
- "7490",
- "5875",
- "18809"
- ]
-}
\ No newline at end of file
diff --git a/scripts/today_problem.out b/scripts/today_problem.out
deleted file mode 100644
index ee551e8..0000000
--- a/scripts/today_problem.out
+++ /dev/null
@@ -1,4 +0,0 @@
-11653
-13022
-8983
-14391
diff --git a/shortest_path/README.md b/shortest_path/README.md
deleted file mode 100644
index a332ff3..0000000
--- a/shortest_path/README.md
+++ /dev/null
@@ -1,74 +0,0 @@
-# Shortest Path (최단거리)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-최단거리 문제를 해결할 때 사용하는 알고리즘 중 다익스트라, 벨만-포드, 플로이드 위주로 뽑았습니다.
-
-문제를 읽어보고 문제를 해결하기 위해 필요한 무엇인지 생각해봐야 합니다.
-
-위 알고리즘들의 차이와 각 알고리즘의 특성을 이해하지 못한 상황에서 문제를 푸는 것은 도움이 안된다고 생각합니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7273)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 18352 | 특정 거리의 도시 찾기 | | |
-| 01 | :heavy_check_mark: | 11403 | 경로 찾기 | | |
-| 02 | :heavy_check_mark: | 11265 | 끝나지 않는 파티 | | |
-| 03 | :heavy_check_mark: | 1753 | 최단경로 | | |
-| 04 | :heavy_check_mark: | 13549 | 숨바꼭질 3 | | |
-| 05 | :heavy_check_mark: | 2224 | 명제 증명 | | |
-| 06 | :heavy_check_mark: | 14938 | 서강그라운드 | | |
-| 07 | :heavy_check_mark: | 1719 | 택배 | | 바로가기 |
-| 08 | :heavy_check_mark: | 1277 | 발전소 설치 | | |
-| 09 | :heavy_check_mark: | 11404 | 플로이드 | | |
-| 10 | :heavy_check_mark: | 1956 | 운동 | | |
-| 11 | :heavy_check_mark: | 11657 | 타임머신 | | |
-| 12 | :heavy_check_mark: | 22865 | 가장 먼 곳 | | |
-| 13 | :heavy_check_mark: | 1238 | 파티 | | |
-| 14 | :heavy_check_mark: | 10159 | 저울 | | |
-| 15 | :heavy_check_mark: | 1507 | 궁금한 민호 | | |
-| 16 | :heavy_check_mark: | 1613 | 역사 | | |
-| 17 | :heavy_check_mark: | 1865 | 웜홀 | | |
-| 18 | | 18243 | Small World Network | | |
-| 19 | | 1058 | 친구 | | |
-| 20 | | 1446 | 지름길 | | |
-| 21 | | 1389 | 케빈 베이컨의 6단계 법칙 | | |
-| 22 | | 9205 | 맥주 마시면서 걸어가기 | | |
-| 23 | | 1916 | 최소비용 구하기 | | |
-| 24 | | 17396 | 백도어 | | |
-| 25 | | 5972 | 택배 배송 | | |
-| 26 | | 14284 | 간선 이어가기 2 | | |
-| 27 | | 20168 | 골목 대장 호석 - 기능성 | | |
-| 28 | | 2660 | 회장뽑기 | | |
-| 29 | | 15723 | n단 논법 | | |
-| 30 | | 13424 | 비밀 모임 | | |
-| 31 | | 1261 | 알고스팟 | | |
-| 32 | | 1504 | 특정한 최단 경로 | | |
-| 33 | | 4485 | 녹색 옷 입은 애가 젤다지? | | |
-| 34 | | 10282 | 해킹 | | 바로가기 |
-| 35 | | 18223 | 민준이와 마산 그리고 건우 | | |
-| 36 | | 20007 | 떡 돌리기 | | |
-| 37 | | 2458 | 키 순서 | | |
-| 38 | | 11562 | 백양로 브레이크 | | |
-| 39 | | 21940 | 가운데에서 만나기 | | |
-| 40 | | 20182 | 골목 대장 호석 - 효율성 1 | | |
-| 41 | | 11779 | 최소비용 구하기 2 | | |
-| 42 | | 13911 | 집 구하기 | | |
-| 43 | | 2982 | 국왕의 방문 | | |
-| 44 | | 9370 | 미확인 도착지 | | |
-| 45 | | 2211 | 네트워크 복구 | | |
-| 46 | | 1445 | 일요일 아침의 데이트 | | |
-| 47 | | 2307 | 도로검문 | | |
-| 48 | | 11780 | 플로이드 2 | | |
-| 49 | | 20183 | 골목 대장 호석 - 효율성 2 | | |
-| 50 | | 16118 | 달빛 여우 | | |
-| 51 | | 1219 | 오민식의 고민 | | |
-| 52 | | 22870 | 산책 (large) | | |
diff --git a/shortest_path/header.md b/shortest_path/header.md
deleted file mode 100644
index 9570ff6..0000000
--- a/shortest_path/header.md
+++ /dev/null
@@ -1,19 +0,0 @@
-# Shortest Path (최단거리)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-최단거리 문제를 해결할 때 사용하는 알고리즘 중 다익스트라, 벨만-포드, 플로이드 위주로 뽑았습니다.
-
-문제를 읽어보고 문제를 해결하기 위해 필요한 무엇인지 생각해봐야 합니다.
-
-위 알고리즘들의 차이와 각 알고리즘의 특성을 이해하지 못한 상황에서 문제를 푸는 것은 도움이 안된다고 생각합니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/7273)
diff --git a/shortest_path/list.md b/shortest_path/list.md
deleted file mode 100644
index 4666c9b..0000000
--- a/shortest_path/list.md
+++ /dev/null
@@ -1,53 +0,0 @@
-1,18352,
-1,1753,
-,1916,
-1,13549,
-,1446,
-,13424,
-,17396,
-,5972,
-,14284,
-,20168,
-,20182,
-,20183,
-,1261,
-,1504,
-,4485,
-,10282,./../solution/shortest_path/10282
-1,14938,
-1,1719,./../solution/shortest_path/1719
-,18223,
-,20007,
-1,1277,
-1,1238,
-,11779,
-,13911,
-,2982,
-,9370,
-,2211,
-,16118,
-,1445,
-,2307,
-,18243,
-1,11403,
-,1389,
-,9205,
-,1058,
-1,2224,
-1,11265,
-,2660,
-,15723,
-1,11404,
-,2458,
-1,1956,
-,11562,
-1,10159,
-1,1507,
-1,1613,
-,11780,
-1,11657,
-1,1865,
-,1219,
-,21940,
-1,22865,
-,22870,
diff --git a/simulation/README.md b/simulation/README.md
deleted file mode 100644
index 3bcfe03..0000000
--- a/simulation/README.md
+++ /dev/null
@@ -1,65 +0,0 @@
-# Simulation (시뮬레이션)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-기출 문제를 맨 위로 올렸습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6832)
-| 순번 | 추천 문제 | 문제 번호 | 문제 이름 | 난이도 | 풀이 링크 |
-| :-----: | :-----: | :-----: | :-----: | :-----: | :-----: |
-| 00 | :heavy_check_mark: | 16234 | 인구 이동 | | 바로가기 |
-| 01 | :heavy_check_mark: | 21610 | 마법사 상어와 비바라기 | | 바로가기 |
-| 02 | :heavy_check_mark: | 17144 | 미세먼지 안녕! | | 바로가기 |
-| 03 | :heavy_check_mark: | 20056 | 마법사 상어와 파이어볼 | | |
-| 04 | :heavy_check_mark: | 15685 | 드래곤 커브 | | |
-| 05 | :heavy_check_mark: | 16235 | 나무 재테크 | | |
-| 06 | :heavy_check_mark: | 17135 | 캐슬 디펜스 | | |
-| 07 | :heavy_check_mark: | 17140 | 이차원 배열과 연산 | | |
-| 08 | :heavy_check_mark: | 17779 | 게리맨더링 2 | | |
-| 09 | :heavy_check_mark: | 20058 | 마법사 상어와 파이어스톰 | | 바로가기 |
-| 10 | :heavy_check_mark: | 16236 | 아기 상어 | | 바로가기 |
-| 11 | :heavy_check_mark: | 19238 | 스타트 택시 | | |
-| 12 | :heavy_check_mark: | 20057 | 마법사 상어와 토네이도 | | 바로가기 |
-| 13 | :heavy_check_mark: | 17822 | 원판 돌리기 | | |
-| 14 | :heavy_check_mark: | 19237 | 어른 상어 | | |
-| 15 | :heavy_check_mark: | 19236 | 청소년 상어 | | |
-| 16 | :heavy_check_mark: | 17143 | 낚시왕 | | |
-| 17 | :heavy_check_mark: | 20061 | 모노미노도미노 2 | | 바로가기 |
-| 18 | :heavy_check_mark: | 21609 | 상어 중학교 | | |
-| 19 | :heavy_check_mark: | 20436 | ZOAC 3 | | |
-| 20 | :heavy_check_mark: | 5212 | 지구 온난화 | | |
-| 21 | :heavy_check_mark: | 1713 | 후보 추천하기 | | |
-| 22 | :heavy_check_mark: | 14891 | 톱니바퀴 | | 바로가기 |
-| 23 | :heavy_check_mark: | 20055 | 컨베이어 벨트 위의 로봇 | | |
-| 24 | :heavy_check_mark: | 20165 | 인내의 도미노 장인 호석 | | 바로가기 |
-| 25 | :heavy_check_mark: | 21922 | 학부 연구생 민상 | | |
-| 26 | :heavy_check_mark: | 15683 | 감시 | | |
-| 27 | :heavy_check_mark: | 17837 | 새로운 게임 2 | | |
-| 28 | :heavy_check_mark: | 22861 | 폴더 정리 (large) | | |
-| 29 | :heavy_check_mark: | 13460 | 구슬 탈출 2 | | |
-| 30 | | 14594 | 동방 프로젝트 (Small) | | |
-| 31 | | 20665 | 독서실 거리두기 | | |
-| 32 | | 14503 | 로봇 청소기 | | |
-| 33 | | 3190 | 뱀 | | 바로가기 |
-| 34 | | 14499 | 주사위 굴리기 | | 바로가기 |
-| 35 | | 8972 | 미친 아두이노 | | |
-| 36 | | 18808 | 스티커 붙이기 | | |
-| 37 | | 13459 | 구슬 탈출 | | |
-| 38 | | 2933 | 미네랄 | | |
-| 39 | | 18500 | 미네랄 2 | | |
-| 40 | | 17780 | 새로운 게임 | | |
-| 41 | | 16939 | 2×2×2 큐브 | | |
-| 42 | | 15653 | 구슬 탈출 4 | | |
-| 43 | | 18809 | Gaaaaaaaaaarden | | |
-| 44 | | 15644 | 구슬 탈출 3 | | |
-| 45 | | 5373 | 큐빙 | | 바로가기 |
-| 46 | | 19235 | 모노미노도미노 | | |
-| 47 | | 3025 | 돌 던지기 | | |
diff --git a/simulation/header.md b/simulation/header.md
deleted file mode 100644
index 487ed3f..0000000
--- a/simulation/header.md
+++ /dev/null
@@ -1,15 +0,0 @@
-# Simulation (시뮬레이션)
-
-[메인으로 돌아가기](https://github.com/tony9402/baekjoon)
-
-풀어보면 좋을 문제는 추천 문제에 체크(:heavy_check_mark:) 해놨습니다.
-
-추천 문제 아닌 나머지는 나머지를 난이도 섞었습니다.
-
-기출 문제를 맨 위로 올렸습니다.
-
-
-
-***❗️❗️꼭 문제를 순서대로 안풀어도 됩니다.❗️❗️***
-
-[백준 문제집](https://www.acmicpc.net/workbook/view/6832)
diff --git a/simulation/list.md b/simulation/list.md
deleted file mode 100644
index 58c1d47..0000000
--- a/simulation/list.md
+++ /dev/null
@@ -1,48 +0,0 @@
-1,20436,
-,14594,
-1,5212,
-1,14891,./../solution/simulation/14891
-1,1713,
-1,20055,
-,20665,
-,14503,
-,3190,./../solution/simulation/3190
-,14499,./../solution/simulation/14499
-1,15683,
-2,16234,./../solution/simulation/16234
-2,17144,./../solution/simulation/17144
-2,20056,
-1,20165,./../solution/simulation/20165
-2,16236,./../solution/simulation/16236
-2,15685,
-2,16235,
-2,17135,
-2,17140,
-2,17779,
-2,19238,
-2,20057,./../solution/simulation/20057
-2,20058,./../solution/simulation/20058
-,8972,
-2,17822,
-2,19236,
-,13459,
-,2933,
-2,19237,
-,18808,
-,18500,
-2,17143,
-1,17837,
-,15653,
-,17780,
-2,20061,./../solution/simulation/20061
-,5373,./../solution/simulation/5373
-,18809,
-,16939,
-,19235,
-,3025,
-1,13460,
-,15644,
-2,21609,
-2,21610,./../solution/simulation/21610
-1,21922,
-1,22861,
diff --git a/solution/backtracking/1038/main.py b/solution/backtracking/1038/main.py
deleted file mode 100644
index 91e4054..0000000
--- a/solution/backtracking/1038/main.py
+++ /dev/null
@@ -1,35 +0,0 @@
-# Authored by : gkgg123
-# Co-authored by : -
-# Link : http://boj.kr/ab9a5bb2d14943b3aefaf98f4648a469
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def bfs(N):
- queue = deque()
- for i in range(1, 10):
- queue.append((i, str(i)))
- while queue:
- if len(result) == N + 1:
- break
- cur_num,totol_num = queue.popleft()
- if cur_num != 0:
- for k in range(cur_num):
- next_num = totol_num + str(k)
- queue.append((k,next_num))
- result.append(next_num)
-
-N = int(input())
-result = []
-for i in range(10):
- result.append(i)
-
-if N >=10:
- bfs(N)
-
-if len(result) > N:
- print(result[N])
-else:
- print(-1)
diff --git a/solution/backtracking/10974/main.py b/solution/backtracking/10974/main.py
deleted file mode 100644
index b4cde09..0000000
--- a/solution/backtracking/10974/main.py
+++ /dev/null
@@ -1,24 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/f386e090dfe84518a7329d6f0a77f8c6
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def DFS():
- if len(arr) == N:
- print(*arr)
- return
- for i in range(1, N+1):
- if visited[i] == 0:
- visited[i] = 1
- arr.append(i)
- DFS()
- arr.pop()
- visited[i] = 0
-
-N = int(input())
-arr = []
-visited = [0] * (N+1)
-DFS()
\ No newline at end of file
diff --git a/solution/backtracking/1182/Main.java b/solution/backtracking/1182/Main.java
deleted file mode 100644
index d584f11..0000000
--- a/solution/backtracking/1182/Main.java
+++ /dev/null
@@ -1,78 +0,0 @@
-// Authored by : lms0806
-// Co-authored by : -
-// Link : http://boj.kr/4ec78fe2e6674292a7179dc07a7718b3
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.StringTokenizer;
-
-public class Main {
- static int n, s;
- static int[] arr = new int[22];
-
- public static void main(String[] args) throws IOException {
- FastReader rd = new FastReader();
-
- n = rd.nextInt();
- s = rd.nextInt();
-
- for (int i = 0; i < n; i++) {
- arr[i] = rd.nextInt();
- }
-
- System.out.print(solve(false, 0, 0));
- }
-
- public static int solve(boolean flag, int idx, int num) {
- if (idx == n) { // 끝부분까지 갔을 때
- if (num == s && flag) { // flag가 true면 다 확인했고, 값이 같으므로 1
- return 1;
- }
- return 0; // 끝까지 갔으나 다르므로 0
- }
-
- return solve(true, idx + 1, num + arr[idx]) + solve(flag, idx + 1, num);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while (st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- } catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() {
- return Integer.parseInt(next());
- }
-
- long nextLong() {
- return Long.parseLong(next());
- }
-
- double nextDouble() {
- return Double.parseDouble(next());
- }
-
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- } catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/backtracking/1182/main.py b/solution/backtracking/1182/main.py
deleted file mode 100644
index b6f12d5..0000000
--- a/solution/backtracking/1182/main.py
+++ /dev/null
@@ -1,29 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/1938989c82c1488282cdb2c22d4a9e17
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def backTracking(idx):
- global ans
- if len(poc) >= N:
- if sum(poc) == S:
- ans += 1
- return
- else:
- if sum(poc) == S and poc:
- ans += 1
- for i in range(idx,N):
- poc.append(arr[i])
- backTracking(i+1)
- poc.pop()
-
-N, S = map(int, input().split())
-arr = list(map(int, input().split()))
-visited = [0] * N
-poc = []
-ans = 0
-backTracking(0)
-print(ans)
\ No newline at end of file
diff --git a/solution/backtracking/1189/main.cpp b/solution/backtracking/1189/main.cpp
deleted file mode 100644
index 05de145..0000000
--- a/solution/backtracking/1189/main.cpp
+++ /dev/null
@@ -1,42 +0,0 @@
-// Authored by : jybin321
-// Co-authored by : -
-// Link : http://boj.kr/4e07968244514f549f599884c6fd819e
-
-#include
-using namespace std;
-int r, c, k, ans;
-string _map[6];
-bool visited[6][6];
-int dx[] = {0, -1, 0, 1};
-int dy[] = {-1, 0, 1, 0};
-
-void input() {
- cin >> r >> c >> k;
- for(int i = r - 1; i >= 0; i--) {
- string s; cin >> s;
- _map[i] = s;
- }
-}
-
-void func(int cnt, int y, int x) {
- if(cnt == k) {
- if(y == r - 1 && x == c - 1) ans += 1;
- return;
- }
- visited[y][x] = 1;
- for(int i = 0; i < 4; i++) {
- int nx = x + dx[i], ny = y + dy[i];
- if(nx < 0 || nx >= c || ny < 0 || ny >= r) continue;
- if(visited[ny][nx] || _map[ny][nx] == 'T') continue;
- func(cnt + 1, ny, nx);
- visited[ny][nx] = 0;
- }
-}
-
-int main(void) {
- ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
- input();
- func(1, 0, 0);
- cout << ans;
- return 0;
-}
\ No newline at end of file
diff --git a/solution/backtracking/1405/main.py b/solution/backtracking/1405/main.py
deleted file mode 100644
index 05aea73..0000000
--- a/solution/backtracking/1405/main.py
+++ /dev/null
@@ -1,32 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/90f99f64ed7f4b2ba7af6cba10fac4b9
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def DFS(x,y,ct,now):
- global ans
- if ct == N:
- ans += now
- return
- for i in range(4):
- dx = x + nx[i]
- dy = y + ny[i]
- if visited[dx][dy] == 0:
- visited[dx][dy] = 1
- DFS(dx,dy,ct+1,now*dir[i]/100)
- visited[dx][dy] = 0
-
-arr = list(map(int, input().split()))
-ans = 0
-nx = [0, 0, 1, -1]
-ny = [1, -1, 0, 0]
-visited = [[0 for i in range(31)] for j in range(31)]
-N = arr[0]
-dir = arr[1:]
-visited[14][14] = 1
-DFS(14,14,0,1)
-print(ans)
\ No newline at end of file
diff --git a/solution/backtracking/14712/Main.java b/solution/backtracking/14712/Main.java
deleted file mode 100644
index 229aa3e..0000000
--- a/solution/backtracking/14712/Main.java
+++ /dev/null
@@ -1,78 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/f810af85a30044488b4324ded456497d
-import java.io.*;
-import java.util.*;
-import java.lang.*;
-
-public class Main {
- static int [][]map;
- static int N, M;
- static int answer;
- static public void main(String[] args) {
- FastReader rd = new FastReader();
-
- N = rd.nextInt();
- M = rd.nextInt();
-
- map = new int[N + 1][M + 1]; // 1-index
-
- dfs(0);
-
- System.out.println(answer);
- }
-
- static void dfs(int cnt) {
- if(cnt == N * M) {
- answer ++;
- return ;
- }
- int y = cnt / M + 1;
- int x = cnt % M + 1;
-
- if(map[y - 1][x] == 1 && map[y][x - 1] == 1 && map[y - 1][x - 1] == 1) { // 현재 놓을 수 없는 곳
- dfs(cnt + 1);
- }
- else {
- dfs(cnt + 1); // 선택 안하고 다음껄 볼 경우
- map[y][x] = 1;
- dfs(cnt + 1); // 선택 하고 다음껄 볼 경우
- map[y][x] = 0;
- }
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/backtracking/14712/main.cpp b/solution/backtracking/14712/main.cpp
deleted file mode 100644
index f1ba4bc..0000000
--- a/solution/backtracking/14712/main.cpp
+++ /dev/null
@@ -1,42 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/1a1754c8c07c462e9d52af5ae146809c
-
-#include
-
-using namespace std;
-
-int N, M, Map[33][33]; // 1-index
-int answer = 0;
-
-bool check(int y, int x) {
- return Map[y-1][x] && Map[y][x-1] && Map[y-1][x-1];
-}
-
-void go(int usedCnt) {
- if(usedCnt == N * M) {
- answer ++;
- return ;
- }
-
- int y = usedCnt / M + 1;
- int x = usedCnt % M + 1;
-
- go(usedCnt + 1);
- if(!check(y, x)) {
- Map[y][x] = 1;
- go(usedCnt + 1);
- Map[y][x] = 0;
- }
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- cin >> N >> M;
- go(0);
- cout << answer;
-
- return 0;
-}
diff --git a/solution/backtracking/14712/main.py b/solution/backtracking/14712/main.py
deleted file mode 100644
index cd763d0..0000000
--- a/solution/backtracking/14712/main.py
+++ /dev/null
@@ -1,31 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/117634e91c71493787610c9e0406a605
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-
-# 1-index
-Map = [ [ 0 for _ in range(M + 1) ] for __ in range(N + 1) ]
-answer = 0
-
-def dfs(cnt):
- global answer
- if cnt == N * M:
- answer += 1
- return
-
- y = cnt // M + 1
- x = cnt % M + 1
-
- dfs(cnt + 1)
- if Map[y - 1][x] == 0 or Map[y][x - 1] == 0 or Map[y - 1][x - 1] == 0: # 만약 놓을 수 있는 곳이라면
- Map[y][x] = 1
- dfs(cnt + 1)
- Map[y][x] = 0
-
-dfs(0)
-print(answer)
diff --git a/solution/backtracking/14889/main.cpp b/solution/backtracking/14889/main.cpp
deleted file mode 100644
index b4f0fc3..0000000
--- a/solution/backtracking/14889/main.cpp
+++ /dev/null
@@ -1,48 +0,0 @@
-// Authored by : jybin321
-// Co-authored by : -
-// Link : http://boj.kr/1352b81ac8c5417f908c5e9fd2f395d9
-
-#include
-using namespace std;
-int n, ans = INT_MAX, arr[21][21];
-bool v[21];
-
-void input() {
- cin >> n;
- for(int i = 0; i < n; i++)
- for(int j = 0; j < n; j++)
- cin >> arr[i][j];
-}
-
-int check(int clan) {
- int res = 0;
- for(int i = 0; i < n; i++)
- for(int j = 0; j < n; j++)
- if(v[i] == clan && v[j] == clan)
- res += arr[i][j];
- return res;
-}
-
-void func(int idx, int cnt) {
- if(idx == n / 2) {
- int a = check(1);
- int b = check(0);
- ans = min(ans, abs(a - b));
- return;
- }
-
- for(int i = cnt; i < n; i++) {
- if(v[i]) continue;
- v[i] = 1;
- func(idx + 1, i);
- v[i] = 0;
- }
-}
-
-int main(void) {
- ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
- input();
- func(0, 0);
- cout << ans;
- return 0;
-}
diff --git a/solution/backtracking/15649/main.cpp b/solution/backtracking/15649/main.cpp
deleted file mode 100644
index f6376b3..0000000
--- a/solution/backtracking/15649/main.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/51963cf92cd741ea8bb67b164cc944f9
-#include
-
-using namespace std;
-
-int choose[10], N, M;
-bool used[10];
-
-void dfs(int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- dfs(0);
-
- return 0;
-}
diff --git a/solution/backtracking/15649/main.py b/solution/backtracking/15649/main.py
deleted file mode 100644
index 243c71c..0000000
--- a/solution/backtracking/15649/main.py
+++ /dev/null
@@ -1,29 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/69f68131effd4506a17fdac4b8569c6c
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-choose = [ 0 for _ in range(10) ]
-used = [ 0 for _ in range(10) ]
-
-def dfs(cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(choose[idx], end=' ')
- print()
- return
-
- for i in range(1, N + 1):
- if used[i]:
- continue
- used[i] = 1
- choose[cnt] = i
- dfs(cnt + 1)
- used[i] = 0
-
-dfs(0)
diff --git a/solution/backtracking/15650/main.cpp b/solution/backtracking/15650/main.cpp
deleted file mode 100644
index 925b460..0000000
--- a/solution/backtracking/15650/main.cpp
+++ /dev/null
@@ -1,38 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/dc4a2e040e7d406b875abaa4d969bd50
-#include
-
-using namespace std;
-
-int choose[10], N, M;
-bool used[10];
-
-void dfs(int pre, int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- dfs(0, 0);
-
- return 0;
-}
-
diff --git a/solution/backtracking/15650/main.py b/solution/backtracking/15650/main.py
deleted file mode 100644
index 58a021e..0000000
--- a/solution/backtracking/15650/main.py
+++ /dev/null
@@ -1,31 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/afca9b0c42354f99a6578ab92e0de0a3
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-choose = [ 0 for _ in range(10) ]
-used = [ 0 for _ in range(10) ]
-
-def dfs(idx, cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(choose[idx], end=' ')
- print()
- return
-
- for i in range(idx, N + 1):
- if used[i]:
- continue
- used[i] = 1
- choose[cnt] = i
- dfs(i + 1, cnt + 1)
- used[i] = 0
-
-dfs(1, 0)
-
-
diff --git a/solution/backtracking/15651/main.cpp b/solution/backtracking/15651/main.cpp
deleted file mode 100644
index b169471..0000000
--- a/solution/backtracking/15651/main.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/0a5ce31db1ff47cf8190b0275e74bef8
-#include
-
-using namespace std;
-
-int choose[10], N, M;
-
-void dfs(int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- dfs(0);
-
- return 0;
-}
diff --git a/solution/backtracking/15651/main.py b/solution/backtracking/15651/main.py
deleted file mode 100644
index 06047ff..0000000
--- a/solution/backtracking/15651/main.py
+++ /dev/null
@@ -1,25 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/4631083fc0c04817af9b1020e2396ddc
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-choose = [ 0 for _ in range(10) ]
-
-def dfs(idx, cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(choose[idx], end=' ')
- print()
- return
-
- for i in range(1, N + 1):
- choose[cnt] = i
- dfs(i + 1, cnt + 1)
-
-dfs(1, 0)
-
diff --git a/solution/backtracking/15652/main.cpp b/solution/backtracking/15652/main.cpp
deleted file mode 100644
index e6ef667..0000000
--- a/solution/backtracking/15652/main.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/a90bad59d92f4f87bbb056c9e643b330
-#include
-
-using namespace std;
-
-int choose[10], N, M;
-
-void dfs(int pre, int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- dfs(1, 0);
-
- return 0;
-}
diff --git a/solution/backtracking/15652/main.py b/solution/backtracking/15652/main.py
deleted file mode 100644
index bcfd3c6..0000000
--- a/solution/backtracking/15652/main.py
+++ /dev/null
@@ -1,26 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/2a9874489cb74d7babd30d70501acff9
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-choose = [ 0 for _ in range(10) ]
-
-def dfs(idx, cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(choose[idx], end=' ')
- print()
- return
-
- for i in range(idx, N + 1):
- choose[cnt] = i
- dfs(i, cnt + 1)
-
-dfs(1, 0)
-
-
diff --git a/solution/backtracking/15654/main.cpp b/solution/backtracking/15654/main.cpp
deleted file mode 100644
index b2d76b8..0000000
--- a/solution/backtracking/15654/main.cpp
+++ /dev/null
@@ -1,39 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/3955b249d38d4c79851d4cf97d474c0b
-#include
-
-using namespace std;
-
-int choose[10];
-int arr[10], N, M;
-bool used[10];
-
-void dfs(int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0);
-
- return 0;
-}
diff --git a/solution/backtracking/15654/main.py b/solution/backtracking/15654/main.py
deleted file mode 100644
index 4b39fbf..0000000
--- a/solution/backtracking/15654/main.py
+++ /dev/null
@@ -1,30 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/fa5e88e6aac14dbabbbb8b5bc7037963
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-used = [ 0 for _ in range(10) ]
-
-def dfs(cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- for i in range(0,N):
- if used[i]:
- continue
- used[i] = 1
- choose[cnt] = i
- dfs(cnt + 1)
- used[i] = 0
-
-dfs(0)
diff --git a/solution/backtracking/15655/main.cpp b/solution/backtracking/15655/main.cpp
deleted file mode 100644
index 27a6e14..0000000
--- a/solution/backtracking/15655/main.cpp
+++ /dev/null
@@ -1,39 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/cb5e9a75972a4ac59cc7b4428d07f2fa
-#include
-
-using namespace std;
-
-int arr[10], choose[10], N, M;
-bool used[10];
-
-void dfs(int idx, int cnt) {
- if(cnt == M){
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0, 0);
-
- return 0;
-}
diff --git a/solution/backtracking/15655/main.py b/solution/backtracking/15655/main.py
deleted file mode 100644
index 1378325..0000000
--- a/solution/backtracking/15655/main.py
+++ /dev/null
@@ -1,30 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/d4f609a8ba2e40e8b578c37f3d21d344
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-used = [ 0 for _ in range(10) ]
-
-def dfs(idx, cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- for i in range(idx,N):
- if used[i]:
- continue
- used[i] = 1
- choose[cnt] = i
- dfs(i + 1, cnt + 1)
- used[i] = 0
-
-dfs(0, 0)
diff --git a/solution/backtracking/15656/main.cpp b/solution/backtracking/15656/main.cpp
deleted file mode 100644
index 4fda9cc..0000000
--- a/solution/backtracking/15656/main.cpp
+++ /dev/null
@@ -1,34 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/83f80cd932d54d52bc8cd412a6ee3abc
-#include
-
-using namespace std;
-
-int arr[10], choose[10], N, M;
-
-void dfs(int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0);
-
- return 0;
-}
diff --git a/solution/backtracking/15656/main.py b/solution/backtracking/15656/main.py
deleted file mode 100644
index 7c7aaf9..0000000
--- a/solution/backtracking/15656/main.py
+++ /dev/null
@@ -1,25 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/dd28c9dd06a54efeb12b4f72e82e8c77
-import sys
-
-def input():
- return sys.stdin.readline().strip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-
-def dfs(cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- for i in range(0,N):
- choose[cnt] = i
- dfs(cnt + 1)
-
-dfs(0)
diff --git a/solution/backtracking/15657/main.cpp b/solution/backtracking/15657/main.cpp
deleted file mode 100644
index a38e258..0000000
--- a/solution/backtracking/15657/main.cpp
+++ /dev/null
@@ -1,34 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/ba10084d78354aeabad7a57999d07356
-#include
-
-using namespace std;
-
-int arr[10], choose[10], N, M;
-
-void dfs(int idx, int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0, 0);
-
- return 0;
-}
diff --git a/solution/backtracking/15657/main.py b/solution/backtracking/15657/main.py
deleted file mode 100644
index 97ba764..0000000
--- a/solution/backtracking/15657/main.py
+++ /dev/null
@@ -1,26 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/7bbdc54527b2456d9e1e829834a2ece2
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-
-def dfs(idx, cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- for i in range(idx,N):
- choose[cnt] = i
- dfs(i, cnt + 1)
-
-dfs(0, 0)
-
diff --git a/solution/backtracking/15658/main.py b/solution/backtracking/15658/main.py
deleted file mode 100644
index 6e39bb8..0000000
--- a/solution/backtracking/15658/main.py
+++ /dev/null
@@ -1,43 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/7f225e2c0f214a7a9033560ded2a16d4
-
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def DFS(ans):
- global MIN, MAX
- if not arr:
- MIN = min(MIN, ans)
- MAX = max(MAX, ans)
- return
- for i in range(4):
- if oper[i] > 0:
- oper[i] -= 1
- first = arr[0]
- if i == 0:
- DFS(ans+arr.popleft())
- elif i == 1:
- DFS(ans-arr.popleft())
- elif i == 2:
- DFS(ans*arr.popleft())
- elif i == 3:
- if ans < 0 and arr[0] > 0 or ans > 0 and arr[0] < 0:
- div = abs(ans) // abs(arr.popleft())
- DFS(-div)
- else:
- DFS(ans//arr.popleft())
- arr.appendleft(first)
- oper[i] += 1
-
-N = int(input())
-arr = deque(list(map(int, input().split())))
-oper = list(map(int, input().split()))
-MIN = 1e9+1
-MAX = -1e9-1
-DFS(arr.popleft())
-print(MAX)
-print(MIN)
\ No newline at end of file
diff --git a/solution/backtracking/15663/main.cpp b/solution/backtracking/15663/main.cpp
deleted file mode 100644
index d9dc2c9..0000000
--- a/solution/backtracking/15663/main.cpp
+++ /dev/null
@@ -1,40 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/07e0a7b8b518418d86ac107dcdf56a7e
-#include
-
-using namespace std;
-
-int arr[10], choose[10], N, M;
-bool used[10];
-
-void dfs(int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0);
-
- return 0;
-}
diff --git a/solution/backtracking/15663/main.py b/solution/backtracking/15663/main.py
deleted file mode 100644
index f1c07d0..0000000
--- a/solution/backtracking/15663/main.py
+++ /dev/null
@@ -1,32 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/186f2997e3dd48859f2ef8b729d98bf3
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-used = [ 0 for _ in range(10) ]
-
-def dfs(cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- pre = -1
- for i in range(N):
- if used[i] or pre == arr[i]:
- continue
- pre = arr[i]
- used[i] = 1
- choose[cnt] = i
- dfs(cnt + 1)
- used[i] = 0
-
-dfs(0)
diff --git a/solution/backtracking/15664/main.cpp b/solution/backtracking/15664/main.cpp
deleted file mode 100644
index 4a102f7..0000000
--- a/solution/backtracking/15664/main.cpp
+++ /dev/null
@@ -1,40 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/6b0fef4c57c541529fa7feb2b74cd385
-#include
-
-using namespace std;
-
-int arr[10], choose[10], N, M;
-bool used[10];
-
-void dfs(int idx, int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0, 0);
-
- return 0;
-}
diff --git a/solution/backtracking/15664/main.py b/solution/backtracking/15664/main.py
deleted file mode 100644
index 0012a33..0000000
--- a/solution/backtracking/15664/main.py
+++ /dev/null
@@ -1,33 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/e43bf55556be4bd19c0ae586bcf5d12a
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-used = [ 0 for _ in range(10) ]
-
-def dfs(idx, cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- pre = -1
- for i in range(idx, N):
- if used[i] or pre == arr[i]:
- continue
- pre = arr[i]
- used[i] = 1
- choose[cnt] = i
- dfs(i + 1, cnt + 1)
- used[i] = 0
-
-dfs(0, 0)
-
diff --git a/solution/backtracking/15665/main.cpp b/solution/backtracking/15665/main.cpp
deleted file mode 100644
index 8090274..0000000
--- a/solution/backtracking/15665/main.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/216c114645a74d2fa0bcba6ddec5370b
-#include
-
-using namespace std;
-
-int arr[10], choose[10], N, M;
-
-void dfs(int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0);
-
- return 0;
-}
diff --git a/solution/backtracking/15665/main.py b/solution/backtracking/15665/main.py
deleted file mode 100644
index c821dde..0000000
--- a/solution/backtracking/15665/main.py
+++ /dev/null
@@ -1,29 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/fc8e94e5fb3f4384a7272130a0624d8d
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-
-def dfs(cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- pre = -1
- for i in range(0, N):
- if pre == arr[i]:
- continue
- pre = arr[i]
- choose[cnt] = i
- dfs(cnt + 1)
-
-dfs(0)
diff --git a/solution/backtracking/15666/main.cpp b/solution/backtracking/15666/main.cpp
deleted file mode 100644
index cf8827d..0000000
--- a/solution/backtracking/15666/main.cpp
+++ /dev/null
@@ -1,38 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/f952a2a2e4724f8981ff82ceccbdf854
-#include
-
-using namespace std;
-
-int arr[10], choose[10], N, M;
-
-void dfs(int idx, int cnt) {
- if(cnt == M) {
- for(int i=0;i> N >> M;
- for(int i=0;i> arr[i];
- sort(arr, arr + N);
- dfs(0, 0);
-
- return 0;
-}
-
diff --git a/solution/backtracking/15666/main.py b/solution/backtracking/15666/main.py
deleted file mode 100644
index a63d8d2..0000000
--- a/solution/backtracking/15666/main.py
+++ /dev/null
@@ -1,30 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/dbd389b484d4468990a877b205126f0f
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = sorted(list(map(int, input().split())))
-choose = [ 0 for _ in range(10) ]
-
-def dfs(idx, cnt):
- global N, M
- if cnt == M:
- for idx in range(cnt):
- print(arr[choose[idx]], end=' ')
- print()
- return
-
- pre = -1
- for i in range(idx, N):
- if pre == arr[i]:
- continue
- pre = arr[i]
- choose[cnt] = i
- dfs(i, cnt + 1)
-
-dfs(0, 0)
-
diff --git a/solution/backtracking/16198/main.py b/solution/backtracking/16198/main.py
deleted file mode 100644
index 242149e..0000000
--- a/solution/backtracking/16198/main.py
+++ /dev/null
@@ -1,25 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/3ba9e83879cc4489a5db43c977f87f45
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def DFS(x):
- global MAX
- if len(arr) == 2:
- MAX = max(MAX, x)
- return
- for i in range(1, len(arr)-1):
- save = arr[i]
- arr.pop(i)
- DFS(x + arr[i-1] * arr[i])
- arr.insert(i, save)
-
-N = int(input())
-MAX = 0
-arr = list(map(int, input().split()))
-DFS(0)
-print(MAX)
diff --git a/solution/backtracking/18430/main.cpp b/solution/backtracking/18430/main.cpp
deleted file mode 100644
index 6913694..0000000
--- a/solution/backtracking/18430/main.cpp
+++ /dev/null
@@ -1,69 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/9af9a652c69740c78b6f572ad732c356
-#include
-
-using namespace std;
-int arr[10][10], n, m;
-bool used[10][10];
-pair cases[4] = {{0,0}, {0,1}, {1,1}, {1,0}};
-
-bool check(int y, int x, int c){
- int dy = cases[c].first, dx = cases[c].second;
- for(int i=0;i<2;i++)
- for(int j=0;j<2;j++){
- if(i == dy && j == dx)continue;
- if(i + y >= n || j + x >= m)return false;
- if(used[y+i][x+j])return false;
- }
- return true;
-}
-
-void change(int y, int x, int c){
- int dy = cases[c].first, dx = cases[c].second;
- for(int i=0;i<2;i++)
- for(int j=0;j<2;j++){
- if(i == dy && j == dx)continue;
- used[i+y][j+x] = !used[i+y][j+x];
- }
-}
-
-int cal(int y, int x, int c){
- int dy = cases[c].first, dx = cases[c].second;
- int oy = cases[(c+2)%4].first, ox = cases[(c+2)%4].second;
- int ret = 0;
- for(int i=0;i<2;i++)
- for(int j=0;j<2;j++){
- if(i == dy && j == dx) ret += arr[y+oy][x+ox];
- else ret += arr[y+i][x+j];
- }
- return ret;
-}
-
-int solve(int y, int x){
- int ret = 0;
- for(int i=y;i> n >> m;
- for(int i=0;i> arr[i][j];
-
- cout << solve(0, 0);
-}
diff --git a/solution/backtracking/2026/main.py b/solution/backtracking/2026/main.py
deleted file mode 100644
index ba8f935..0000000
--- a/solution/backtracking/2026/main.py
+++ /dev/null
@@ -1,62 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/23aa0efe0fd94f888b47fdcacfbce2c7
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-K, N, F = map(int, sys.stdin.readline().split())
-relation = [[True if i == j else False for j in range(N+1)] for i in range(N+1)]
-
-for _ in range(F):
- a, b = map(int, sys.stdin.readline().split())
- relation[a][b] = True
- relation[b][a] = True
-
-def check(cur, friends): # 지금까지 쌓아온 친구들과 모두 관계가 성립하는지 확인
- result = True
- for friend in friends:
- if not relation[cur][friend]:
- result = False
- break
- return result
-
-def dfs(start, relation, friends):
- global flag, visit, answer
- if flag: # 친구 관계 성립되면 더이상 할 필요 X
- return
- if len(friends) == K: # 만족하는 친구관계가 K개 일때
- flag = True
- answer = friends
- return
- for nxt, status in enumerate(relation[start]):
- if not status: continue
- if visit[nxt]: continue
- if not check(nxt, friends): continue
- visit[nxt] = True
- dfs(nxt, relation, friends + [nxt])
- visit[nxt] = False
-
-def solution(relation, K):
- global flag, visit, answer
- flag = False
- answer = -1
- visit = [False for _ in range(N+1)]
- for i in range(1, N+1):
- if sum(relation[i]) < K: continue # i번째 사람의 친구가 K보다 작으면 할 필요 X
- if flag: # 성공한 적 있으면 더이상 할 필요 X
- break
- visit[i] = True
- dfs(i, relation, [i])
- visit[i] = False
- return answer
-
-answer = solution(relation, K)
-
-if flag:
- for num in answer:
- print(num)
-else:
- print(-1)
diff --git a/solution/backtracking/22944/main.py b/solution/backtracking/22944/main.py
deleted file mode 100644
index 46081eb..0000000
--- a/solution/backtracking/22944/main.py
+++ /dev/null
@@ -1,56 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/62858e6576584934b6d2db90001acd5b
-
-import sys
-sys.setrecursionlimit(10**4)
-
-def input():
- return sys.stdin.readline().rstrip()
-
-n, h, d = map(int, input().split())
-
-visit = [[False] * n for _ in range(n)]
-umbs = []
-for i in range(n):
- line = input()
- for j in range(n):
- if line[j] == 'U':
- umbs.append([i, j])
- elif line[j] == 'S':
- start = [i, j]
- elif line[j] == 'E':
- end = [i, j]
-
-INF = 99999999
-answer = INF
-
-dy = [0, 0, -1, 1]
-dx = [-1, 1, 0, 0]
-
-def dfs(cur):
- global answer, n
- y, x, health, durability, cnt = cur
- dist = abs(end[0] - y) + abs(end[1] - x)
- if dist <= health + durability:
- answer = min(answer, cnt + dist)
- return
- else:
- for umb in umbs:
- uy, ux = umb
- if visit[uy][ux]: continue
- dist2 = abs(uy - y) + abs(ux - x)
- if dist2 - 1 >= health + durability: continue
- visit[uy][ux] = True
- if dist2 <= durability:
- dfs((uy, ux, health, d, cnt + dist2))
- else:
- dfs((uy, ux, health + durability - dist2, d, cnt + dist2))
- visit[uy][ux] = False
-
-dfs((start[0], start[1], h, 0, 0))
-
-if answer == INF:
- print(-1)
-else:
- print(answer)
diff --git a/solution/backtracking/2580/main.cpp b/solution/backtracking/2580/main.cpp
deleted file mode 100644
index da2060e..0000000
--- a/solution/backtracking/2580/main.cpp
+++ /dev/null
@@ -1,64 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/0ceb759a209343af89d8559da57a2bb2
-#include
-
-using namespace std;
-
-int Quiz[9][9], zeroCnt;
-bool y[9][10], x[9][10], xy[9][10];
-
-void input() {
- for(int i=0;i<9;i++){
- for(int j=0;j<9;j++){
- cin >> Quiz[i][j];
- if(Quiz[i][j] == 0)zeroCnt++;
- else {
- x[j][Quiz[i][j]] = true;
- y[i][Quiz[i][j]] = true;
- xy[i/3*3+j/3][Quiz[i][j]] = true;
- }
- }
- }
-}
-
-void output() {
- for(int i=0;i<9;i++){
- for(int j=0;j<9;j++){
- cout << Quiz[i][j] << " ";
- }
- cout << '\n';
- }
-}
-
-bool solve() {
- if(zeroCnt == 0) return true;
-
- // Find 0
- for(int i=0;i<9;i++){
- for(int j=0;j<9;j++){
- if(Quiz[i][j] != 0) continue;
- for(int k=1;k<=9;k++){
- if(x[j][k] || y[i][k] || xy[i/3*3+j/3][k]) continue;
- x[j][k] = y[i][k] = xy[i/3*3+j/3][k] = true;
- Quiz[i][j] = k;
- zeroCnt--;
- if(solve()) return true;
- x[j][k] = y[i][k] = xy[i/3*3+j/3][k] = false;
- Quiz[i][j] = 0;
- zeroCnt++;
- }
- return false;
- }
- }
- return false;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- input();
- solve();
- output();
-}
diff --git a/solution/backtracking/9663/main.cpp b/solution/backtracking/9663/main.cpp
deleted file mode 100644
index 8d9bbd4..0000000
--- a/solution/backtracking/9663/main.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/bb3cca54213d47268ddc82a82728f730
-#include
-
-using namespace std;
-
-int n, ans;
-bool Y[22], DL[44], DR[44];
-
-void dfs(int y, int cnt){
- if(cnt == n){
- ans++;
- return;
- }
- for(int j=0;j> n;
- dfs(0, 0);
- cout << ans;
-
- return 0;
-}
diff --git a/solution/binary_search/10815/Main.java b/solution/binary_search/10815/Main.java
deleted file mode 100644
index b094b35..0000000
--- a/solution/binary_search/10815/Main.java
+++ /dev/null
@@ -1,81 +0,0 @@
-// Authored by : lms0806
-// Co-authored by : -
-// Link : http://boj.kr/7105d879677a4ebb96ade9837f789f03
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.Arrays;
-import java.util.StringTokenizer;
-
-public class Main {
- static int[] arr;
- public static void main(String[] args) throws IOException{
- FastReader rd = new FastReader();
-
- int size = rd.nextInt();
-
- arr = new int[size];
-
- for(int i = 0; i < size; i++) {
- arr[i] = rd.nextInt();
- }
-
- Arrays.sort(arr);
-
- size = rd.nextInt();
-
- StringBuilder sb = new StringBuilder();
- while(size --> 0) {
- sb.append(binary_search(0, arr.length - 1, rd.nextInt())).append(" ");
- }
- System.out.print(sb);
- }
-
- public static int binary_search(int start, int end, int n) {
- while(start <= end) {
- int mid = (start + end) / 2;
- if(arr[mid] == n) {
- return 1;
- }
-
- if(n < arr[mid]) end = mid - 1;
- else start = mid + 1;
- }
- return 0;
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/binary_search/10815/main.cpp b/solution/binary_search/10815/main.cpp
deleted file mode 100644
index 16dc877..0000000
--- a/solution/binary_search/10815/main.cpp
+++ /dev/null
@@ -1,24 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/9e4cc6a176c6444d99cbc0379c5fd53a
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- vector V(N);
- for(auto &i: V) cin >> i;
- sort(V.begin(), V.end());
- int Q; cin >> Q;
- for(int i=0;i> x;
- if(binary_search(V.begin(), V.end(), x)) cout << 1 << ' ';
- else cout << 0 << ' ';
- }
-
- return 0;
-}
diff --git a/solution/binary_search/10816/main.py b/solution/binary_search/10816/main.py
deleted file mode 100644
index 621286a..0000000
--- a/solution/binary_search/10816/main.py
+++ /dev/null
@@ -1,17 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/3bcac4799e584285b9df8be8d69ab79a
-import sys
-from bisect import bisect_left, bisect_right
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-arr = list(map(int, input().split()))
-M = int(input())
-arr2 = list(map(int, input().split()))
-arr.sort()
-for i in arr2:
- idx_left = bisect_left(arr,i)
- idx_right = bisect_right(arr,i)
- print(idx_right - idx_left, end=' ')
\ No newline at end of file
diff --git a/solution/binary_search/1477/main.py b/solution/binary_search/1477/main.py
deleted file mode 100644
index 3b6681a..0000000
--- a/solution/binary_search/1477/main.py
+++ /dev/null
@@ -1,29 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/b93ed1e8f2a7413fa8fe39483692604f
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-n, m, l = map(int, input().split())
-rests = sorted([0] + list(map(int, input().split())) + [l])
-
-low = 1
-high = l
-answer = high
-while low <= high:
- mid = (low + high) // 2
-
- cnt = 0
- for i in range(n+1):
- cnt += (rests[i+1] - rests[i] - 1) // mid
-
- if cnt<=m:
- answer = mid
- high = mid - 1
- else:
- low = mid + 1
-
-print(answer)
diff --git a/solution/binary_search/1654/main.py b/solution/binary_search/1654/main.py
deleted file mode 100644
index 98caf71..0000000
--- a/solution/binary_search/1654/main.py
+++ /dev/null
@@ -1,30 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/5200a798517a4ec09af16f496ad137bd
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def binary_search():
- global ans
- start, end = 1, max(arr)
-
- while start <= end:
- ct = 0
- mid = (start + end) // 2
- for i in arr:
- ct += i // mid
- if ct < N:
- end = mid - 1
- else:
- start = mid + 1
- ans = end
-
-K,N = map(int, input().split())
-arr = []
-ans = 0
-for i in range(K):
- arr.append(int(input()))
-binary_search()
-print(ans)
diff --git a/solution/binary_search/1789/Main.java b/solution/binary_search/1789/Main.java
deleted file mode 100644
index fe89131..0000000
--- a/solution/binary_search/1789/Main.java
+++ /dev/null
@@ -1,58 +0,0 @@
-// Authored by : lms0806
-// Co-authored by : -
-// Link : http://boj.kr/67f7e1ce71fd4319ae9fbb05c69d50c2
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.StringTokenizer;
-
-public class Main {
- public static void main(String[] args) throws IOException{
- FastReader rd = new FastReader();
-
- long size = rd.nextLong();
-
- long count = 1, sum = 0;
- while(size >= sum) {
- sum += count;
- count++;
- }
-
- System.out.print(count - 2);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
\ No newline at end of file
diff --git a/solution/binary_search/1789/main.cpp b/solution/binary_search/1789/main.cpp
deleted file mode 100644
index c3df21c..0000000
--- a/solution/binary_search/1789/main.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/b757695822a7451ca902c666e024bb5f
-#include
-
-using namespace std;
-typedef long long ll;
-
-ll S;
-bool chk(ll n){ return n*(n+1)/2 > S; }
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
- cin >> S;
- ll l = 1, r = 93000; // sqrt(4294967295 * 2)
- while(l <= r){
- ll mid = (l + r) / 2;
- if(chk(mid))r = mid - 1;
- else l = mid + 1;
- }
- cout << r;
-}
diff --git a/solution/binary_search/1920/main.cpp b/solution/binary_search/1920/main.cpp
deleted file mode 100644
index 0cbf30a..0000000
--- a/solution/binary_search/1920/main.cpp
+++ /dev/null
@@ -1,24 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/ecf2284ada79472da95d933e310ca959
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- vector V(N);
- for(auto &i: V) cin >> i;
- sort(V.begin(), V.end());
- int Q; cin >> Q;
- for(int i=0;i> x;
- if(binary_search(V.begin(), V.end(), x)) cout << 1 << '\n';
- else cout << 0 << '\n';
- }
-
- return 0;
-}
diff --git a/solution/binary_search/19637/main.cpp b/solution/binary_search/19637/main.cpp
deleted file mode 100644
index 888b75b..0000000
--- a/solution/binary_search/19637/main.cpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// Authored by : tallua_y
-// Co-authored by : tony9402
-// Link : http://boj.kr/f9b5128041b54d33822f60534944128c
-#include
-
-using namespace std;
-
-int main()
-{
- ios::sync_with_stdio(false);
- cin.tie(nullptr);
-
- int N, M;
- cin >> N >> M;
-
- vector title_levels;
- vector title_names;
-
- title_levels.reserve(N);
- title_names.reserve(N);
-
- for(int i = 0; i < N; i++) {
- string name;
- int level;
- cin >> name >> level;
-
- if (!title_levels.empty() && title_levels.back() == level) {
- continue;
- }
-
- title_levels.push_back(level);
- title_names.push_back(name);
- }
-
- for(int i = 0; i < M; i++) {
- int power_level;
- cin >> power_level;
-
- int index = lower_bound(title_levels.begin(), title_levels.end(), power_level) - title_levels.begin();
- cout << title_names[index] << '\n';
- }
-
- return 0;
-}
diff --git a/solution/binary_search/2110/Main.java b/solution/binary_search/2110/Main.java
deleted file mode 100644
index 036828e..0000000
--- a/solution/binary_search/2110/Main.java
+++ /dev/null
@@ -1,82 +0,0 @@
-// Authored by : lms0806
-// Co-authored by : -
-// Link : http://boj.kr/200735713a4a43b9a67e046187e1c2d9
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.Arrays;
-import java.util.StringTokenizer;
-
-public class Main {
- static int[] arr;
- public static void main(String[] args) throws IOException{
- FastReader rd = new FastReader();
-
- int size = rd.nextInt(), num = rd.nextInt();
-
- arr = new int[size];
-
- for(int i = 0; i < size; i++) {
- arr[i] = rd.nextInt();
- }
-
- Arrays.sort(arr);
-
- int start = 1, end = arr[size - 1], answer = -1;
- while(start <= end) {
- int mid = (start + end) / 2;
- int count = 1, last = arr[0];
-
- for(int i = 1; i < size; i++) {
- if(arr[i] - last >= mid) {
- count++;
- last = arr[i];//차이 좁혀가기
- }
- }
-
- if(count >= num) {
- answer = mid;
- start = mid + 1;//start 차이 좁혀가기
- }
- else {
- end = mid - 1;//end 차이 좁혀가기
- }
- }
- System.out.print(answer);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
\ No newline at end of file
diff --git a/solution/binary_search/2143/main.cpp b/solution/binary_search/2143/main.cpp
deleted file mode 100644
index 502a6be..0000000
--- a/solution/binary_search/2143/main.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-// Authored by : xhdxhl
-// Co-authored by : -
-// Link : http://boj.kr/7bb72686d3ca4feaba809fd4dd3f8c2e
-#include
-#define ll long long
-using namespace std;
-ll n, m, t, ans;
-int main(){
- cin >> t >> n;
- vector a(n);
- for(int i = 0; i < n; i++) cin >> a[i];
- cin >> m;
- vector b(m);
- for(int i = 0; i < m; i++) cin >> b[i];
- for(int i = 0; i < n; i++){
- ll sum = a[i];
- for(int j = i+1; j < n; j++){
- sum += a[j];
- a.push_back(sum);
- }
- }
-
- for(int i = 0; i < m; i++){
- ll sum = b[i];
- for(int j = i+1; j < m; j++){
- sum += b[j];
- b.push_back(sum);
- }
- }
- sort(b.begin(),b.end());
- for(int i = 0; i < a.size(); i++){
- int idx = lower_bound(b.begin(),b.end(),t - a[i]) - b.begin();
- int endIdx = upper_bound(b.begin(),b.end(),t - a[i]) - b.begin();
- ans += endIdx - idx;
- }
- cout << ans;
-}
\ No newline at end of file
diff --git a/solution/binary_search/2417/Main.java b/solution/binary_search/2417/Main.java
deleted file mode 100644
index 5258ff9..0000000
--- a/solution/binary_search/2417/Main.java
+++ /dev/null
@@ -1,51 +0,0 @@
-// Authored by : lms0806
-// Co-authored by : -
-// Link : http://boj.kr/0d734197171d4318bf44c3de32cd5b65
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.StringTokenizer;
-
-public class Main {
- public static void main(String[] args) throws IOException{
- FastReader rd = new FastReader();
-
- long n = rd.nextLong(), num = (long)Math.sqrt(n);
- System.out.print(num >= n ? num : num + 1);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
\ No newline at end of file
diff --git a/solution/binary_search/2417/main.cpp b/solution/binary_search/2417/main.cpp
deleted file mode 100644
index e22869e..0000000
--- a/solution/binary_search/2417/main.cpp
+++ /dev/null
@@ -1,32 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/dc2b68715aff442db67228432e9510ed
-#include
-
-using namespace std;
-typedef long long ll;
-
-bool chk(ll a, ll b) {
- if(b % a == 0) return a >= b / a;
- return a > b / a;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- ll N; cin >> N;
- if(N == 0) {
- cout << 0;
- return 0;
- }
- ll L = 1, R = 1LL << 32;
- while(L <= R) {
- ll mid = L + (R - L) / 2;
- if(chk(mid, N)) R = mid - 1;
- else L = mid + 1;
- }
- cout << L;
-
- return 0;
-}
diff --git a/solution/binary_search/2470/main.py b/solution/binary_search/2470/main.py
deleted file mode 100644
index 32a80ed..0000000
--- a/solution/binary_search/2470/main.py
+++ /dev/null
@@ -1,44 +0,0 @@
-# Authored by : cieske
-# Co-authored by : -
-# Link : http://boj.kr/c487c1f5e7f34df0aaeba6a14fb6b2a5
-from bisect import bisect_left
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-n = int(input())
-lst_pos, lst_neg = [], []
-input_lst = list(map(int, input().split()))
-for x in input_lst:
- if x > 0: lst_pos.append(x)
- else: lst_neg.append(x)
-
-lst_pos.sort()
-lst_neg.sort()
-
-if not lst_pos: print(*lst_neg[-2:]) # 양수가 없는 경우
-elif not lst_neg: print(*lst_pos[:2]) # 음수가 없는 경우
-else:
- tmp = 2000000001 #최악 케이스+1
- if len(lst_neg) > 1: # 음수만 가지고 답일 수 있음
- if tmp > abs(sum(lst_neg[-2:])):
- tmp = abs(sum(lst_neg[-2:]))
- sol = lst_neg[-2:]
-
- if len(lst_pos) > 1: # 양수만 가지고 답일 수 있음
- if tmp > abs(sum(lst_pos[:2])):
- tmp = abs(sum(lst_pos[:2]))
- sol = lst_pos[:2]
-
- for num in lst_neg:
- idx = bisect_left(lst_pos, -num)
- if idx == len(lst_pos): idx -= 1 # 마지막 인덱스
- elif idx == 0: pass # 처음 인덱스
- elif abs(num+lst_pos[idx]) > abs(num+lst_pos[idx-1]): # 둘 중 최적 선택
- idx -= 1
-
- if tmp > abs(num+lst_pos[idx]): # 필요 시 업데이트
- tmp = abs(num+lst_pos[idx])
- sol = sorted([num, lst_pos[idx]])
-
- print(*sol)
diff --git a/solution/binary_search/2512/main.py b/solution/binary_search/2512/main.py
deleted file mode 100644
index 0dd3696..0000000
--- a/solution/binary_search/2512/main.py
+++ /dev/null
@@ -1,28 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/7910ebb7f8ec409ba2e93cb14d047a19
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def binary_search():
- start, end = 0, max(arr)
- while start <= end:
- mid = (start + end) // 2
- total = 0
- for i in arr:
- if mid < i:
- total += mid
- else:
- total += i
- if total <= M:
- start = mid + 1
- else:
- end = mid - 1
- return end
-
-N = int(input())
-arr = list(map(int, input().split()))
-M = int(input())
-print(binary_search())
diff --git a/solution/binary_search/2776/main.py b/solution/binary_search/2776/main.py
deleted file mode 100644
index 08f07e0..0000000
--- a/solution/binary_search/2776/main.py
+++ /dev/null
@@ -1,29 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/93afacc450454aedbd2b0d6667914846
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def binary_search(t):
- start, end = 0, len(arr)-1
- while start <= end:
- mid = (start + end) // 2
- if arr[mid] == t:
- return 1
- elif arr[mid] > t:
- end = mid - 1
- else:
- start = mid + 1
- return 0
-
-T = int(input())
-for i in range(T):
- N = int(input())
- arr = list(map(int, input().split()))
- M = int(input())
- arr2 = list(map(int, input().split()))
- arr.sort()
- for j in arr2:
- print(binary_search(j))
\ No newline at end of file
diff --git a/solution/binary_search/2805/Main.java b/solution/binary_search/2805/Main.java
deleted file mode 100644
index d7552ae..0000000
--- a/solution/binary_search/2805/Main.java
+++ /dev/null
@@ -1,83 +0,0 @@
-// Authored by : lms0806
-// Co-authored by : -
-// Link : http://boj.kr/72e516ae033949fba8f5ab0b042e4364
-import java.io.BufferedReader;
-import java.io.IOException;
-import java.io.InputStreamReader;
-import java.util.StringTokenizer;
-
-public class Main {
- static int[] arr;
- public static void main(String[] args) throws IOException{
- FastReader rd = new FastReader();
-
- int size = rd.nextInt(), num = rd.nextInt();
-
- arr = new int[size];
-
- for(int i = 0; i < size; i++) {
- arr[i] = rd.nextInt();
- }
-
- long end = arr[0];
- for(int n : arr) {
- end = Math.max(end, n);
- }
-
- long start = 0, answer = -1;
- while(start <= end) {
- long mid = (start + end) / 2, now = 0;
-
- for(int n : arr) {
- now += Math.max(0, n - mid);
- if(now >= num) {
- break;
- }
- }
-
- if(now >= num) {
- answer = mid;
- start = mid + 1;//start 차이 좁혀가기
- }
- else {
- end = mid - 1;//end 차이 좁혀가기
- }
- }
- System.out.print(answer);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
\ No newline at end of file
diff --git a/solution/binary_search/2805/main.py b/solution/binary_search/2805/main.py
deleted file mode 100644
index 3f40296..0000000
--- a/solution/binary_search/2805/main.py
+++ /dev/null
@@ -1,30 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/331c1288d35f4db9b12e371e014dfffd
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def binary_search():
- global ans
- start, end = 0, max(arr)
-
- while start <= end:
- mid = (start + end) // 2
- total_length = 0
- for i in arr:
- if i - mid >= 0:
- total_length += i - mid
-
- if total_length < M:
- end = mid - 1
- else:
- start = mid + 1
- ans = end
-
-N, M = map(int, input().split())
-arr = list(map(int, input().split()))
-ans = 0
-binary_search()
-print(ans)
diff --git a/solution/binary_search/3079/main.py b/solution/binary_search/3079/main.py
deleted file mode 100644
index 428a016..0000000
--- a/solution/binary_search/3079/main.py
+++ /dev/null
@@ -1,24 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/efcb8c8f772044538717ee1203d7c02d
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-n, m = map(int, input().split())
-arr = [int(input()) for _ in range(n)]
-
-low, high = 0, 1000000000 * m
-while low <= high:
- mid = (low + high)//2
- cnt = 0
- for time in arr:
- cnt += mid//time
- if cnt>=m:
- high = mid - 1
- else:
- low = mid + 1
-
-print(low)
diff --git a/solution/binary_search/6236/main.py b/solution/binary_search/6236/main.py
deleted file mode 100644
index 716793b..0000000
--- a/solution/binary_search/6236/main.py
+++ /dev/null
@@ -1,33 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/2fe2f6f8da4f448a8b1b2e6a4da13627
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def binary_search():
- global K
- start, end = max(arr), sum(arr)
- while start <= end:
- mid = (start + end) // 2
- have,ct = 0,0
- for i in arr:
- if have < i:
- have = mid - i
- ct += 1
- else:
- have = have - i
- if ct > M:
- start = mid + 1
- else:
- end = mid - 1
- K = mid
-
-N, M = map(int, input().split())
-arr = []
-K = 0
-for i in range(N):
- arr.append(int(input()))
-binary_search()
-print(K)
diff --git a/solution/brute_force/1145/main.py b/solution/brute_force/1145/main.py
deleted file mode 100644
index fed5937..0000000
--- a/solution/brute_force/1145/main.py
+++ /dev/null
@@ -1,17 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/d16fad5335804ed3a30799f0cf9fdf11
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-arr = list(map(int, input().split()))
-for i in range(min(arr), 1000001):
- ct = 0
- for j in range(5):
- if i % arr[j] == 0:
- ct += 1
- if ct >= 3:
- print(i)
- break
\ No newline at end of file
diff --git a/solution/brute_force/13140/main.cpp b/solution/brute_force/13140/main.cpp
deleted file mode 100644
index abbd2ad..0000000
--- a/solution/brute_force/13140/main.cpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// Authored by : xhdxhl
-// Co-authored by : -
-// Link : http://boj.kr/86c226302ae94672947f1600061f2976
-#include
-
-using namespace std;
-
-int result, nums[10], flag;
-string word = "helowrd";
-unordered_map m;
-
-int main(){
- ios_base::sync_with_stdio(0);
- cin.tie(0); cout.tie(0);
-
- cin >> result;
- for(int i = 0; i < 10; i++) nums[i] = i;
-
- do{
- for(int i = 0; i < word.size(); i++) m[word[i]] = nums[i];
-
- if(m['h'] == 0 || m['w'] == 0) continue;
-
- int a = m['h'] * 10000 + m['e'] * 1000 + m['l'] * 100 + m['l'] * 10 + m['o'];
- int b = m['w'] * 10000 + m['o'] * 1000 + m['r'] * 100 + m['l'] * 10 + m['d'];
-
- if(a + b == result){
- int as = to_string(a).size();
- int bs = to_string(b).size();
-
- cout << " " << a << '\n';
- cout << "+ " << b << '\n';
- cout << "-------\n";
- for(int i = 0; i < 7 - to_string(result).size(); i++) cout << ' ';
- cout << result << '\n';
-
- flag = 1;
- break;
- }
-
- } while(next_permutation(nums, nums + 10));
-
- if(!flag) cout << "No Answer";
-}
diff --git a/solution/brute_force/13410/main.py b/solution/brute_force/13410/main.py
deleted file mode 100644
index 5d6e249..0000000
--- a/solution/brute_force/13410/main.py
+++ /dev/null
@@ -1,11 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/6cd0f036ab1d40eaad68c57ee4eb6ff4
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, K = map(int, input().split())
-num = [ int(str(N * i)[::-1]) for i in range(1, K + 1) ]
-print(max(num))
diff --git a/solution/brute_force/1436/main.py b/solution/brute_force/1436/main.py
deleted file mode 100644
index dc8056a..0000000
--- a/solution/brute_force/1436/main.py
+++ /dev/null
@@ -1,25 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/32ff54d1000b438281226631f054c697
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-ct = 0
-ans = 0
-num = 666
-
-while True:
-
- if '666' in str(num):
- ct += 1
-
- if ct == N:
- ans = num
- break
-
- num += 1
-
-print(ans)
\ No newline at end of file
diff --git a/solution/brute_force/14500/main.py b/solution/brute_force/14500/main.py
deleted file mode 100644
index 6eccc36..0000000
--- a/solution/brute_force/14500/main.py
+++ /dev/null
@@ -1,77 +0,0 @@
-#Authored by : shjeong92
-#Co-authored by : -
-#Link : http://boj.kr/04d943fbb1d14ca0b17c62790a25fe8a
-import sys
-from itertools import combinations as combi
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int,input().split())
-#보드입력받기
-board = [list(map(int,input().split())) for _ in range(N)]
-#백트래킹용 체크
-check = [ [True] * M for _ in range(N)]
-#RLUD
-dx = (0,0,-1,1)
-dy = (1,-1,0,0)
-answer = 0
-#T 자블록 검색
-def block_T(x,y):
- #중앙의 한 점이라고 가정한다
- result = board[x][y]
- # 상하좌우의 티어나온부분 중 날개가 4개면
- # 제일작은 값을 제거한값이 최대값이 될것이고,
- # 날개가 2개라면 T가아니고 날개가 3개라면 그냥 그값을 리턴해준다.
- wings = 4
- MIN = int(1e9)
- for i in range(4):
- nx = x + dx[i]
- ny = y + dy[i]
- if wings == 2:
- return 0
- #꼬다리부분이 맵을 벗어난다? 그방향 날개는 없는것.
- if not (0<=nx board[nx][ny]:
- MIN = board[nx][ny]
- #모든방향 날개가 살아있단 말이므로 4방향의 날개중 제일 작은날개 하나를 잘라준다.
- if wings == 4:
- result -= MIN
- return result
-
-#T자를 제외한 블록은 dfs를 이용해 계산
-def dfs(x,y,val,depth):
- global answer
- if depth == 4:
- answer = max(answer,val)
- return
-
- for i in range(4):
- nx = x + dx[i]
- ny = y + dy[i]
- if 0 <= nx < N and 0 <= ny < M:
- if check[nx][ny]:
- #4개블럭값이 이전 블럭값이면 안되니까 false 해주고
- check[nx][ny] = False
- dfs(nx,ny,val+board[nx][ny],depth+1)
- #끝난후 다시 방문가능처리해줌.
- check[nx][ny] = True
-
-
-for i in range(N):
- for j in range(M):
- #시작블록을 다시방문하면안됨
- check[i][j] = False
- dfs(i,j,board[i][j],1)
- #끝난후 다시 방문가능처리
- check[i][j] = True
-
- temp = block_T(i,j)
- answer = max(answer,temp)
-
-
-print(answer)
diff --git a/solution/brute_force/14620/main.py b/solution/brute_force/14620/main.py
deleted file mode 100644
index 4d55318..0000000
--- a/solution/brute_force/14620/main.py
+++ /dev/null
@@ -1,44 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/3b62a8a262a34102b1361a464e12f0c9
-
-import sys
-from itertools import combinations
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-arr = []
-flower = []
-MIN = 1e9
-nx = [-1, 0, 1, 0]
-ny = [0, -1, 0, 1]
-for i in range(N):
- arr.append(list(map(int, input().split())))
-for i in range(1, N-1):
- for j in range(1, N-1):
- flower.append((i,j))
-for flower_comb in combinations(flower, 3):
- temp = 0
- flag = 0
- visited = [[0 for i in range(N)] for j in range(N)]
- for flo in flower_comb:
- if visited[flo[0]][flo[1]] == 0:
- visited[flo[0]][flo[1]]
- temp += arr[flo[0]][flo[1]]
- else:
- flag = 1
- break
- for i in range(4):
- dx = flo[0] + nx[i]
- dy = flo[1] + ny[i]
- if visited[dx][dy] == 0:
- visited[dx][dy] = 1
- temp += arr[dx][dy]
- else:
- flag = 1
- break
- if not flag:
- MIN = min(MIN, temp)
-print(MIN)
\ No newline at end of file
diff --git a/solution/brute_force/15661/main.py b/solution/brute_force/15661/main.py
deleted file mode 100644
index 6176ad1..0000000
--- a/solution/brute_force/15661/main.py
+++ /dev/null
@@ -1,26 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/946d652cbd7a4361aaeff5ff1f2612d5
-import sys
-from itertools import combinations
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-arr = []
-num = [i for i in range(N)]
-MIN = 1e9
-for i in range(N):
- arr.append(list(map(int, input().split())))
-comb_list = list(combinations(num, N//2))
-for comb in comb_list:
- start = 0
- link = 0
- remain = [i for i in range(N) if i not in comb]
- for com in combinations(comb, 2):
- start += arr[com[0]][com[1]]
- for ar in combinations(remain, 2):
- link += arr[ar[0]][ar[1]]
- MIN = min(MIN, abs(start - link))
-print(MIN)
\ No newline at end of file
diff --git a/solution/brute_force/15721/main.cpp b/solution/brute_force/15721/main.cpp
deleted file mode 100644
index 1f12825..0000000
--- a/solution/brute_force/15721/main.cpp
+++ /dev/null
@@ -1,29 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/2e1ee57b7481444fad22d74a53c6ac21
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int A, T, B; cin >> A >> T >> B;
- int answer = -1;
- for(int i=1; T ;i++){
- for(int j=0;T && j<4;j++) {
- T -= (j % 2 == B);
- ++answer;
- }
- for(int j=0;T && j<2;j++) {
- for(int k=0;T && k<=i;k++) {
- T -= (j % 2 == B);
- ++answer;
- }
- }
- }
- cout << answer % A;
-
- return 0;
-}
diff --git a/solution/brute_force/16439/main.cpp b/solution/brute_force/16439/main.cpp
deleted file mode 100644
index 1e2fcc3..0000000
--- a/solution/brute_force/16439/main.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/e9a6c4d2144e4f7db1fd8ab2bfd14058
-#include
-
-using namespace std;
-
-int arr[33][33];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- for(int i=0;i> arr[i][j];
- int answer = 0;
- for(int i=0;i N:
- break
- if a * a + b * b == N:
- ret = 2
-
- if ret <= 2:
- break
- for c in range(1, sqrtN + 1):
- if a * a + b * b + c * c > N:
- break
- if a * a + b * b + c * c == N:
- ret = 3
- break
-
- return ret
-
-N = int(input())
-sqrtN = int(sqrt(N))
-print(solve(N))
diff --git a/solution/brute_force/18312/main.cpp b/solution/brute_force/18312/main.cpp
deleted file mode 100644
index 1638932..0000000
--- a/solution/brute_force/18312/main.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/a1f005e8ee00409590b55623b8057ff0
-#include
-
-using namespace std;
-
-bool chk(int a, int b) {
- for(int i=0;i<2;i++) {
- if(a % 10 == b) return true;
- a /= 10;
- }
- return false;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, K; cin >> N >> K;
- int answer = 0;
- for(int i=0;i<(N+1)*3600;i++) {
- int hh = i / 3600;
- int mm = i / 60 % 60;
- int ss = i % 60;
- if(chk(hh, K) || chk(mm, K) || chk(ss, K)) answer++;
- }
- cout << answer;
-
- return 0;
-}
diff --git a/solution/brute_force/18511/main.py b/solution/brute_force/18511/main.py
deleted file mode 100644
index caab2ad..0000000
--- a/solution/brute_force/18511/main.py
+++ /dev/null
@@ -1,23 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/b56f91d1e33b44c2b24d57cd460eace2
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def backTracking(num):
- global ans
- if num > N:
- return
- ans = max(ans,num)
- for i in K:
- num = num * 10 + i
- backTracking(num)
- num = (num - i) // 10
-
-N, C = map(int, input().split())
-K = list(map(int, input().split()))
-ans = 0
-backTracking(0)
-print(ans)
diff --git a/solution/brute_force/18808/main.py b/solution/brute_force/18808/main.py
deleted file mode 100644
index 3b57b98..0000000
--- a/solution/brute_force/18808/main.py
+++ /dev/null
@@ -1,80 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/81188121d759417d8f72e6a00476ce7c
-
-from collections import deque
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def rotate(arr, N):
- result = []
- i_array = []
- j_array = []
- for item in arr:
- i,j = item
- i_array.append(j)
- j_array.append(N-i-1)
- result.append((j,N-i-1))
- i_min = min(i_array)
- j_min = min(j_array)
- real_result = []
- for item in result:
- y,x = item
- real_result.append((y-i_min,x-j_min))
- return real_result
-
-def check(n,m,arr,visit):
- for i in range(n):
- for j in range(m):
- chk = True
- temp = set()
- for y,x in arr:
- if y+i
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- vector V(6);
- for(int i=0;i<6;i++) cin >> V[i];
-
- for(int x = -1000; x <= 1000; x++) {
- for(int y = -1000; y <= 1000; y++) {
- int F = V[0] * x + V[1] * y - V[2];
- int S = V[3] * x + V[4] * y - V[5];
- if(F == 0 && S == 0) {
- cout << x << ' ' << y;
- return 0;
- }
- }
- }
-
- return 0;
-}
diff --git a/solution/brute_force/1969/main.py b/solution/brute_force/1969/main.py
deleted file mode 100644
index 76218fb..0000000
--- a/solution/brute_force/1969/main.py
+++ /dev/null
@@ -1,33 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/c08f03602f524dc3822344da70739929
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = []
-word = ''
-dist = 0
-
-for i in range(N):
- arr.append(input())
-
-for i in range(M):
- dic = {}
- for j in range(N):
- if arr[j][i] not in dic:
- dic[arr[j][i]] = 1
-
- else:
- dic[arr[j][i]] += 1
-
- ans = list(dic.items())
- ans.sort(key = lambda x : (-x[1], x[0]))
- word += ans[0][0]
- dist += N - ans[0][1]
-
-print(word)
-print(dist)
\ No newline at end of file
diff --git a/solution/brute_force/21278/main.py b/solution/brute_force/21278/main.py
deleted file mode 100644
index bef384c..0000000
--- a/solution/brute_force/21278/main.py
+++ /dev/null
@@ -1,67 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/b52664ec81c3495db8b8091cd12f95d5
-
-from itertools import combinations
-from collections import deque
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-graph = {i: [] for i in range(1, N+1)}
-for _ in range(M):
- a, b = map(int, input().split())
- graph[a].append(b)
- graph[b].append(a)
-
-def bfs(start1, start2, graph, N):
- result = [99999999 for _ in range(N+1)]
- result[0] = 0 # 인덱스 0은 더미
- result[start1] = 0
- result[start2] = 0
- q = deque()
- q.append((start1, 0))
- q.append((start2, 0))
- visit = set()
- visit.add(start1)
- visit.add(start2)
- while q:
- if len(visit) == N:
- break
- cur, dist = q.popleft()
- for nxt in graph[cur]:
- if nxt in visit: continue
- visit.add(nxt)
- q.append((nxt, dist + 1))
- result[nxt] = dist + 1
- return sum(result)
-
-
-def solution(graph, N):
- candidate = [i for i in range(1, N+1)]
- answer = 99999999
- fin_store1 = N+1
- fin_store2 = N+1
- for comb in combinations(candidate, 2):
- store1, store2 = comb
- result = bfs(store1, store2, graph, N)
- if answer > result:
- fin_store1 = store1
- fin_store2 = store2
- answer = result
- elif answer == result:
- if fin_store1 > store1:
- fin_store1 = store1
- fin_store2 = store2
- answer = result
- elif fin_store1 == store1:
- if fin_store2 > store2:
- fin_store1 = store1
- fin_store2 = store2
- answer = result
-
- return ' '.join(map(str, [fin_store1, fin_store2, answer * 2]))
-
-print(solution(graph, N))
diff --git a/solution/brute_force/21315/main.py b/solution/brute_force/21315/main.py
deleted file mode 100644
index 25bdfb3..0000000
--- a/solution/brute_force/21315/main.py
+++ /dev/null
@@ -1,38 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/9857ec1183e144acb9d49a7316bdf595
-
-from itertools import permutations
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def shuffle(card1, card2, card3):
- card = card2 + card1 + card3
- if len(card2) > 1:
- return shuffle(card2[:len(card2)//2] + card1, card2[len(card2)//2:], card3)
- else:
- card = card2 + card1 + card3
- return card
-
-n = int(input())
-correct_cards = list(map(int,input().split()))
-answer = []
-orders = [i for i in range(1, 10)] + [i for i in range(1, 10)]
-
-for perm in permutations(orders, 2):
- if 2 ** max(perm)>=n:
- continue
- cards = [i for i in range(1, n+1)]
- for k in perm:
- card1 = []
- card2 = cards[n-(2**k):]
- card3 = cards[:n-(2**k)]
- cards = shuffle(card1, card2, card3)
-
- if cards == correct_cards:
- answer = perm
- break
-
-print(' '.join(map(str, answer)))
diff --git a/solution/brute_force/2231/main.cpp b/solution/brute_force/2231/main.cpp
deleted file mode 100644
index df6f456..0000000
--- a/solution/brute_force/2231/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/19379bdb38884854badc892db21a8d6b
-#include
-
-using namespace std;
-
-int cal(int x) {
- int tmp = x;
- while(x) {
- tmp += x % 10;
- x /= 10;
- }
- return tmp;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- int cur = 1;
- while(cur < N + 100 && N != cal(cur)) cur++;
- if(cur == N + 100) cur = 0;
- cout << cur;
-
- return 0;
-}
diff --git a/solution/brute_force/2309/main.py b/solution/brute_force/2309/main.py
deleted file mode 100644
index 94e2667..0000000
--- a/solution/brute_force/2309/main.py
+++ /dev/null
@@ -1,28 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/be3b4fb036844cb390e1f7a818471cde
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def findIndex(ans):
-
- for i in range(9):
- for j in range(i+1,9):
- if arr[i] + arr[j] == ans:
- return (arr[i], arr[j])
-
-arr = []
-for i in range(9):
- arr.append(int(input()))
-
-ans = sum(arr) - 100
-first, second = findIndex(ans)
-arr.remove(first)
-arr.remove(second)
-arr.sort()
-
-for i in arr:
- print(i)
\ No newline at end of file
diff --git a/solution/brute_force/2422/main.cpp b/solution/brute_force/2422/main.cpp
deleted file mode 100644
index 3f3b226..0000000
--- a/solution/brute_force/2422/main.cpp
+++ /dev/null
@@ -1,31 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/514a7a75b2eb4a2eaf862e8227682be7
-#include
-
-using namespace std;
-
-bool chk[222][222];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- for(int i=0;i> a >> b;
- chk[a][b] = chk[b][a] = true;
- }
- int answer = 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(chk[i][j] || chk[j][k] || chk[i][k])continue;
- answer++;
- }
- }
- }
- cout << answer;
-
- return 0;
-}
diff --git a/solution/brute_force/2503/main.py b/solution/brute_force/2503/main.py
deleted file mode 100644
index 00066af..0000000
--- a/solution/brute_force/2503/main.py
+++ /dev/null
@@ -1,48 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/4e0ef6629dd34e659f1b3d6d470ccc41
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def isDifferentAndNotZero(num):
- if num[0] == num[1] or num[0] == num[2] or num[1] == num[2]:
- return False
- if '0' in num:
- return False
- return True
-
-def baseball(num):
- flag = 0
- for i in range(N):
- strike, ball = 0,0
- for j in range(3):
- if num[j] == arr[i][0][j]:
- strike += 1
- if num[0] == arr[i][0][1] or num[0] == arr[i][0][2]:
- ball += 1
- if num[1] == arr[i][0][0] or num[1] == arr[i][0][2]:
- ball += 1
- if num[2] == arr[i][0][0] or num[2] == arr[i][0][1]:
- ball += 1
- if strike == arr[i][1] and ball == arr[i][2]:
- flag += 1
- if flag == N:
- return True
- else:
- return False
-
-N = int(input())
-arr = []
-poc = []
-ans = 0
-
-for i in range(N):
- num, strike, ball = input().split()
- arr.append([num, int(strike), int(ball)])
-
-for i in range(123,988):
- if isDifferentAndNotZero(str(i)) and baseball(str(i)):
- ans += 1
-print(ans)
\ No newline at end of file
diff --git a/solution/brute_force/2615/Main.java b/solution/brute_force/2615/Main.java
deleted file mode 100644
index 424b6d7..0000000
--- a/solution/brute_force/2615/Main.java
+++ /dev/null
@@ -1,117 +0,0 @@
-// Authored by : smw123123
-// Co-authored by : -
-// Link : http://boj.kr/7fe90aad8ed1484f95674d7fd4464d5c
-
-import java.util.*;
-import java.lang.*;
-import java.io.*;
-
-public class Main {
- static int[][] board;
- static int lastX, lastY;
- public static void main(String[] args) {
- FastReader sc = new FastReader();
- board = new int[19][19];
- for (int i = 0; i < 19; i++) {
- for (int j = 0; j < 19; j++) {
- board[i][j] = sc.nextInt();
- }
- }
- for (int i = 0; i < 19; i++) {
- for (int j = 0; j < 19; j++) {
- int cur = board[i][j];
- if(cur > 0) {
- for (int d = 0; d < 4; d++) {
- int nx = i + dx[d];
- int ny = j + dy[d];
- if(!isPossible(nx, ny)) continue;
- if(board[nx][ny] == cur) {
- var a = checkFirst(nx, ny, cur, d) + 1;
- if(a == 5) {
- var b = checkSecond(cur, d);
- if(a == b) {
- System.out.println(cur);
- System.out.println((lastX+ dx[d]+1) + " " + (lastY+dy[d]+1));
- return;
- }
- }
- }
- }
- }
- }
- }
- System.out.println(0);
- }
-
- private static int checkFirst(int x, int y, int cur, int direction) {
- lastX = x;
- lastY = y;
- int nx = x + dx[direction];
- int ny = y + dy[direction];
- if(!isPossible(nx, ny)) return 1;
- if(board[nx][ny] == cur) {
- return checkFirst(nx, ny, cur, direction) + 1;
- }
- else
- return 1;
- }
-
- private static int checkSecond(int cur, int d) {
- lastX = lastX + rdx[d];
- lastY = lastY + rdy[d];
- if(!isPossible(lastX, lastY)) return 1;
- if(board[lastX][lastY] == cur) {
- return checkSecond(cur, d) + 1;
- }
- else {
- return 1;
- }
- }
- private static boolean isPossible(int x, int y) {
- return x >= 0 && x < 19 && y >= 0 && y < 19;
- }
-
- // 오른쪽 위↗, 오른쪽→, 오른쪽 아래↘, 아래↓
- static int[] dx = {-1, 0, 1, 1};
- static int[] dy = {1, 1, 1, 0};
-
- // 왼쪽 아래↙, 왼쪽←, 왼쪽 위↖, 위↑
- static int[] rdx = {1, 0, -1, -1};
- static int[] rdy = {-1, -1, -1, 0};
-
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/brute_force/2798/main.cpp b/solution/brute_force/2798/main.cpp
deleted file mode 100644
index c199254..0000000
--- a/solution/brute_force/2798/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/dc356e3adafd4e158b47dce9a9acd59b
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- int answer = 0;
- vector V(N);
- for(int i=0;i> V[i];
- for(int i=0;i M) continue;
- answer = max(answer, value);
- }
- }
- }
- cout << answer;
-
- return 0;
-}
diff --git a/solution/brute_force/2798/main.py b/solution/brute_force/2798/main.py
deleted file mode 100644
index 1995310..0000000
--- a/solution/brute_force/2798/main.py
+++ /dev/null
@@ -1,17 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/29a558ec778348f589fad5c627187638
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-MAX = 0
-arr = list(map(int, input().split()))
-for i in range(len(arr)):
- for j in range(i+1,len(arr)):
- for z in range(j+1,len(arr)):
- if arr[i] + arr[j] + arr[z] <= M:
- MAX = max(MAX, arr[i] + arr[j] + arr[z])
-print(MAX)
\ No newline at end of file
diff --git a/solution/brute_force/4096/main.py b/solution/brute_force/4096/main.py
deleted file mode 100644
index d87fe55..0000000
--- a/solution/brute_force/4096/main.py
+++ /dev/null
@@ -1,26 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/b554cc74d1a24c9e9306775641121065
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-def isPalindrome(s):
- return s == s[::-1]
-
-while True:
- N = input()
- length = len(N)
- ct = 0
- if N == '0':
- break
- elif isPalindrome(N):
- print(0)
- else:
- while True:
- if isPalindrome(N):
- print(ct)
- break
- N = str(int(N)+1)
- N = '0' * (length - len(N)) + N
- ct += 1
\ No newline at end of file
diff --git a/solution/brute_force/4690/main.py b/solution/brute_force/4690/main.py
deleted file mode 100644
index 78447b1..0000000
--- a/solution/brute_force/4690/main.py
+++ /dev/null
@@ -1,9 +0,0 @@
-# Authored by : chj3748
-# Co-authored by : -
-# Link : http://boj.kr/fb355cbf95324465b430f4423567a2c4
-for a in range(2, 100 + 1):
- for b in range(2, a):
- for c in range(b, a):
- for d in range(c, a):
- if a ** 3 == b ** 3 + c ** 3 + d ** 3:
- print(f'Cube = {a}, Triple = ({b},{c},{d})')
\ No newline at end of file
diff --git a/solution/brute_force/5568/main.py b/solution/brute_force/5568/main.py
deleted file mode 100644
index 1fc4604..0000000
--- a/solution/brute_force/5568/main.py
+++ /dev/null
@@ -1,23 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/0dd94001579e4341b3ea06ed523d2cba
-import sys
-from itertools import permutations
-
-def input():
- return sys.stdin.readline().rstrip()
-
-n = int(input())
-arr = []
-ans = set()
-k = int(input())
-for i in range(n):
- arr.append(input())
-per = list(permutations(arr, k))
-for i in range(len(per)):
- st = ''
- for j in range(len(per[i])):
- st += per[i][j]
- ans.add(st)
-ans = list(ans)
-print(len(ans))
\ No newline at end of file
diff --git a/solution/brute_force/7568/main.py b/solution/brute_force/7568/main.py
deleted file mode 100644
index e04f188..0000000
--- a/solution/brute_force/7568/main.py
+++ /dev/null
@@ -1,22 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/5540a61d3d364466bbe47e8c62beaedb
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-arr = []
-
-for i in range(N):
- weight, height = map(int, input().split())
- arr.append([weight,height,1])
-
-for i in range(N):
- for j in range(N):
- if arr[i][0] < arr[j][0] and arr[i][1] < arr[j][1]:
- arr[i][2] += 1
-
-for i in range(len(arr)):
- print(arr[i][2], end=' ')
\ No newline at end of file
diff --git a/solution/brute_force/9079/main.cpp b/solution/brute_force/9079/main.cpp
deleted file mode 100644
index a3af8d3..0000000
--- a/solution/brute_force/9079/main.cpp
+++ /dev/null
@@ -1,129 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/98c4781dcf14402db3f83717f0154d5e
-#include
-
-using namespace std;
-
-int makeBit(string s) {
- int bit = 0;
- for(int i = 8; i >= 0; i--) {
- bit <<= 1;
- if(s[i] == 'H') bit |= 1;
- }
- return bit;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int T; cin >> T;
- while(T--) {
- string coin;
- bool used[512] = { false };
- int answer = -1;
-
- for(int i = 0; i < 9; i++) {
- char ch; cin >> ch;
- coin += ch;
- }
-
- int bit = makeBit(coin);
-
- queue Q;
- Q.push(bit);
- used[bit] = true;
-
- bool flag = true;
- while(!Q.empty() && flag) {
- int qsize = Q.size();
- answer ++;
- while(qsize--) {
- int cur = Q.front(); Q.pop();
- if(cur == 0 || cur == (1 << 9) - 1) {
- flag = false;
- break;
- }
- // 자세한 내용은 맨 아래 Note 참고
- for(int nxt : { 7, 56, 448, 73, 146, 292, 273, 84 }) {
- int nxtState = cur ^ nxt;
- if(used[nxtState]) continue;
- used[nxtState] = true;
- Q.push(nxtState);
- }
- }
- }
- if(flag) answer = -1;
- cout << answer << '\n';
- }
-
- return 0;
-}
-
-/*
- * NOTE !!
- *
- * - 동전 상태를 비트로 저장
- * 비트의 위치를 의미
- *
- * 012
- * 345 -> [876543210]
- * 678
- *
- * ex)
- * HTT 100
- * HTT -> 100 -> 110001001 -> 393
- * THH 011
- *
- *
- * - 동전을 뒤집는 경우 값
- *
- * 111
- * 000 -> 000000111 -> 7
- * 000
- *
- * 000
- * 111 -> 000111000 -> 56
- * 000
- *
- * 000
- * 000 -> 111000000 -> 448
- * 111
- *
- * 100
- * 100 -> 001001001 -> 73
- * 100
- *
- * 010
- * 010 -> 010010010 -> 146
- * 010
- *
- * 001
- * 001 -> 100100100 -> 292
- * 001
- *
- * 100
- * 010 -> 100010001 -> 273
- * 001
- *
- * 001
- * 010 -> 001010100 -> 84
- * 100
- *
- * - 위 값을 이용하여 동전 뒤집기
- *
- * HTT THH <--- 요 라인
- * HTT -> HTT : 가장 윗 부분 뒤집기
- * THH THH
- *
- * 이를 숫자를 이용하여 계산을 해본다면 아래와 같음
- *
- * 왼쪽 동전 상태의 값 : 110001001 -> 393
- * 가장 위를 뒤집는 값 : 000000111 -> 7
- * 오른쪽 동전 상태의 값 : 110001110 -> 398
- *
- * 해당 위치를 뒤집을 땐 XOR 연산을 이용하면 됨.
- *
- * 393 ^ 7 => 398
- */
diff --git a/solution/brute_force/9094/main.py b/solution/brute_force/9094/main.py
deleted file mode 100644
index 929ab03..0000000
--- a/solution/brute_force/9094/main.py
+++ /dev/null
@@ -1,18 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : tony9402
-# Link : http://boj.kr/ea96af96027540dcb1daa3b65e849eab
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-T = int(input())
-for i in range(T):
- n,m = map(int, input().split())
- ct = 0
- for a in range(1,n):
- for b in range(a+1,n):
- if (a * a + b * b + m) % (a*b) == 0:
- ct += 1
-
- print(ct)
diff --git a/solution/data_structure/1021/main.py b/solution/data_structure/1021/main.py
deleted file mode 100644
index d888026..0000000
--- a/solution/data_structure/1021/main.py
+++ /dev/null
@@ -1,26 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/71a5091026cf4a1b836dc46c812aeaca
-import sys
-from collections import deque
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-arr = list(map(int, input().split()))
-queue = deque([i for i in range(1,N+1)])
-ans = 0
-for i in arr:
- idx = queue.index(i)
- if idx == 0:
- queue.popleft()
- else:
- if idx <= len(queue)//2:
- queue.rotate(-idx)
- queue.popleft()
- ans += idx
- else:
- queue.rotate(len(queue) - idx)
- ans += len(queue) - idx
- queue.popleft()
-print(ans)
\ No newline at end of file
diff --git a/solution/data_structure/10799/main.cpp b/solution/data_structure/10799/main.cpp
deleted file mode 100644
index d0eca1f..0000000
--- a/solution/data_structure/10799/main.cpp
+++ /dev/null
@@ -1,39 +0,0 @@
-// Authored by : tallua_y
-// Co-authored by : -
-// Link : http://boj.kr/6f2667a520d749d9adcee6ec0591da98
-#include
-
-using namespace std;
-
-int main()
-{
- ios::sync_with_stdio(false);
- cin.tie(nullptr);
-
- int total = 0;
- int pipe_stack = 0;
- bool is_opened = true;
-
- char ch;
- while (cin >> ch) {
- if (ch == '(') {
- // start of pipe
- pipe_stack++;
- is_opened = true;
- } else if (ch == ')' && is_opened) {
- // laser
- pipe_stack--;
- total += pipe_stack;
- is_opened = false;
- } else if (ch == ')' && !is_opened) {
- // end of pipe
- pipe_stack--;
- total += 1;
- is_opened = false;
- }
- }
-
- cout << total << '\n';
-
- return 0;
-}
diff --git a/solution/data_structure/10828/Main.java b/solution/data_structure/10828/Main.java
deleted file mode 100644
index f1d3d86..0000000
--- a/solution/data_structure/10828/Main.java
+++ /dev/null
@@ -1,87 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/011509a1ee6b4edf8c2b2b2630b9822f
-import java.lang.*;
-import java.util.*;
-import java.io.*;
-
-public class Main{
- static public void main(String[] args) {
- FastReader rd = new FastReader();
-
- int N = rd.nextInt();
-
- Stack stack = new Stack<>();
-
- StringBuilder out = new StringBuilder();
- for(int i=0;i
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
-
- stack st;
-
- for(int i=0;i> cmd;
- if(cmd == "push") {
- int X; cin >> X;
- st.push(X);
- }
- else if(cmd == "pop") {
- if(st.empty()) {
- cout << -1 << '\n';
- }
- else {
- cout << st.top() << '\n';
- st.pop();
- }
- }
- else if(cmd == "size") {
- cout << (int)st.size() << '\n';
- }
- else if(cmd == "empty") {
- cout << st.empty() << '\n';
- }
- else if(cmd == "top") {
- if(st.empty()) {
- cout << -1 << '\n';
- }
- else {
- cout << st.top() << '\n';
- }
- }
- }
-}
diff --git a/solution/data_structure/10828/main.py b/solution/data_structure/10828/main.py
deleted file mode 100644
index 6e26004..0000000
--- a/solution/data_structure/10828/main.py
+++ /dev/null
@@ -1,36 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/ab416f0794fc41cabc3d9ed46db29f60
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-
-stack = []
-
-for i in range(N):
- cmd = input().split()
- X = 0
- if len(cmd) == 2:
- X = cmd[1]
- cmd = cmd[0]
-
- if cmd == "push":
- stack.append(X)
- elif cmd == "pop":
- if len(stack) == 0:
- print(-1)
- else:
- print(stack[-1])
- stack.pop(-1)
- elif cmd == "size":
- print(len(stack))
- elif cmd == "empty":
- print(0 if len(stack) else 1)
- elif cmd == "top":
- if len(stack) == 0:
- print(-1)
- else:
- print(stack[-1])
diff --git a/solution/data_structure/10845/main.py b/solution/data_structure/10845/main.py
deleted file mode 100644
index b70e60e..0000000
--- a/solution/data_structure/10845/main.py
+++ /dev/null
@@ -1,37 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/89f5e4e54afb441bbf218b5e68a4160d
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-queue = deque()
-for i in range(N):
- command = input().split()
- if command[0] == "push":
- queue.append(command[1])
- elif command[0] == "pop":
- if queue:
- print(queue.popleft())
- else:
- print(-1)
- elif command[0] == "size":
- print(len(queue))
- elif command[0] == "empty":
- if not queue:
- print(1)
- else:
- print(0)
- elif command[0] == "front":
- if queue:
- print(queue[0])
- else:
- print(-1)
- elif command[0] == "back":
- if queue:
- print(queue[-1])
- else:
- print(-1)
\ No newline at end of file
diff --git a/solution/data_structure/10866/main.cpp b/solution/data_structure/10866/main.cpp
deleted file mode 100644
index eb74762..0000000
--- a/solution/data_structure/10866/main.cpp
+++ /dev/null
@@ -1,55 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/29a0795cb69c4aefa644a07f7019bbb9
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- deque dq;
- for(int i=0;i> cmd;
- if(cmd == "push_front") {
- int X; cin >> X;
- dq.push_front(X);
- }
- else if(cmd == "push_back") {
- int X; cin >> X;
- dq.push_back(X);
- }
- else if(cmd == "pop_front") {
- if(dq.empty()) cout << -1 << '\n';
- else {
- cout << dq.front() << '\n';
- dq.pop_front();
- }
- }
- else if(cmd == "pop_back") {
- if(dq.empty()) cout << -1 << '\n';
- else {
- cout << dq.back() << '\n';
- dq.pop_back();
- }
- }
- else if(cmd == "size") {
- cout << (int)dq.size() << '\n';
- }
- else if(cmd == "empty") {
- cout << dq.empty() << '\n';
- }
- else if(cmd == "front") {
- if(dq.empty()) cout << -1 << '\n';
- else cout << dq.front() << '\n';
- }
- else if(cmd == "back") {
- if(dq.empty()) cout << -1 << '\n';
- else cout << dq.back() << '\n';
- }
- }
-
- return 0;
-}
diff --git a/solution/data_structure/10866/main.py b/solution/data_structure/10866/main.py
deleted file mode 100644
index f8e2c3d..0000000
--- a/solution/data_structure/10866/main.py
+++ /dev/null
@@ -1,44 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/1cf1ea352dba44daa9768b67c7f109e9
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-queue = deque()
-N = int(input())
-for i in range(N):
- command = input().split()
- if command[0] == 'push_front':
- queue.appendleft(command[1])
- elif command[0] == 'push_back':
- queue.append(command[1])
- elif command[0] == 'pop_front':
- if queue:
- print(queue.popleft())
- else:
- print(-1)
- elif command[0] == 'pop_back':
- if queue:
- print(queue.pop())
- else:
- print(-1)
- elif command[0] == 'size':
- print(len(queue))
- elif command[0] == 'empty':
- if not queue:
- print(1)
- else:
- print(0)
- elif command[0] == 'front':
- if queue:
- print(queue[0])
- else:
- print(-1)
- elif command[0] == 'back':
- if queue:
- print(queue[-1])
- else:
- print(-1)
\ No newline at end of file
diff --git a/solution/data_structure/1158/main.cpp b/solution/data_structure/1158/main.cpp
deleted file mode 100644
index a4437c2..0000000
--- a/solution/data_structure/1158/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/d29720a15b49470bb1ec3f405e4decdb
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, K; cin >> N >> K;
- queue Q;
- for(int i=1;i<=N;i++) Q.push(i);
- cout << "<";
- while(true) {
- for(int i=1;i";
-
- return 0;
-}
diff --git a/solution/data_structure/1158/main.py b/solution/data_structure/1158/main.py
deleted file mode 100644
index f6ff278..0000000
--- a/solution/data_structure/1158/main.py
+++ /dev/null
@@ -1,18 +0,0 @@
-# Authored by : klm03025
-# Co-authored by : -
-# Link : http://boj.kr/1306fa8a1c5a4f4cab631f833d92636a
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, K = map(int, input().split())
-_list = []
-q = deque([i + 1 for i in range(N)])
-
-while len(q) != 0:
- q.rotate(-K)
- _list.append(q.pop())
-
-print('<' + ', '.join(map(str, _list)) + '>')
\ No newline at end of file
diff --git a/solution/data_structure/18258/main.cpp b/solution/data_structure/18258/main.cpp
deleted file mode 100644
index 41f76c1..0000000
--- a/solution/data_structure/18258/main.cpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/9bc206242acc4800a1f1df61d2b1b062
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int T; cin >> T;
- queue Q;
- while(T--) {
- string cmd; cin >> cmd;
- if(cmd == "push") {
- int X; cin >> X;
- Q.push(X);
- }
- else if(cmd == "pop") {
- if(Q.empty()) cout << -1 << '\n';
- else {
- cout << Q.front() << '\n';
- Q.pop();
- }
- }
- else if(cmd == "size") {
- cout << (int)Q.size() << '\n';
- }
- else if(cmd == "empty") {
- cout << Q.empty() << '\n';
- }
- else if(cmd == "front") {
- if(Q.empty()) cout << -1 << '\n';
- else cout << Q.front() << '\n';
- }
- else if(cmd == "back") {
- if(Q.empty()) cout << -1 << '\n';
- else cout << Q.back() << '\n';
- }
- }
-
- return 0;
-}
diff --git a/solution/data_structure/18258/main.py b/solution/data_structure/18258/main.py
deleted file mode 100644
index e450d52..0000000
--- a/solution/data_structure/18258/main.py
+++ /dev/null
@@ -1,37 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/6bf4491116ff480fab750a65591c134e
-
-import sys
-from collections import deque
-def input():
- return sys.stdin.readline().rstrip()
-
-queue = deque()
-N = int(input())
-for i in range(N):
- com = input().split()
- if com[0] == 'push':
- queue.append(com[1])
- elif com[0] == 'pop':
- if queue:
- print(queue.popleft())
- else:
- print(-1)
- elif com[0] == 'size':
- print(len(queue))
- elif com[0] == 'front':
- if queue:
- print(queue[0])
- else:
- print(-1)
- elif com[0] == 'back':
- if queue:
- print(queue[-1])
- else:
- print(-1)
- elif com[0] == 'empty':
- if not queue:
- print(1)
- else:
- print(0)
\ No newline at end of file
diff --git a/solution/data_structure/1874/main.cpp b/solution/data_structure/1874/main.cpp
deleted file mode 100644
index 6adcdef..0000000
--- a/solution/data_structure/1874/main.cpp
+++ /dev/null
@@ -1,51 +0,0 @@
-// Authored by : tallua_y
-// Co-authored by :
-// Link : http://boj.kr/98f5daa8e3a3430cb4a5998327fd56cf
-#include
-
-using namespace std;
-
-int main(int argc, char** argv)
-{
- ios::sync_with_stdio(false);
- cin.tie(nullptr);
-
- int N;
- cin >> N;
-
- int remain = 1;
- vector stack;
- stack.reserve(N);
-
- vector answer;
- answer.reserve(2 * N + 1);
-
- for (int n = 0; n < N; ++n) {
- int current;
- cin >> current;
-
- while (remain <= current) {
- stack.push_back(remain++);
- answer.push_back('+');
- answer.push_back('\n');
- }
-
- if (!stack.empty() && stack.back() == current) {
- stack.pop_back();
- answer.push_back('-');
- answer.push_back('\n');
- } else {
- answer.clear();
- answer.push_back('N');
- answer.push_back('O');
- answer.push_back('\n');
- break;
- }
- }
-
- // make c string
- answer.push_back(0);
- cout << answer.data();
-
- return 0;
-}
\ No newline at end of file
diff --git a/solution/data_structure/1918/main.cpp b/solution/data_structure/1918/main.cpp
deleted file mode 100644
index 370ef3e..0000000
--- a/solution/data_structure/1918/main.cpp
+++ /dev/null
@@ -1,50 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/1bff0abd9f2646ceb07d7fdb4b5ace97
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- string s; cin >> s;
- stack st;
- string answer = "";
- for(auto &ch: s) {
- if('A' <= ch && ch <= 'Z') answer += ch;
- else {
- if(ch == '(') st.push(ch);
- else if(ch == ')') {
- while(!st.empty() && st.top() != '(') {
- answer += st.top();
- st.pop();
- }
- st.pop();
- }
- else if(ch == '*' || ch == '/') {
- while(!st.empty() && (st.top() == '*' || st.top() == '/')) {
- answer += st.top();
- st.pop();
- }
- st.push(ch);
- }
- else if(ch == '+' || ch == '-') {
- while(!st.empty() && st.top() != '(') {
- answer += st.top();
- st.pop();
- }
- st.push(ch);
- }
- }
- }
- while(!st.empty()) {
- answer += st.top();
- st.pop();
- }
- cout << answer;
-
- return 0;
-}
-
diff --git a/solution/data_structure/1935/main.py b/solution/data_structure/1935/main.py
deleted file mode 100644
index 029df1e..0000000
--- a/solution/data_structure/1935/main.py
+++ /dev/null
@@ -1,45 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/db333837b5af4d84a2a5ba1dc83d2086
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-arr = input()
-oper = '+-*/'
-dic = {}
-stack = []
-num = deque()
-
-for i in range(N):
- num.append(int(input()))
-
-for i in arr:
- if i not in dic and i not in oper:
- dic[i] = num.popleft()
-
-for i in arr:
- if i not in oper:
- stack.append(dic[i])
- else:
- if i == '+':
- a = stack.pop()
- b = stack.pop()
- stack.append(b+a)
- elif i == '-':
- a = stack.pop()
- b = stack.pop()
- stack.append(b-a)
- elif i == '*':
- a = stack.pop()
- b = stack.pop()
- stack.append(b*a)
- else:
- a = stack.pop()
- b = stack.pop()
- stack.append(b/a)
-
-print(f"{stack[0]:.2f}")
diff --git a/solution/data_structure/1966/main.py b/solution/data_structure/1966/main.py
deleted file mode 100644
index d26f441..0000000
--- a/solution/data_structure/1966/main.py
+++ /dev/null
@@ -1,31 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/74b1e7adb56b425aa6644b3d2ea726e0
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-T = int(input())
-for i in range(T):
- queue = deque()
- queue2 = deque()
- ct = 1
- N,M = map(int, input().split())
- arr = list(map(int, input().split()))
- for j in range(len(arr)):
- queue.append(arr[j])
- queue2.append(j)
- while True:
- if queue[0] == max(queue):
- if queue2[0] == M:
- print(ct)
- break
- else:
- queue.popleft()
- queue2.popleft()
- ct += 1
- else:
- queue.rotate(-1)
- queue2.rotate(-1)
\ No newline at end of file
diff --git a/solution/data_structure/2164/main.cpp b/solution/data_structure/2164/main.cpp
deleted file mode 100644
index b2c1106..0000000
--- a/solution/data_structure/2164/main.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/cb5c5740111745b0b9f0fb6582da5bdd
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- queue Q;
- for(int i=1;i<=N;i++) Q.push(i);
- while((int)Q.size() > 1) {
- Q.pop();
- Q.push(Q.front());
- Q.pop();
- }
- cout << Q.front();
-
- return 0;
-}
diff --git a/solution/data_structure/2164/main.py b/solution/data_structure/2164/main.py
deleted file mode 100644
index add2b7e..0000000
--- a/solution/data_structure/2164/main.py
+++ /dev/null
@@ -1,21 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/3ad1b45ad3db4bf7b1bfc5227e1acd12
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-queue = deque()
-N = int(input())
-for i in range(1,N+1):
- queue.append(i)
-
-while True:
- a = queue.popleft()
- if not queue:
- print(a)
- break
- b = queue.popleft()
- queue.append(b)
\ No newline at end of file
diff --git a/solution/data_structure/22942/main.cpp b/solution/data_structure/22942/main.cpp
deleted file mode 100644
index e0b57c7..0000000
--- a/solution/data_structure/22942/main.cpp
+++ /dev/null
@@ -1,59 +0,0 @@
-// Authored by : tallua_y
-// Co-authored by :
-// Link : http://boj.kr/7637094ad3f24a62939ad2b4811c9f77
-#include
-
-using namespace std;
-
-struct circle_t {
- int begin;
- int end;
-};
-
-int main(int argc, char** argv) {
- ios::sync_with_stdio(false);
- cin.tie(nullptr);
-
- size_t N;
- cin >> N;
-
- vector circles(N);
- while (N--) {
- int x, r;
- cin >> x >> r;
-
- const int begin = x - r;
- const int end = x + r;
-
- circles[N] = {begin, end};
- }
-
- sort(circles.begin(), circles.end(), [](circle_t const& lhs, circle_t const& rhs) {
- return lhs.begin != rhs.begin ? lhs.begin < rhs.begin : lhs.end < rhs.end;
- });
-
- bool is_valid = true;
- vector end_stack;
- for (auto const& circle : circles) {
- // prune circle not ended
- while (!end_stack.empty() && end_stack.back() < circle.begin) {
- end_stack.pop_back();
- }
-
- // circle should not exist between other circle
- if (!end_stack.empty() && circle.begin <= end_stack.back() && end_stack.back() <= circle.end) {
- is_valid = false;
- break;
- }
-
- end_stack.push_back(circle.end);
- }
-
- if (is_valid) {
- cout << "YES\n";
- } else {
- cout << "NO\n";
- }
-
- return 0;
-}
diff --git a/solution/data_structure/2346/main.py b/solution/data_structure/2346/main.py
deleted file mode 100644
index b03fbda..0000000
--- a/solution/data_structure/2346/main.py
+++ /dev/null
@@ -1,23 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/71af42c3664749e48f8f0272c3c04fd2
-import sys
-from collections import deque
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-queue = deque(list(map(int, input().split())))
-queue2 = deque([i for i in range(1,N+1)])
-while queue:
- q = queue[0]
- if q > 0:
- queue.popleft()
- queue.rotate(-q+1)
- print(queue2.popleft())
- queue2.rotate(-q+1)
- else:
- queue.popleft()
- queue.rotate(-q)
- print(queue2.popleft())
- queue2.rotate(-q)
\ No newline at end of file
diff --git a/solution/data_structure/2493/Main.java b/solution/data_structure/2493/Main.java
deleted file mode 100644
index c224a74..0000000
--- a/solution/data_structure/2493/Main.java
+++ /dev/null
@@ -1,94 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/183e8c3f134847ccb55fc85f0d072a61
-
-import java.util.*;
-import java.io.*;
-
-class Pair {
- int x, y;
- Pair(int x, int y){
- this.x = x; // x는 건물의 높이를 갖는다.
- this.y = y; // y는 건물의 위치를 갖는다.
- }
- int getX() {
- return x;
- }
- int getY() {
- return y;
- }
-}
-
-public class Main {
- static int[] receive = new int[500010]; //수신받는 건물 위치 저장
- static Stack stack = new Stack<>();
-
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- int N = rd.nextInt();
- stack.push(new Pair(rd.nextInt(), 1));
-
- for(int i = 2;i <= N;i++) {
- int n = rd.nextInt();
-
- while(true) {
- // 우선 스택이 비어있는지 확인합니다
- // 비어있으면 자신보다 높은 건물은 앞에 존재하지 않으므로
- // receive 값은 0입니다
- if(stack.isEmpty() == true) {
- stack.push(new Pair(n, i));
- break;
- }
- // 자신보다 작은 건물들을 stack에서 pop합니다
- else if(stack.peek().getX() < n)
- stack.pop();
- // stack을 보다가 자기보다 높은 건물을 발견하면
- // 그 건물의 위치를 receive에 저장하고
- // stack에 push합니다
- else {
- receive[i] = stack.peek().getY();
- stack.push(new Pair(n, i));
- break;
- }
- }
- }
-
- for(int i = 1;i <= N;i++) {
- System.out.print(receive[i] + " ");
- }
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/data_structure/2493/main.cpp b/solution/data_structure/2493/main.cpp
deleted file mode 100644
index cded36a..0000000
--- a/solution/data_structure/2493/main.cpp
+++ /dev/null
@@ -1,24 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/b2e3a3c79d3f4e219827c39174c3238f
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- stack> st;
-
- st.emplace(100000005, 0);
- for(int i=1;i<=N;i++) {
- int x; cin >> x;
- while(!st.empty() && st.top().first < x) st.pop();
- cout << st.top().second << ' ';
- st.emplace(x, i);
- }
-
- return 0;
-}
diff --git a/solution/data_structure/2504/main.cpp b/solution/data_structure/2504/main.cpp
deleted file mode 100644
index 49a1186..0000000
--- a/solution/data_structure/2504/main.cpp
+++ /dev/null
@@ -1,52 +0,0 @@
-// Authored by : tallua_y
-// Co-authored by :
-// Link : http://boj.kr/48252863d9ae4860b54cfceb442110ba
-#include
-
-using namespace std;
-
-struct Token {
- int value;
- size_t pos;
-};
-
-int main(int argc, char** argv)
-{
- ios::sync_with_stdio(false);
- cin.tie(nullptr);
-
- string input;
- cin >> input;
-
- vector tokens;
- tokens.push_back({ 0, '$' });
- for (size_t head = 0; head < input.size(); ++head) {
- if (input[head] == '(' || input[head] == '[') {
- tokens.push_back({ 0, head });
- } else {
- const auto open_tag = (input[head] == ')' ? '(' : '[');
- if (tokens.empty() || input[tokens.back().pos] != open_tag) {
- tokens.clear();
- break;
- }
-
- Token token = tokens.back();
- tokens.pop_back();
-
- const auto designated_value = (input[head] == ')' ? 2 : 3);
- if (token.pos + 1 == head) {
- tokens.back().value += designated_value;
- } else {
- tokens.back().value += token.value * designated_value;
- }
- }
- }
-
- if (tokens.size() != 1) {
- cout << "0\n";
- } else {
- cout << tokens.back().value << '\n';
- }
-
- return 0;
-}
\ No newline at end of file
diff --git a/solution/data_structure/2504/main.py b/solution/data_structure/2504/main.py
deleted file mode 100644
index f012a21..0000000
--- a/solution/data_structure/2504/main.py
+++ /dev/null
@@ -1,67 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/a35de756ecf642b6b2e116f14ffd6093
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-s = input()
-stack = []
-
-# Check Bracket
-for ch in s:
- if ch == '(':
- stack.append('(')
- elif ch == '[':
- stack.append('[')
- elif ch == ')':
- if stack and stack[-1] == '(':
- stack.pop(-1)
- else:
- print(0)
- exit(0)
- else:
- if stack and stack[-1] == '[':
- stack.pop(-1)
- else:
- print(0)
- exit(0)
-
-if stack:
- print(0)
- exit(0)
-
-# [open bracket] + Integer + Integer => [open bracket] + Integer
-# compress (add) Integers
-def compress():
- # Integer를 하나로 합쳐야 하니깐 길이가 2 이상이어야 함.
- while len(stack) > 1:
- # 두 개의 값이 무조건 Integer이어야 하므로
- # Integer면 첫번째 원소가 None으로 되어 있음
- a, integer1 = stack[-1]
- b, integer2 = stack[-2]
- if a or b:
- break
- stack.pop()
- stack.pop()
- stack.append((None, integer1 + integer2))
-
-for ch in s:
- # open bracket -> append ( open bracket, ~ )
- if ch == '(':
- stack.append(('(', 2))
- elif ch == '[':
- stack.append(('[', 3))
- elif ch == ')' or ch == ']': # Must Be len(stack) ≥ 1
- last1, last2 = stack.pop()
- # Case 1 : ~~ open bracket
- if last1 != None:
- stack.append((None, last2))
- # Case 2 : ~~ open bracket, Integer,
- else:
- a, b = stack.pop()
- stack.append((None, last2 * b))
- compress()
-
-print(stack[-1][1])
diff --git a/solution/data_structure/2800/Main.java b/solution/data_structure/2800/Main.java
deleted file mode 100644
index 53f2d2e..0000000
--- a/solution/data_structure/2800/Main.java
+++ /dev/null
@@ -1,112 +0,0 @@
-// Authored by : kyj1991719
-// Co-authored by : -
-// Link : http://boj.kr/cb80d90792224a2395fc61cfe30f53b6
-
-import java.util.*;
-import java.lang.*;
-import java.io.*;
-
-public class Main {
- private static List bracketList = new ArrayList<>();
- private static List eqList = new ArrayList<>();
- private static String input;
-
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- input = rd.nextLine();
- Stack startStack = new Stack<>();
- for(int i = 0; i < input.length(); i++) {
- if(input.charAt(i) == '(') startStack.add(i);
- if(input.charAt(i) == ')') bracketList.add(new Bracket(startStack.pop(), i));
- }
-
- for(int i = 0; i < bracketList.size(); i++) {
- boolean[] removedArr = new boolean[input.length()];
- removedArr[bracketList.get(i).start] = true;
- removedArr[bracketList.get(i).end] = true;
- solve(i, removedArr);
- }
-
- List distinctList = new ArrayList<>(new HashSet<>(eqList));
- distinctList.sort((o1, o2) -> o1.compareTo(o2));
- StringBuilder sb = new StringBuilder();
- for(String tmp : distinctList) {
- sb.append(tmp);
- sb.append("\n");
- }
- System.out.print(sb.toString());
- }
-
- private static void solve(int idx, boolean[] removedArr) {
- if(idx == bracketList.size()) {
- addEq(removedArr);
- return;
- }
-
- for(int i = idx+1; i < bracketList.size(); i++) {
- Bracket bracket = bracketList.get(i);
-
- removedArr[bracket.start] = true;
- removedArr[bracket.end] = true;
- solve(i, removedArr);
- removedArr[bracket.start] = false;
- removedArr[bracket.end] = false;
- }
-
- solve(idx+1, removedArr);
- }
-
- private static void addEq(boolean[] removedArr) {
- StringBuilder sb = new StringBuilder();
- for(int i = 0; i < input.length(); i++) {
- if(removedArr[i]) continue;
- sb.append(input.charAt(i));
- }
- eqList.add(sb.toString());
- }
-
-
- static class Bracket {
- int start, end;
- public Bracket(int start, int end) {
- this.start = start;
- this.end = end;
- }
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/data_structure/2800/main.py b/solution/data_structure/2800/main.py
deleted file mode 100644
index fbecdbd..0000000
--- a/solution/data_structure/2800/main.py
+++ /dev/null
@@ -1,57 +0,0 @@
-# Authored by : tony9402
-# Co-authored by : -
-# Link : http://boj.kr/9908832547364dfd87342eb0a2a873ce
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-s = input()
-N = len(s)
-
-index = [ -1 for _ in range(N) ]
-stack = []
-current_index = 0
-
-# 올바른 괄호만 주어진다. 각 괄호 쌍에 차례대로 index를 붙여주고 기록하자.
-for idx, ch in enumerate(s):
- if ch == '(':
- stack.append(current_index)
- index[idx] = current_index
- current_index += 1
- elif ch == ')':
- index[idx] = stack.pop()
-
-# 각 괄호에 번호를 기록해놨다. 이제 재귀를 돌아 괄호쌍을 뽑자.
-answer = [] # 가능한 모든 것을 저장 후 정렬 후 출력하기 위해 사용
-
-# current_index ==> bracket count
-choose = [ 0 for _ in range(current_index) ]
-
-# cnt -> bracket index 번호
-def func(cnt):
- if cnt == current_index:
- erase_bracket_count = sum(choose)
- if erase_bracket_count == 0:
- return
-
- string = ""
- for idx, ch in enumerate(s):
- # index[idx] == -1 인 경우 (괄호가 아니므로 추가)
- # 만약 -1이면 뒤에 조건문이 실행 안됨
- if index[idx] == -1 or choose[index[idx]] == 0:
- string += ch
-
- answer.append(string)
- return
-
- choose[cnt] = 1 # 해당 괄호쌍을 지운 경우
- func(cnt + 1)
- choose[cnt] = 0 # 해당 괄호쌍을 지우지 않은 경우
- func(cnt + 1)
-
-# Run
-func(0)
-# 정답 중에 중복이 있을 수 있기 때문에 중복 제거
-answer = sorted(set(answer))
-print('\n'.join(answer))
diff --git a/solution/data_structure/3986/main.py b/solution/data_structure/3986/main.py
deleted file mode 100644
index 2e1d532..0000000
--- a/solution/data_structure/3986/main.py
+++ /dev/null
@@ -1,24 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/25fcff12eee34fb6a0f0d4023cac4e4d
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-ans = 0
-for i in range(N):
- stack = []
- a = input()
- for i in a:
- if not stack:
- stack.append(i)
- else:
- if stack[-1] == i:
- stack.pop()
- else:
- stack.append(i)
- if not stack:
- ans += 1
-print(ans)
\ No newline at end of file
diff --git a/solution/data_structure/5397/main.py b/solution/data_structure/5397/main.py
deleted file mode 100644
index 4b8c97d..0000000
--- a/solution/data_structure/5397/main.py
+++ /dev/null
@@ -1,28 +0,0 @@
-# // Authored by : chj3748
-# // Co-authored by : -
-# // Link : http://boj.kr/471d69f455a544769c6c2fa7199442d1
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-T = int(input())
-for test in range(T):
- answer_l = deque()
- answer_r = deque()
- for string in input():
- if string == '<':
- if answer_l:
- temp = answer_l.pop()
- answer_r.appendleft(temp)
- elif string == '>':
- if answer_r:
- temp = answer_r.popleft()
- answer_l.append(temp)
- elif string == '-':
- if answer_l:
- answer_l.pop()
- else:
- answer_l.append(string)
- print(''.join(answer_l + answer_r))
diff --git a/solution/data_structure/5430/Main.java b/solution/data_structure/5430/Main.java
deleted file mode 100644
index 5641229..0000000
--- a/solution/data_structure/5430/Main.java
+++ /dev/null
@@ -1,137 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/fc75d4683aa44fd5be618ed3934ac634
-
-/*
-시간이 빡빡해서 실제로 뒤집기, 삭제하기를 구현하면 안됩니다.
-뒤집기는 실제로 뒤집는 것이 아닌 앞에서 뒤로 읽는걸 뒤에서 앞으로 읽게 하였고
-삭제하기는 실제 삭제가 아닌 front포인터를 하나 증가시키는 식으로 구현했습니다.
-출력도 빠른 출력을 해야 시간초과가 나지 않습니다.
-*/
-
-import java.util.*;
-import java.io.*;
-
-public class Main {
- static ArrayList numlist = new ArrayList();
- static boolean reverse = false;
- static int front, end;
- static BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
-
- public static void main(String[] args) throws IOException {
- FastReader rd = new FastReader();
-
- int T = rd.nextInt();
-
- for(int i = 0;i < T;i++) {
- String p = rd.nextLine();
- int n = rd.nextInt();
-
- // inputString => tokenizer로 구분자 제거 후 list에 삽입
- InputString(rd.nextLine());
-
- boolean error = false;
- for(int j = 0;j < p.length();j++) {
- if(p.charAt(j) == 'R')
- ReverseList(); // ListReverse => 뒤집기
-
- else {
- if(front > end) {
- // 에러상황
- // front가 end보다 큰 상황은
- // front == end == 1 인 상황(list에 값이 하나)에서
- // 하나를 지운 후 상황이다. 즉 지울 것이 없는 상태
- bw.write("error\n");
- bw.flush();
- error = true;
- break;
- }
- else // 지울 수 있는 문자가 있을 때
- DeleteList(); // DeleteList => 0번 인덱스 삭제
- }
- }
- if(error == false) OutputList();
-
- numlist.clear();
- reverse = false;
- }
- bw.close();
- }
-
- static void OutputList() throws IOException{
- bw.write("[");
- // reverse가 false면 정상상태 => 앞(front) 뒤(end)방향으로 출력
- if(reverse == false) {
- for(int i = front;i <= end;i++) {
- if(i == end) bw.write(numlist.get(i));
- else bw.write(numlist.get(i) + ",");
- }
- }
- // reverse가 true면 뒤집힌 상태 => 뒤(end) 앞(front)방향으로 출력
- else {
- for(int i = end;i >= front;i--)
- if(i == front) bw.write(numlist.get(i));
- else bw.write(numlist.get(i) + ",");
- }
- bw.write("]\n");
- bw.flush();
- }
-
- static void DeleteList() {
- // 실제로 지우는 것이 아닌 가리키는 인덱스를 증가 또는 감소시킴
- // 정상 상태이면 앞 인덱스를 증가(앞을 삭제하게 되므로)
- // 뒤집힌 상태이면 뒤 인덱스를 감소(뒤가 가장 앞이 되므로)
- if(reverse == false) front++;
- else end--;
- }
-
- static void ReverseList() {
- // 실제로 뒤집는 것이 아닌 뒤집혀있는지 아닌지만 판단
- // 후에 출력할때 출력 순서를 바꾼다
- if(reverse == true) reverse = false;
- else reverse = true;
- }
-
- static void InputString(String numstr) {
- StringTokenizer st = new StringTokenizer(numstr, "[ | , | ]");
-
- while(st.hasMoreTokens())
- numlist.add(st.nextToken());
-
- front = 0;
- end = numlist.size() - 1;
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/data_structure/5430/main.py b/solution/data_structure/5430/main.py
deleted file mode 100644
index 3aa9e60..0000000
--- a/solution/data_structure/5430/main.py
+++ /dev/null
@@ -1,34 +0,0 @@
-# Authored by : cieske
-# Co-authored by : -
-# Link : http://boj.kr/cc59c57fb1534ac4831b7f44f87831be
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-t = int(input())
-for _ in range(t):
- oper = str(input())
- n = int(input())
- lst = str(input())[1:-1].split(',')
- if not lst[0].isdigit():
- lst = [] #빈 list가 들어올 경우 따로 처리
-
- l_p, r_p, front = 0, len(lst), True
- for p in oper:
- if p == 'R': #D operation이 일어날 위치 설정
- front = not front
- else: #D operation 수행
- if front: #앞에서 제거
- l_p += 1
- else: #뒤에서 제거
- r_p -= 1
- if l_p > r_p: #지울 수 없는데 지운 경우
- print('error')
- break
- if l_p <= r_p:
- if front:
- sol = lst[l_p:r_p]
- else:
- sol = list(reversed(lst[l_p:r_p]))
- print('['+','.join(sol)+']') #출력 형식 맞추기
\ No newline at end of file
diff --git a/solution/data_structure/9012/main.cpp b/solution/data_structure/9012/main.cpp
deleted file mode 100644
index 3c9873b..0000000
--- a/solution/data_structure/9012/main.cpp
+++ /dev/null
@@ -1,33 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/553d0936c1674183a249a58070467343
-#include
-
-using namespace std;
-
-string solve(string str) {
- stack st;
- for(int i=0;i<(int)str.size();i++){
- if(str[i] == '(') st.push('(');
- else {
- if(st.empty()) return "NO";
- st.pop();
- }
- }
-
- if(st.empty()) return "YES";
- return "NO";
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int T; cin >> T;
- while(T--) {
- string s; cin >> s;
- cout << solve(s) << '\n';
- }
-
- return 0;
-}
diff --git a/solution/data_structure/9012/main.py b/solution/data_structure/9012/main.py
deleted file mode 100644
index 9ced5fe..0000000
--- a/solution/data_structure/9012/main.py
+++ /dev/null
@@ -1,23 +0,0 @@
-# Authored by : klm03025
-# Co-authored by : -
-# Link : http://boj.kr/b57f1dad96a946e48e0679872d97d024
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-result = ""
-
-for i in range(N):
- testcase = input()
- cnt = 0
- for c in testcase:
- cnt += 1 if c == '(' else -1
- if cnt < 0:
- result += "NO\n"
- break
- else:
- result += "YES\n" if cnt == 0 else "NO\n"
-
-print(result)
\ No newline at end of file
diff --git a/solution/data_structure2/10546/main.py b/solution/data_structure2/10546/main.py
deleted file mode 100644
index c9388d4..0000000
--- a/solution/data_structure2/10546/main.py
+++ /dev/null
@@ -1,21 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/bb59bafb8ef04d69a5ab5ade6d7cfeb9
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-dic = {}
-for i in range(N):
- name = input()
- dic[name] = dic.get(name, 0) + 1
-
-for i in range(N-1):
- name = input()
- dic[name] -= 1
-
-dic_list = list(dic.items())
-dic_list.sort(key = lambda x : (-x[1], x[0]))
-print(dic_list[0][0])
diff --git a/solution/data_structure2/11279/main.cpp b/solution/data_structure2/11279/main.cpp
deleted file mode 100644
index 0d96b7f..0000000
--- a/solution/data_structure2/11279/main.cpp
+++ /dev/null
@@ -1,29 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/53d07a6885b1412d93b53a1fe211e153
-#include
-
-using namespace std;
-
-priority_queue pq;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- pq.push(0);
- for(int i=0;i> x;
- if(x == 0) {
- if(pq.empty()) cout << 0 << '\n';
- else {
- cout << pq.top() << '\n';
- pq.pop();
- }
- }
- else pq.push(x);
- }
-
- return 0;
-}
diff --git a/solution/data_structure2/11279/main.py b/solution/data_structure2/11279/main.py
deleted file mode 100644
index d725a5f..0000000
--- a/solution/data_structure2/11279/main.py
+++ /dev/null
@@ -1,19 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/2b2600bda1c447b7b7f2c2399b167716
-import sys
-import heapq
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-heap = []
-for i in range(N):
- a = int(input())
- if a == 0:
- if heap:
- print(-heapq.heappop(heap))
- else:
- print(0)
- heapq.heappush(heap, -a)
\ No newline at end of file
diff --git a/solution/data_structure2/11286/main.cpp b/solution/data_structure2/11286/main.cpp
deleted file mode 100644
index addcb1d..0000000
--- a/solution/data_structure2/11286/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/3866a743ca954b6fa27922ed08da2b5e
-#include
-
-using namespace std;
-
-priority_queue, vector>, greater>> pq;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- for(int i=0;i> x;
- if(x == 0) {
- if(pq.empty()) cout << 0 << '\n';
- else {
- cout << pq.top().second << '\n';
- pq.pop();
- }
- }
- else pq.emplace(abs(x), x);
- }
-
- return 0;
-}
diff --git a/solution/data_structure2/11286/main.py b/solution/data_structure2/11286/main.py
deleted file mode 100644
index 4bb9089..0000000
--- a/solution/data_structure2/11286/main.py
+++ /dev/null
@@ -1,20 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/29a558ec778348f589fad5c627187638
-import sys
-import heapq
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-heap = []
-for i in range(N):
- x = int(input())
- if x == 0:
- if heap:
- print(heapq.heappop(heap)[1])
- else:
- print(0)
- else:
- heapq.heappush(heap, [abs(x), x])
\ No newline at end of file
diff --git a/solution/data_structure2/1269/main.py b/solution/data_structure2/1269/main.py
deleted file mode 100644
index 06cae3d..0000000
--- a/solution/data_structure2/1269/main.py
+++ /dev/null
@@ -1,23 +0,0 @@
-# Authored by : chj3748
-# Co-authored by : -
-# Link : http://boj.kr/73b320e09628425c8d29b3c81287a865
-import sys
-from collections import defaultdict
-
-def input():
- return sys.stdin.readline().rstrip()
-
-len_a, len_b = map(int, input().split())
-dict_a = defaultdict(int)
-
-for number in map(int, input().split()):
- dict_a[number] = 1
-
-cnt = 0
-
-for number in map(int, input().split()):
- if dict_a[number]:
- cnt += 1
-
-answer = (len_a - cnt) + (len_b - cnt)
-print(answer)
\ No newline at end of file
diff --git a/solution/data_structure2/1302/main.py b/solution/data_structure2/1302/main.py
deleted file mode 100644
index a1311c3..0000000
--- a/solution/data_structure2/1302/main.py
+++ /dev/null
@@ -1,20 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/8adc986ae26b461eadd65abdff3cfba9
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-book = {}
-for i in range(N):
- name = input()
- if name not in book:
- book[name] = 1
- else:
- book[name] += 1
-
-book = list(book.items())
-book.sort(key = lambda x : (-x[1],x[0]))
-print(book[0][0])
diff --git a/solution/data_structure2/14425/main.cpp b/solution/data_structure2/14425/main.cpp
deleted file mode 100644
index 8071a9f..0000000
--- a/solution/data_structure2/14425/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/c8831b4a36e741ddb4ae083cc32902ef
-#include
-
-using namespace std;
-
-unordered_set st;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- for(int i=0;i> s;
- st.insert(s);
- }
-
- int answer = 0;
- for(int i=0;i> s;
- if(st.find(s) != st.end()) answer ++;
- }
- cout << answer;
-
- return 0;
-}
diff --git a/solution/data_structure2/14425/main.py b/solution/data_structure2/14425/main.py
deleted file mode 100644
index b3ced75..0000000
--- a/solution/data_structure2/14425/main.py
+++ /dev/null
@@ -1,20 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/efd53a96cfd04ca9ab21018162c3084d
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M = map(int, input().split())
-ans = 0
-dic = {}
-for i in range(N):
- a = input()
- dic[a] = 1
-for i in range(M):
- a = input()
- if a in dic:
- ans += 1
-print(ans)
\ No newline at end of file
diff --git a/solution/data_structure2/1620/main.cpp b/solution/data_structure2/1620/main.cpp
deleted file mode 100644
index ffac986..0000000
--- a/solution/data_structure2/1620/main.cpp
+++ /dev/null
@@ -1,34 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/9289c0621c6f41dabd5bfc2ba190a2ce
-#include
-
-using namespace std;
-
-unordered_map pokemon;
-unordered_map pokemonSeq;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, Q; cin >> N >> Q;
- for(int i=1;i<=N;i++){
- string s; cin >> s;
- string idx = to_string(i);
- pokemon[s] = idx;
- pokemonSeq[idx] = s;
- }
-
- while(Q--) {
- string s; cin >> s;
- if(isdigit(s[0])) {
- cout << pokemonSeq[s] << '\n';
- }
- else {
- cout << pokemon[s] << '\n';
- }
- }
-
- return 0;
-}
diff --git a/solution/data_structure2/1927/main.py b/solution/data_structure2/1927/main.py
deleted file mode 100644
index e479a03..0000000
--- a/solution/data_structure2/1927/main.py
+++ /dev/null
@@ -1,21 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/5d73f6bad59b42a58688435c855b9580
-import sys
-import heapq
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-heap = []
-
-for i in range(N):
- x = int(input())
- if x == 0:
- if not heap:
- print(0)
- else:
- print(heapq.heappop(heap))
- else:
- heapq.heappush(heap,x)
diff --git a/solution/data_structure2/2075/main.cpp b/solution/data_structure2/2075/main.cpp
deleted file mode 100644
index 025539a..0000000
--- a/solution/data_structure2/2075/main.cpp
+++ /dev/null
@@ -1,25 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/9d0a68ae0d4349238f376383cbaf13e0
-#include
-
-using namespace std;
-
-priority_queue, greater> pq;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- for(int i=0;i> x;
- pq.push(x);
- if((int)pq.size() > N) pq.pop();
- }
- }
- cout << pq.top();
-
- return 0;
-}
diff --git a/solution/data_structure2/21939/Main.java b/solution/data_structure2/21939/Main.java
deleted file mode 100644
index b7bcfb2..0000000
--- a/solution/data_structure2/21939/Main.java
+++ /dev/null
@@ -1,105 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/2e98c8f8a8b54b428eb5bc4a00e17491
-
-import java.util.*;
-import java.io.*;
-
-class Problem implements Comparable {
- int num, level;
- Problem(int num, int level){
- this.num = num;
- this.level = level;
- }
- // 난이도로 내림차순 정렬을 먼저 한 뒤
- // 같은 난이도에 대해서는 문제번호로 내림차순 정렬
- @Override
- public int compareTo(Problem op) {
- if(level < op.level) return 1;
- else if(level == op.level) {
- if(num < op.num) return 1;
- else if(num == op.num) return 0;
- else return -1;
- }
- else return -1;
- }
-}
-
-public class Main {
- static TreeSet tset = new TreeSet();
- static int[] problem = new int[100010];
- public static void main(String[] args) {
- FastReader rd = new FastReader();
- int N = rd.nextInt();
-
- // problem 배열에서 문제번호와 난이도를 저장하고
- // TreeSet을 이용하여 난이도, 문제번호 순으로 정렬합니다.
- for(int i = 0;i < N;i++) {
- int num = rd.nextInt();
- int lev = rd.nextInt();
- tset.add(new Problem(num, lev));
- problem[num] = lev;
- }
-
- int M = rd.nextInt();
- for(int i = 0;i < M;i++) {
- String command = rd.next();
-
- // "add" 명령시 TreeSet과 problem 배열에 추가
- if(command.equals("add")) {
- int num = rd.nextInt();
- int lev = rd.nextInt();
- tset.add(new Problem(num, lev));
- problem[num] = lev;
- }
- // "solved" 명령시 입력받은 문제번호와
- // 저장해놓은 문제번호의 난이도를 배열에서 찾은 후
- // TreeSet에서 삭제합니다.
- else if(command.equals("solved")) {
- int num = rd.nextInt();
- tset.remove(new Problem(num, problem[num]));
- }
- // recommend 1 은 가장 어렵고 큰 번호 이므로 첫 번째 값
- // recommend 2 는 가장 쉽고 작은 번호 이므로 마지막 값
- else {
- int n = rd.nextInt();
- if(n == 1)
- System.out.println(tset.first().num);
- else
- System.out.println(tset.last().num);
- }
- }
- }
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/data_structure2/21942/main.py b/solution/data_structure2/21942/main.py
deleted file mode 100644
index caf6768..0000000
--- a/solution/data_structure2/21942/main.py
+++ /dev/null
@@ -1,59 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/16de6b69c0ca419a908289ee440a407a
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def calculate_days_per_month():
- month_days = {1: 31, 2: 28, 3: 31, 4: 30, 5: 31, 6: 30, 7: 31, 8: 31, 9: 30, 10: 31, 11: 30, 12: 31}
- days = [0]
- for month, day in month_days.items():
- days.append(days[month-1] + day)
- return days
-
-month_days = calculate_days_per_month()
-
-def change_str(_str):
- date, time, item, person = _str.split()
- _, month, day = map(int, date.split('-')) # 년도 필요없음
- hour, minute = map(int, time.split(':'))
- return person, item, (month_days[month-1] + day) * 24 * 60 + hour * 60 + minute
-
-def solution(info, deadline_time, F):
- dic = {}
- people = {} # 벌금 낼 사람들
- for data in info:
- result = -1
- person, item, time = change_str(data)
- if person not in dic:
- dic[person] = {}
- if item in dic[person]:
- result = time - dic[person].pop(item)
- else:
- dic[person][item] = time
- if result > deadline_time:
- if person not in people:
- people[person] = 0
- people[person] += (result - deadline_time) * F
- if people:
- people = sorted(people.items(), key = lambda x: x[0])
- for person, pay in people:
- print('{} {}'.format(person, pay))
- else:
- print(-1)
-
-N, L, F = input().split()
-N, F = int(N), int(F)
-day, time = L.split('/')
-day = int(day)
-hour, minute = map(int, time.split(':'))
-deadline_time = day*24*60 + hour*60 + minute
-info = []
-for _ in range(N):
- _str = input()
- info.append(_str)
-
-solution(info, deadline_time, F)
diff --git a/solution/data_structure2/2696/main.cpp b/solution/data_structure2/2696/main.cpp
deleted file mode 100644
index 9dd7141..0000000
--- a/solution/data_structure2/2696/main.cpp
+++ /dev/null
@@ -1,52 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/c5acf6a6a2f24b4ca0c415fbe1947571
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int t; cin >> t;
- while(t--) {
- int n; cin >> n;
- priority_queue L;
- priority_queue, greater> R;
- vector answer;
- for(int i=0;i> x;
- R.push(x);
-
- while(L.size() < R.size()) {
- L.push(R.top());
- R.pop();
- }
- while(L.size() > R.size() + 1) {
- R.push(L.top());
- L.pop();
- }
- while(!L.empty() || !R.empty()) {
- int valueL = L.top();
- int valueR = R.top();
- if(valueL <= valueR) break;
- L.pop();
- R.pop();
- L.push(valueR);
- R.push(valueL);
- }
-
- if(i % 2 == 0) answer.push_back(L.top());
- }
- cout << answer.size() << '\n';
- for(int i=0;i<(int)answer.size();i++) {
- cout << answer[i];
- if(i + 1 != (int)answer.size() && (i + 1) % 10 == 0) cout << '\n';
- else cout << ' ';
- }
- cout << '\n';
- }
-
- return 0;
-}
diff --git a/solution/data_structure2/4358/main.cpp b/solution/data_structure2/4358/main.cpp
deleted file mode 100644
index 2a05f1f..0000000
--- a/solution/data_structure2/4358/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/8af3200059e848aaa9c06901b34bcef7
-#include
-
-using namespace std;
-
-map mp;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- string s;
- int total = 0;
- while(getline(cin, s)) {
- mp[s] += 1;
- total += 1;
- }
-
- cout.precision(4);
- cout << fixed;
- for(auto &[k, v]: mp) {
- cout << k << ' ' << v * 100.0 / total << '\n';
- }
-
- return 0;
-}
diff --git a/solution/data_structure2/7662/main.cpp b/solution/data_structure2/7662/main.cpp
deleted file mode 100644
index c15acc0..0000000
--- a/solution/data_structure2/7662/main.cpp
+++ /dev/null
@@ -1,48 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/3a213ad379ca457c87e01e73a8ddf8b2
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int t; cin >> t;
- while(t--) {
- map mp;
- int n; cin >> n;
- for(int i=0;i> cmd;
- int x;cin >> x;
-
- if(cmd == 'I') {
- mp[x] += 1;
- }
- else {
- if(mp.empty()) continue;
- if(x == -1) {
- if(mp.begin()->second == 1) {
- mp.erase(mp.begin()->first);
- }
- else {
- mp.begin()->second --;
- }
- }
- else {
- if(mp.rbegin()->second == 1) {
- mp.erase(mp.rbegin()->first);
- }
- else {
- mp.rbegin()->second --;
- }
- }
- }
- }
- if(mp.empty()) cout << "EMPTY\n";
- else cout << mp.rbegin()->first << ' ' << mp.begin()->first << '\n';
- }
-
- return 0;
-}
diff --git a/solution/data_structure2/7662/main.py b/solution/data_structure2/7662/main.py
deleted file mode 100644
index aa2fcc6..0000000
--- a/solution/data_structure2/7662/main.py
+++ /dev/null
@@ -1,50 +0,0 @@
-# Authored by : chj3748
-# Co-authored by : -
-# Link : http://boj.kr/2eb814a8afac4ceab99cbb89db78a2c6
-import sys
-import heapq
-from collections import defaultdict
-
-def input():
- return sys.stdin.readline().rstrip()
-
-for T in range(int(input())):
- max_q = []
- min_q = []
- total_ele_cnt = 0
- elements_cnt = defaultdict(int)
- for _ in range(int(input())):
- operator, number = input().split()
- if operator == 'I':
- number = int(number)
- heapq.heappush(max_q, -number)
- heapq.heappush(min_q, number)
- elements_cnt[number] += 1
- total_ele_cnt += 1
- else:
- if total_ele_cnt > 0:
- if number == '1':
- while True:
- del_num = -heapq.heappop(max_q)
- if elements_cnt[del_num] != 0:
- elements_cnt[del_num] -= 1
- break
- else:
- while True:
- del_num = heapq.heappop(min_q)
- if elements_cnt[del_num] != 0:
- elements_cnt[del_num] -= 1
- break
- total_ele_cnt -= 1
- if total_ele_cnt:
- while True:
- max_v = -heapq.heappop(max_q)
- if elements_cnt[max_v] != 0:
- break
- while True:
- min_v = heapq.heappop(min_q)
- if elements_cnt[min_v] != 0:
- break
- print(max_v, min_v)
- else:
- print('EMPTY')
\ No newline at end of file
diff --git a/solution/disjoint_set/1043/main.cpp b/solution/disjoint_set/1043/main.cpp
deleted file mode 100644
index d9b4770..0000000
--- a/solution/disjoint_set/1043/main.cpp
+++ /dev/null
@@ -1,65 +0,0 @@
-// Authored by : xhdxhl
-// Co-authored by : -
-// Link : http://boj.kr/d4f08f292aed46729e98bea45c026da6
-
-#include
-using namespace std;
-
-int n, m, k, parent[51];
-
-vector know;
-vector > v(51);
-
-int find(int x) {
- if (parent[x] == x) return x;
- return parent[x] = find(parent[x]);
-}
-
-void merge(int x, int y) {
- x = find(x);
- y = find(y);
- parent[x] = y;
-}
-
-int main(void) {
- ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
-
- cin >> n >> m >> k;
-
- while (k--) {
- int t;
- cin >> t;
- know.push_back(t);
- }
-
- for (int i = 1; i <= n; i++) parent[i] = i;
-
- for (int i = 0; i < m; i++) {
- int p, num, prev;
- cin >> p;
- for (int j = 0; j < p; j++) {
- if (j >= 1) {
- prev = num;
- cin >> num;
- merge(prev, num);
- }
- else cin >> num;
- v[i].push_back(num);
- }
- }
-
- for (auto& list : v) {
- bool flag = false;
- for (auto& person : list) {
- for (auto& t : know) {
- if (find(person) == find(t)) {
- flag = true;
- break;
- }
- }
- if (flag) break;
- }
- if(flag) m--;
- }
- cout << m;
-}
diff --git a/solution/disjoint_set/10775/main.cpp b/solution/disjoint_set/10775/main.cpp
deleted file mode 100644
index c742c33..0000000
--- a/solution/disjoint_set/10775/main.cpp
+++ /dev/null
@@ -1,41 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/f71cbcd7b21940189fe6db7f99852f09
-#include
-
-using namespace std;
-
-constexpr int MAXN = 100005;
-int uf[MAXN];
-
-int find(int x) {
- if(uf[x] < 0) return x;
- return uf[x] = find(uf[x]);
-}
-
-bool merge(int a, int b){
- a = find(a);
- b = find(b);
- if(a == b)return false;
- uf[b] = a;
- return true;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- for(int i=0;i<=N;i++) uf[i] = -1;
- int answer = 0;
- for(int i=0;i> x;
- int cur = find(x);
- if(cur == 0) break;
- merge(cur - 1, cur);
- answer ++;
- }
- cout << answer;
-
- return 0;
-}
diff --git a/solution/disjoint_set/10775/main.py b/solution/disjoint_set/10775/main.py
deleted file mode 100644
index 00a2981..0000000
--- a/solution/disjoint_set/10775/main.py
+++ /dev/null
@@ -1,27 +0,0 @@
-# Authored by : chj3748
-# Co-authored by : -
-# Link : http://boj.kr/30c745d5f3c547c28e95b5c9a76647c1
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-G = int(input())
-P = int(input())
-gates = list(range(G + 1))
-
-def find_max(x):
- if gates[x] != x:
- gates[x] = find_max(gates[x])
- return gates[x]
-
-answer = 0
-for _ in range(P):
- plane = int(input())
- gate_n = find_max(plane)
- if gate_n == 0:
- print(answer)
- sys.exit(0)
- answer += 1
- gates[gate_n] = gates[gate_n - 1]
-print(answer)
diff --git a/solution/disjoint_set/16562/main.cpp b/solution/disjoint_set/16562/main.cpp
deleted file mode 100644
index 601c76c..0000000
--- a/solution/disjoint_set/16562/main.cpp
+++ /dev/null
@@ -1,44 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/caef773ebb994d6e854c390d5fe22057
-#include
-
-using namespace std;
-
-int uf[10101], arr[10101];
-
-int find(int x) {
- if(uf[x] < 0) return x;
- return uf[x] = find(uf[x]);
-}
-
-bool merge(int a, int b) {
- a = find(a);
- b = find(b);
- if(a == b) return false;
- uf[b] = a;
- arr[a] = min(arr[a], arr[b]);
- arr[b] = 0;
- return true;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int n, m, k; cin >> n >> m >> k;
- for(int i=1;i<=n;i++) {
- uf[i] = -1;
- cin >> arr[i];
- }
- for(int i=0;i> a >> b;
- merge(a, b);
- }
- int answer = 0;
- for(int i=1;i<=n;i++) answer += arr[i];
- if(answer > k) cout << "Oh no";
- else cout << answer;
-
- return 0;
-}
diff --git a/solution/disjoint_set/1717/main.cpp b/solution/disjoint_set/1717/main.cpp
deleted file mode 100644
index 6e5ff20..0000000
--- a/solution/disjoint_set/1717/main.cpp
+++ /dev/null
@@ -1,39 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/681761d952b14fd58d55c93eaf11c0ef
-#include
-
-using namespace std;
-
-int uf[1000005];
-
-int find(int x) {
- if(uf[x] < 0) return x;
- return uf[x] = find(uf[x]);
-}
-
-bool merge(int a, int b) {
- a = find(a);
- b = find(b);
- if(a == b)return false;
- uf[b] = a;
- return true;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- for(int i=0;i<=N;i++) uf[i] = -1;
- for(int i=0;i> t >> a >> b;
- if(t == 1) {
- if(find(a) == find(b)) cout << "YES\n";
- else cout << "NO\n";
- }
- else merge(a, b);
- }
-
- return 0;
-}
diff --git a/solution/disjoint_set/1717/main.py b/solution/disjoint_set/1717/main.py
deleted file mode 100644
index f3e5181..0000000
--- a/solution/disjoint_set/1717/main.py
+++ /dev/null
@@ -1,43 +0,0 @@
-# Authored by : cieske
-# Co-authored by : -
-# Link : http://boj.kr/69e732906ee9469bbd233ff0ed09bafb
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-n, m = map(int, input().split())
-dis_set = [-1]*(n+1)
-
-#Disjoint set 관련 함수
-def upward(x, update_lst):
- if dis_set[x] < 0: # 해당 disjoint set의 최상단 root를 찾음
- return x
- # x가 root가 아니라면 update_lst에 추가하고 root를 찾아감
- update_lst.append(x)
- return upward(dis_set[x], update_lst)
-
-def find(x):
- update_lst = [] # x가 속한 disjoint set에서 path compression을 위해 root update가 필요한 node set
- root = upward(x, update_lst) # x가 속한 disjoint set의 root
- for idx in update_lst: # Path compression
- dis_set[idx] = root
- return root
-
-def union(x, y):
- x_root = find(x)
- y_root = find(y)
- if x_root != y_root: #두 node의 root가 다르다면 -> 합쳐야 함
- dis_set[y_root] = x_root
-
-
-for _ in range(m):
- oper, x, y = map(int, input().split())
- if oper: # Check
- if find(x) == find(y):
- print("YES")
- else:
- print("NO")
-
- else: # Union
- union(x, y)
diff --git a/solution/disjoint_set/17352/main.cpp b/solution/disjoint_set/17352/main.cpp
deleted file mode 100644
index 559df2e..0000000
--- a/solution/disjoint_set/17352/main.cpp
+++ /dev/null
@@ -1,47 +0,0 @@
-// Authored by : bakh1
-// Co-authored by : -
-// Link : http://boj.kr/a55613bb803d46ce8e3cbc399ac6427d
-
-#include
-using namespace std;
-#define SET_SIZE 300010
-
-struct DisjointSet{
- int parent[SET_SIZE];
-
- int find(int x){
- if(parent[x] == x) return x;
- return parent[x] = find(parent[x]);
- }
- void Union(int x, int y){
- x=find(x); y=find(y);
- if(x!=y) parent[y]=x;
- }
- DisjointSet(){
- for(int i=0; i> N;
- for(int i=0; i < N-2; i++) {
- cin>>a>>b;
- st.Union(a,b);
- }
-
- prev = st.find(1);
-
- for(int i=1; i<=N; i++){
- if(st.find(i) != prev){
- cout << prev << " " << st.find(i) << "\n";
- break;
- }
- prev = st.find(i);
- }
-
- return 0;
-}
diff --git a/solution/disjoint_set/18116/main.cpp b/solution/disjoint_set/18116/main.cpp
deleted file mode 100644
index 2f466f3..0000000
--- a/solution/disjoint_set/18116/main.cpp
+++ /dev/null
@@ -1,47 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/7a6068ec74014cc68c29b63fd59c25ea
-#include
-
-using namespace std;
-
-const int MAXN = 1000005;
-int uf[MAXN], cnt[MAXN];
-
-int find(int x) {
- if(uf[x] < 0) return x;
- return uf[x] = find(uf[x]);
-}
-
-bool merge(int a, int b) {
- a = find(a);
- b = find(b);
- if(a == b)return false;
- uf[b] = a;
- cnt[a] += cnt[b];
- return true;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- for(int i=0;i> cmd;
- if(cmd == 'I') {
- int a, b; cin >> a >> b;
- merge(a, b);
- }
- else {
- int a; cin >> a;
- cout << cnt[find(a)] << '\n';
- }
- }
-
- return 0;
-}
diff --git a/solution/disjoint_set/1976/main.cpp b/solution/disjoint_set/1976/main.cpp
deleted file mode 100644
index a9b3406..0000000
--- a/solution/disjoint_set/1976/main.cpp
+++ /dev/null
@@ -1,46 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/18fb3fd9e39e4f0eb7cb530d83a16848
-#include
-
-using namespace std;
-
-int uf[40404];
-
-int find(int x) {
- if(uf[x] < 0) return x;
- return uf[x] = find(uf[x]);
-}
-
-bool merge(int a, int b) {
- a = find(a);
- b = find(b);
- if(a == b)return false;
- uf[b] = a;
- return true;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- for(int i=0;i<=N;i++)uf[i] = -1;
- for(int i=1;i<=N;i++){
- for(int j=1;j<=N;j++) {
- int x;cin >> x;
- if(x) merge(i, j);
- }
- }
- int pre; cin >> pre;
- bool answer = true;
- for(int i=1;i> cur;
- if(find(pre) != find(cur)) answer = false;
- pre = cur;
- }
- if(answer) cout << "YES";
- else cout << "NO";
-
- return 0;
-}
diff --git a/solution/disjoint_set/1976/main.py b/solution/disjoint_set/1976/main.py
deleted file mode 100644
index de3c3c3..0000000
--- a/solution/disjoint_set/1976/main.py
+++ /dev/null
@@ -1,45 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/a5ab5f0d45ed4e5584f0444987ba6c9a
-
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def union(x,y):
- x = find_parent(x)
- y = find_parent(y)
- if x < y:
- parent[y] = x
- else:
- parent[x] = y
-
-def find_parent(x):
- if parent[x] != x:
- parent[x] = find_parent(parent[x])
- return parent[x]
-
-N = int(input())
-M = int(input())
-parent = [i for i in range(N)]
-arr = []
-for i in range(N):
- arr.append(list(map(int, input().split())))
-for i in range(N):
- for j in range(N):
- if arr[i][j] == 1:
- a = find_parent(i)
- b = find_parent(j)
- union(a,b)
-ans = list(map(int, input().split()))
-flag = 0
-standard = ans[0] - 1
-for i in range(1, len(ans)):
- if parent[standard] != parent[ans[i]-1]:
- flag = 1
- break
-if not flag:
- print('YES')
-else:
- print('NO')
\ No newline at end of file
diff --git a/solution/disjoint_set/4195/main.cpp b/solution/disjoint_set/4195/main.cpp
deleted file mode 100644
index 8be6838..0000000
--- a/solution/disjoint_set/4195/main.cpp
+++ /dev/null
@@ -1,48 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/03ac57850f3e4b83b42d8300cccc91fb
-#include
-
-using namespace std;
-
-constexpr int MAXN = 200005;
-int uf[MAXN], siz[MAXN];
-
-int find(int x) {
- if(uf[x] < 0) return x;
- return uf[x] = find(uf[x]);
-}
-
-bool merge(int a, int b) {
- a = find(a); b = find(b);
- if(a == b)return false;
- uf[b] = a;
- siz[a] += siz[b];
- return true;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int t; cin >> t;
- while(t--){
- for(int i=0;i> n;
- unordered_map mp;
- int idx = 0;
-
- for(int i=0;i> a >> b;
- if(mp.count(a) == 0) mp[a] = idx++;
- if(mp.count(b) == 0) mp[b] = idx++;
- merge(mp[a], mp[b]);
- cout << siz[find(mp[a])] << '\n';
- }
- }
-
- return 0;
-}
diff --git a/solution/divide_and_conquer/1074/main.cpp b/solution/divide_and_conquer/1074/main.cpp
deleted file mode 100644
index 36d1a58..0000000
--- a/solution/divide_and_conquer/1074/main.cpp
+++ /dev/null
@@ -1,24 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/fba04fa859d540fab6cad5266780f137
-#include
-
-using namespace std;
-
-int solve(int y, int x, int s) {
- if(s == 2) return 2 * y + x;
- s >>= 1;
- int ny = y / s, nx = x / s;
- int nxt = ny * 2 + nx;
- return s * s * nxt + solve(y - ny * s, x - nx * s, s);
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, R, C; cin >> N >> R >> C;
- cout << solve(R, C, 1 << N);
-
- return 0;
-}
diff --git a/solution/divide_and_conquer/17829/main.cpp b/solution/divide_and_conquer/17829/main.cpp
deleted file mode 100644
index 19d4c59..0000000
--- a/solution/divide_and_conquer/17829/main.cpp
+++ /dev/null
@@ -1,54 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/aa7f1c4041eb4941a1366dd8229e70a4
-#include
-
-using namespace std;
-
-constexpr int MAXN = 1025;
-int arr[MAXN][MAXN], tmp[MAXN][MAXN];
-
-void f(int y, int x, int s) {
- if(s == 2) {
- int value[4] = { 0 };
- for(int i=0;i<2;i++){
- for(int j=0;j<2;j++){
- value[i * 2 + j] = arr[y + i][x + j];
- }
- }
- sort(value, value + 4);
- tmp[y / 2][x / 2] = value[2];
- return;
- }
-
- s /= 2;
- f(y , x , s);
- f(y + s, x , s);
- f(y , x + s, s);
- f(y + s, x + s, s);
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- for(int i=0;i> arr[i][j];
- }
- }
-
- while(N != 1) {
- f(0, 0, N);
- N /= 2;
- for(int i=0;i
-
-using namespace std;
-typedef long long ll;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- ll N; cin >> N;
- ll cnt = 0;
- while(N){
- ll cur = 1;
- while(cur * 2 < N) cur <<= 1;
- N -= cur;
- cnt ++;
- }
- ll ans = ~cnt & 1;
- cout << ans;
-
- return 0;
-}
-
diff --git a/solution/divide_and_conquer/1992/main.cpp b/solution/divide_and_conquer/1992/main.cpp
deleted file mode 100644
index 3c013ba..0000000
--- a/solution/divide_and_conquer/1992/main.cpp
+++ /dev/null
@@ -1,40 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/f4a1319fd1af4655b19f5c7cd7872b92
-#include
-
-using namespace std;
-
-char arr[66][66];
-string answer;
-
-void solve(int y, int x, int s) {
- bool flag = true;
- for(int i=0;i> N;
- for(int i=0;i> arr[i];
- solve(0, 0, N);
- cout << answer;
-
- return 0;
-}
diff --git a/solution/divide_and_conquer/2447/main.cpp b/solution/divide_and_conquer/2447/main.cpp
deleted file mode 100644
index d297dd7..0000000
--- a/solution/divide_and_conquer/2447/main.cpp
+++ /dev/null
@@ -1,47 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/619d768333f74fce8dd3e0cdd129a675
-#include
-
-using namespace std;
-
-bool arr[6666][6666];
-
-void solve(int y, int x, int size) {
- if(size == 3) {
- for(int i=0;i<3;i++) {
- for(int j=0;j<3;j++) {
- if(i == 1 && j == 1)continue;
- arr[y + i][x + j] = true;
- }
- }
- return;
- }
- size /= 3;
- solve(y + 0 * size, x + 0 * size, size);
- solve(y + 0 * size, x + 1 * size, size);
- solve(y + 0 * size, x + 2 * size, size);
- solve(y + 1 * size, x + 0 * size, size);
-
- solve(y + 1 * size, x + 2 * size, size);
- solve(y + 2 * size, x + 0 * size, size);
- solve(y + 2 * size, x + 1 * size, size);
- solve(y + 2 * size, x + 2 * size, size);
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- solve(0, 0, N);
- for(int i=0;i
-
-using namespace std;
-
-char stars[3500][6500];
-char DB[3][6] = {
- " * ",
- " * * ",
- "*****"
-};
-
-void solve(int y, int x, int s) {
- if(s == 1) {
- for(int i=0;i<3;i++){
- for(int j=0;j<5;j++){
- stars[y + i][x + j] = DB[i][j];
- }
- }
- return;
- }
- s /= 2;
- solve(y, x + 3 * s, s);
- solve(y + 3 * s, x, s);
- solve(y + 3 * s, x + 6 * s, s);
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int n; cin >> n;
- solve(0, 0, n / 3);
- for(int i=0;i
-
-using namespace std;
-
-int arr[150][150], answer[2];
-
-void solve(int y, int x, int size) {
- bool flag = true;
- for(int i=0;i> N;
- for(int i=0;i> arr[i][j];
- }
- }
-
- solve(0, 0, N);
- cout << answer[0] << '\n' << answer[1];
-
- return 0;
-}
diff --git a/solution/divide_and_conquer/4256/main.cpp b/solution/divide_and_conquer/4256/main.cpp
deleted file mode 100644
index 77d3fba..0000000
--- a/solution/divide_and_conquer/4256/main.cpp
+++ /dev/null
@@ -1,35 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/320c53a7494341c0b867034b59ec4377
-#include
-
-using namespace std;
-
-vector preorder, inorder;
-void solve(int L, int R, int L2, int R2) {
- if(L > R || L2 > R2) return;
- int root = preorder[L];
- int idx = L2;
- while(inorder[idx] != root) idx ++;
- solve(L + 1, L + idx - L2, L2, idx - 1);
- solve(L + idx - L2 + 1, R, idx + 1, R2);
- cout << root << ' ';
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int t; cin >> t;
- while(t--) {
- int n; cin >> n;
- preorder.clear(); preorder.resize(n);
- inorder.clear(); inorder.resize(n);
- for(int i=0;i> preorder[i];
- for(int i=0;i> inorder[i];
- solve(0, n - 1, 0, n - 1);
- cout << '\n';
- }
-
- return 0;
-}
diff --git a/solution/divide_and_conquer/4779/main.cpp b/solution/divide_and_conquer/4779/main.cpp
deleted file mode 100644
index e955c62..0000000
--- a/solution/divide_and_conquer/4779/main.cpp
+++ /dev/null
@@ -1,36 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/5aee7052f3ee45d5b0294edfb54c92f1
-#include
-
-using namespace std;
-
-string answer;
-
-void dfs(int L, int dis) {
- if(dis == 1) {
- answer[L] = '-';
- return;
- }
-
- dis /= 3;
- dfs(L, dis);
- dfs(L + 2 * dis, dis);
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int k;
- while(cin >> k) {
- int N = 1;
- for(int i = 0; i < k; i++) N *= 3;
- answer = string(N, ' ');
- dfs(0, N);
- cout << answer << '\n';
- }
-
- return 0;
-}
-
diff --git a/solution/dynamic_programming_1/1010/Main.java b/solution/dynamic_programming_1/1010/Main.java
deleted file mode 100644
index c4e4b19..0000000
--- a/solution/dynamic_programming_1/1010/Main.java
+++ /dev/null
@@ -1,64 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/00ddd7d473554b639c5e65eb1e1d8269
-
-import java.util.*;
-import java.io.*;
-
-public class Main {
- static int[][] dp = new int[30][30];
-
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- int T = rd.nextInt();
-
- // 조합공식을 이용하여 풀이가능 (M C N)
- dp[0][0] = 1;
- for(int j = 1;j < 30;j++) {
- dp[j][0] = 1;
- for(int k = 1;k <= j;k++)
- dp[j][k] = dp[j - 1][k - 1] + dp[j - 1][k];
- }
-
- for(int i = 0;i < T;i++) {
- int N = rd.nextInt();
- int M = rd.nextInt();
-
- System.out.println(dp[M][N]);
- }
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/dynamic_programming_1/1010/main.cpp b/solution/dynamic_programming_1/1010/main.cpp
deleted file mode 100644
index 5d6aae1..0000000
--- a/solution/dynamic_programming_1/1010/main.cpp
+++ /dev/null
@@ -1,29 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/4a2e9c2a7d9a44e7b0c4eda2c2cae10b
-#include
-
-using namespace std;
-typedef long long ll;
-
-ll DP[33][33];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int T; cin >> T;
- DP[0][0] = 1;
- for(int i=1;i<=30;i++) {
- DP[i][0] = 1;
- for(int j=1;j<=30;j++) {
- DP[i][j] = DP[i - 1][j] + DP[i - 1][j - 1];
- }
- }
- while(T--) {
- int N, M; cin >> N >> M;
- cout << DP[M][N] << '\n';
- }
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/1010/main.py b/solution/dynamic_programming_1/1010/main.py
deleted file mode 100644
index 2153d9e..0000000
--- a/solution/dynamic_programming_1/1010/main.py
+++ /dev/null
@@ -1,20 +0,0 @@
-# Authored by : gkgg123
-# Co-authored by : -
-# Link : https://www.acmicpc.net/source/share/6c285d8c7b9c44af971645f45c06d848
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-T = int(input())
-
-dp = [[0 for _ in range(31)] for _ in range(31)]
-dp[0][0] = 1
-
-for num in range(1,31):
- dp[num][0] = 1
- for pick in range(1,31):
- dp[num][pick] = dp[num-1][pick] + dp[num-1][pick-1]
-
-for _ in range(T):
- N, M = map(int,input().split())
- print(dp[M][N])
diff --git a/solution/dynamic_programming_1/10164/main.cpp b/solution/dynamic_programming_1/10164/main.cpp
deleted file mode 100644
index 494bf08..0000000
--- a/solution/dynamic_programming_1/10164/main.cpp
+++ /dev/null
@@ -1,37 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/17e87614b6d540ca996295b147a740d5
-#include
-
-using namespace std;
-
-int N, M, K;
-int DP[22][22];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- cin >> N >> M >> K;
- int y = N, x = M;
- if(K > 0) {
- --K;
- y = K / M + 1, x = K % M + 1; // 1 - based
- }
- DP[1][1] = 1;
- for(int i=1;i<=y; i++) {
- for(int j=1;j<=x;j++) {
- if(i == 1 && j == 1) continue;
- DP[i][j] = DP[i][j - 1] + DP[i - 1][j];
- }
- }
- for(int i=y;i<=N;i++){
- for(int j=x;j<=M;j++){
- if(i == y && j == x) continue;
- DP[i][j] = DP[i][j - 1] + DP[i - 1][j];
- }
- }
- cout << DP[N][M];
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/10870/main.cpp b/solution/dynamic_programming_1/10870/main.cpp
deleted file mode 100644
index c011b73..0000000
--- a/solution/dynamic_programming_1/10870/main.cpp
+++ /dev/null
@@ -1,22 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/4c48767c6ca14f2fbef014b726303f33
-#include
-
-using namespace std;
-
-int DP[25];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- DP[0] = 0;
- DP[1] = 1;
- for(int i=2;i<=20;i++){
- DP[i] = DP[i - 1] + DP[i - 2];
- }
-
- int N; cin >> N;
- cout << DP[N];
-}
diff --git a/solution/dynamic_programming_1/11048/main.cpp b/solution/dynamic_programming_1/11048/main.cpp
deleted file mode 100644
index 88726cd..0000000
--- a/solution/dynamic_programming_1/11048/main.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/4ff69fc575384408beee739a7904de45
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, M; cin >> N >> M;
- vector> DP(N + 1, vector(M + 1));
- for(int i=1;i<=N;i++) {
- for(int j=1;j<=M;j++) {
- int x; cin >> x;
- DP[i][j] = max({DP[i-1][j], DP[i][j-1], DP[i-1][j-1]}) + x;
- }
- }
- cout << DP[N][M];
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/11053/main.cpp b/solution/dynamic_programming_1/11053/main.cpp
deleted file mode 100644
index b134995..0000000
--- a/solution/dynamic_programming_1/11053/main.cpp
+++ /dev/null
@@ -1,26 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/67f06494af394db6958644f6cb20e8fe
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- vector V(N), DP(N);
- for(auto &i: V) cin >> i;
- for(int i=0;i V[j]) {
- DP[i] = max(DP[i], DP[j] + 1);
- }
- }
- }
- cout << *max_element(DP.begin(), DP.end());
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/11055/main.cpp b/solution/dynamic_programming_1/11055/main.cpp
deleted file mode 100644
index 857d10e..0000000
--- a/solution/dynamic_programming_1/11055/main.cpp
+++ /dev/null
@@ -1,26 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/038f38ed8c6f41149b051350cb3cabd1
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- vector V(N), DP(N);
- for(auto &i: V) cin >> i;
- for(int i=0;i V[j]) {
- DP[i] = max(DP[i], DP[j] + V[i]);
- }
- }
- }
- cout << *max_element(DP.begin(), DP.end());
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/1106/Main.java b/solution/dynamic_programming_1/1106/Main.java
deleted file mode 100644
index 473e60b..0000000
--- a/solution/dynamic_programming_1/1106/Main.java
+++ /dev/null
@@ -1,83 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/f27ceec311074b119fc847208aad7a4a
-
-import java.util.*;
-import java.io.*;
-
-class Pair{
- private int cost, customer;
- Pair(int cost, int customer) {
- this.cost = cost;
- this.customer = customer;
- }
- public int getCo() { return cost; }
- public int getCu() { return customer; }
-}
-
-public class Main {
- // dp[i]는 i의 비용으로 몇명의 고객을 늘릴 수 있는지
- // 최대 : 100원으로 1명의 인원이 늘어날 수 있고 1000명을 모집해야 한다면
- // 100 * 1000 = 100000 만큼 필요
- static Pair[] city = new Pair[30]; // 도시의 수
- static int[] dp = new int[100010];
-
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- int C = rd.nextInt();
- int N = rd.nextInt();
-
- for(int i = 0;i < N;i++) {
- int x = rd.nextInt();
- int y = rd.nextInt();
- city[i] = new Pair(x,y);
- }
-
- // dp[i], 즉 i의 돈으로 홍보 할 수 있는 최대의 인원을 각 도시를 돌면서 확인하여 최대값으로 갱신합니다.
- for(int i = 1;i < 100001;i++) {
- for(int j = 0;j < N;j++) {
- if(city[j].getCo() <= i)
- dp[i] = Math.max(dp[i], dp[i - city[j].getCo()] + city[j].getCu());
- }
- // dp[i]가 홍보 해야 할 인원을 만족하면 i는 최소비용
- if(dp[i] >= C) {
- System.out.println(i);
- break;
- }
- }
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/dynamic_programming_1/11660/main.cpp b/solution/dynamic_programming_1/11660/main.cpp
deleted file mode 100644
index fe2b6ab..0000000
--- a/solution/dynamic_programming_1/11660/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/c28a9148cd334f45b6edcbc40ae7ec15
-#include
-
-using namespace std;
-
-int arr[1033][1033], dp[1033][1033];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N, Q; cin >> N >> Q;
- for(int i=1;i<=N;i++) {
- for(int j=1;j<=N;j++) {
- cin >> arr[i][j];
- dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + arr[i][j];
- }
- }
-
- for(int i=0;i> x1 >> y1 >> x2 >> y2;
- cout << dp[x2][y2] - dp[x1-1][y2] - dp[x2][y1-1] + dp[x1-1][y1-1] << '\n';
- }
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/11722/main.py b/solution/dynamic_programming_1/11722/main.py
deleted file mode 100644
index fb90d70..0000000
--- a/solution/dynamic_programming_1/11722/main.py
+++ /dev/null
@@ -1,16 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/6b74718335d14780a6213de8a6b33e42
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-arr = list(map(int, input().split()))
-dp = [1] * (N+1)
-for i in range(N):
- for j in range(i+1,N):
- if arr[i] > arr[j]:
- dp[j] = max(dp[i]+1, dp[j])
-print(max(dp))
\ No newline at end of file
diff --git a/solution/dynamic_programming_1/11726/Main.java b/solution/dynamic_programming_1/11726/Main.java
deleted file mode 100644
index 879ed3e..0000000
--- a/solution/dynamic_programming_1/11726/Main.java
+++ /dev/null
@@ -1,64 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/54a281a936484bbda48800ca4f5f546c
-
-/*
-문제는 1x2 2x1 이라고 주어졌지만 사실은 2x1타일을 쓰는 순간
-밑에도 2x1타일을 써야하기 때문에 2x2타일이라고 생각해도 무방합니다.
-따라서 dp[i] = dp[i] = dp[i - 1] + dp[i - 2] 입니다.
-현재 타일 경우 = (이전에) 1x2타일을 썼을 때 + 2x2타일을 썼을 때
-*/
-
-import java.util.*;
-import java.io.*;
-
-public class Main {
- static int[] dp = new int[1010];
-
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- int n = rd.nextInt();
-
- dp[1] = 1;
- dp[2] = 2;
-
- // dp[i] = dp[i - 1] + dp[i - 2]
- for(int i = 3;i <= n;i++)
- dp[i] = (dp[i - 1] + dp[i - 2]) % 10007;
- System.out.println(dp[n]);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/dynamic_programming_1/11726/main.py b/solution/dynamic_programming_1/11726/main.py
deleted file mode 100644
index 2f9a2a5..0000000
--- a/solution/dynamic_programming_1/11726/main.py
+++ /dev/null
@@ -1,18 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/120bee5ac7444d88ad6686eecd957cd2
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-MOD = 10007
-N = int(input())
-dp = [0] * (N+2)
-dp[1] = 1
-dp[2] = 2
-
-for i in range(3,N+1):
- dp[i] = (dp[i-1] + dp[i-2]) % MOD
-
-print(dp[N] % MOD)
diff --git a/solution/dynamic_programming_1/11727/main.py b/solution/dynamic_programming_1/11727/main.py
deleted file mode 100644
index d297f66..0000000
--- a/solution/dynamic_programming_1/11727/main.py
+++ /dev/null
@@ -1,18 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/db4e4b38ee3c4264b672837fa8fff893
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-MOD = 10007
-N = int(input())
-dp = [0] * (N+2)
-dp[1] = 1
-dp[2] = 3
-
-for i in range(3,N+1):
- dp[i] = (dp[i-1] + dp[i-2] * 2) % MOD
-
-print(dp[N] % MOD)
diff --git a/solution/dynamic_programming_1/13699/main.py b/solution/dynamic_programming_1/13699/main.py
deleted file mode 100644
index 41ddc08..0000000
--- a/solution/dynamic_programming_1/13699/main.py
+++ /dev/null
@@ -1,15 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/84dabc0ec83940a9b2ee36e163f602c2
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-n = int(input())
-t = [0] * (n+4)
-t[0] = 1
-for i in range(1,n+1):
- for j in range(i):
- t[i] += t[j] * t[i-1-j]
-print(t[n])
\ No newline at end of file
diff --git a/solution/dynamic_programming_1/1463/main.cpp b/solution/dynamic_programming_1/1463/main.cpp
deleted file mode 100644
index 58d2e97..0000000
--- a/solution/dynamic_programming_1/1463/main.cpp
+++ /dev/null
@@ -1,32 +0,0 @@
-// Authored by : tallua_y
-// Co-authored by : -
-// Link : http://boj.kr/96a171e5da7746c7a51d5d348bc759a8
-#include
-
-using namespace std;
-
-int main(int argc, char** argv)
-{
- ios::sync_with_stdio(false);
- cin.tie(nullptr);
-
- size_t N;
- cin >> N;
-
- vector count(N + 1);
- count[1] = 0;
-
- for(int i = 2; i < N + 1; ++i) {
- count[i] = count[i - 1] + 1;
- if (i % 2 == 0) {
- count[i] = min(count[i], count[i / 2] + 1);
- }
- if (i % 3 == 0) {
- count[i] = min(count[i], count[i / 3] + 1);
- }
- }
-
- cout << count[N] << '\n';
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/14722/main.cpp b/solution/dynamic_programming_1/14722/main.cpp
deleted file mode 100644
index 08966d8..0000000
--- a/solution/dynamic_programming_1/14722/main.cpp
+++ /dev/null
@@ -1,41 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/9916726bfd8e4ded9c7e4d6295073c1f
-#include
-
-using namespace std;
-
-const int dy[] = { 1, 0 };
-const int dx[] = { 0, 1 };
-int DP[1002][1002][4], V[1002][1002], N;
-
-int go(int y, int x, int milk) {
- int &ret = DP[y][x][milk + 1];
- if(ret != -1) return ret;
- ret = 0;
- for(int dir = 0; dir < 2; dir++) {
- int ny = y + dy[dir];
- int nx = x + dx[dir];
- if(0 > ny || ny >= N || 0 > nx || nx >= N) continue;
- if(V[ny][nx] == (milk + 1) % 3) ret = max(ret, go(ny, nx, (milk + 1) % 3) + 1);
- ret = max(ret, go(ny, nx, milk));
- }
- return ret;
-}
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- cin >> N;
- for(int i=0;i> V[i][j];
- }
- }
- memset(DP, 0xff, sizeof(int) * 1002 * 1002 * 4);
- if(V[0][0] == 0) cout << go(0, 0, 0) + 1;
- else cout << go(0, 0, -1);
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/15486/Main.java b/solution/dynamic_programming_1/15486/Main.java
deleted file mode 100644
index 287de53..0000000
--- a/solution/dynamic_programming_1/15486/Main.java
+++ /dev/null
@@ -1,64 +0,0 @@
-// Authored by : smw123123
-// Co-authored by : -
-// Link : http://boj.kr/a9b5c6f0b2a443549ae67563af0f5e55
-
-import java.util.*;
-import java.lang.*;
-import java.io.*;
-
-public class Main {
- public static void main(String[] args) {
-
- FastReader rd = new FastReader();
- int N = rd.nextInt();
- int[] dp = new int[N+1];
- int T, P;
-
- for(int i = 0; i < N; i++) {
- T = rd.nextInt();
- P = rd.nextInt();
- dp[i+1] = Math.max(dp[i], dp[i+1]);
- if(i + T <= N) {
- dp[i+T] = Math.max(dp[i+T], dp[i] + P);
- }
- }
- System.out.println(dp[N]);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- long nextLong() { return Long.parseLong(next()); }
- double nextDouble() { return Double.parseDouble(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
-
-// 설명 링크 : https://github.com/tony9402/baekjoon/pull/249#issue-978163457
diff --git a/solution/dynamic_programming_1/15989/main.cpp b/solution/dynamic_programming_1/15989/main.cpp
deleted file mode 100644
index 306cb59..0000000
--- a/solution/dynamic_programming_1/15989/main.cpp
+++ /dev/null
@@ -1,38 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/7363aaeb37fd489aaa5c0ad142ce8a7a
-#include
-
-using namespace std;
-typedef long long ll;
-
-ll DP[10005][4];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- for(int i=1;i<=3;i++) {
- for(int j=1;j<=i;j++) {
- DP[i][j] = 1;
- }
- }
-
- for(int i=4;i<=10000;i++) {
- for(int j=1;j<=3;j++) {
- for(int k=1;k<=j;k++) {
- DP[i][j] += DP[i - j][k];
- }
- }
- }
-
- int T; cin >> T;
- while(T--){
- int n; cin >> n;
- ll answer = 0;
- for(int i=1;i<=3;i++) answer += DP[n][i];
- cout << answer << '\n';
- }
-
- return 0;
-}
diff --git a/solution/dynamic_programming_1/15990/main.cpp b/solution/dynamic_programming_1/15990/main.cpp
deleted file mode 100644
index b3ce023..0000000
--- a/solution/dynamic_programming_1/15990/main.cpp
+++ /dev/null
@@ -1,32 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/7a8607af45e042df9e44b48962548e1a
-#include
-
-using namespace std;
-typedef long long ll;
-
-ll DP[100005][4];
-const ll MOD = 1e9 + 9;
-const int MAXN = 100000;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- for(int i=1;i<=3;i++) DP[i][i] = DP[3][i] = 1;
- for(int i=4;i<=MAXN;i++){
- for(int j=1;j<=3;j++){
- for(int k=1;k<=3;k++){
- if(j == k)continue;
- DP[i][j] = (DP[i][j] + DP[i - j][k]) % MOD;
- }
- }
- }
- int T; cin >> T;
- while(T--){
- int n; cin >> n;
- cout << (DP[n][1] + DP[n][2] + DP[n][3]) % MOD << '\n';
- }
- return 0;
-}
diff --git a/solution/dynamic_programming_1/17626/main.py b/solution/dynamic_programming_1/17626/main.py
deleted file mode 100644
index 545b2e7..0000000
--- a/solution/dynamic_programming_1/17626/main.py
+++ /dev/null
@@ -1,21 +0,0 @@
-# Authored by : osy0056
-# Co-authored by : -
-# Link : http://boj.kr/49cc21bd78694086b7b2864e8bc6fa69
-import math
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-n = int(input())
-dp = [0] * 50001
-INF = float('inf')
-
-dp[0] = 0
-dp[1] = 1
-for i in range(2, n+1):
- min_value = INF
- for k in range(1, math.floor(math.sqrt(i)) + 1):
- min_value = min(min_value, dp[i - k * k])
- dp[i] = min_value + 1
-print(dp[n])
diff --git a/solution/dynamic_programming_1/1890/main.py b/solution/dynamic_programming_1/1890/main.py
deleted file mode 100644
index 856a55e..0000000
--- a/solution/dynamic_programming_1/1890/main.py
+++ /dev/null
@@ -1,28 +0,0 @@
-# Authored by : cieske
-# Co-authored by : -
-# Link : http://boj.kr/73b9e168131842dd90aa2b02380cb0fa
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-n = int(input())
-lst = []
-for _ in range(n):
- lst.append(list(map(int, input().split())))
-
-dp = [[0]*n for _ in range(n)]
-dp[0][0] = 1
-
-for i in range(n):
- for j in range(n):
- if lst[i][j] == 0:
- continue
- jump = lst[j][i]
-
- if j+jump < n:
- dp[j+jump][i] += dp[j][i]
- if i+jump < n:
- dp[j][i+jump] += dp[j][i]
-
-print(dp[-1][-1])
diff --git a/solution/dynamic_programming_1/1912/Main.java b/solution/dynamic_programming_1/1912/Main.java
deleted file mode 100644
index 440bed1..0000000
--- a/solution/dynamic_programming_1/1912/Main.java
+++ /dev/null
@@ -1,66 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/788f5770927f4da79551c4bc06c3351b
-
-import java.util.*;
-import java.io.*;
-
-public class Main {
-
- static int[] arr = new int[100010];
- static int[] dp = new int[100010];
-
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- int n = rd.nextInt();
- for(int i = 0;i < n;i++)
- arr[i] = rd.nextInt();
-
- // 초기화
- int max = arr[0];
- dp[0] = arr[0];
-
- // dp[i]안에는 arr[0~i]까지의 합 중 최대값을 가진다.
- // max는 dp값중 최대값을 가진다.=> 결과값
- for(int i = 1;i < n;i++) {
- dp[i] = Math.max(dp[i - 1] + arr[i], arr[i]);
- max = Math.max(dp[i], max);
- }
-
- System.out.println(max);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/dynamic_programming_1/19622/main.py b/solution/dynamic_programming_1/19622/main.py
deleted file mode 100644
index 536680f..0000000
--- a/solution/dynamic_programming_1/19622/main.py
+++ /dev/null
@@ -1,23 +0,0 @@
-# Authored by : chj3748
-# Co-authored by : -
-# Link : http://boj.kr/25c02a4ea33e493f9f1320165f1a5f95
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N = int(input())
-meetings = []
-for _ in range(N):
- meetings.append(list(map(int, input().split())))
-dp = [0] * N
-
-for i in range(N):
- if i == 0:
- dp[0] = meetings[0][2]
- elif i == 1:
- dp[1] = max(meetings[1][2], dp[0])
- else:
- dp[i] = max(dp[i-2] + meetings[i][2], dp[i-1])
-
-print(dp[N - 1])
\ No newline at end of file
diff --git a/solution/dynamic_programming_1/21317/main.cpp b/solution/dynamic_programming_1/21317/main.cpp
deleted file mode 100644
index daf9350..0000000
--- a/solution/dynamic_programming_1/21317/main.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/7b74ffa836cb49029ffc4ee08767c9db
-#include
-
-using namespace std;
-
-int DP[105][2], arr[105][2];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- for(int i=1;i> arr[i][0] >> arr[i][1];
- int k; cin >> k;
- for(int i=2;i<105;i++) DP[i][0] = DP[i][1] = INT_MAX;
- for(int i=1;ik:
- continue
- for j in range(i+1, n):
- need = (j-i) * (1 + abs(rocks[i]-rocks[j]))
- dp[j] = min(dp[j], need)
-
-if dp[n-1]>k:
- print('NO')
-else:
- print('YES')
diff --git a/solution/dynamic_programming_1/2294/main.py b/solution/dynamic_programming_1/2294/main.py
deleted file mode 100644
index cf75646..0000000
--- a/solution/dynamic_programming_1/2294/main.py
+++ /dev/null
@@ -1,23 +0,0 @@
-# Authored by : cieske
-# Co-authored by : -
-# Link : http://boj.kr/4c2449f200e440f39d4ba8e1e71601b6
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-n, k = map(int, input().split())
-coin = set([int(input()) for _ in range(n)]) #중복 동전 제거
-dp = [0]*(k+1)
-
-for i in range(1, k+1):
- possible = []
- for c in coin:
- if i-c >= 0 and dp[i-c] >= 0: # i-c원 경우에 c원 동전을 추가해서 i원을 만들 수 있는 경우
- possible.append(dp[i-c])
- if possible:
- dp[i] = min(possible) + 1 # optimal 값 + 1
- else:
- dp[i] = -1 #불가능!
-
-print(dp[k])
diff --git a/solution/dynamic_programming_1/2407/Main.java b/solution/dynamic_programming_1/2407/Main.java
deleted file mode 100644
index 6ebc5d0..0000000
--- a/solution/dynamic_programming_1/2407/Main.java
+++ /dev/null
@@ -1,67 +0,0 @@
-//Authored by : suin8
-//Co-authored by : -
-//Link : http://boj.kr/342101ba2b5246bb9801f2d356ea8c56
-
-import java.util.*;
-import java.io.*;
-import java.math.*;
-
-public class Main {
- static BigInteger[][] dp = new BigInteger[110][110];
-
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- int n = rd.nextInt();
- int m = rd.nextInt();
-
- // 매우매우 큰수가 나오는 조합(n C m), 따라서 biginteger사용
- dp[0][0] = new BigInteger("1");
-
- for(int i = 1;i <= n;i++) {
- dp[i][0] = new BigInteger("1");
- for(int j = 1;j <= i;j++) {
- // biginteger는 string이라서 null로 초기화 되어 있기 때문에
- // 각 예외상황마다 값을 정해주어야 한다.
- if(i == j) dp[i][j] = new BigInteger("1");
- else if(i < j) dp[i][j] = new BigInteger("0");
- else dp[i][j] = dp[i - 1][j - 1].add(dp[i - 1][j]);
- }
- }
-
- System.out.println(dp[n][m]);
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/dynamic_programming_1/2579/main.py b/solution/dynamic_programming_1/2579/main.py
deleted file mode 100644
index 3be5d15..0000000
--- a/solution/dynamic_programming_1/2579/main.py
+++ /dev/null
@@ -1,20 +0,0 @@
-# Authored by : cieske
-# Co-authored by : -
-# Link : http://boj.kr/3d9ff337b9bc420a975cf6783b298212
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-n = int(input())
-lst = [int(input()) for _ in range(n)]
-
-if n > 3:
- dp = [lst[0], lst[0]+lst[1], max(lst[0], lst[1])+lst[2]] # 3번째 칸까지는 먼저 구하기
- for i in range(3, n):
- next_max = max(dp[i-2], dp[i-3]+lst[i-1]) # max(2칸 전에서 i번째 경우, 3칸-1칸 전 밟고 i번째 오는 경우)
- dp.append(next_max+lst[i])
- print(dp[-1])
-else:
- print(sum(lst)) #2칸 이하면 모두 밟는게 최대
-
diff --git a/solution/dynamic_programming_1/2748/main.cpp b/solution/dynamic_programming_1/2748/main.cpp
deleted file mode 100644
index 9398005..0000000
--- a/solution/dynamic_programming_1/2748/main.cpp
+++ /dev/null
@@ -1,20 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/b5fdc8a3c2c84784a6b308c98e4aa7e9
-#include
-
-using namespace std;
-
-long long DP[99];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- DP[1] = 1;
- for(int i=2;i<=90;i++)DP[i] = DP[i-1] + DP[i-2];
-
- int N; cin >> N;
- cout << DP[N];
-}
-
diff --git a/solution/dynamic_programming_1/2839/main.cpp b/solution/dynamic_programming_1/2839/main.cpp
deleted file mode 100644
index 5aa590e..0000000
--- a/solution/dynamic_programming_1/2839/main.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/48cb7b8049444c7eb5cdc5752dd5eb66
-#include
-
-using namespace std;
-
-int DP[5005];
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- const int INF = 50000;
- for(int i=1;i<=5000;i++) DP[i] = INF;
- DP[3] = 1;
-
- for(int i=5;i<=5000;i++) DP[i] = min({ DP[i], DP[i - 3] + 1, DP[i - 5] + 1});
-
- int N; cin >> N;
- if(DP[N] == INF)DP[N] = -1;
- cout << DP[N];
-}
diff --git a/solution/dynamic_programming_1/9095/main.py b/solution/dynamic_programming_1/9095/main.py
deleted file mode 100644
index b30aa6f..0000000
--- a/solution/dynamic_programming_1/9095/main.py
+++ /dev/null
@@ -1,21 +0,0 @@
-# Authored by : osy0056
-# Co-authored by : -
-# Link : http://boj.kr/da3d10e3ebc945349d778cb06444ffb1
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-tc = int(input())
-
-dp = [0] * 15
-dp[1] = 1
-dp[2] = 2
-dp[3] = 4
-for i in range(4, 12):
- dp[i] = dp[i - 3] + dp[i - 2] + dp[i - 1]
-
-for _ in range(tc):
- n = int(input())
-
- print(dp[n])
diff --git a/solution/dynamic_programming_1/9461/main.py b/solution/dynamic_programming_1/9461/main.py
deleted file mode 100644
index f9ff9de..0000000
--- a/solution/dynamic_programming_1/9461/main.py
+++ /dev/null
@@ -1,20 +0,0 @@
-# Authored by : gusdn3477
-# Co-authored by : -
-# Link : http://boj.kr/369118cac2b14c75866029d361c95152
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-def recursion(x):
- if x == 1 or x == 2 or x == 3:
- return 1
- if dp[x] == 0:
- dp[x] = recursion(x-2) + recursion(x-3)
- return dp[x]
-
-T = int(input())
-dp = [0] * 101
-for i in range(T):
- N = int(input())
- print(recursion(N))
\ No newline at end of file
diff --git a/solution/dynamic_programming_1/9465/main.py b/solution/dynamic_programming_1/9465/main.py
deleted file mode 100644
index 85378d9..0000000
--- a/solution/dynamic_programming_1/9465/main.py
+++ /dev/null
@@ -1,26 +0,0 @@
-# Authored by : cieske
-# Co-authored by : -
-# Link : http://boj.kr/39643867e537451a9ae49e16ec4f2f3f
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-t = int(input())
-for _ in range(t):
- n = int(input())
- lst = [list(map(int, input().split())) for i in range(2)]
- # 새로 dp 행렬 만들 필요 없이 스티커 값이 저장된 lst 배열에서 dp 수행
-
- if n > 1:
- # 경우의 수 오직 1개
- lst[0][1] += lst[1][0]
- lst[1][1] += lst[0][0]
-
- if n > 2:
- for i in range(2, n):
- #대각선에 있는 스티커를 고를 지, 거기서 한 칸 더 떨어져 있는 스티커를 고를 지 선택
- lst[0][i] += max(lst[1][i-1], lst[1][i-2])
- lst[1][i] += max(lst[0][i-1], lst[0][i-2])
-
- print(max(lst[0][-1], lst[1][-1]))
diff --git a/solution/dynamic_programming_1/9655/Main.java b/solution/dynamic_programming_1/9655/Main.java
deleted file mode 100644
index 97f7ce6..0000000
--- a/solution/dynamic_programming_1/9655/Main.java
+++ /dev/null
@@ -1,58 +0,0 @@
-//Authored by : suin8
-//Co-authored by : tony9402
-//Link : http://boj.kr/096e8e82144f450ab19b16bcf62cc83b
-import java.util.*;
-import java.io.*;
-
-public class Main {
- static int DP[] = new int[1001];
- public static void main(String[] args) {
- FastReader rd = new FastReader();
-
- // 짝수일때는 창영이가, 홀수일때는 상근이가 이기게 됩니다.
- // 반드시 상근이가 먼저 시작하고 1,3 홀수개 만큼 가져가기 때문.
- // System.out.println((N % 2 == 0) ? "CY" : "SK");
-
- int N = rd.nextInt();
- // 1 : 상근, 2 : 창영
- DP[1] = 1;
- for(int i = 1; i < 1000; i++) {
- if(DP[i + 1] == 0) DP[i + 1] = 3 - DP[i];
- if(i + 3 <= 1000) DP[i + 3] = 3 - DP[i];
- }
- System.out.println((DP[N] % 2 == 0 ? "CY" : "SK"));
- }
-
- static class FastReader {
- BufferedReader br;
- StringTokenizer st;
-
- public FastReader() {
- br = new BufferedReader(new InputStreamReader(System.in));
- }
-
- String next() {
- while(st == null || !st.hasMoreElements()) {
- try {
- st = new StringTokenizer(br.readLine());
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- }
- return st.nextToken();
- }
-
- int nextInt() { return Integer.parseInt(next()); }
- String nextLine() {
- String str = "";
- try {
- str = br.readLine();
- }
- catch (IOException e) {
- e.printStackTrace();
- }
- return str;
- }
- }
-}
diff --git a/solution/dynamic_programming_1/9655/main.py b/solution/dynamic_programming_1/9655/main.py
deleted file mode 100644
index 1d47517..0000000
--- a/solution/dynamic_programming_1/9655/main.py
+++ /dev/null
@@ -1,24 +0,0 @@
-# Authored by : yj2221
-# Co-authored by : -
-# Link : http://boj.kr/f4bdc1e4d3f34003a1080645069b0ee7
-
-import sys
-def input():
- return sys.stdin.readline().rstrip()
-
-dp = ['' for _ in range(1001)]
-dp[1] = 'SK'
-
-for i in range(1,1000):
- if dp[i]=="SK":
- if dp[i+1]=='':
- dp[i+1] = 'CY'
- if i+3<1000:
- dp[i+3] = 'CY'
- elif dp[i]=='CY':
- if dp[i+1]=='':
- dp[i+1] = 'SK'
- if i+3<1000:
- dp[i+3] = 'SK'
-
-print(dp[int(input())])
\ No newline at end of file
diff --git a/solution/dynamic_programming_2/1005/main.cpp b/solution/dynamic_programming_2/1005/main.cpp
deleted file mode 100644
index 115675b..0000000
--- a/solution/dynamic_programming_2/1005/main.cpp
+++ /dev/null
@@ -1,45 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/9577f93393b64444a01592dfb1458d97
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int T; cin >> T;
- while(T--) {
- int N, M, W; cin >> N >> M;
- vector> graph(N);
- vector V(N), DP(N), indegree(N);
- for(int i=0;i> V[i];
- for(int i=0;i> a >> b;
- graph[--a].emplace_back(--b);
- indegree[b]++;
- }
- cin >> W;
-
- queue Q;
- for(int i=0;i
-
-using namespace std;
-
-const int INF = 0x3f3f3f3f;
-
-int main() {
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- vector> V(N, vector(N));
- vector> DP(N, vector(N, INF));
- DP[0][0]=0;
- for(int i=0;i> V[i][j];
- if(j > 0){
- int d = max(0, V[i][j] - V[i][j-1] + 1);
- DP[i][j]=min(DP[i][j], DP[i][j-1] + d);
- }
- if(i > 0){
- int d = max(0, V[i][j] - V[i-1][j] + 1);
- DP[i][j] = min(DP[i][j], DP[i-1][j] + d);
- }
- }
- }
- cout << DP[N-1][N-1];
-
- return 0;
-}
diff --git a/solution/dynamic_programming_2/11909/main.py b/solution/dynamic_programming_2/11909/main.py
deleted file mode 100644
index 817c08a..0000000
--- a/solution/dynamic_programming_2/11909/main.py
+++ /dev/null
@@ -1,32 +0,0 @@
-# Authored by : chj3748
-# Co-authored by : -
-# Link : http://boj.kr/a7949813f6e74a918f1f18b458ea5f8c
-import sys
-from collections import deque
-
-def input():
- return sys.stdin.readline().rstrip()
-
-inf = float('inf')
-n = int(input())
-prison = [list(map(int, input().split())) for _ in range(n)]
-dp = [[inf] * n for _ in range(n)]
-dp[0][0] = 0
-dirx = [1, 0]
-diry = [0, 1]
-
-q = deque()
-q.append((0, 0))
-while q:
- x, y = q.popleft()
- for dx, dy in zip(dirx, diry):
- nx, ny = x + dx, y + dy
- if 0 <= nx < n and 0 <= ny < n:
- cost = prison[nx][ny] - prison[x][y] + 1
- if cost < 1:
- cost = 0
- if dp[nx][ny] > dp[x][y] + cost:
- q.append((nx, ny))
- dp[nx][ny] = dp[x][y] + cost
-
-print(dp[n - 1][n - 1])
\ No newline at end of file
diff --git a/solution/dynamic_programming_2/11985/main.py b/solution/dynamic_programming_2/11985/main.py
deleted file mode 100644
index 1f5a19e..0000000
--- a/solution/dynamic_programming_2/11985/main.py
+++ /dev/null
@@ -1,34 +0,0 @@
-# Authored by : chj3748
-# Co-authored by : -
-# Link : http://boj.kr/f293bc24e6e347dba7b5aa08836171fe
-import sys
-
-def input():
- return sys.stdin.readline().rstrip()
-
-N, M, K = map(int, input().split())
-oranges = []
-inf = float('inf')
-dp = [inf] * N
-dp[0] = K
-for idx in range(N):
- oranges.append(int(input()))
- if idx > 0:
- max_size = oranges[idx]
- min_size = oranges[idx]
- for j in range(M):
- left_idx = idx - j
- if left_idx < 0:
- break
- if max_size < oranges[left_idx]:
- max_size = oranges[left_idx]
- if min_size > oranges[left_idx]:
- min_size = oranges[left_idx]
- if left_idx - 1 >= 0:
- temp = dp[left_idx - 1] + K + (max_size - min_size) * (j + 1)
- else:
- temp = K + (max_size - min_size) * (j + 1)
- if dp[idx] > temp:
- dp[idx] = temp
-
-print(dp[N - 1])
diff --git a/solution/dynamic_programming_2/12015/main.cpp b/solution/dynamic_programming_2/12015/main.cpp
deleted file mode 100644
index 3fac1dc..0000000
--- a/solution/dynamic_programming_2/12015/main.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-// Authored by : tony9402
-// Co-authored by : -
-// Link : http://boj.kr/c74669b0329d4d59ad5145504275e7ac
-#include
-
-using namespace std;
-
-int main(){
- ios::sync_with_stdio(false);
- cin.tie(0);
-
- int N; cin >> N;
- vector