National Taiwan University Online Judge

DP (138)brute force (58)Math (56)BFS (33)
binary search (31)greedy (29)String (27)DFS (26)
Geometry (22)flow (20)easy (17)Simulation (17)
graph (16)computational geometry (14)Tree DP (13)MST (12)
Matching (11)Sorting (10)shortest path (9)Number Theory (8)
recursion (8)sort (8)Ad Hoc (8)Hash (7)
小品演算法XD (7)Big Number (6)Trie (6)Game (5)
Bipartite Maximum Matching (5)Disjoint Set (5)Floyd-Warshall (5)Dynamic Programming (4)
SG value (4)LCA (4)BFS/DFS (4)heap (4)
Tree (4)線段樹(Segment Tree) (4)Maximum Flow (3)offline (3)
Union Find (3)prime (3)Data structure (3)Bellman Ford (3)
union (3)Topological Sort (3)Tyrant (3)平方分割 (3)
prime factor (3)水母 (3)dijkstra (3)SCC (3)
Queue (3)General Matching (3)ｇㄚ (3)convex hull (3)
Euler Circuit (3)Fibonacci (3)STL (2)Polya Theorem (2)
離散化 (2)持久化 (2)deque (2)Min-Cost flow (2)
maximum matching (2)當我沒說 (2)next permutation (2)perseverence, perseverence, perseverence (2)
stack (2)Jizz_Problem (2)probability (2)BCC (2)
Sieve (2)Matrix operation (2)Gaussian Elimination (2)LCS (2)
String matching (2)Joseph Problem (2)Farey Tree (2)DFS+DP(LCS) (2)
Huffman (2)Stoer-Wagner (2)Suffix Array (2)Euler's function (2)
可省去二分搜 (2)DotA (1)ｇ (1)半平面交 (1)
planar graph (1)FFT (1)MaxFlow (1)Heuristic Search (1)
DFS+pruning (1)有限狀態自動機(Finite State Machine){Automata} (1)Extended Euclid (1)sweeping (1)
exists an O(nlgn) algorithm. (1)SMP (1)next_permutation (1)Combination (1)
Articulation Point (1)testdata need enhancement (?) (1)Miller-Rabin (1)incomplete description (1)
long long (1)樹狀數組 (1)Ad-hoc (1)差分約束 (1)
Inversion Number (1)Ring Mapping (1)Carefulness (1)Search (1)
最小度限制生成樹 (1)Sweep Line (1)Matrix Multiply (1)枚舉+最短路徑 (1)
and 四色定理 (1)binary search tree (1)dijkastra (1)用vector容易TLE (1)
pre-calculation (1)string parsing (1)Strong Test Data (1)Bridge (1)
Network Flow (1)factorization (1)Monotonicity (1)BigNum (1)
RKKKKK (1)half-plane intersection (1)Bipartite Graph (1)Treap (1)
Warshell (1)Problem setter: akira (1)bipartite (1)cross product (1)
模擬 (1)100*600*600DP (1)recursion && string (1)Union ans Find (1)
Weak Test Data (1)DFS(2^8*1000) (1)DP+dijkstra (1)recursive (1)
AC自動機 (1)Floyd (1)狀態壓縮DP (1)splay tree (1)
數位類統計 (1)猜猜看題目要問什麼 (1)兩次Floyd Warshall (1)rope (1)
Chemistry (1)Next Permutation + LIS (1)problemsetter: kelvin (1)Determinant (1)
最短路徑 (1)Minimum Spanning Tree (1)Burnside lemma (1)DFS+cut (1)
DFS+convex hull (1)Test Problem (1)bipartite matching (1)greedy, KMP (1)
Rearrangement Inequality (1)bracket matching (1)puts("2"); (1)__int128 (1)
Search from goal (1)Dijkstra with sudo node (1)easy, brute force (1)max flow (1)
Binary-Search (1)Hash+DP (1)Dynamic Programming with Pruning (1)Depth First Search (1)
BinarySearcg + Dijkstra (1)array (1)Bellman-Ford (1)MergeSort (1)
防破台, 防破台, 防破台 (1)Iterative Method (1)Steiner Tree (1)You'll_Jizz (1)
514!!! (1)MinCut (1)STDERR_FILENO (1)DMST (1)
std::tm (1)MST(Kruskal's) (1)catalan (1)counting sort (1)
計算面積 (1)memoization (1)Alpha-beta pruning (1)preprocess (1)
DP + math(combination) (1)Aho-Corasick (1)coprime (1)DLX (1)
2-sat (1)KMP (1)題目條件騙人題 (1)Manhattan distance (1)
Weighted Bipartite Matching (1)Branch and Bound (1)hao123 (1)Inversion(逆序和) (1)
binary search+greedy (1)topological_sort (1)balance tree (1)Culer Circuit (1)
BFS+Math (1)Floyd-Warshall min-max version (1)解聯立方程式 (1)syntax tree (1)
1 1 (1)Pruning (1)be careful (1)練習看長篇且充滿陷阱的題目敘述 (1)
Suffix Tree (1)Flood Fill (1)inclusion–exclusion principle (1)有陷阱的題目敘述 (1)
觸手 (1)倍增 (1)segment tree (1)CSP (1)
Floyd Warshall (1)枚舉+KMP (1)Euler Path (1)奇偶性討論 (1)
枚舉 (1)8 8 (1)IDA* (1)merge sort (1)
degree (1)XD (1)LIS (1)Z value (1)
implementation (1)
Top Taggers
1sa072686135
2l52153093
3Natural80
4tmt51461
5BNMAA60
6可愛的貓咪醫生58
7anfranion48
8DarkKnight45
9david942j35
10scan33scan3332
11MnO229
12ckclark24
13s86437200223
14ħħ17
15a127a12715
16anonymous13
17Fate_Testarossa10
18momohuang10
19iaNTU9
20tentacle9
programmer: 劉邦鋒 pangfeng, 上官林傑 ericsk, 陳映睿 springgod, 王尹 cindylinz, 蕭俊宏 chhsiao.
Imager: 江昌鴻 senkousha.
modified by: 高紹航 denehs, 沈定 beephoenix, 馮俊菘 csferng, 黃上恩 tmt514