태그 목록

태그 못 푼 문제 수 푼 문제 수 총 문제 수 진행도
Mathematics 1,032 0 1,032
Dynamic programming 877 0 877
Graph theory 786 0 786
Implementation 733 0 733
Graph traversal 398 0 398
Greedy 302 0 302
Segment tree 295 0 295
Binary search 263 0 263
Bruteforcing 248 0 248
Geometry 243 0 243
String 238 0 238
Number theory 231 0 231
Tree 231 0 231
Sorting 215 0 215
Breadth-first search 210 0 210
Arithmetic 199 0 199
Combinatorics 123 0 123
Dijkstra's 120 0 120
Depth-first search 110 0 110
Bitmask 105 0 105
Disjoint set 99 0 99
Maximum flow 93 0 93
Backtracking 92 0 92
Divide and conquer 89 0 89
Prefix sum 80 0 80
Line sweeping 72 0 72
Stack 71 0 71
Parsing 68 0 68
Bipartite matching 65 0 65
Ad-Hoc 65 0 65
Dynamic programming; on trees 60 0 60
Exponentiation by squaring 59 0 59
Priority queue 58 0 58
Constructive 58 0 58
Simulation 58 0 58
Segment tree with lazy propagation 55 0 55
Dynamic programming; using bitfield 54 0 54
Offline queries 55 0 55
Strongly connected component 52 0 52
Game theory 53 0 53
Primality test 48 0 48
Minimum spanning tree 47 0 47
Two-pointer 47 0 47
Topological sorting 42 0 42
Lowest common ancestor 41 0 41
Arbitrary precision / Big integers 41 0 41
Hashing 40 0 40
Floyd–Warshall 39 0 39
Fast Fourier transform 38 0 38
Convex hull 37 0 37
Knuth–Morris–Pratt 36 0 36
Trie 35 0 35
Recursion 33 0 33
Sieve of Eratosthenes 33 0 33
Square root decomposition 32 0 32
Convex hull trick 31 0 31
Suffix array and LCP array 29 0 29
Sprague–Grundy theorem 27 0 27
Case work 27 0 27
2-SAT 26 0 26
Minimum cost maximum flow 23 0 23
Set / Map by trees 24 0 24
Meet in the middle 23 0 23
Linear algebra 23 0 23
Heavy-light decomposition 22 0 22
Longest increasing sequence in O(n log n) 21 0 21
Inclusion and exclusion 20 0 20
Mo's 20 0 20
Parallel binary search 20 0 20
Deque 20 0 20
Sparse array 20 0 20
Euclidean algorithm 19 0 19
Sliding window 19 0 19
Ternary search 18 0 18
Line segment intersection check 17 0 17
Persistent segment tree 17 0 17
Set / Map by hashing 17 0 17
Articulation points and bridges 15 0 15
Extended Euclidean algorithm 15 0 15
Calculus 14 0 14
Randomization 13 0 13
Bellman–Ford 13 0 13
Chinese remainder theorem 13 0 13
Euler tour technique 13 0 13
Aho-Corasick 12 0 12
Centroid decomposition 12 0 12
Queue 12 0 12
Divide and conquer optimization 12 0 12
Geometry; 3D 12 0 12
Knapsack 12 0 12
Gaussian elimination 11 0 11
Splay tree 11 0 11
Möbius inversion 10 0 10
Manacher's 9 0 9
Rabin–Karp 9 0 9
Interpreter 9 0 9
Rotating calipers 8 0 8
Eulerian path / circuit 8 0 8
Dynamic programming; using a deque 8 0 8
Heuristics 7 0 7
Max-flow min-cut theorem 8 0 8
Travelling salesman problem 7 0 7
Merge sort tree 7 0 7
Burnside's lemma 6 0 6
Fermat's little theorem 6 0 6
Offline dynamic connectivity 6 0 6
Regular Expression 6 0 6
Linear programming 6 0 6
Dynamic programming; using connection profile 6 0 6
Numerical analysis 6 0 6
Euler totient function 6 0 6
Bit set 6 0 6
Planar graph 6 0 6
Link/cut tree 5 0 5
Berlekamp–Massey 5 0 5
Physics 5 0 5
Euler characteristic (χ=V-E+F) 5 0 5
Bidirectional search 5 0 5
Biconnected component 5 0 5
Palindrome tree 4 0 4
Pollard rho 4 0 4
Z 4 0 4
Alien's trick 4 0 4
Linked list 4 0 4
Value / coordinate compression 4 0 4
Area of a polygon 3 0 3
General matching 3 0 3
Hall's theorem 3 0 3
Miller–Rabin 3 0 3
Stoer–Wagner 3 0 3
Knuth optimization 3 0 3
Matroid 3 0 3
Kitamasa 3 0 3
Slope trick 3 0 3
Minimum enclosing circle 3 0 3
Hungarian 2 0 2
Point in convex polygon check 2 0 2
Pythagoras theorem 2 0 2
Lucas theorem 2 0 2
Tree isomorphism 2 0 2
Discrete logarithm 2 0 2
Boyer–Moore majority vote 2 0 2
Hirschberg's 2 0 2
Modular multiplicative inverse 2 0 2
Delaunay triangulation 1 0 1
Directed minimum spanning tree 1 0 1
Point in non-convex polygon check 1 0 1
Voronoi diagram 1 0 1
Red-black tree 1 0 1
Geometry; hyperdimensional 1 0 1
Dominator tree 1 0 1
Cactus 1 0 1
Discrete square root 1 0 1
Rope 1 0 1
Multidimensional segment tree 1 0 1