*Dear Visitor,
If you arrive at this page because you are (Google-)searching for hints/solutions for some of these 2.95K+ UVa/Kattis online judge problems
and you do not know about "Competitive Programming" text book yet, you may be interested to get one copy where I discuss
the required data structure(s) and/or algorithm(s) for those problems :).
Alternatively, you can also visit my other tool VisuAlgo (free) for animated explanations of some of
those data structure(s) and/or algorithm(s).
If you arrive at this page because of CP3 (published 24 May 2013),
please notice that this page contains the most up-to-date version of CPbook problem classification at UVa or uHunt pages
(dubbed CP3.19a++, information is up to date as of 15 May 2019).
The major update is the inclusion of ~1K+ Kattis online judge problems
on top of the ~2K UVa online judge problems (there are some overlap, around 90+,
search substring "also available at Kattis" / "also available at UVa" to find such problems).
Also, if you are a Google Chrome and Kattis user, use this nice Kattis Hint Giver created by one of my student Lin Si Jie that integrates this page directly with Kattis problems pages (you may want to occassionally 'Remove from Chrome' and re-'Add to Chrome' to manually sync this Methods to Solve content with the local cache).
Regards,
Dr Steven Halim, NUS ICPC head coach, ICPC Asia Singapore Regional Contest Director, Singapore IOI team leader, IOI 2020 Deputy Chairman.
Btw, browsing these ~3K problems may feel daunting for beginners, so feel free to use the following filters:
*

- NUS CS1010/E/S/CS1101S : (Basic) Programming Methodology level: I/O, Sequence, Selection, Repetition, Control Flow, Function, Easy Problems, 1D/2D Array, Simple Sorting, Binary Search, Basic Math, Basic String
- NUS CS2040/C/S : (Basic) Data Structures and Algorithms level: 1D/2D Array/Vector, Sorting, Linked List, Binary Heap, Hash Table, Binary Search Tree, Graph DS, Graph Traversal, SSSP
- NUS CS3230 : Design and Analysis of Algorithms level: Sorting (Harder), BF, D&C (+MatPow, Closest Pair), Greedy, DP (+APSP, Combinatorics, DP String), MST (+Union-Find), SSSP (Harder), String Matching, Convex Hull, NP-hard Problems
- NUS CS4234 : Optimisation Algorithms level: Complete Search (small instances), DP (esp Pseudo-Polynomial versions), NP-hard Problems, Max Flow, Graph Matching (+Weighted MCBM), Linear Programming
- CP3.19a, "Chapter 1 : Introduction" starred problems only or CP3.19a, all Chapter 1 problems
- CP3.19a, "Chapter 2 : Data Structures and Libraries" starred problems only or CP3.19a, all Chapter 2 problems
- CP3.19a, "Chapter 3 : Problem Solving Paradigms" starred problems only or CP3.19a, all Chapter 3 problems
- CP3.19a, "Chapter 4 : Graph" starred problems only or CP3.19a, all Chapter 4 problems
- CP3.19a, "Chapter 8 : More Advanced Topics" starred problems only or CP3.19a, all Chapter 8 problems
- Only starred problems from all chapters
- If no (or wrong) filter is specified, we will list down all problems, including all those uncategorized 'non-starred' problems (for NUS CS3233/ICPC: Competitive Programming level)

UVa/Kattis | Problem Title | CP3.19a++ |
---|---|---|

00105 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

00108 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

00111 | Fetching from uHunt | 3.5b, LIS |

00116 | Fetching from uHunt | 3.5f, DP level 1 |

00123 | Fetching from uHunt | 2.2d, Sorting, Harder |

00129 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00147 | Fetching from uHunt | 3.5d, Coin-Change |

00154 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

00157 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

00166 | Fetching from uHunt | 3.5d, Coin-Change |

00183 | Fetching from uHunt | 3.3c, Other DnC Problems |

00196 | Fetching from uHunt | 3.5f, DP level 1 |

00208 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00215 | Fetching from uHunt | 3.5f, DP level 1 |

00216 | Fetching from uHunt | 3.5e, TSP |

00222 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00231 | Fetching from uHunt | 3.5b, LIS |

00242 | Fetching from uHunt | 3.5d, Coin-Change |

00253 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

00296 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

00298 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

00301 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00307 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00314 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

00331 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00336 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00357 | Fetching from uHunt | 3.5d, Coin-Change |

00369 | Fetching from uHunt | 5.4b, Binomial Coefficients |

00383 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00386 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

00388 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00400 | Fetching from uHunt | 2.2c, Sorting, Easier |

00410 | Fetching from uHunt | 3.4a, Greedy (Classical) |

00416 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00429 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00431 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

00433 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00437 | Fetching from uHunt | 3.5b, LIS |

00441 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

00450 | Fetching from uHunt | 2.2d, Sorting, Harder |

00481 | Fetching from uHunt | 3.5b, LIS |

00495 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

00497 | Fetching from uHunt | 3.5b, LIS |

00507 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

00523 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

00532 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

00534 | Fetching from uHunt | 4.3b, MST, Variants |

00539 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

00544 | Fetching from uHunt | 4.3b, MST, Variants |

00558 | Fetching from uHunt | 4.4e, SSSP, -ve weight |

00562 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

00565 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

00589 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

00592 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

00608 | Fetching from uHunt | 3.3c, Other DnC Problems |

00617 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

00624 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

00626 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

00627 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00634 | Fetching from uHunt | 7.3a, Polygon, Easier |

00658 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

00674 | Fetching from uHunt | 3.5d, Coin-Change |

00679 | Fetching from uHunt | 3.3a, Binary Search |

00703 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

00721 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

00735 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

00762 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00763 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

00787 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

00790 | Fetching from uHunt | 2.2d, Sorting, Harder |

00793 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

00821 | Fetching from uHunt | 4.5a, APSP, Standard |

00836 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

00855 | Fetching from uHunt | 2.2c, Sorting, Easier |

00859 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

00869 | Fetching from uHunt | 4.5b, APSP, Variants |

00908 | Fetching from uHunt | 4.3a, MST, Standard |

00924 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

00928 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

00929 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

00949 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

00957 | Fetching from uHunt | 3.3a, Binary Search |

00983 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

00989 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

00990 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

01013 | Fetching from uHunt | 4.3b, MST, Variants |

01048 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

01056 | Fetching from uHunt | 4.5b, APSP, Variants |

01057 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

01105 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

01112 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

01148 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

01160 | Fetching from uHunt | 4.3b, MST, Variants |

01174 | Fetching from uHunt | 4.3a, MST, Standard |

01192 | Fetching from uHunt | 6.5a, DP String, Classic |

01193 | Fetching from uHunt | 3.4a, Greedy (Classical) |

01196 | Fetching from uHunt | 3.5b, LIS |

01197 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

01202 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

01208 | Fetching from uHunt | 4.3a, MST, Standard |

01213 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

01216 | Fetching from uHunt | 4.3b, MST, Variants |

01234 | Fetching from uHunt | 4.3b, MST, Variants |

01235 | Fetching from uHunt | 4.3a, MST, Standard |

01247 | Fetching from uHunt | 4.5a, APSP, Standard |

01260 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

01261 | Fetching from uHunt | 3.5f, DP level 1 |

01262 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

01265 | Fetching from uHunt | 4.3b, MST, Variants |

01329 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

01347 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

01449 | Fetching from uHunt | 6.4a, String Matching, Standard |

01588 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

01600 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

01610 | Fetching from uHunt | 2.2d, Sorting, Harder |

01738 | Fetching from uHunt | 3.3c, Other DnC Problems |

01753 | Fetching from uHunt | 3.3b, Binary Search the Answer |

10001 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

10003 | Fetching from uHunt | 3.5f, DP level 1 |

10009 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

10020 | Fetching from uHunt | 3.4a, Greedy (Classical) |

10034 | Fetching from uHunt | 4.3a, MST, Standard |

10036 | Fetching from uHunt | 3.5f, DP level 1 |

10041 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

10044 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

10047 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

10048 | Fetching from uHunt | 4.3b, MST, Variants |

10057 | Fetching from uHunt | 2.2c, Sorting, Easier |

10063 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

10067 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

10074 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

10077 | Fetching from uHunt | 3.3a, Binary Search |

10086 | Fetching from uHunt | 3.5f, DP level 1 |

10094 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

10097 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

10099 | Fetching from uHunt | 4.3b, MST, Variants |

10102 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

10107 | Fetching from uHunt | 2.2c, Sorting, Easier |

10120 | Fetching from uHunt | 3.5f, DP level 1 |

10130 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

10131 | Fetching from uHunt | 3.5b, LIS |

10147 | Fetching from uHunt | 4.3b, MST, Variants |

10152 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10154 | Fetching from uHunt | 3.5b, LIS |

10158 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10166 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10187 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10194 | Fetching from uHunt | 2.2d, Sorting, Harder |

10227 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10229 | Fetching from uHunt | 5.9a, Matrix Power |

10245 | Fetching from uHunt | 9.clos, Closest Pair Problem |

10249 | Fetching from uHunt | 3.4a, Greedy (Classical) |

10258 | Fetching from uHunt | 2.2d, Sorting, Harder |

10261 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

10269 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

10278 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10280 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10306 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

10313 | Fetching from uHunt | 3.5d, Coin-Change |

10334 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

10337 | Fetching from uHunt | 3.5f, DP level 1 |

10340 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10341 | Fetching from uHunt | 3.3b, Binary Search the Answer |

10342 | Fetching from uHunt | 4.5b, APSP, Variants |

10354 | Fetching from uHunt | 4.5a, APSP, Standard |

10356 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10360 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

10365 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

10369 | Fetching from uHunt | 4.3b, MST, Variants |

10382 | Fetching from uHunt | 3.4a, Greedy (Classical) |

10389 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

10397 | Fetching from uHunt | 4.3b, MST, Variants |

10400 | Fetching from uHunt | 3.5f, DP level 1 |

10405 | Fetching from uHunt | 6.5a, DP String, Classic |

10440 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10446 | Fetching from uHunt | 3.5f, DP level 1 |

10448 | Fetching from uHunt | 3.5d, Coin-Change |

10449 | Fetching from uHunt | 4.4e, SSSP, -ve weight |

10457 | Fetching from uHunt | 4.3b, MST, Variants |

10460 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

10462 | Fetching from uHunt | 4.3b, MST, Variants |

10465 | Fetching from uHunt | 3.5f, DP level 1 |

10474 | Fetching from uHunt | 3.3a, Binary Search |

10475 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

10483 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

10502 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

10506 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

10507 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10520 | Fetching from uHunt | 3.5f, DP level 1 |

10534 | Fetching from uHunt | 3.5b, LIS |

10541 | Fetching from uHunt | 5.4b, Binomial Coefficients |

10557 | Fetching from uHunt | 4.4e, SSSP, -ve weight |

10567 | Fetching from uHunt | 3.3a, Binary Search |

10570 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

10582 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

10583 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10600 | Fetching from uHunt | 4.3b, MST, Variants |

10602 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10603 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10608 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10610 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

10611 | Fetching from uHunt | 3.3a, Binary Search |

10616 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

10653 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

10655 | Fetching from uHunt | 5.9a, Matrix Power |

10656 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10660 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

10662 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

10664 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

10667 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

10672 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10682 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

10684 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

10685 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

10688 | Fetching from uHunt | 3.5f, DP level 1 |

10689 | Fetching from uHunt | 5.4a, Fibonacci Numbers |

10690 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

10698 | Fetching from uHunt | 2.2d, Sorting, Harder |

10700 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10706 | Fetching from uHunt | 3.3a, Binary Search |

10714 | Fetching from uHunt | 3.4d, Non Classical, Easier |

10721 | Fetching from uHunt | 3.5f, DP level 1 |

10730 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

10742 | Fetching from uHunt | 3.3a, Binary Search |

10755 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

10763 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

10785 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

10801 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10819 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

10827 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

10842 | Fetching from uHunt | 4.3b, MST, Variants |

10859 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

10880 | Fetching from uHunt | 2.2c, Sorting, Easier |

10905 | Fetching from uHunt | 2.2c, Sorting, Easier |

10910 | Fetching from uHunt | 3.5f, DP level 1 |

10912 | Fetching from uHunt | 3.5f, DP level 1 |

10923 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

10943 | Fetching from uHunt | 3.5f, DP level 1 |

10959 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

10967 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

10973 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

10977 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

10980 | Fetching from uHunt | 3.5f, DP level 1 |

10986 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

10987 | Fetching from uHunt | 4.5b, APSP, Variants |

10993 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11003 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

11026 | Fetching from uHunt | 3.5f, DP level 1 |

11039 | Fetching from uHunt | 2.2c, Sorting, Easier |

11049 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11052 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

11054 | Fetching from uHunt | 3.4d, Non Classical, Easier |

11057 | Fetching from uHunt | 3.3a, Binary Search |

11059 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

11096 | Fetching from uHunt | 7.3a, Polygon, Easier |

11101 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11108 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11137 | Fetching from uHunt | 3.5d, Coin-Change |

11147 | Fetching from uHunt | 3.3c, Other DnC Problems |

11228 | Fetching from uHunt | 4.3a, MST, Standard |

11236 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11242 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

11259 | Fetching from uHunt | 3.5d, Coin-Change |

11264 | Fetching from uHunt | 3.4a, Greedy (Classical) |

11269 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

11280 | Fetching from uHunt | 4.4e, SSSP, -ve weight |

11292 | Fetching from uHunt | 3.4a, Greedy (Classical) |

11300 | Fetching from uHunt | 2.2d, Sorting, Harder |

11321 | Fetching from uHunt | 2.2c, Sorting, Easier |

11338 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

11341 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

11342 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11352 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11357 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

11367 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

11369 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

11374 | Fetching from uHunt | 8.2d, State-Space, Dijkstra |

11377 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11378 | Fetching from uHunt | 9.clos, Closest Pair Problem |

11389 | Fetching from uHunt | 3.4a, Greedy (Classical) |

11407 | Fetching from uHunt | 3.5f, DP level 1 |

11413 | Fetching from uHunt | 3.3b, Binary Search the Answer |

11420 | Fetching from uHunt | 3.5f, DP level 1 |

11447 | Fetching from uHunt | 7.3a, Polygon, Easier |

11450 | Fetching from uHunt | 3.5f, DP level 1 |

11456 | Fetching from uHunt | 3.5b, LIS |

11463 | Fetching from uHunt | 4.5a, APSP, Standard |

11473 | Fetching from uHunt | 7.3a, Polygon, Easier |

11492 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

11503 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

11513 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

11520 | Fetching from uHunt | 3.4d, Non Classical, Easier |

11532 | Fetching from uHunt | 3.4d, Non Classical, Easier |

11548 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11565 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11566 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

11573 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11582 | Fetching from uHunt | 5.9a, Matrix Power |

11588 | Fetching from uHunt | 2.2c, Sorting, Easier |

11621 | Fetching from uHunt | 3.3a, Binary Search |

11624 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11631 | Fetching from uHunt | 4.3a, MST, Standard |

11658 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

11690 | Fetching from uHunt | 2.4b, Union-Find Disjoint Sets |

11703 | Fetching from uHunt | 3.5f, DP level 1 |

11710 | Fetching from uHunt | 4.3a, MST, Standard |

11729 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

11733 | Fetching from uHunt | 4.3a, MST, Standard |

11747 | Fetching from uHunt | 4.3a, MST, Standard |

11753 | Fetching from uHunt | 3.2i, Backtracking (Harder) |

11777 | Fetching from uHunt | 2.2c, Sorting, Easier |

11790 | Fetching from uHunt | 3.5b, LIS |

11792 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

11795 | Fetching from uHunt | 3.5e, TSP |

11804 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11824 | Fetching from uHunt | 2.2c, Sorting, Easier |

11832 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

11833 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

11837 | Fetching from uHunt | 6.4a, String Matching, Standard |

11857 | Fetching from uHunt | 4.3a, MST, Standard |

11876 | Fetching from uHunt | 3.3a, Binary Search |

11881 | Fetching from uHunt | 3.3b, Binary Search the Answer |

11900 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

11935 | Fetching from uHunt | 3.3b, Binary Search the Answer |

11951 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

11955 | Fetching from uHunt | 5.4b, Binomial Coefficients |

11959 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

11974 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

11975 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

12032 | Fetching from uHunt | 3.3b, Binary Search the Answer |

12047 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

12071 | Fetching from uHunt | 2.2c, Sorting, Easier |

12135 | Fetching from uHunt | 8.2b, State-Space, BFS, Easier |

12144 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

12160 | Fetching from uHunt | 4.4a, SSSP, BFS, Easier |

12190 | Fetching from uHunt | 3.3b, Binary Search the Answer |

12192 | Fetching from uHunt | 3.3a, Binary Search |

12205 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

12210 | Fetching from uHunt | 3.4a, Greedy (Classical) |

12269 | Fetching from uHunt | 2.2c, Sorting, Easier |

12321 | Fetching from uHunt | 3.4a, Greedy (Classical) |

12337 | Fetching from uHunt | 3.2d, Three+ Nested Loops, Harder |

12405 | Fetching from uHunt | 3.4a, Greedy (Classical) |

12455 | Fetching from uHunt | 8.4a, NP-hard/C, small, Easier |

12467 | Fetching from uHunt | 6.4a, String Matching, Standard |

12482 | Fetching from uHunt | 3.4d, Non Classical, Easier |

12485 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

12488 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

12498 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

12515 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

12541 | Fetching from uHunt | 2.2c, Sorting, Easier |

12583 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

12621 | Fetching from uHunt | 3.5c, 0-1 Knapsack |

12640 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

12654 | Fetching from uHunt | 3.5f, DP level 1 |

12709 | Fetching from uHunt | 2.2c, Sorting, Easier |

12712 | Fetching from uHunt | 5.4b, Binomial Coefficients |

12747 | Fetching from uHunt | 6.5a, DP String, Classic |

12791 | Fetching from uHunt | 3.3b, Binary Search the Answer |

12796 | Fetching from uHunt | 5.9a, Matrix Power |

12801 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

12826 | Fetching from uHunt | 4.4b, SSSP, BFS, Harder |

12841 | Fetching from uHunt | 3.5e, TSP |

12844 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

12861 | Fetching from uHunt | 2.2c, Sorting, Easier |

12893 | Fetching from uHunt | 3.3c, Other DnC Problems |

12904 | Fetching from uHunt | 3.2c, Three+ Nested Loops, Easier |

12950 | Fetching from uHunt | 4.4d, SSSP, Dijkstra, Harder |

12951 | Fetching from uHunt | 3.5f, DP level 1 |

12965 | Fetching from uHunt | 2.2d, Sorting, Harder |

13018 | Fetching from uHunt | 3.2b, Iterative (Two Nested Loops) |

13031 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

13095 | Fetching from uHunt | 3.5a, Max 1D/2D Range Sum |

13109 | Fetching from uHunt | 3.4b, Involving Sorting, Easier |

13113 | Fetching from uHunt | 2.2c, Sorting, Easier |

13115 | Fetching from uHunt | 8.4c, NP-hard/C, special, Easier |

13127 | Fetching from uHunt | 4.4c, SSSP, Dijkstra, Easier |

13141 | Fetching from uHunt | 3.5f, DP level 1 |

13142 | Fetching from uHunt | 3.3b, Binary Search the Answer |

13146 | Fetching from uHunt | 6.5a, DP String, Classic |

8queens | Kattis - 8queens | 3.2b, Iterative (Two Nested Loops) |

a1paper | Kattis - a1paper | 3.3c, Other DnC Problems |

acm2 | Kattis - acm2 | 3.4b, Involving Sorting, Easier |

akcija | Kattis - akcija | 3.4b, Involving Sorting, Easier |

alicedigital | Kattis - alicedigital | 3.5a, Max 1D/2D Range Sum |

allpairspath | Kattis - allpairspath | 4.5a, APSP, Standard |

almostunionfind | Kattis - almostunionfind | 2.4b, Union-Find Disjoint Sets |

alphabet | Kattis - alphabet | 3.5b, LIS |

anti11 | Kattis - anti11 | 5.4a, Fibonacci Numbers |

antiarithmetic | Kattis - antiarithmetic | 3.2b, Iterative (Two Nested Loops) |

ants | Kattis - ants | 3.4d, Non Classical, Easier |

aprizenoonecanwin | Kattis - aprizenoonecanwin | 3.4b, Involving Sorting, Easier |

arbitrage | Kattis - arbitrage | 4.5b, APSP, Variants |

arcticnetwork | Kattis - arcticnetwork | 4.3b, MST, Variants |

bank | Kattis - bank | 3.4d, Non Classical, Easier |

batmanacci | Kattis - batmanacci | 5.4a, Fibonacci Numbers |

beepers | Kattis - beepers | 3.5e, TSP |

bestrelayteam | Kattis - bestrelayteam | 3.2b, Iterative (Two Nested Loops) |

bigtruck | Kattis - bigtruck | 8.2d, State-Space, Dijkstra |

bilateral | Kattis - bilateral | 8.4c, NP-hard/C, special, Easier |

blackfriday | Kattis - blackfriday | 3.2b, Iterative (Two Nested Loops) |

blockcrusher | Kattis - blockcrusher | 4.4d, SSSP, Dijkstra, Harder |

booking | Kattis - booking | 2.2d, Sorting, Harder |

bumped | Kattis - bumped | 8.2d, State-Space, Dijkstra |

bustour | Kattis - bustour | 3.5e, TSP |

buttonbashing | Kattis - buttonbashing | 4.4a, SSSP, BFS, Easier |

calculatingdartscores | Kattis - calculatingdartscores | 3.2d, Three+ Nested Loops, Harder |

canonical | Kattis - canonical | 3.5d, Coin-Change |

carefulascent | Kattis - carefulascent | 3.3b, Binary Search the Answer |

cats | Kattis - cats | 4.3a, MST, Standard |

ceiling | Kattis - ceiling | 3.3c, Other DnC Problems |

chartingprogress | Kattis - chartingprogress | 2.2c, Sorting, Easier |

checkingforcorrectness | Kattis - checkingforcorrectness | 5.9a, Matrix Power |

classrooms | Kattis - classrooms | 3.4a, Greedy (Classical) |

classy | Kattis - classy | 2.2d, Sorting, Harder |

closestpair1 | Kattis - closestpair1 | 9.clos, Closest Pair Problem |

closestsums | Kattis - closestsums | 3.2b, Iterative (Two Nested Loops) |

closingtheloop | Kattis - closingtheloop | 2.2c, Sorting, Easier |

color | Kattis - color | 3.4a, Greedy (Classical) |

commercials | Kattis - commercials | 3.5a, Max 1D/2D Range Sum |

conquestcampaign | Kattis - conquestcampaign | 4.4b, SSSP, BFS, Harder |

control | Kattis - control | 2.4b, Union-Find Disjoint Sets |

convexhull | Kattis - convexhull | 7.3a, Polygon, Easier |

crosscountry | Kattis - crosscountry | 4.4e, SSSP, -ve weight |

cudoviste | Kattis - cudoviste | 3.2c, Three+ Nested Loops, Easier |

cups | Kattis - cups | 2.2c, Sorting, Easier |

cuttingcorners | Kattis - cuttingcorners | 7.3a, Polygon, Easier |

cycleseasy | Kattis - cycleseasy | 3.5e, TSP |

destinationunknown | Kattis - destinationunknown | 8.2d, State-Space, Dijkstra |

dobra | Kattis - dobra | 3.2i, Backtracking (Harder) |

drivingrange | Kattis - drivingrange | 4.3a, MST, Standard |

dungeon | Kattis - dungeon | 4.4b, SSSP, BFS, Harder |

dyslectionary | Kattis - dyslectionary | 2.2d, Sorting, Harder |

ecoins | Kattis - ecoins | 8.2b, State-Space, BFS, Easier |

election | Kattis - election | 5.4b, Binomial Coefficients |

elevatortrouble | Kattis - elevatortrouble | 8.2b, State-Space, BFS, Easier |

emptyingbaltic | Kattis - emptyingbaltic | 4.4d, SSSP, Dijkstra, Harder |

equalsumseasy | Kattis - equalsumseasy | 8.4a, NP-hard/C, small, Easier |

errands | Kattis - errands | 3.5e, TSP |

erraticants | Kattis - erraticants | 4.4b, SSSP, BFS, Harder |

europeantrip | Kattis - europeantrip | 8.4c, NP-hard/C, special, Easier |

exactchange2 | Kattis - exactchange2 | 3.5d, Coin-Change |

fallingapart | Kattis - fallingapart | 3.4b, Involving Sorting, Easier |

fire2 | Kattis - fire2 | 4.4b, SSSP, BFS, Harder |

fire3 | Kattis - fire3 | 4.4b, SSSP, BFS, Harder |

firefly | Kattis - firefly | 3.3a, Binary Search |

firestation | Kattis - firestation | 4.4d, SSSP, Dijkstra, Harder |

fishmongers | Kattis - fishmongers | 3.4a, Greedy (Classical) |

flipfive | Kattis - flipfive | 8.2b, State-Space, BFS, Easier |

flowerytrails | Kattis - flowerytrails | 4.4c, SSSP, Dijkstra, Easier |

flowfree | Kattis - flowfree | 8.4a, NP-hard/C, small, Easier |

foldedmap | Kattis - foldedmap | 3.5a, Max 1D/2D Range Sum |

font | Kattis - font | 8.4a, NP-hard/C, small, Easier |

forests | Kattis - forests | 2.4b, Union-Find Disjoint Sets |

freckles | Kattis - freckles | 4.3a, MST, Standard |

freeweights | Kattis - freeweights | 3.3b, Binary Search the Answer |

fridge | Kattis - fridge | 3.4b, Involving Sorting, Easier |

froshweek2 | Kattis - froshweek2 | 3.4a, Greedy (Classical) |

fruitbaskets | Kattis - fruitbaskets | 3.2i, Backtracking (Harder) |

fulltank | Kattis - fulltank | 4.4d, SSSP, Dijkstra, Harder |

geneticsearch | Kattis - geneticsearch | 6.4a, String Matching, Standard |

george | Kattis - george | 4.4c, SSSP, Dijkstra, Easier |

getshorty | Kattis - getshorty | 4.4c, SSSP, Dijkstra, Easier |

gettowork | Kattis - gettowork | 3.4b, Involving Sorting, Easier |

golombrulers | Kattis - golombrulers | 3.2b, Iterative (Two Nested Loops) |

grid | Kattis - grid | 4.4a, SSSP, BFS, Easier |

guess | Kattis - guess | 3.3a, Binary Search |

height | Kattis - height | 2.2c, Sorting, Easier |

horror | Kattis - horror | 4.4a, SSSP, BFS, Easier |

horrorfilmnight | Kattis - horrorfilmnight | 3.4d, Non Classical, Easier |

htoo | Kattis - htoo | 3.3b, Binary Search the Answer |

hydrasheads | Kattis - hydrasheads | 8.2b, State-Space, BFS, Easier |

icpcteamselection | Kattis - icpcteamselection | 3.4b, Involving Sorting, Easier |

importspaghetti | Kattis - importspaghetti | 4.5a, APSP, Standard |

includescoring | Kattis - includescoring | 2.2d, Sorting, Harder |

increasingsubsequence | Kattis - increasingsubsequence | 3.5b, LIS |

inflagrantedelicto | Kattis - inflagrantedelicto | 6.5a, DP String, Classic |

inflation | Kattis - inflation | 3.4a, Greedy (Classical) |

islandhopping | Kattis - islandhopping | 4.3a, MST, Standard |

judging | Kattis - judging | 2.2c, Sorting, Easier |

kastenlauf | Kattis - kastenlauf | 4.5b, APSP, Variants |

knapsack | Kattis - knapsack | 3.5c, 0-1 Knapsack |

ladice | Kattis - ladice | 2.4b, Union-Find Disjoint Sets |

lawnmower | Kattis - lawnmower | 2.2c, Sorting, Easier |

lektira | Kattis - lektira | 3.2d, Three+ Nested Loops, Harder |

lineup | Kattis - lineup | 2.2c, Sorting, Easier |

lockedtreasure | Kattis - lockedtreasure | 5.4b, Binomial Coefficients |

longincsubseq | Kattis - longincsubseq | 3.5b, LIS |

loowater | Kattis - loowater | 3.4a, Greedy (Classical) |

lost | Kattis - lost | 4.4b, SSSP, BFS, Harder |

lostmap | Kattis - lostmap | 4.3a, MST, Standard |

mallmania | Kattis - mallmania | 4.4b, SSSP, BFS, Harder |

marblestree | Kattis - marblestree | 3.4d, Non Classical, Easier |

maximizingyourpay | Kattis - maximizingyourpay | 3.5e, TSP |

millionairemadness | Kattis - millionairemadness | 4.3b, MST, Variants |

minimumscalar | Kattis - minimumscalar | 3.4b, Involving Sorting, Easier |

minspantree | Kattis - minspantree | 4.3a, MST, Standard |

misa | Kattis - misa | 3.2d, Three+ Nested Loops, Harder |

mjehuric | Kattis - mjehuric | 2.2c, Sorting, Easier |

muddyhike | Kattis - muddyhike | 4.3b, MST, Variants |

musicyourway | Kattis - musicyourway | 2.2d, Sorting, Harder |

naturereserve | Kattis - naturereserve | 4.3b, MST, Variants |

nikola | Kattis - nikola | 3.5f, DP level 1 |

ninepacks | Kattis - ninepacks | 3.5c, 0-1 Knapsack |

npuzzle | Kattis - npuzzle | 3.2c, Three+ Nested Loops, Easier |

oceancurrents | Kattis - oceancurrents | 4.4b, SSSP, BFS, Harder |

oddbinom | Kattis - oddbinom | 5.4b, Binomial Coefficients |

onemorebellmanford | Kattis - onemorebellmanford | 4.4e, SSSP, -ve weight |

onemorecc | Kattis - onemorecc | 3.5d, Coin-Change |

orders | Kattis - orders | 3.5c, 0-1 Knapsack |

pagelayout | Kattis - pagelayout | 3.2i, Backtracking (Harder) |

pandachess | Kattis - pandachess | 6.5a, DP String, Classic |

patuljci | Kattis - patuljci | 3.2c, Three+ Nested Loops, Easier |

peg | Kattis - peg | 3.2b, Iterative (Two Nested Loops) |

permutationdescent | Kattis - permutationdescent | 3.5f, DP level 1 |

pet | Kattis - pet | 3.2b, Iterative (Two Nested Loops) |

pikemaneasy | Kattis - pikemaneasy | 3.4b, Involving Sorting, Easier |

planetaris | Kattis - planetaris | 3.4b, Involving Sorting, Easier |

plantingtrees | Kattis - plantingtrees | 3.4b, Involving Sorting, Easier |

pokemongogo | Kattis - pokemongogo | 3.5e, TSP |

porpoises | Kattis - porpoises | 5.9a, Matrix Power |

powerstrings | Kattis - powerstrings | 6.4a, String Matching, Standard |

presidentialelections | Kattis - presidentialelections | 3.5c, 0-1 Knapsack |

princeandprincess | Kattis - princeandprincess | 6.5a, DP String, Classic |

pripreme | Kattis - pripreme | 3.4d, Non Classical, Easier |

prozor | Kattis - prozor | 3.5a, Max 1D/2D Range Sum |

putovanje | Kattis - putovanje | 3.2b, Iterative (Two Nested Loops) |

reactivity | Kattis - reactivity | 8.4c, NP-hard/C, special, Easier |

redistribution | Kattis - redistribution | 3.4b, Involving Sorting, Easier |

reduction | Kattis - reduction | 3.2b, Iterative (Two Nested Loops) |

register | Kattis - register | 3.2b, Iterative (Two Nested Loops) |

rijeci | Kattis - rijeci | 5.4a, Fibonacci Numbers |

robotprotection | Kattis - robotprotection | 7.3a, Polygon, Easier |

roompainting | Kattis - roompainting | 3.3a, Binary Search |

safe | Kattis - safe | 8.2b, State-Space, BFS, Easier |

safehouses | Kattis - safehouses | 3.2c, Three+ Nested Loops, Easier |

scrollingsign | Kattis - scrollingsign | 6.4a, String Matching, Standard |

secretchamber | Kattis - secretchamber | 4.5b, APSP, Variants |

sellingspatulas | Kattis - sellingspatulas | 3.5a, Max 1D/2D Range Sum |

set | Kattis - set | 3.2c, Three+ Nested Loops, Easier |

shopaholic | Kattis - shopaholic | 3.4b, Involving Sorting, Easier |

shortestpath1 | Kattis - shortestpath1 | 4.4c, SSSP, Dijkstra, Easier |

shortestpath2 | Kattis - shortestpath2 | 4.4c, SSSP, Dijkstra, Easier |

shortestpath3 | Kattis - shortestpath3 | 4.4e, SSSP, -ve weight |

showroom | Kattis - showroom | 4.4b, SSSP, BFS, Harder |

sidewayssorting | Kattis - sidewayssorting | 2.2c, Sorting, Easier |

simplicity | Kattis - simplicity | 3.4d, Non Classical, Easier |

sixdegrees | Kattis - sixdegrees | 4.4b, SSSP, BFS, Harder |

skocimis | Kattis - skocimis | 3.4d, Non Classical, Easier |

slikar | Kattis - slikar | 4.4b, SSSP, BFS, Harder |

smallschedule | Kattis - smallschedule | 3.3b, Binary Search the Answer |

sortofsorting | Kattis - sortofsorting | 2.2d, Sorting, Harder |

speed | Kattis - speed | 3.3b, Binary Search the Answer |

spiderman | Kattis - spiderman | 3.5f, DP level 1 |

spiral | Kattis - spiral | 4.4a, SSSP, BFS, Easier |

squarepegs | Kattis - squarepegs | 3.4a, Greedy (Classical) |

squawk | Kattis - squawk | 5.9a, Matrix Power |

stringmatching | Kattis - stringmatching | 6.4a, String Matching, Standard |

subway2 | Kattis - subway2 | 4.4c, SSSP, Dijkstra, Easier |

suspensionbridges | Kattis - suspensionbridges | 3.3b, Binary Search the Answer |

swaptosort | Kattis - swaptosort | 2.4b, Union-Find Disjoint Sets |

sylvester | Kattis - sylvester | 3.3c, Other DnC Problems |

synchronizinglists | Kattis - synchronizinglists | 2.2c, Sorting, Easier |

tautology | Kattis - tautology | 3.2d, Three+ Nested Loops, Harder |

teacherevaluation | Kattis - teacherevaluation | 3.4d, Non Classical, Easier |

telephones | Kattis - telephones | 3.2b, Iterative (Two Nested Loops) |

textmessaging | Kattis - textmessaging | 3.4b, Involving Sorting, Easier |

ticketpricing | Kattis - ticketpricing | 3.5f, DP level 1 |

tourdefrance | Kattis - tourdefrance | 3.2b, Iterative (Two Nested Loops) |

trainsorting | Kattis - trainsorting | 3.5b, LIS |

transportationplanning | Kattis - transportationplanning | 4.5a, APSP, Standard |

virtualfriends | Kattis - virtualfriends | 2.4b, Union-Find Disjoint Sets |

visualgo | Kattis - visualgo | 4.4d, SSSP, Dijkstra, Harder |

weightofwords | Kattis - weightofwords | 3.5f, DP level 1 |

wine | Kattis - wine | 4.4d, SSSP, Dijkstra, Harder |

woodcutting | Kattis - woodcutting | 3.4b, Involving Sorting, Easier |

xyzzy | Kattis - xyzzy | 4.4e, SSSP, -ve weight |