최대공약수
/tags/%EC%B5%9C%EB%8C%80%EA%B3%B5%EC%95%BD%EC%88%98/ https://42jerrykim.github.io/tags/%EC%B5%9C%EB%8C%80%EA%B3%B5%EC%95%BD%EC%88%98/ tags %EC%B5%9C%EB%8C%80%EA%B3%B5%EC%95%BD%EC%88%98
Tags
3 pages
최대공약수
[Algorithm] BOJ 13926 gcd(n, k) = 1 — φ(n) 계산 (C++/Python)
[Algorithm] cpp-python 백준 10854번: Divisions - 약수 개수
[Algorithm] cpp 백준 12858번: Range GCD - 차분+세그트리
![[Algorithm] BOJ 13926 gcd(n, k) = 1 — φ(n) 계산 (C++/Python)](/post/algorithm/2025-10-14-boj-13926-gcd-n-k-equals-1-cpp-python-solution/wordcloud_hu_4f80697d0be61606.png)
![[Algorithm] cpp-python 백준 10854번: Divisions - 약수 개수](/post/algorithm/2025-09-16-boj-10854-divisions-number-of-divisors-cpp-python-solution/wordcloud_hu_f2a53254f2f126b2.png)
![[Algorithm] cpp 백준 12858번: Range GCD - 차분+세그트리](/post/algorithm/2025-08-14-boj-12858-range-gcd-cpp-solution/wordcloud_hu_47906873416556e5.png)