Dataset Viewer
negative
listlengths 3
3
| positive
dict | reference
dict |
|---|---|---|
[
{
"prob_id": "814d",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "814c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "585f",
"tags": [
"Aho-Corasick|String Structures|Advanced Data Structures"
]
}
] |
{
"prob_id": "276c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics",
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
|
{
"prob_id": "816b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics",
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
|
[
{
"prob_id": "1361c",
"tags": [
"Euler Tour||"
]
},
{
"prob_id": "1349d",
"tags": [
"Martingale|Probabilities and Expected Values|Math",
"Probabilities and Expected Values|Probabilities and Expected Values|Math",
"The Slime Trick|Probabilities and Expected Values|Math",
"Thomas Algorithm|Linear Algebra|Math"
]
},
{
"prob_id": "1436e",
"tags": [
"[Problem] MEX of all Subarrays|Miscellaneous|Miscellaneous"
]
}
] |
{
"prob_id": "div game169",
"tags": [
"Divisibility||",
"Prime Factorization|Number Theory|Basics"
]
}
|
{
"prob_id": "1349a",
"tags": [
"Divisibility||",
"Prime Factorization|Number Theory|Basics"
]
}
|
[
{
"prob_id": "1108e2",
"tags": [
"Sorted Set||"
]
},
{
"prob_id": "1190a",
"tags": [
"Global Deltaing||Advanced Data Structures"
]
},
{
"prob_id": "1327d",
"tags": [
"Permutations and Permutation Cycles|Permutations|Miscellaneous"
]
}
] |
{
"prob_id": "588e",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
}
|
{
"prob_id": "1140g",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
}
|
[
{
"prob_id": "585d",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
},
{
"prob_id": "585f",
"tags": [
"Aho-Corasick|String Structures|Advanced Data Structures"
]
},
{
"prob_id": "793c",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
}
] |
{
"prob_id": "609e",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
}
|
{
"prob_id": "588e",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
}
|
[
{
"prob_id": "1051f",
"tags": [
"Euler Tour||",
"Tree Euler||"
]
},
{
"prob_id": "842d",
"tags": [
"MEX task (Minimal Excluded element in an array)|Sequences|Miscellaneous"
]
},
{
"prob_id": "1416c",
"tags": [
"Trie on Strings and Bits|Trie|Data Structures (DS)"
]
}
] |
{
"prob_id": "601e",
"tags": [
"Dynamic Connectivity Problem (Offline)|Dynamic Connectivity|Data Structures (DS)",
"Offline Deletion||"
]
}
|
{
"prob_id": "1217f",
"tags": [
"Dynamic Connectivity Problem (Offline)|Dynamic Connectivity|Data Structures (DS)",
"Offline Deletion||"
]
}
|
[
{
"prob_id": "1081c",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "704b",
"tags": [
"Connected Component DP|Miscellaneous|Dynamic Programming (DP)"
]
},
{
"prob_id": "911g",
"tags": [
"Pragmas|Miscellaneous|Miscellaneous",
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
}
] |
{
"prob_id": "1063f",
"tags": [
"String Suffix||",
"Suffix Automaton|Suffix Structures|Strings"
]
}
|
{
"prob_id": "235c",
"tags": [
"String Suffix||",
"Suffix Automaton|Suffix Structures|Strings"
]
}
|
[
{
"prob_id": "754e",
"tags": [
"2D FFT / NTT|Convolution|Math",
"String Matching using Bitsets|String Matching|Strings"
]
},
{
"prob_id": "modularness156",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
},
{
"prob_id": "snuke line068",
"tags": [
"Harmonic Lemma||Intermediate"
]
}
] |
{
"prob_id": "292c",
"tags": [
"Backtracking|Miscellaneous|Miscellaneous"
]
}
|
{
"prob_id": "755114",
"tags": [
"Backtracking|Miscellaneous|Miscellaneous"
]
}
|
[
{
"prob_id": "1580c",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "161d",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
},
{
"prob_id": "1476a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
}
] |
{
"prob_id": "17e",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
|
{
"prob_id": "1478c",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
|
[
{
"prob_id": "22e",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "471d",
"tags": [
"Z algorithm|String Matching|Strings"
]
},
{
"prob_id": "241c",
"tags": [
"Reflections on a Rectangle|Miscellaneous|Geometry"
]
}
] |
{
"prob_id": "multiple of 2019164",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
|
{
"prob_id": "363b",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
|
[
{
"prob_id": "809d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
},
{
"prob_id": "873f",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "893f",
"tags": [
"Tree Flattening||Advanced Data Structures"
]
}
] |
{
"prob_id": "590b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
{
"prob_id": "847b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
[
{
"prob_id": "825f",
"tags": [
"Z algorithm|String Matching|Strings"
]
},
{
"prob_id": "1100b",
"tags": [
"Amortized Analysis||Intermediate"
]
},
{
"prob_id": "839d",
"tags": [
"Principle of Inclusion-Exclusion|Counting|Intermediate"
]
}
] |
{
"prob_id": "590b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
{
"prob_id": "818f",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
[
{
"prob_id": "1368d",
"tags": [
"Basic Greedy Algorithms|Greedy and Constructive|Basics",
"Bit Manipulation|Bit Manipulation|Basics"
]
},
{
"prob_id": "576a",
"tags": [
"Prime Factorization|Number Theory|Basics"
]
},
{
"prob_id": "1387b2",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)",
"Small to Large||"
]
}
] |
{
"prob_id": "water bottle144",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
{
"prob_id": "1468d",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
[
{
"prob_id": "digit sum044",
"tags": [
"Harmonic Lemma||Intermediate",
"Square-Root Discrimination||Intermediate"
]
},
{
"prob_id": "meaningful mean075",
"tags": [
"Order Statistics||Intermediate"
]
},
{
"prob_id": "one-stroke path054",
"tags": [
"All-Permutations|Complete Search|Basics"
]
}
] |
{
"prob_id": "590b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
{
"prob_id": "triangles143",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
[
{
"prob_id": "568b",
"tags": [
"Partitions of a Set / Bell Number|Partitions|Combinatorics"
]
},
{
"prob_id": "567e",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "392c",
"tags": [
"Berlekamp Messey|Linear Recurrence|Math",
"Generating Functions|Polynomial|Math",
"Matrix Exponentiation|Matrices|Math"
]
}
] |
{
"prob_id": "distinct numbers143",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
{
"prob_id": "580b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
[
{
"prob_id": "868f",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
},
{
"prob_id": "632d",
"tags": [
"Divisor Sieve|Number Theory|Intermediate",
"Harmonic Lemma||Intermediate"
]
},
{
"prob_id": "148d",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]
}
] |
{
"prob_id": "water bottle144",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
{
"prob_id": "165b",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
|
[
{
"prob_id": "117c",
"tags": [
"Tournament Graph|Special Graphs|Graph Theory"
]
},
{
"prob_id": "498e",
"tags": [
"Binary Exponentiation|Fundamentals|Algebra"
]
},
{
"prob_id": "873d",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
}
] |
{
"prob_id": "1073c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
}
|
{
"prob_id": "6e",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
}
|
[
{
"prob_id": "10d",
"tags": [
"Longest Increasing Subsequence (LIS)|Classic DP|Dynamic Programming (DP)"
]
},
{
"prob_id": "1375d",
"tags": [
"MEX task (Minimal Excluded element in an array)|Sequences|Miscellaneous"
]
},
{
"prob_id": "449d",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics",
"Sum Over Subsets DP (SOS DP)|Bit Related DP|Dynamic Programming (DP)"
]
}
] |
{
"prob_id": "1205b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
}
|
{
"prob_id": "689b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
}
|
[
{
"prob_id": "1061f",
"tags": [
"Interactive Problems|Interactive Problems|Miscellaneous",
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
},
{
"prob_id": "588e",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
},
{
"prob_id": "1328a",
"tags": [
"Big O Notation and Time and Space Complexity Analysis|Complexity Analysis|Basics"
]
}
] |
{
"prob_id": "1407e",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
}
|
{
"prob_id": "769c",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
}
|
[
{
"prob_id": "431c",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "803d",
"tags": [
"Basic Greedy Algorithms|Greedy and Constructive|Basics",
"Binary Search|Leveraging Monotonicity|Basics",
"Two Pointers|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "741d",
"tags": [
"Small to Large||"
]
}
] |
{
"prob_id": "291c",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
|
{
"prob_id": "579a",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
|
[
{
"prob_id": "14d",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures",
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "1555e",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "1365d",
"tags": [
"Flood Fill||"
]
}
] |
{
"prob_id": "291c",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
|
{
"prob_id": "1420b",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
|
[
{
"prob_id": "161d",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
},
{
"prob_id": "1454e",
"tags": [
"Cycle Detection|Cycles|Graph Theory"
]
},
{
"prob_id": "1475f",
"tags": [
"2-SAT|DFS Lowlink|Advanced Algorithms",
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
}
] |
{
"prob_id": "906d",
"tags": [
"Divisibility||"
]
}
|
{
"prob_id": "1225d",
"tags": [
"Divisibility||"
]
}
|
[
{
"prob_id": "1085e",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
},
{
"prob_id": "630h",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
},
{
"prob_id": "1375d",
"tags": [
"MEX task (Minimal Excluded element in an array)|Sequences|Miscellaneous"
]
}
] |
{
"prob_id": "906d",
"tags": [
"Divisibility||"
]
}
|
{
"prob_id": "1536c",
"tags": [
"Divisibility||"
]
}
|
[
{
"prob_id": "785e",
"tags": [
"2D BIT|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
},
{
"prob_id": "877e",
"tags": [
"Tree Flattening||Advanced Data Structures"
]
},
{
"prob_id": "653f",
"tags": [
"String Suffix||",
"Suffix Automaton|Suffix Structures|Strings"
]
}
] |
{
"prob_id": "common subsequence130",
"tags": [
"Knapsack DP||"
]
}
|
{
"prob_id": "675e",
"tags": [
"Knapsack DP||"
]
}
|
[
{
"prob_id": "510b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "702e",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
},
{
"prob_id": "662a",
"tags": [
"Vector Space and XOR Basis|Linear Algebra|Math"
]
}
] |
{
"prob_id": "909c",
"tags": [
"Knapsack DP||"
]
}
|
{
"prob_id": "797f",
"tags": [
"Knapsack DP||"
]
}
|
[
{
"prob_id": "1240f",
"tags": [
"Edge Coloring of Bipartite Graph|Graph Coloring|Graph Theory"
]
},
{
"prob_id": "708d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "1594c",
"tags": [
"Harmonic Number|Very Basic Math|Basics"
]
}
] |
{
"prob_id": "1402c",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
}
|
{
"prob_id": "735e",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
}
|
[
{
"prob_id": "833b",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming",
"Knapsack DP||"
]
},
{
"prob_id": "786b",
"tags": [
"[Trick] Dijkstra on Segment Tree|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "323b",
"tags": [
"Tournament Graph|Special Graphs|Graph Theory"
]
}
] |
{
"prob_id": "ki138",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
}
|
{
"prob_id": "766e",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
}
|
[
{
"prob_id": "honestorunkind2147",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
},
{
"prob_id": "fork in the road144",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]
},
{
"prob_id": "tak and hotels060",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
] |
{
"prob_id": "150b",
"tags": [
"Disjoint Set Union||"
]
}
|
{
"prob_id": "decayed bridges120",
"tags": [
"Disjoint Set Union||"
]
}
|
[
{
"prob_id": "702f",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
},
{
"prob_id": "1203f1",
"tags": [
"Exchange Argument|Greedy|Basics"
]
},
{
"prob_id": "1000e",
"tags": [
"Articulation Bridges and Bridge Tree|Graph Connectivity|Graph Theory"
]
}
] |
{
"prob_id": "1257f",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
}
|
{
"prob_id": "585d",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
}
|
[
{
"prob_id": "633c",
"tags": [
"Trie||"
]
},
{
"prob_id": "414b",
"tags": [
"Counting with DP||Intermediate"
]
},
{
"prob_id": "1091e",
"tags": [
"Degree Sequences|Miscellaneous|Graph Theory"
]
}
] |
{
"prob_id": "1257f",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
}
|
{
"prob_id": "1105e",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
}
|
[
{
"prob_id": "427c",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "1016b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "831c",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
] |
{
"prob_id": "1025d",
"tags": [
"Interval DP / Range DP / Matrix Chain Multiplication (MCM)|Classic DP|Dynamic Programming (DP)"
]
}
|
{
"prob_id": "245h",
"tags": [
"Interval DP / Range DP / Matrix Chain Multiplication (MCM)|Classic DP|Dynamic Programming (DP)"
]
}
|
[
{
"prob_id": "1201c",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "427c",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
},
{
"prob_id": "1613f",
"tags": [
"Number Theoretic Transform (NTT)|Convolution|Math"
]
}
] |
{
"prob_id": "1025d",
"tags": [
"Interval DP / Range DP / Matrix Chain Multiplication (MCM)|Classic DP|Dynamic Programming (DP)"
]
}
|
{
"prob_id": "1303e",
"tags": [
"Interval DP / Range DP / Matrix Chain Multiplication (MCM)|Classic DP|Dynamic Programming (DP)"
]
}
|
[
{
"prob_id": "1536b",
"tags": [
"Pigeonhole Principle|Basic Counting|Basics"
]
},
{
"prob_id": "1619h",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "150e",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
] |
{
"prob_id": "32c",
"tags": [
"Minimum Spanning Tree||"
]
}
|
{
"prob_id": "1513d",
"tags": [
"Minimum Spanning Tree||"
]
}
|
[
{
"prob_id": "1252k",
"tags": [
"Segment Tree with Lazy Propagation|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "4d",
"tags": [
"DP with Solution Construction||Intermediate"
]
},
{
"prob_id": "1477a",
"tags": [
"Bezout's Identity|Euclidean Algorithm|Number Theory"
]
}
] |
{
"prob_id": "632f",
"tags": [
"Minimum Spanning Tree||"
]
}
|
{
"prob_id": "1245d",
"tags": [
"Minimum Spanning Tree||"
]
}
|
[
{
"prob_id": "244b",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
},
{
"prob_id": "434d",
"tags": [
"Network Flows||Advanced Algorithms"
]
},
{
"prob_id": "245h",
"tags": [
"Interval DP / Range DP / Matrix Chain Multiplication (MCM)|Classic DP|Dynamic Programming (DP)"
]
}
] |
{
"prob_id": "1513d",
"tags": [
"Minimum Spanning Tree||"
]
}
|
{
"prob_id": "125e",
"tags": [
"Minimum Spanning Tree||"
]
}
|
[
{
"prob_id": "960g",
"tags": [
"Stirling Number of the First Kind for Fixed N|Stirling Numbers|Combinatorics"
]
},
{
"prob_id": "1288c",
"tags": [
"Stars and Bars|Basic Counting|Basics"
]
},
{
"prob_id": "1108e2",
"tags": [
"Sorted Set||"
]
}
] |
{
"prob_id": "32c",
"tags": [
"Minimum Spanning Tree||"
]
}
|
{
"prob_id": "1408e",
"tags": [
"Minimum Spanning Tree||"
]
}
|
[
{
"prob_id": "1085e",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
},
{
"prob_id": "704d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "128b",
"tags": [
"Suffix Automaton|Suffix Structures|Strings"
]
}
] |
{
"prob_id": "909e",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
}
|
{
"prob_id": "510c",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
}
|
[
{
"prob_id": "402e",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
},
{
"prob_id": "650d",
"tags": [
"O(n lg n) Longest Monotonic Subsequence|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "713d",
"tags": [
"Level Ancestors and Lowest Common Ancestors||Advanced Data Structures"
]
}
] |
{
"prob_id": "510c",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
}
|
{
"prob_id": "501c",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
}
|
[
{
"prob_id": "117e",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
},
{
"prob_id": "464b",
"tags": [
"All-Permutations|Complete Search|Basics",
"Backtracking|Miscellaneous|Miscellaneous"
]
},
{
"prob_id": "1217f",
"tags": [
"Dynamic Connectivity Problem (Offline)|Dynamic Connectivity|Data Structures (DS)",
"Offline Deletion||"
]
}
] |
{
"prob_id": "510c",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
}
|
{
"prob_id": "825e",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
}
|
[
{
"prob_id": "708d",
"tags": [
"Flow with Lower Bounds||"
]
},
{
"prob_id": "884f",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
},
{
"prob_id": "616c",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
] |
{
"prob_id": "852b",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
}
|
{
"prob_id": "621e",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
}
|
[
{
"prob_id": "241c",
"tags": [
"Reflections on a Rectangle|Miscellaneous|Geometry"
]
},
{
"prob_id": "32e",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
},
{
"prob_id": "501d",
"tags": [
"Factorial Number System|Miscellaneous|Number Theory",
"Segment Tree|Trees|Data Structures",
"Sorted Set||"
]
}
] |
{
"prob_id": "678d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
}
|
{
"prob_id": "576d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
}
|
[
{
"prob_id": "1110e",
"tags": [
"Invariants and Monovariants|Techniques|Miscellaneous"
]
},
{
"prob_id": "679a",
"tags": [
"Interactive Problems|Interactive Problems|Miscellaneous"
]
},
{
"prob_id": "702e",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
] |
{
"prob_id": "678d",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
}
|
{
"prob_id": "917c",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
}
|
[
{
"prob_id": "891e",
"tags": [
"Generating Functions|Polynomial|Math"
]
},
{
"prob_id": "1418e",
"tags": [
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
},
{
"prob_id": "755114",
"tags": [
"Backtracking|Miscellaneous|Miscellaneous"
]
}
] |
{
"prob_id": "1234d",
"tags": [
"Segment Tree|Trees|Data Structures"
]
}
|
{
"prob_id": "914d",
"tags": [
"Segment Tree|Trees|Data Structures"
]
}
|
[
{
"prob_id": "82a",
"tags": [
"Sums and Asymptotics||Preliminaries"
]
},
{
"prob_id": "827f",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
},
{
"prob_id": "840d",
"tags": [
"Divide & Conquer - Static Range Queries||"
]
}
] |
{
"prob_id": "silver fox vs monster153",
"tags": [
"Sweep Line||"
]
}
|
{
"prob_id": "834b",
"tags": [
"Sweep Line||"
]
}
|
[
{
"prob_id": "101b",
"tags": [
"Knapsack DP||",
"Sweep Line||"
]
},
{
"prob_id": "609e",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
},
{
"prob_id": "594d",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)",
"Euler's totient function|Number-theoretic functions|Algebra",
"Offline Queries|Techniques|Data Structures (DS)",
"Segment Tree|Trees|Data Structures"
]
}
] |
{
"prob_id": "631e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
}
|
{
"prob_id": "333e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
}
|
[
{
"prob_id": "545d",
"tags": [
"Exchange Argument|Greedy|Basics"
]
},
{
"prob_id": "755114",
"tags": [
"Backtracking|Miscellaneous|Miscellaneous"
]
},
{
"prob_id": "915g",
"tags": [
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]
}
] |
{
"prob_id": "319c",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
}
|
{
"prob_id": "682e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
}
|
[
{
"prob_id": "hopscotch addict132",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "tak and hotels060",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
},
{
"prob_id": "multiple of 2019164",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
] |
{
"prob_id": "873d",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
}
|
{
"prob_id": "yakiniku restaurants067",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
}
|
[
{
"prob_id": "987e",
"tags": [
"Permutations and Permutation Cycles|Permutations|Miscellaneous"
]
},
{
"prob_id": "86d",
"tags": [
"Mo's Algorithm|Square Root Decomposition|Data Structures (DS)",
"Square Root Decomposition||"
]
},
{
"prob_id": "1006c",
"tags": [
"Two Pointers|Leveraging Monotonicity|Basics"
]
}
] |
{
"prob_id": "768b",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
}
|
{
"prob_id": "868f",
"tags": [
"Divide and Conquer DP|DP optimizations|Dynamic Programming"
]
}
|
[
{
"prob_id": "87e",
"tags": [
"Minkowski Sum|Convex Polygon|Geometry",
"Point in Convex Polygon in log(N)(2D)|Geometry 2D|Geometry"
]
},
{
"prob_id": "371d",
"tags": [
"Disjoint Set Union||"
]
},
{
"prob_id": "1176e",
"tags": [
"Bipartite Graph||",
"Graph Traversal||"
]
}
] |
{
"prob_id": "BTREE",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
|
{
"prob_id": "342e",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
|
[
{
"prob_id": "78c",
"tags": [
"Winning and Losing Positions, Strategy Stealing|Combinatorial Games|Advanced Algorithms"
]
},
{
"prob_id": "703d",
"tags": [
"Offline Processing of Queries||Advanced Data Structures"
]
},
{
"prob_id": "786b",
"tags": [
"[Trick] Dijkstra on Segment Tree|Shortest Paths|Graph Theory"
]
}
] |
{
"prob_id": "708c",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
|
{
"prob_id": "150e",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
|
[
{
"prob_id": "827e",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math",
"String Matching with FFT ft Wildcard Matching|String Matching|Strings"
]
},
{
"prob_id": "825f",
"tags": [
"Z algorithm|String Matching|Strings"
]
},
{
"prob_id": "828f",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
}
] |
{
"prob_id": "708c",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
|
{
"prob_id": "833d",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
}
|
[
{
"prob_id": "sum of gcd of tuples (hard)162",
"tags": [
"Harmonic Lemma||Intermediate",
"Möbius Inversion||Advanced Mathematics"
]
},
{
"prob_id": "exhausted?076",
"tags": [
"Bipartite Matching|Network Flows|Advanced Algorithms"
]
},
{
"prob_id": "or plus max100",
"tags": [
"Subset Convolution|Bit Related DP|Dynamic Programming (DP)"
]
}
] |
{
"prob_id": "702e",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
|
{
"prob_id": "tak and hotels060",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
|
[
{
"prob_id": "1175f",
"tags": [
"XOR Hashing|Hashing|Strings"
]
},
{
"prob_id": "120j",
"tags": [
"Closest Pair of Points|Sweep Line|Geometry"
]
},
{
"prob_id": "878c",
"tags": [
"Sorted Set||"
]
}
] |
{
"prob_id": "teleporter167",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
|
{
"prob_id": "1328e",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
|
[
{
"prob_id": "25c",
"tags": [
"All-Pairs|Shortest Paths|Intermediate"
]
},
{
"prob_id": "372b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "1434d",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"
]
}
] |
{
"prob_id": "teleporter167",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
|
{
"prob_id": "372d",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
}
|
[
{
"prob_id": "19e",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory",
"Queue Undo Trick|Techniques|Data Structures (DS)"
]
},
{
"prob_id": "lisdl091",
"tags": [
"Longest Increasing Subsequence (LIS)|Classic DP|Dynamic Programming (DP)"
]
},
{
"prob_id": "lcms038",
"tags": [
"Inclusion Exclusion on Multiples|Inclusion Exclusion|Combinatorics",
"Mobius Function and Mobius Inversion|Multiplicative Functions|Number Theory"
]
}
] |
{
"prob_id": "471d",
"tags": [
"Z algorithm|String Matching|Strings"
]
}
|
{
"prob_id": "iroha loves strings058",
"tags": [
"Z algorithm|String Matching|Strings"
]
}
|
[
{
"prob_id": "724c",
"tags": [
"Reflections on a Rectangle|Miscellaneous|Geometry"
]
},
{
"prob_id": "305b",
"tags": [
"Continued Fractions|Miscellaneous|Math"
]
},
{
"prob_id": "464e",
"tags": [
"Dijkstra's Algorithm|Shortest Paths|Graph Theory"
]
}
] |
{
"prob_id": "1055f",
"tags": [
"Trie||"
]
}
|
{
"prob_id": "455b",
"tags": [
"Trie||"
]
}
|
[
{
"prob_id": "1205b",
"tags": [
"Breadth First Search|Graph traversal|Graphs"
]
},
{
"prob_id": "1093e",
"tags": [
"2D BIT|Binary Indexed Tree (BIT)|Data Structures (DS)",
"CDQ Divide and Conquer|Techniques|Data Structures (DS)"
]
},
{
"prob_id": "909e",
"tags": [
"Topological Sorting|Graph Traversal|Graph Theory"
]
}
] |
{
"prob_id": "1197e",
"tags": [
"Counting Minimums with Segment Tree||"
]
}
|
{
"prob_id": "997e",
"tags": [
"Counting Minimums with Segment Tree||"
]
}
|
[
{
"prob_id": "963e",
"tags": [
"Gaussian Elimination|Linear Algebra|Math"
]
},
{
"prob_id": "1175d",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "251a",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
}
] |
{
"prob_id": "1109f",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
}
|
{
"prob_id": "117e",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
}
|
[
{
"prob_id": "954f",
"tags": [
"Matrix Exponentiation|Matrices|Math"
]
},
{
"prob_id": "1389a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics",
"Greatest Common Divisor and Least Common Multiple|Number Theory|Basics"
]
},
{
"prob_id": "597c",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
}
] |
{
"prob_id": "1109f",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
}
|
{
"prob_id": "1172e",
"tags": [
"Link Cut Tree (LCT)|Link Cut Tree (LCT)|Data Structures (DS)"
]
}
|
[
{
"prob_id": "1442d",
"tags": [
"Queue Undo Trick|Techniques|Data Structures (DS)",
"SMAWK Algorithm and Min Plus Convolution (Convex and Arbitrary)|Min Plus Convolution|Miscellaneous"
]
},
{
"prob_id": "1195f",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms",
"Point Update Range Sum||"
]
},
{
"prob_id": "1567b",
"tags": [
"Bit Manipulation|Bit Manipulation|Basics"
]
}
] |
{
"prob_id": "22e",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
}
|
{
"prob_id": "1239d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
}
|
[
{
"prob_id": "598c",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
},
{
"prob_id": "793a",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
},
{
"prob_id": "1245a",
"tags": [
"Chicken McNugget Theorem|Euclidean Algorithm|Number Theory"
]
}
] |
{
"prob_id": "22e",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
}
|
{
"prob_id": "505d",
"tags": [
"Strongly Connected Components (SCC)|Graph Connectivity|Graph Theory"
]
}
|
[
{
"prob_id": "191a",
"tags": [
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "855c",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)",
"Subtree Convolution|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "18e",
"tags": [
"Knapsack DP||"
]
}
] |
{
"prob_id": "837g",
"tags": [
"Persistent Segment Tree|Segment Tree|Data Structures (DS)"
]
}
|
{
"prob_id": "226e",
"tags": [
"Persistent Segment Tree|Segment Tree|Data Structures (DS)"
]
}
|
[
{
"prob_id": "361b",
"tags": [
"Relatively Prime, Euler Totient Function|Number Theory|Intermediate"
]
},
{
"prob_id": "87e",
"tags": [
"Minkowski Sum|Convex Polygon|Geometry",
"Point in Convex Polygon in log(N)(2D)|Geometry 2D|Geometry"
]
},
{
"prob_id": "340c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
}
] |
{
"prob_id": "837g",
"tags": [
"Persistent Segment Tree|Segment Tree|Data Structures (DS)"
]
}
|
{
"prob_id": "484e",
"tags": [
"Persistent Segment Tree|Segment Tree|Data Structures (DS)"
]
}
|
[
{
"prob_id": "219d",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "241e",
"tags": [
"Single Source with Negative Weights|Shortest Paths|Intermediate"
]
},
{
"prob_id": "1016b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
] |
{
"prob_id": "EST",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
|
{
"prob_id": "204e",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
|
[
{
"prob_id": "359c",
"tags": [
"Greatest Common Divisor and Least Common Multiple|Number Theory|Basics"
]
},
{
"prob_id": "47d",
"tags": [
"Backtracking|Miscellaneous|Miscellaneous"
]
},
{
"prob_id": "27d",
"tags": [
"Bipartite Graph||"
]
}
] |
{
"prob_id": "802i",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
|
{
"prob_id": "232d",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
|
[
{
"prob_id": "613d",
"tags": [
"Virtual Tree / Auxiliary Tree|More Tree Stuff|Graph Theory"
]
},
{
"prob_id": "120j",
"tags": [
"Closest Pair of Points|Sweep Line|Geometry"
]
},
{
"prob_id": "617b",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
}
] |
{
"prob_id": "802i",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
|
{
"prob_id": "504e",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
|
[
{
"prob_id": "1392h",
"tags": [
"Martingale|Probabilities and Expected Values|Math",
"Probabilities and Expected Values|Probabilities and Expected Values|Math"
]
},
{
"prob_id": "633f",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "1083a",
"tags": [
"DP on Trees and DAGs|Dp on Different Structures|Dynamic Programming (DP)"
]
}
] |
{
"prob_id": "1510b",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
}
|
{
"prob_id": "1307g",
"tags": [
"Min Cost Max Flow (MCMF)|Flow and Min Cut|Graph Theory"
]
}
|
[
{
"prob_id": "722c",
"tags": [
"Disjoint Set Union||"
]
},
{
"prob_id": "453e",
"tags": [
"Segment Tree Beats|Segment Tree|Data Structures (DS)"
]
},
{
"prob_id": "451e",
"tags": [
"Generating Functions|Polynomial|Math",
"Principle of Inclusion-Exclusion|Counting|Intermediate"
]
}
] |
{
"prob_id": "1310f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
{
"prob_id": "1194d",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
[
{
"prob_id": "1575f",
"tags": [
"Martingale|Probabilities and Expected Values|Math"
]
},
{
"prob_id": "997e",
"tags": [
"Counting Minimums with Segment Tree||"
]
},
{
"prob_id": "1364c",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
}
] |
{
"prob_id": "1310f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
{
"prob_id": "FDIVGAME",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
[
{
"prob_id": "222c",
"tags": [
"Sieve, Prime Factorization and Divisors|Primes and Divisors|Number Theory"
]
},
{
"prob_id": "611c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "835f",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
}
] |
{
"prob_id": "1310f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
{
"prob_id": "1312f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
[
{
"prob_id": "1006f",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics",
"Meet in the Middle|Techniques|Miscellaneous"
]
},
{
"prob_id": "1364c",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
},
{
"prob_id": "1408e",
"tags": [
"Minimum Spanning Tree||"
]
}
] |
{
"prob_id": "1310f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
{
"prob_id": "1451f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
[
{
"prob_id": "12d",
"tags": [
"BIT / Fenwick Tree|Binary Indexed Tree (BIT)|Data Structures (DS)"
]
},
{
"prob_id": "58a",
"tags": [
"Greedy Stays Ahead|Greedy|Basics"
]
},
{
"prob_id": "231e",
"tags": [
"Biconnectivity|DFS Lowlink|Advanced Algorithms"
]
}
] |
{
"prob_id": "1310f",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
{
"prob_id": "305e",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
}
|
[
{
"prob_id": "grouping067",
"tags": [
"Harmonic Lemma||Intermediate"
]
},
{
"prob_id": "fork in the road144",
"tags": [
"Markov Chains|Probability and Expectation|Intermediate"
]
},
{
"prob_id": "red and green apples160",
"tags": [
"Exchange Argument|Greedy|Basics"
]
}
] |
{
"prob_id": "1299d",
"tags": [
"XOR Basis||"
]
}
|
{
"prob_id": "xor battle045",
"tags": [
"XOR Basis||"
]
}
|
[
{
"prob_id": "585d",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
},
{
"prob_id": "193a",
"tags": [
"Grid Graphs|Graphs|Basics"
]
},
{
"prob_id": "434d",
"tags": [
"Network Flows||Advanced Algorithms"
]
}
] |
{
"prob_id": "855f",
"tags": [
"Segment Tree Beats|Segment Tree|Data Structures (DS)"
]
}
|
{
"prob_id": "438d",
"tags": [
"Segment Tree Beats|Segment Tree|Data Structures (DS)"
]
}
|
[
{
"prob_id": "engines139",
"tags": [
"Vectors and Applications|Geometry|Basics"
]
},
{
"prob_id": "many easy problems005",
"tags": [
"Generating Functions|Polynomial|Math",
"[Problem] Sum of nCr(a[i], K) for each K from 1 to N|Factorials and Binomial Coefficients (nCr)|Combinatorics"
]
},
{
"prob_id": "lotus leaves074",
"tags": [
"Network Flows||Advanced Algorithms"
]
}
] |
{
"prob_id": "527a",
"tags": [
"Greatest Common Divisor and Least Common Multiple|Number Theory|Basics"
]
}
|
{
"prob_id": "partition112",
"tags": [
"Greatest Common Divisor and Least Common Multiple|Number Theory|Basics"
]
}
|
[
{
"prob_id": "580c",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
},
{
"prob_id": "678f",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "958f3",
"tags": [
"Fast Fourier Transform (FFT)|Convolution|Math"
]
}
] |
{
"prob_id": "180b",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
{
"prob_id": "284a",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
[
{
"prob_id": "722c",
"tags": [
"Disjoint Set Union||"
]
},
{
"prob_id": "1151c",
"tags": [
"Sums and Asymptotics||Preliminaries"
]
},
{
"prob_id": "842d",
"tags": [
"MEX task (Minimal Excluded element in an array)|Sequences|Miscellaneous"
]
}
] |
{
"prob_id": "modulo summation103",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
{
"prob_id": "793a",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
[
{
"prob_id": "505c",
"tags": [
"GP Hash Table|Policy Based Data Structures|Data Structures (DS)"
]
},
{
"prob_id": "213c",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Flatten the Memo|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "1288c",
"tags": [
"Stars and Bars|Basic Counting|Basics"
]
}
] |
{
"prob_id": "special trains084",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
{
"prob_id": "682a",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
[
{
"prob_id": "distinct numbers143",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "iroha loves strings058",
"tags": [
"Z algorithm|String Matching|Strings"
]
},
{
"prob_id": "gcd on blackboard125",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
] |
{
"prob_id": "180b",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
{
"prob_id": "remainder minimization 2019133",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
[
{
"prob_id": "red and green apples160",
"tags": [
"Exchange Argument|Greedy|Basics"
]
},
{
"prob_id": "league139",
"tags": [
"Directed Acyclic Graphs|Shortest Paths|Intermediate"
]
},
{
"prob_id": "digit sum044",
"tags": [
"Harmonic Lemma||Intermediate",
"Square-Root Discrimination||Intermediate"
]
}
] |
{
"prob_id": "180b",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
{
"prob_id": "sequence sum179",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
|
[
{
"prob_id": "455d",
"tags": [
"Splay Trees and Treaps|Augmenting Data Structures|Advanced Data Structures"
]
},
{
"prob_id": "546e",
"tags": [
"Network Flows||Advanced Algorithms"
]
},
{
"prob_id": "30e",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
}
] |
{
"prob_id": "983b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
|
{
"prob_id": "18c",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
|
[
{
"prob_id": "double factorial148",
"tags": [
"Prime Factorization|Number Theory|Basics"
]
},
{
"prob_id": "sum of gcd of tuples (hard)162",
"tags": [
"Harmonic Lemma||Intermediate",
"Möbius Inversion||Advanced Mathematics"
]
},
{
"prob_id": "must be rectangular!131",
"tags": [
"Bipartite Graph||"
]
}
] |
{
"prob_id": "877b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
|
{
"prob_id": "atcoder express 2106",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
|
[
{
"prob_id": "854a",
"tags": [
"Greatest Common Divisor and Least Common Multiple|Number Theory|Basics"
]
},
{
"prob_id": "19e",
"tags": [
"DFS Tree|Graph Traversal|Graph Theory",
"Queue Undo Trick|Techniques|Data Structures (DS)"
]
},
{
"prob_id": "891e",
"tags": [
"Generating Functions|Polynomial|Math"
]
}
] |
{
"prob_id": "get ac122",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
|
{
"prob_id": "602b",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
}
|
[
{
"prob_id": "not divisible170",
"tags": [
"Prime and Composite, Primality Testing, Prime Sieves, Finding Divisors|Number Theory|Preliminaries"
]
},
{
"prob_id": "chat in a circle173",
"tags": [
"Structural Argument|Greedy|Basics"
]
},
{
"prob_id": "or plus max100",
"tags": [
"Subset Convolution|Bit Related DP|Dynamic Programming (DP)"
]
}
] |
{
"prob_id": "760f",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
}
|
{
"prob_id": "many many paths154",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
}
|
[
{
"prob_id": "914e",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "241e",
"tags": [
"Single Source with Negative Weights|Shortest Paths|Intermediate"
]
},
{
"prob_id": "616c",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
] |
{
"prob_id": "785d",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
}
|
{
"prob_id": "407c",
"tags": [
"Binomial Coefficients|Fundamentals|Combinatorics"
]
}
|
[
{
"prob_id": "528c",
"tags": [
"Euler Tour||"
]
},
{
"prob_id": "545d",
"tags": [
"Exchange Argument|Greedy|Basics"
]
},
{
"prob_id": "946d",
"tags": [
"Precalculation, Double DP|DP Common Tricks|Intermediate"
]
}
] |
{
"prob_id": "202a",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
}
|
{
"prob_id": "535b",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
}
|
[
{
"prob_id": "walk on multiplication table144",
"tags": [
"Prime and Composite, Primality Testing, Prime Sieves, Finding Divisors|Number Theory|Preliminaries"
]
},
{
"prob_id": "1004e",
"tags": [
"Tree Diameter|Graph Traversal|Graph Theory"
]
},
{
"prob_id": "1383f",
"tags": [
"Maximum Flow / Minimum Cut|Flow and Min Cut|Graph Theory"
]
}
] |
{
"prob_id": "114b",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
}
|
{
"prob_id": "shopping street080",
"tags": [
"All-Subsets / Binary Choice|Complete Search|Basics"
]
}
|
[
{
"prob_id": "82d",
"tags": [
"DP with Solution Construction||Intermediate"
]
},
{
"prob_id": "321c",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "862b",
"tags": [
"Bipartite Graph||",
"Graph Traversal||"
]
}
] |
{
"prob_id": "124b",
"tags": [
"All-Permutations|Complete Search|Basics"
]
}
|
{
"prob_id": "431b",
"tags": [
"All-Permutations|Complete Search|Basics"
]
}
|
[
{
"prob_id": "547e",
"tags": [
"String Suffix||"
]
},
{
"prob_id": "1476a",
"tags": [
"Basic Constructive Algorithms|Greedy and Constructive|Basics"
]
},
{
"prob_id": "1244e",
"tags": [
"Basic Greedy Algorithms|Greedy and Constructive|Basics",
"Binary Search|Leveraging Monotonicity|Basics",
"Prefix Sum|Range Queries Without Updates|Basics"
]
}
] |
{
"prob_id": "five dishes123",
"tags": [
"All-Permutations|Complete Search|Basics"
]
}
|
{
"prob_id": "124b",
"tags": [
"All-Permutations|Complete Search|Basics"
]
}
|
[
{
"prob_id": "five dishes123",
"tags": [
"All-Permutations|Complete Search|Basics"
]
},
{
"prob_id": "roaming156",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
},
{
"prob_id": "blue and red balls132",
"tags": [
"Permutations with Repetition, Stars and Bars|Counting|Intermediate"
]
}
] |
{
"prob_id": "545d",
"tags": [
"Exchange Argument|Greedy|Basics"
]
}
|
{
"prob_id": "katana thrower085",
"tags": [
"Exchange Argument|Greedy|Basics"
]
}
|
[
{
"prob_id": "828f",
"tags": [
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
},
{
"prob_id": "346d",
"tags": [
"Single Source with Negative Weights|Shortest Paths|Intermediate"
]
},
{
"prob_id": "516d",
"tags": [
"Tree Centers and Diameter||Advanced Data Structures"
]
}
] |
{
"prob_id": "atcodeer and rock-paper046",
"tags": [
"Exchange Argument|Greedy|Basics"
]
}
|
{
"prob_id": "545d",
"tags": [
"Exchange Argument|Greedy|Basics"
]
}
|
[
{
"prob_id": "i hate shortest path problem177",
"tags": [
"Amortized Analysis||Intermediate"
]
},
{
"prob_id": "tak and hotels060",
"tags": [
"Binary Lifting||Advanced Data Structures"
]
},
{
"prob_id": "modularness156",
"tags": [
"Divisibility, Modular Arithmetic|Number Theory|Basics"
]
}
] |
{
"prob_id": "922d",
"tags": [
"Exchange Argument|Greedy|Basics"
]
}
|
{
"prob_id": "summer vacation137",
"tags": [
"Exchange Argument|Greedy|Basics"
]
}
|
[
{
"prob_id": "588e",
"tags": [
"Binary Lifting||Advanced Data Structures",
"Lowest Common Ancestor|Lowest common ancestor|Graphs"
]
},
{
"prob_id": "506d",
"tags": [
"Splitting Objects into Light and Heavy / Case Processing|Square Root Decomposition|Data Structures (DS)"
]
},
{
"prob_id": "9d",
"tags": [
"Counting with DP||Intermediate"
]
}
] |
{
"prob_id": "strange bank099",
"tags": [
"Structural Argument|Greedy|Basics"
]
}
|
{
"prob_id": "979b",
"tags": [
"Structural Argument|Greedy|Basics"
]
}
|
[
{
"prob_id": "gcd on blackboard125",
"tags": [
"Prefix Sum|Range Queries Without Updates|Basics"
]
},
{
"prob_id": "atcoder express 2106",
"tags": [
"Prefix Sums and Difference Arrays|Range Queries|Basics"
]
},
{
"prob_id": "lotus leaves074",
"tags": [
"Network Flows||Advanced Algorithms"
]
}
] |
{
"prob_id": "979b",
"tags": [
"Structural Argument|Greedy|Basics"
]
}
|
{
"prob_id": "grand garden116",
"tags": [
"Structural Argument|Greedy|Basics"
]
}
|
[
{
"prob_id": "unfair nim172",
"tags": [
"Nim, Sprague-Grundy Theorem|Combinatorial Games|Advanced Mathematics"
]
},
{
"prob_id": "roadwork128",
"tags": [
"Sweep Line||"
]
},
{
"prob_id": "distributing integers160",
"tags": [
"Tree Re-rooting|DP Optimization|Advanced Algorithms"
]
}
] |
{
"prob_id": "1007a",
"tags": [
"Structural Argument|Greedy|Basics"
]
}
|
{
"prob_id": "contrast178",
"tags": [
"Structural Argument|Greedy|Basics"
]
}
|
[
{
"prob_id": "377e",
"tags": [
"Convex Hull Trick|DP Optimization|Advanced Algorithms"
]
},
{
"prob_id": "338d",
"tags": [
"Chinese Remainder Theorem|Modular arithmetic|Algebra"
]
},
{
"prob_id": "724c",
"tags": [
"Reflections on a Rectangle|Miscellaneous|Geometry"
]
}
] |
{
"prob_id": "814d",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
}
|
{
"prob_id": "429a",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
}
|
[
{
"prob_id": "next prime149",
"tags": [
"Prime and Composite, Primality Testing, Prime Sieves, Finding Divisors|Number Theory|Preliminaries"
]
},
{
"prob_id": "active infants163",
"tags": [
"Eliminate Dependent Parameters|DP Optimization|Advanced Algorithms",
"Presorting|DP Common Tricks|Intermediate"
]
},
{
"prob_id": "enclose all151",
"tags": [
"Intersections and Containment|Geometry|Intermediate"
]
}
] |
{
"prob_id": "814d",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
}
|
{
"prob_id": "playing tag on tree148",
"tags": [
"Trees and Tree Traversals|Graphs|Basics"
]
}
|
[
{
"prob_id": "241e",
"tags": [
"Single Source with Negative Weights|Shortest Paths|Intermediate"
]
},
{
"prob_id": "232d",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "66e",
"tags": [
"Global Deltaing||Advanced Data Structures"
]
}
] |
{
"prob_id": "grid repainting088",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
{
"prob_id": "540c",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
[
{
"prob_id": "232d",
"tags": [
"Suffix Array|Suffix Structures|Strings"
]
},
{
"prob_id": "839e",
"tags": [
"Meet in the Middle|Techniques|Miscellaneous"
]
},
{
"prob_id": "713c",
"tags": [
"Slope Trick|More Tricks|Dynamic Programming (DP)"
]
}
] |
{
"prob_id": "329b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
{
"prob_id": "877d",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
[
{
"prob_id": "1468d",
"tags": [
"Binary Search|Leveraging Monotonicity|Basics"
]
},
{
"prob_id": "305b",
"tags": [
"Continued Fractions|Miscellaneous|Math"
]
},
{
"prob_id": "1392i",
"tags": [
"Euler's Formula||",
"Fast Fourier Transform (FFT)|Convolution|Math"
]
}
] |
{
"prob_id": "grid repainting088",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
{
"prob_id": "585b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
[
{
"prob_id": "612c",
"tags": [
"Balanced Brackets|Miscellaneous|Strings"
]
},
{
"prob_id": "1081d",
"tags": [
"Centroid Decomposition|Centroid Decomposition|Data Structures (DS)",
"Minimum Spanning Tree||"
]
},
{
"prob_id": "19c",
"tags": [
"String Hashing|Hashing|Strings"
]
}
] |
{
"prob_id": "329b",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
{
"prob_id": "31d",
"tags": [
"Grid Graphs|Graphs|Basics"
]
}
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 31