baekJoonStudyLog

• 단계별로 풀어보기 알고리즘 공부 시작(21.10.12. ~ )
• 정렬단계까지만 단계별로 풀기( ~ 22.02.27.)
• 백준코드플러스 난이도별 코드 풀기 - 기초 1/2 (22.02.28. ~ ) vsCpp setting link
  https://github.com/mw08081/baekJoon-old-/blob/main/.vscode/launch.json
  https://github.com/mw08081/baekJoon-old-/blob/main/.vscode/tasks.json
  　

helped

• Algorithmic
  1011
  1018
  1929 - 에라토스테네스의 체
  https://github.com/mw08081/baekJoon-old-/tree/main/BAEKJOON/Q1929
  1712
  2750 - O(N^2) BubbleSort, SelectSort, QuickSort, InsertionSort
  2751 - O(N lgN) HeapSort, MergeSort
  7568
  9093
  10814 - stableSort vs unStableSort
  10989 - O(N) CountingSort
  　
• MatheMatical
  1193 - 계차수열
  https://github.com/mw08081/baekJoon-old-/tree/main/BAEKJOON/Q1193/README.md
  2292 - 등차수열
  https://github.com/mw08081/baekJoon-old-/tree/main/BAEKJOON/Q2292/README.md
  　
• Linguistic
  1008, 3053 - cout.precision(streamsize), cout << fixed, setprecisioin(streamsize)
  https://github.com/mw08081/baekJoon-old-/tree/main/BAEKJOON/Q1008/README.md
  1152 - getline(cin, str)
  https://github.com/mw08081/baekJoon-old-/blob/main/BAEKJOON/Q1152/README.md
  1181 - string Compare(string operator overloading '<' vs string.compare() & [#include <string>]
  https://github.com/mw08081/baekJoon-old-/blob/main/BAEKJOON/Q1181/README.md
  1929, 10809 - fill_n, endl vs '\n'
  https://github.com/mw08081/baekJoon-old-/tree/main/BAEKJOON/Q1929/README.md
  2751 - vector<T> & #include <vector>
  https://blog.naver.com/president304/222422474064
  2108 - T ceil<T> (T val), T floor<T>(T val)
  https://github.com/mw08081/baekJoon-old-/blob/main/BAEKJOON/Q2108/README.md
  3053 - M_PI, pow(), powl() & #include <cmath>, #define _USE_MATH_DEFINES
  https://github.com/mw08081/baekJoon-old-/blob/main/BAEKJOON/Q3053/README.md
  7568 - pair<T, T>, vector<pair<int, int>>
  https://github.com/mw08081/baekJoon-old-/blob/main/BAEKJOON/Q7568/README.md
  9093 - cin.ignore(); -flush buffer
  https://github.com/mw08081/baekJoon-old-/blob/main/BAEKJOON/Q9093/README.md
  10989 - ios::sync_with_stdio(false);, cin.tie(NULL);, cout.tie(NULL);
  https://github.com/mw08081/baekJoon-old-/blob/main/BAEKJOON/Q10989/README.md
  11650 - sort() & #include<algorithm>
  https://github.com/mw08081/baekJoon-old-/tree/main/BAEKJOON/Q11650
  　

Special(onMyWay || Hard)

1929 - Sieve of Eratosthenes H
2447 - Recursive PrintStar M, H
10757 - LongInt Calc(using string) M, H
10870 - Recursive Fibonacci M
11650 - vector<pair<int, int>> HeapSort M
18870 - gridCompression vector<pair<pair<int, int>, int>> M

References

18870 - unique(), vector.erase()
https://github.com/mw08081/baekJoon-old-/tree/main/BAEKJOON/Q18870
10828 - You don't need to compare all spelling