Skip to content

No labels!

There arenโ€™t any labels for this repository quite yet.

BFS/DFS
BFS/DFS
๊ทธ๋ž˜ํ”„ ํƒ์ƒ‰
BOJ
BOJ
Baekjoon
๋‹ค์ด๋‚˜๋ฏนํ”„๋กœ๊ทธ๋ž˜๋ฐ by Bit
๋‹ค์ด๋‚˜๋ฏนํ”„๋กœ๊ทธ๋ž˜๋ฐ by Bit
Dynamic programming using bitfield
PRG
PRG
Programmers
๊ฐ•ํ•œ์—ฐ๊ฒฐ์š”์†Œ
๊ฐ•ํ•œ์—ฐ๊ฒฐ์š”์†Œ
Strongly connected component
๊ตฌํ˜„
๊ตฌํ˜„
implementation
๊ทธ๋ฆฌ๋””
๊ทธ๋ฆฌ๋””
Greedy
๋ˆ„์ ํ•ฉ
๋ˆ„์ ํ•ฉ
Prefix sum
๋‹ค์ด๋‚˜๋ฏน ํ”„๋กœ๊ทธ๋ž˜๋ฐ
๋‹ค์ด๋‚˜๋ฏน ํ”„๋กœ๊ทธ๋ž˜๋ฐ
dynamic programming
๋‹ค์ด๋‚˜๋ฏน ํ”„๋กœ๊ทธ๋ž˜๋ฐ by Tree
๋‹ค์ด๋‚˜๋ฏน ํ”„๋กœ๊ทธ๋ž˜๋ฐ by Tree
Dynamic programming on trees
๋‹ค์ต์ŠคํŠธ๋ผ
๋‹ค์ต์ŠคํŠธ๋ผ
Dijkstra's
๋ฌธ์„œ์ •๋ฆฌ
๋ฌธ์„œ์ •๋ฆฌ
Documentation
๋ฌธ์ž์—ด
๋ฌธ์ž์—ด
string
๋ฐฑํŠธ๋ž˜ํ‚น
๋ฐฑํŠธ๋ž˜ํ‚น
back tracking
๋ถ„๋ฆฌ์ง‘ํ•ฉ
๋ถ„๋ฆฌ์ง‘ํ•ฉ
disjoint set
๋ถ„ํ• ์ •๋ณต
๋ถ„ํ• ์ •๋ณต
divide and conquer
๋ธŒ๋ฃจํŠธํฌ์Šค
๋ธŒ๋ฃจํŠธํฌ์Šค
Bruteforcing
๋น„ํŠธ๋งˆ์Šคํ‚น
๋น„ํŠธ๋งˆ์Šคํ‚น
bit masking
์ˆ˜ํ•™
์ˆ˜ํ•™
math
์ˆœ์—ด
์ˆœ์—ด
Permutation
์‹œ๋ฎฌ๋ ˆ์ด์…˜
์‹œ๋ฎฌ๋ ˆ์ด์…˜
simulation
์šฐ์„ ์ˆœ์œ„ํ
์šฐ์„ ์ˆœ์œ„ํ
priority queue
์ด๋ถ„๋งค์นญ
์ด๋ถ„๋งค์นญ
Bipartite matching
์ด๋ถ„ํƒ์ƒ‰
์ด๋ถ„ํƒ์ƒ‰
binary search
์žฌ๊ท€
์žฌ๊ท€
Recursion
์ •๊ทœํ‘œํ˜„์‹
์ •๊ทœํ‘œํ˜„์‹
์ •๊ทœํ‘œํ˜„์‹
์ •๋ ฌ
์ •๋ ฌ
sorting
์กฐํ•ฉ๋ก 
์กฐํ•ฉ๋ก 
Combinatorics
์ตœ๋‹จ๊ฒฝ๋กœ
์ตœ๋‹จ๊ฒฝ๋กœ
์ตœ๋Œ€์œ ๋Ÿ‰
์ตœ๋Œ€์œ ๋Ÿ‰
Maximum flow