230806 일상
오랜만에 개발을 공부하며 문득 회상합니다.
Notice
How To Read
이 블로그의 글들을 읽는 방법
Latest Posts
BOJ 11960 - Max Flow
BOJ 11960 - Max Flow
BOJ 2855 - 흥미로운 수열
BOJ 2855 - 흥미로운 수열
Codeforces Round 880 (Div. 2)
Codeforces Round 880 (Div. 2)
Codeforces Round 879 (Div. 2) - D. Survey in Class
D. Survey in Class
Codeforces Round 879 (Div. 2) - C. Game with Reversing
C. Game with Reversing
Codeforces Round 879 (Div. 2) - B. Maximum Strength
B. Maximum Strength
Codeforces Round 879 (Div. 2) - A. Unit Array
A. Unit Array
Codeforces Round 701 (Div. 2) - D. Multiples and Power Differences (2200)
D. Multiples and Power Differences
Codeforces Round 864 (Div. 2)
Codeforces Round 864 (Div. 2)
Codeforces Round 829 (Div. 2) - E. Wish I Knew How to Sort (2000)
E. Wish I Knew How to Sort
BOJ 24272 - 루트 노드가 많은 트리일수록 좋은 트리이다
BOJ 24272 - 루트 노드가 많은 트리일수록 좋은 트리이다
BOJ 28068 - I Am Knowledge
BOJ 28068 - I Am Knowledge
BOJ 10650 - Marathon
BOJ 10650 - Marathon
BOJ 14706 - 구간 합 최대
BOJ 14706 - 구간 합 최대
BOJ 1555 - 소수 만들기
BOJ 1555 - 소수 만들기
Codeforces Round 829 (Div. 2) - D. Factorial Divisibility (1600)
D. Factorial Divisibility
Sack - Disjoint Set Union on Tree
Prerequisite
Codeforces Round 862 (Div. 2) - E. There Should Be a Lot of Maximums (2300)
E. There Should Be a Lot of Maximums
Codeforces Round 862 (Div. 2) - C. Place for a Selfie (1400)
C. Place for a Selfie
Codeforces Round 862 (Div. 2) - B. The String Has a Target (800)
B. The String Has a Target