태그 목록 (베타)

등록된 전체 태그 목록

태그 못 푼 문제 수 푼 문제 수 총 문제 수 진행도
Mathematics 745 0 745
Dynamic programming 695 0 695
Graph theory 632 0 632
Implementation 547 0 547
Graph traversal 327 0 327
Dynamic programming; multidimensional 259 0 259
Greedy 247 0 247
Segment tree 238 0 238
Bruteforcing 203 0 203
Geometry 199 0 199
Binary search 195 0 195
Breadth-first search 178 0 178
Number theory 176 0 176
Sorting 176 0 176
Tree 156 0 156
Dynamic programming; 1-dimensional 99 0 99
Depth-first search 101 0 101
Dijkstra's 97 0 97
Arithmetic 96 0 96
Combinatorics 84 0 84
Maximum flow 83 0 83
Disjoint set 84 0 84
Backtracking 77 0 77
Divide and conquer 62 0 62
Bitmask 59 0 59
Bipartite matching 58 0 58
Stack 58 0 58
Prefix sum 56 0 56
Constructive 50 0 50
Segment tree with lazy propagation 48 0 48
Priority queue 48 0 48
Line sweeping 48 0 48
Ad-Hoc 48 0 48
Strongly connected component 45 0 45
Parsing 45 0 45
Two-pointer 44 0 44
Dynamic programming; on trees 44 0 44
Exponentiation by squaring 42 0 42
Dynamic programming; using bitfield 39 0 39
Offline queries 39 0 39
Minimum spanning tree 37 0 37
Topological sorting 37 0 37
Simulation 37 0 37
Floyd–Warshall 33 0 33
Lowest common ancestor 31 0 31
Trie 30 0 30
Arbitrary precision / Big integers 30 0 30
Hashing 29 0 29
Convex hull 28 0 28
Recursion 28 0 28
Sieve of Eratosthenes 27 0 27
Square root decomposition 27 0 27
Fast Fourier transform 26 0 26
Knuth–Morris–Pratt 26 0 26
Suffix array and LCP array 26 0 26
2-SAT 25 0 25
Minimum cost maximum flow 24 0 24
Convex hull trick 22 0 22
Sparse array 19 0 19
Heavy-light decomposition 18 0 18
Inclusion and exclusion 18 0 18
Meet in the middle 18 0 18
Parallel binary search 18 0 18
Sprague–Grundy theorem 18 0 18
Set / Map by trees 18 0 18
Game theory 18 0 18
Mo's 17 0 17
Case work 17 0 17
Bellman–Ford 15 0 15
Deque 15 0 15
Ternary search 15 0 15
Calculus 15 0 15
Euclidean algorithm 14 0 14
Extended Euclidean algorithm 14 0 14
Longest increasing sequence in O(n log n) 14 0 14
Linear algebra 14 0 14
Line segment intersection check 13 0 13
Sliding window 13 0 13
Persistent segment tree 12 0 12
Aho-Corasick 11 0 11
Geometry; 3D 11 0 11
Articulation points and bridges 10 0 10
Primality test 10 0 10
Splay tree 10 0 10
Randomization 9 0 9
Centroid decomposition 9 0 9
Chinese remainder theorem 9 0 9
Divide and conquer optimization 9 0 9
Set / Map by hashing 9 0 9
Rabin–Karp 8 0 8
Queue 8 0 8
Dynamic programming; using a deque 8 0 8
Manacher 7 0 7
Möbius inversion 7 0 7
Regular Expression 7 0 7
Rotating calipers 7 0 7
Knapsack 7 0 7
Burnside's lemma 6 0 6
Fermat's little theorem 6 0 6
Gaussian elimination 6 0 6
Euler tour 6 0 6
Linear programming 6 0 6
Travelling salesman problem 6 0 6
Heuristics 5 0 5
Euler tour technique 6 0 6
Offline dynamic connectivity 5 0 5
Z 5 0 5
Euler characteristic (χ=V-E+F) 5 0 5
Numerical analysis 5 0 5
Berlekamp–Massey 4 0 4
Physics 4 0 4
Euler totient function 4 0 4
Hall's theorem 3 0 3
Miller–Rabin 3 0 3
Pollard rho 3 0 3
Global minimum cut 3 0 3
Knuth optimization 3 0 3
Link/cut tree 3 0 3
Dynamic programming; using connection profile 3 0 3
Bidirectional search 3 0 3
Area of a polygon 2 0 2
Delaunay triangulation 2 0 2
Directed minimum spanning tree 2 0 2
Hungarian 2 0 2
Palindrome tree 2 0 2
Pythagoras theorem 2 0 2
Matroid 2 0 2
Lucas theorem 2 0 2
Tree isomorphism 2 0 2
General matching 1 0 1
Point in convex polygon check 1 0 1
Voronoi diagram 1 0 1
Red-black tree 1 0 1
Geometry; hyperdimensional 1 0 1
Alien's trick 1 0 1
Dominator tree 1 0 1
Discrete logarithm 1 0 1
Discrete square root 1 0 1
Biconnected component 1 0 1
Linked list 1 0 1
Merge sort tree 1 0 1