{"source":"https://cpbook.net/methodstosolve?oj=all&topic=all&quality=starred&difficulty=all","total":1429,"problems":[{"judge":"UVa","id":"13025","title":null,"url":"https://onlinejudge.org/external/130/13025.pdf","section":"1.4a","topic":"One-Liner I/O","hint":"giveaway, just print the one-line answer","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"carrots","title":"carrots","url":"https://open.kattis.com/problems/carrots","section":"1.4a","topic":"One-Liner I/O","hint":"just print P","dacu":15155,"points":1.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"hello","title":"hello","url":"https://open.kattis.com/problems/hello","section":"1.4a","topic":"One-Liner I/O","hint":"just print \"Hello World!\"","dacu":39217,"points":1.2,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc2469","title":"Convert the Temperature","url":"https://leetcode.com/problems/convert-the-temperature/","section":"1.4a","topic":"One-Liner I/O","hint":"simple C to K/F conversion","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"thelastproblem","title":"thelastproblem","url":"https://open.kattis.com/problems/thelastproblem","section":"1.4a","topic":"One-Liner I/O","hint":"S can have space(s)","dacu":76,"points":1.8,"cp5":false,"solved":false},{"judge":"UVa","id":"10071","title":null,"url":"https://onlinejudge.org/external/100/10071.pdf","section":"1.4b","topic":"I/O + Sequences Only","hint":"super simple: output 2*v*t","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"UVa","id":"11614","title":null,"url":"https://onlinejudge.org/external/116/11614.pdf","section":"1.4b","topic":"I/O + Sequences Only","hint":"root of a quadratic equation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"r2","title":"r2","url":"https://open.kattis.com/problems/r2","section":"1.4b","topic":"I/O + Sequences Only","hint":"just print 2*S-R1","dacu":14929,"points":1.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"conteststruggles","title":"conteststruggles","url":"https://open.kattis.com/problems/conteststruggles","section":"1.4c","topic":"Selection Only, 2 Cases","hint":"simple formula; check if answer in [0..100]","dacu":729,"points":2.2,"cp5":true,"solved":false},{"judge":"Kattis","id":"isithalloween","title":"isithalloween","url":"https://open.kattis.com/problems/isithalloween","section":"1.4c","topic":"Selection Only, 2 Cases","hint":"if-else; 2 cases","dacu":3761,"points":1.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"laptopsticker","title":"laptopsticker","url":"https://open.kattis.com/problems/laptopsticker","section":"1.4c","topic":"Selection Only, 2 Cases","hint":"if-else; 2 cases; note: one centimeter for both sides","dacu":3329,"points":1.5,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc3560","title":"Find Minimum Log Transportation Cost","url":"https://leetcode.com/problems/find-minimum-log-transportation-cost/","section":"1.4c","topic":"Selection Only, 2 Cases","hint":"if-else; 2 cases","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"moscowdream","title":"moscowdream","url":"https://open.kattis.com/problems/moscowdream","section":"1.4c","topic":"Selection Only, 2 Cases","hint":"if-else; 2 cases; check n ≥ 3","dacu":3902,"points":1.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"vajningsplikt","title":"vajningsplikt","url":"https://open.kattis.com/problems/vajningsplikt","section":"1.4c","topic":"Selection Only, 2 Cases","hint":"selection; multiple cases; be careful","dacu":788,"points":2.1,"cp5":true,"solved":false},{"judge":"Kattis","id":"grading","title":"grading","url":"https://open.kattis.com/problems/grading","section":"1.4d","topic":"Selection Only, 3+ Cases","hint":"6 cases","dacu":2744,"points":1.5,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2119","title":"A Number After a Double Reversal","url":"https://leetcode.com/problems/a-number-after-a-double-reversal/","section":"1.4d","topic":"Selection Only, 3+ Cases","hint":"True if num is 0; otherwise True only if num is not divisible by 10","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"onechicken","title":"onechicken","url":"https://open.kattis.com/problems/onechicken","section":"1.4d","topic":"Selection Only, 3+ Cases","hint":"4 cases; piece vs pieces","dacu":6464,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"provincesandgold","title":"provincesandgold","url":"https://open.kattis.com/problems/provincesandgold","section":"1.4d","topic":"Selection Only, 3+ Cases","hint":"6 cases","dacu":4756,"points":1.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"sith","title":"sith","url":"https://open.kattis.com/problems/sith","section":"1.4d","topic":"Selection Only, 3+ Cases","hint":"3 cases","dacu":1137,"points":1.6,"cp5":true,"solved":false},{"judge":"Kattis","id":"temperature","title":"temperature","url":"https://open.kattis.com/problems/temperature","section":"1.4d","topic":"Selection Only, 3+ Cases","hint":"3 cases; derive formula","dacu":1776,"points":2.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"testdrive","title":"testdrive","url":"https://open.kattis.com/problems/testdrive","section":"1.4d","topic":"Selection Only, 3+ Cases","hint":"4 cases","dacu":848,"points":2.1,"cp5":true,"solved":false},{"judge":"UVa","id":"01124","title":null,"url":"https://onlinejudge.org/external/11/1124.pdf","section":"1.4e","topic":"Repetition Only","hint":"LA 2681 - SouthEasternEurope06; just echo/re-print the input again","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11547","title":null,"url":"https://onlinejudge.org/external/115/11547.pdf","section":"1.4e","topic":"Repetition Only","hint":"a one liner O(1) solution exists","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"different","title":"different","url":"https://open.kattis.com/problems/different","section":"1.4e","topic":"Repetition Only","hint":"use abs function per test case","dacu":8964,"points":2.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1281","title":"Subtract the Product and Sum of Digits of an Integer","url":"https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer/","section":"1.4e","topic":"Repetition Only","hint":"break n into digits; do as asked","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"qaly","title":"qaly","url":"https://open.kattis.com/problems/qaly","section":"1.4e","topic":"Repetition Only","hint":"trivial loop","dacu":5955,"points":1.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"tarifa","title":"tarifa","url":"https://open.kattis.com/problems/tarifa","section":"1.4e","topic":"Repetition Only","hint":"one pass; array not needed","dacu":9768,"points":1.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"timeloop","title":"timeloop","url":"https://open.kattis.com/problems/timeloop","section":"1.4e","topic":"Repetition Only","hint":"just print 'num Abracadabra' N times","dacu":17170,"points":1.3,"cp5":false,"solved":false},{"judge":"UVa","id":"11172","title":null,"url":"https://onlinejudge.org/external/111/11172.pdf","section":"1.4f","topic":"Multiple TC + Selection","hint":"very easy; one liner","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12250","title":null,"url":"https://onlinejudge.org/external/122/12250.pdf","section":"1.4f","topic":"Multiple TC + Selection","hint":"LA 4995 - KualaLumpur10; if-else","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12372","title":null,"url":"https://onlinejudge.org/external/123/12372.pdf","section":"1.4f","topic":"Multiple TC + Selection","hint":"just check if all L, W, H ≤ 20","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"eligibility","title":"eligibility","url":"https://open.kattis.com/problems/eligibility","section":"1.4f","topic":"Multiple TC + Selection","hint":"3 cases","dacu":1741,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"helpaphd","title":"helpaphd","url":"https://open.kattis.com/problems/helpaphd","section":"1.4f","topic":"Multiple TC + Selection","hint":"2 cases","dacu":2044,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"leftbeehind","title":"leftbeehind","url":"https://open.kattis.com/problems/leftbeehind","section":"1.4f","topic":"Multiple TC + Selection","hint":"4 cases","dacu":2014,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"oddities","title":"oddities","url":"https://open.kattis.com/problems/oddities","section":"1.4f","topic":"Multiple TC + Selection","hint":"2 cases","dacu":11523,"points":1.3,"cp5":false,"solved":false},{"judge":"UVa","id":"12279","title":null,"url":"https://onlinejudge.org/external/122/12279.pdf","section":"1.4g","topic":"Control Flow, Level 1","hint":"simple linear scan","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1431","title":"Kids With the Greatest Number of Candies","url":"https://leetcode.com/problems/kids-with-the-greatest-number-of-candies/","section":"1.4g","topic":"Control Flow, Level 1","hint":"simple one pass check; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"licensetolaunch","title":"licensetolaunch","url":"https://open.kattis.com/problems/licensetolaunch","section":"1.4g","topic":"Control Flow, Level 1","hint":"easy linear pass","dacu":1969,"points":1.4,"cp5":false,"solved":true},{"judge":"UVa","id":"11799","title":null,"url":"https://onlinejudge.org/external/117/11799.pdf","section":"1.4h","topic":"Control Flow, Level 2","hint":"one linear scan; find max value","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13130","title":null,"url":"https://onlinejudge.org/external/131/13130.pdf","section":"1.4h","topic":"Control Flow, Level 2","hint":"simple","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2169","title":"Count Operations to Obtain Zero","url":"https://leetcode.com/problems/count-operations-to-obtain-zero/","section":"1.4h","topic":"Control Flow, Level 2","hint":"simulate as asked","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"11364","title":null,"url":"https://onlinejudge.org/external/113/11364.pdf","section":"1.4i","topic":"Control Flow, Level 3","hint":"linear scan to get l and r; answer = 2*(r-l)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11764","title":null,"url":"https://onlinejudge.org/external/117/11764.pdf","section":"1.4i","topic":"Control Flow, Level 3","hint":"one linear scan to count high low jumps","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2455","title":"Average Value of Even Numbers That Are Divisible by Three","url":"https://leetcode.com/problems/average-value-of-even-numbers-that-are-divisible-by-three/","section":"1.4i","topic":"Control Flow, Level 3","hint":"even+divisible by 3 = divisible by 6","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"oddgnome","title":"oddgnome","url":"https://open.kattis.com/problems/oddgnome","section":"1.4i","topic":"Control Flow, Level 3","hint":"linear pass","dacu":2388,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"statistics","title":"statistics","url":"https://open.kattis.com/problems/statistics","section":"1.4i","topic":"Control Flow, Level 3","hint":"one pass; array not needed","dacu":2942,"points":1.7,"cp5":false,"solved":false},{"judge":"UVa","id":"11078","title":null,"url":"https://onlinejudge.org/external/110/11078.pdf","section":"1.4j","topic":"Function","hint":"one linear scan; max function","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11332","title":null,"url":"https://onlinejudge.org/external/113/11332.pdf","section":"1.4j","topic":"Function","hint":"simple recursion","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"artichoke","title":"artichoke","url":"https://open.kattis.com/problems/artichoke","section":"1.4j","topic":"Function","hint":"LA 7150 - WorldFinals Marrakech15; linear scan; probably one of the easiest WorldFinals problem; also available at UVa 0...","dacu":1390,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"digits","title":"digits","url":"https://open.kattis.com/problems/digits","section":"1.4j","topic":"Function","hint":"direct simulation; also available at UVa 11687 - Digits","dacu":214,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"filip","title":"filip","url":"https://open.kattis.com/problems/filip","section":"1.4j","topic":"Function","hint":"create a 'reverse string' function; then if-else check","dacu":6345,"points":1.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2180","title":"Count Integers With Even Digit Sum","url":"https://leetcode.com/problems/count-integers-with-even-digit-sum/","section":"1.4j","topic":"Function","hint":"use sum-of-digits function","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"mia","title":"mia","url":"https://open.kattis.com/problems/mia","section":"1.4j","topic":"Function","hint":"just if-else check","dacu":1136,"points":2.1,"cp5":false,"solved":false},{"judge":"UVa","id":"01585","title":null,"url":"https://onlinejudge.org/external/15/1585.pdf","section":"1.4k","topic":"1D Array, Easier","hint":"LA 3354 - Seoul05; very easy one pass algorithm","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12015","title":null,"url":"https://onlinejudge.org/external/120/12015.pdf","section":"1.4k","topic":"1D Array, Easier","hint":"traverse the list twice","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"acm","title":"acm","url":"https://open.kattis.com/problems/acm","section":"1.4k","topic":"1D Array, Easier","hint":"simple simulation; one pass","dacu":3526,"points":1.5,"cp5":false,"solved":true},{"judge":"Kattis","id":"cetiri","title":"cetiri","url":"https://open.kattis.com/problems/cetiri","section":"1.4k","topic":"1D Array, Easier","hint":"sort 3 number helps; 3 cases","dacu":1165,"points":1.9,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1491","title":"Average Salary Excluding the Minimum and Maximum Salary","url":"https://leetcode.com/problems/average-salary-excluding-the-minimum-and-maximum-salary/","section":"1.4k","topic":"1D Array, Easier","hint":"(sum-max-min)/len; programming-skills","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"lineup","title":"lineup","url":"https://open.kattis.com/problems/lineup","section":"1.4k","topic":"1D Array, Easier","hint":"sort ascending/descending and compare; or linear pass","dacu":3703,"points":1.6,"cp5":false,"solved":true},{"judge":"Kattis","id":"lostlineup","title":"lostlineup","url":"https://open.kattis.com/problems/lostlineup","section":"1.4k","topic":"1D Array, Easier","hint":"simple 1D array manipulation","dacu":550,"points":1.5,"cp5":false,"solved":false},{"judge":"UVa","id":"11349","title":null,"url":"https://onlinejudge.org/external/113/11349.pdf","section":"1.4l","topic":"2D Array, Easier","hint":"use long long to avoid issues","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"hakkari","title":"hakkari","url":"https://open.kattis.com/problems/hakkari","section":"1.4l","topic":"2D Array, Easier","hint":"find indices of the '*'","dacu":659,"points":1.3,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1572","title":"Matrix Diagonal Sum","url":"https://leetcode.com/problems/matrix-diagonal-sum/","section":"1.4l","topic":"2D Array, Easier","hint":"sum the diagonals; do not overcount the center cell for odd n; programming-skills","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"UVa","id":"12658","title":null,"url":"https://onlinejudge.org/external/126/12658.pdf","section":"1.4m","topic":"Easy","hint":"character recognition check","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12696","title":null,"url":"https://onlinejudge.org/external/126/12696.pdf","section":"1.4m","topic":"Easy","hint":"LA 6608 - Phuket 2013; easy problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"batterup","title":"batterup","url":"https://open.kattis.com/problems/batterup","section":"1.4m","topic":"Easy","hint":"easy one loop","dacu":4542,"points":1.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"hangingout","title":"hangingout","url":"https://open.kattis.com/problems/hangingout","section":"1.4m","topic":"Easy","hint":"simple loop","dacu":2218,"points":1.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"hissingmicrophone","title":"hissingmicrophone","url":"https://open.kattis.com/problems/hissingmicrophone","section":"1.4m","topic":"Easy","hint":"simple loop","dacu":7690,"points":1.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2739","title":"Total Distance Traveled","url":"https://leetcode.com/problems/total-distance-traveled/","section":"1.4m","topic":"Easy","hint":"simulate the process","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"stopwatch","title":"stopwatch","url":"https://open.kattis.com/problems/stopwatch","section":"1.4m","topic":"Easy","hint":"linear pass; simulation","dacu":390,"points":1.3,"cp5":true,"solved":false},{"judge":"UVa","id":"11683","title":null,"url":"https://onlinejudge.org/external/116/11683.pdf","section":"1.4n","topic":"Still Easy","hint":"one linear pass is enough","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11786","title":null,"url":"https://onlinejudge.org/external/117/11786.pdf","section":"1.4n","topic":"Still Easy","hint":"need to observe the pattern","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bossbattle","title":"bossbattle","url":"https://open.kattis.com/problems/bossbattle","section":"1.4n","topic":"Still Easy","hint":"trick question","dacu":1391,"points":1.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1342","title":"Number of Steps to Reduce a Number to Zero","url":"https://leetcode.com/problems/number-of-steps-to-reduce-a-number-to-zero/","section":"1.4n","topic":"Still Easy","hint":"logarithmic steps simulation","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"peasoup","title":"peasoup","url":"https://open.kattis.com/problems/peasoup","section":"1.4n","topic":"Still Easy","hint":"one linear pass","dacu":771,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"thanos","title":"thanos","url":"https://open.kattis.com/problems/thanos","section":"1.4n","topic":"Still Easy","hint":"simple simulation; R is at least 2","dacu":2503,"points":2.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"vote","title":"vote","url":"https://open.kattis.com/problems/vote","section":"1.4n","topic":"Still Easy","hint":"follow the requirements","dacu":1584,"points":2.2,"cp5":false,"solved":false},{"judge":"UVa","id":"12157","title":null,"url":"https://onlinejudge.org/external/121/12157.pdf","section":"1.4o","topic":"Medium","hint":"LA 4405 - KualaLumpur08; compute and compare the two plans","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12643","title":null,"url":"https://onlinejudge.org/external/126/12643.pdf","section":"1.4o","topic":"Medium","hint":"it has tricky test cases","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"basicprogramming1","title":"basicprogramming1","url":"https://open.kattis.com/problems/basicprogramming1","section":"1.4o","topic":"Medium","hint":"a nice summative problem for programming examination of a basic programming methodology course","dacu":201,"points":4,"cp5":false,"solved":false},{"judge":"Kattis","id":"battlesimulation","title":"battlesimulation","url":"https://open.kattis.com/problems/battlesimulation","section":"1.4o","topic":"Medium","hint":"one pass; special check on 3! = 6 possible combinations of 3 combo moves","dacu":900,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"bitsequalizer","title":"bitsequalizer","url":"https://open.kattis.com/problems/bitsequalizer","section":"1.4o","topic":"Medium","hint":"analyzing patterns; also available at UVa 12545 - Bits Equalizer","dacu":174,"points":4.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc3522","title":"Calculate Score After Performing Instructions","url":"https://leetcode.com/problems/calculate-score-after-performing-instructions/","section":"1.4o","topic":"Medium","hint":"also see Kattis - basicprogramming1","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0058","title":"Length of Last Word","url":"https://leetcode.com/problems/length-of-last-word/","section":"1.5a","topic":"1D Character Array","hint":"split and report as asked; programming-skills; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"UVa","id":"11278","title":null,"url":"https://onlinejudge.org/external/112/11278.pdf","section":"1.5b","topic":"Cipher, Easier","hint":"map QWERTY keys to DVORAK","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12896","title":null,"url":"https://onlinejudge.org/external/128/12896.pdf","section":"1.5b","topic":"Cipher, Easier","hint":"simple cipher; use mapper","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13145","title":null,"url":"https://onlinejudge.org/external/131/13145.pdf","section":"1.5b","topic":"Cipher, Easier","hint":"shift alphabet values by +6 characters to read the problem statement; simple Caesar Cipher problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"conundrum","title":"conundrum","url":"https://open.kattis.com/problems/conundrum","section":"1.5b","topic":"Cipher, Easier","hint":"simple cipher","dacu":5240,"points":1.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"encodedmessage","title":"encodedmessage","url":"https://open.kattis.com/problems/encodedmessage","section":"1.5b","topic":"Cipher, Easier","hint":"simple 2D grid cipher","dacu":2316,"points":1.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0006","title":"Zigzag Conversion","url":"https://leetcode.com/problems/zigzag-conversion/","section":"1.5b","topic":"Cipher, Easier","hint":"index manipulation; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"t9spelling","title":"t9spelling","url":"https://open.kattis.com/problems/t9spelling","section":"1.5b","topic":"Cipher, Easier","hint":"similar to (the reverse of) UVa 12896","dacu":2425,"points":1.7,"cp5":false,"solved":false},{"judge":"UVa","id":"00245","title":null,"url":"https://onlinejudge.org/external/2/245.pdf","section":"1.5c","topic":"Cipher, Medium","hint":"LA 5184 - WorldFinals Nashville95","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11787","title":null,"url":"https://onlinejudge.org/external/117/11787.pdf","section":"1.5c","topic":"Cipher, Medium","hint":"follow the description","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"anewalphabet","title":"anewalphabet","url":"https://open.kattis.com/problems/anewalphabet","section":"1.5c","topic":"Cipher, Medium","hint":"simple cipher; 26 characters","dacu":4154,"points":1.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0443","title":"String Compression","url":"https://leetcode.com/problems/string-compression/","section":"1.5c","topic":"Cipher, Medium","hint":"Run-Length Encoding; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"piglatin","title":"piglatin","url":"https://open.kattis.com/problems/piglatin","section":"1.5c","topic":"Cipher, Medium","hint":"simple; check the vowels that include 'y' and process it","dacu":916,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"secretmessage","title":"secretmessage","url":"https://open.kattis.com/problems/secretmessage","section":"1.5c","topic":"Cipher, Medium","hint":"just do as asked; use 2D grid","dacu":2866,"points":1.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"tajna","title":"tajna","url":"https://open.kattis.com/problems/tajna","section":"1.5c","topic":"Cipher, Medium","hint":"simple 2D grid cipher","dacu":471,"points":2.1,"cp5":false,"solved":false},{"judge":"UVa","id":"01200","title":null,"url":"https://onlinejudge.org/external/12/1200.pdf","section":"1.5d","topic":"Input Parsing (Iter)","hint":"LA 2972 - Tehran03; tokenize input","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10906","title":null,"url":"https://onlinejudge.org/external/109/10906.pdf","section":"1.5d","topic":"Input Parsing (Iter)","hint":"BNF parsing; iterative solution","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11878","title":null,"url":"https://onlinejudge.org/external/118/11878.pdf","section":"1.5d","topic":"Input Parsing (Iter)","hint":"expression parsing","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"autori","title":"autori","url":"https://open.kattis.com/problems/autori","section":"1.5d","topic":"Input Parsing (Iter)","hint":"simple string tokenizer problem","dacu":11602,"points":1.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1678","title":"Goal Parser Interpretation","url":"https://leetcode.com/problems/goal-parser-interpretation/","section":"1.5d","topic":"Input Parsing (Iter)","hint":"simple iterative parser","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"pervasiveheartmonitor","title":"pervasiveheartmonitor","url":"https://open.kattis.com/problems/pervasiveheartmonitor","section":"1.5d","topic":"Input Parsing (Iter)","hint":"simple parsing; then finding average","dacu":950,"points":1.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"timebomb","title":"timebomb","url":"https://open.kattis.com/problems/timebomb","section":"1.5d","topic":"Input Parsing (Iter)","hint":"just a tedious input parsing problem; divisibility by 6","dacu":1174,"points":1.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00488","title":null,"url":"https://onlinejudge.org/external/4/488.pdf","section":"1.5e","topic":"Output Formatting, E","hint":"use several loops","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01605","title":null,"url":"https://onlinejudge.org/external/16/1605.pdf","section":"1.5e","topic":"Output Formatting, E","hint":"LA 4044 - NortheasternEurope07; we can answer this problem with just h=2 levels","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12364","title":null,"url":"https://onlinejudge.org/external/123/12364.pdf","section":"1.5e","topic":"Output Formatting, E","hint":"2D array check; check all possible digits [0..9]","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"display","title":"display","url":"https://open.kattis.com/problems/display","section":"1.5e","topic":"Output Formatting, E","hint":"unordered_map; map a digit -> enlarged 7x5 version","dacu":635,"points":2.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1324","title":"Print Words Vertically","url":"https://leetcode.com/problems/print-words-vertically/","section":"1.5e","topic":"Output Formatting, E","hint":"use 2D grid buffer","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"musicalnotation","title":"musicalnotation","url":"https://open.kattis.com/problems/musicalnotation","section":"1.5e","topic":"Output Formatting, E","hint":"simple but tedious","dacu":421,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"skener","title":"skener","url":"https://open.kattis.com/problems/skener","section":"1.5e","topic":"Output Formatting, E","hint":"enlarging 2D character array","dacu":2067,"points":1.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1455","title":"Check If a Word Occurs As a Prefix of Any Word in a Sentence","url":"https://leetcode.com/problems/check-if-a-word-occurs-as-a-prefix-of-any-word-in-a-sentence/","section":"1.5f","topic":"Easy, Involving String","hint":"tokenize and check","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1880","title":"Check if Word Equals Summation of Two Words","url":"https://leetcode.com/problems/check-if-word-equals-summation-of-two-words/","section":"1.5f","topic":"Easy, Involving String","hint":"create function toInt(s); compare","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1945","title":"Sum of Digits of String After Convert","url":"https://leetcode.com/problems/sum-of-digits-of-string-after-convert/","section":"1.5f","topic":"Easy, Involving String","hint":"use sum-of-digits function","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"ptice","title":"ptice","url":"https://open.kattis.com/problems/ptice","section":"1.5f","topic":"Easy, Involving String","hint":"just a simple simulation","dacu":2100,"points":1.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"sevenwonders","title":"sevenwonders","url":"https://open.kattis.com/problems/sevenwonders","section":"1.5f","topic":"Easy, Involving String","hint":"one pass","dacu":4776,"points":1.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"yinyangstones","title":"yinyangstones","url":"https://open.kattis.com/problems/yinyangstones","section":"1.5f","topic":"Easy, Involving String","hint":"trick question; just check if number of whites equals to number of blacks","dacu":1365,"points":1.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"attemptedalphabet","title":"attemptedalphabet","url":"https://open.kattis.com/problems/attemptedalphabet","section":"1.5g","topic":"Basic String Matching","hint":"just search for all 26 lowercase alphabets","dacu":326,"points":1.5,"cp5":true,"solved":false},{"judge":"Kattis","id":"blackthorn","title":"blackthorn","url":"https://open.kattis.com/problems/blackthorn","section":"1.5g","topic":"Basic String Matching","hint":"simple string search","dacu":702,"points":1.3,"cp5":true,"solved":false},{"judge":"Kattis","id":"eclips","title":"eclips","url":"https://open.kattis.com/problems/eclips","section":"1.5g","topic":"Basic String Matching","hint":"tokenize and check existence of 'e'","dacu":287,"points":1.4,"cp5":true,"solved":false},{"judge":"Kattis","id":"gettingwood","title":"gettingwood","url":"https://open.kattis.com/problems/gettingwood","section":"1.5g","topic":"Basic String Matching","hint":"search for 'tree'","dacu":625,"points":1.3,"cp5":true,"solved":false},{"judge":"Kattis","id":"searchwizard","title":"searchwizard","url":"https://open.kattis.com/problems/searchwizard","section":"1.5g","topic":"Basic String Matching","hint":"multiple basic string matchings","dacu":263,"points":1.6,"cp5":true,"solved":false},{"judge":"UVa","id":"10388","title":null,"url":"https://onlinejudge.org/external/103/10388.pdf","section":"1.6a","topic":"Game (Card)","hint":"card simulation; uses random number to determine moves; need data structure to maintain the face-up and face-down cards","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12247","title":null,"url":"https://onlinejudge.org/external/122/12247.pdf","section":"1.6a","topic":"Game (Card)","hint":"This is a starred problem; refer to CP3/4 book","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bela","title":"bela","url":"https://open.kattis.com/problems/bela","section":"1.6a","topic":"Game (Card)","hint":"simple card scoring problem","dacu":3731,"points":1.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2347","title":"Best Poker Hand","url":"https://leetcode.com/problems/best-poker-hand/","section":"1.6a","topic":"Game (Card)","hint":"apply the poker hand rules as described","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"memorymatch","title":"memorymatch","url":"https://open.kattis.com/problems/memorymatch","section":"1.6a","topic":"Game (Card)","hint":"interesting simulation game; many corner cases","dacu":161,"points":4,"cp5":false,"solved":false},{"judge":"Kattis","id":"pokerhand","title":"pokerhand","url":"https://open.kattis.com/problems/pokerhand","section":"1.6a","topic":"Game (Card)","hint":"frequency count; report max","dacu":2173,"points":1.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"shuffling","title":"shuffling","url":"https://open.kattis.com/problems/shuffling","section":"1.6a","topic":"Game (Card)","hint":"simulate card shuffling operation","dacu":218,"points":2.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00255","title":null,"url":"https://onlinejudge.org/external/2/255.pdf","section":"1.6b","topic":"Game (Chess)","hint":"check the validity of chess moves","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00278","title":null,"url":"https://onlinejudge.org/external/2/278.pdf","section":"1.6b","topic":"Game (Chess)","hint":"basic chess knowledge is needed; derive the closed form formulas","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00696","title":null,"url":"https://onlinejudge.org/external/6/696.pdf","section":"1.6b","topic":"Game (Chess)","hint":"ad hoc; chess","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10284","title":null,"url":"https://onlinejudge.org/external/102/10284.pdf","section":"1.6b","topic":"Game (Chess)","hint":"FEN = Forsyth-Edwards Notation is a standard notation for describing board positions in a chess game","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"chess","title":"chess","url":"https://open.kattis.com/problems/chess","section":"1.6b","topic":"Game (Chess)","hint":"bishop movements; either impossible, 0, 1, or 2 ways - one of this can be invalid; just use brute force","dacu":856,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"empleh","title":"empleh","url":"https://open.kattis.com/problems/empleh","section":"1.6b","topic":"Game (Chess)","hint":"the reverse problem of Kattis - helpme","dacu":245,"points":1.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"helpme","title":"helpme","url":"https://open.kattis.com/problems/helpme","section":"1.6b","topic":"Game (Chess)","hint":"convert the given chess board into chess notation","dacu":302,"points":2.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0999","title":"Available Captures for Rook","url":"https://leetcode.com/problems/available-captures-for-rook/","section":"1.6b","topic":"Game (Chess)","hint":"find the (r, c) of rook 'R'; simulate 4 directions of rook attacks","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"00947","title":null,"url":"https://onlinejudge.org/external/9/947.pdf","section":"1.6c","topic":"Game (Others), Easier","hint":"similar to UVa 340","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10189","title":null,"url":"https://onlinejudge.org/external/101/10189.pdf","section":"1.6c","topic":"Game (Others), Easier","hint":"simulate the classic Minesweeper game; similar to UVa 10279","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11459","title":null,"url":"https://onlinejudge.org/external/114/11459.pdf","section":"1.6c","topic":"Game (Others), Easier","hint":"simulate it; similar to UVa 647","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"connectthedots","title":"connectthedots","url":"https://open.kattis.com/problems/connectthedots","section":"1.6c","topic":"Game (Others), Easier","hint":"classic children game; output formatting","dacu":213,"points":3.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"gamerank","title":"gamerank","url":"https://open.kattis.com/problems/gamerank","section":"1.6c","topic":"Game (Others), Easier","hint":"simulate the ranking update process","dacu":732,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"guessinggame","title":"guessinggame","url":"https://open.kattis.com/problems/guessinggame","section":"1.6c","topic":"Game (Others), Easier","hint":"use a 1D flag array; also available at UVa 10530 - Guessing Game","dacu":684,"points":2.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc3248","title":"Snake in Matrix","url":"https://leetcode.com/problems/snake-in-matrix/","section":"1.6c","topic":"Game (Others), Easier","hint":"simulating the movement of snake grid game","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"00584","title":null,"url":"https://onlinejudge.org/external/5/584.pdf","section":"1.6d","topic":"Game (Others), Harder","hint":"simulation; games; reading comprehension","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10813","title":null,"url":"https://onlinejudge.org/external/108/10813.pdf","section":"1.6d","topic":"Game (Others), Harder","hint":"follow the problem description","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"battleship","title":"battleship","url":"https://open.kattis.com/problems/battleship","section":"1.6d","topic":"Game (Others), Harder","hint":"simulation; reading comprehension; many corner cases","dacu":120,"points":5.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1275","title":"Find Winner on a Tic Tac Toe Game","url":"https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game/","section":"1.6d","topic":"Game (Others), Harder","hint":"just simulate; programming-skills","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"rockpaperscissors","title":"rockpaperscissors","url":"https://open.kattis.com/problems/rockpaperscissors","section":"1.6d","topic":"Game (Others), Harder","hint":"count wins and losses; output win average; also available at UVa 10903 - Rock-Paper-Scissors ...","dacu":820,"points":3.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"tictactoe2","title":"tictactoe2","url":"https://open.kattis.com/problems/tictactoe2","section":"1.6d","topic":"Game (Others), Harder","hint":"check validity of Tic Tac Toe game; tricky; also available at UVa 10363 - Tic Tac Toe","dacu":167,"points":5.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"turtlemaster","title":"turtlemaster","url":"https://open.kattis.com/problems/turtlemaster","section":"1.6d","topic":"Game (Others), Harder","hint":"interesting board game to teach programming for children; simulation","dacu":323,"points":2.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00637","title":null,"url":"https://onlinejudge.org/external/6/637.pdf","section":"1.6e","topic":"Real Life, Easier","hint":"application in printer driver software","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13151","title":null,"url":"https://onlinejudge.org/external/131/13151.pdf","section":"1.6e","topic":"Real Life, Easier","hint":"marking programming exam; ad hoc; straightforward","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"chopin","title":"chopin","url":"https://open.kattis.com/problems/chopin","section":"1.6e","topic":"Real Life, Easier","hint":"you can learn a bit of music with this problem","dacu":823,"points":1.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"compass","title":"compass","url":"https://open.kattis.com/problems/compass","section":"1.6e","topic":"Real Life, Easier","hint":"your typical smartphone's compass function usually has this small feature","dacu":1529,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"fizzbuzz","title":"fizzbuzz","url":"https://open.kattis.com/problems/fizzbuzz","section":"1.6e","topic":"Real Life, Easier","hint":"actually just about easy divisibility properties","dacu":10274,"points":1.3,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc0657","title":"Robot Return to Origin","url":"https://leetcode.com/problems/robot-return-to-origin/","section":"1.6e","topic":"Real Life, Easier","hint":"simple robot movement simulation on a virtual 2D grid; programming-skills","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"trainpassengers","title":"trainpassengers","url":"https://open.kattis.com/problems/trainpassengers","section":"1.6e","topic":"Real Life, Easier","hint":"create a verifier; be careful of corner cases","dacu":1807,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"wertyu","title":"wertyu","url":"https://open.kattis.com/problems/wertyu","section":"1.6e","topic":"Real Life, Easier","hint":"use 2D mapper array to simplify the problem; also available at UVa 10082 - WERTYU","dacu":768,"points":2.9,"cp5":false,"solved":false},{"judge":"UVa","id":"10528","title":null,"url":"https://onlinejudge.org/external/105/10528.pdf","section":"1.6f","topic":"Real Life, Medium","hint":"music knowledge in problem description","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11736","title":null,"url":"https://onlinejudge.org/external/117/11736.pdf","section":"1.6f","topic":"Real Life, Medium","hint":"this is a (simplified) introduction to Computer Organization on how computer stores data in memory","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"beatspread","title":"beatspread","url":"https://open.kattis.com/problems/beatspread","section":"1.6f","topic":"Real Life, Medium","hint":"be careful with boundary cases!; also available at UVa 10812 - Beat the Spread","dacu":980,"points":2.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1041","title":"Robot Bounded In Circle","url":"https://leetcode.com/problems/robot-bounded-in-circle/","section":"1.6f","topic":"Real Life, Medium","hint":"virtual 2D grid traversal; simple observations; programming-skills","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"luhnchecksum","title":"luhnchecksum","url":"https://open.kattis.com/problems/luhnchecksum","section":"1.6f","topic":"Real Life, Medium","hint":"very similar (~95%) to UVa 11743","dacu":836,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"toilet","title":"toilet","url":"https://open.kattis.com/problems/toilet","section":"1.6f","topic":"Real Life, Medium","hint":"simulation; be careful of corner cases","dacu":1756,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"wordcloud","title":"wordcloud","url":"https://open.kattis.com/problems/wordcloud","section":"1.6f","topic":"Real Life, Medium","hint":"just a simulation; but be careful of corner cases","dacu":322,"points":2.4,"cp5":false,"solved":false},{"judge":"UVa","id":"00706","title":null,"url":"https://onlinejudge.org/external/7/706.pdf","section":"1.6g","topic":"Real Life, Harder","hint":"like in old digital display","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01061","title":null,"url":"https://onlinejudge.org/external/10/1061.pdf","section":"1.6g","topic":"Real Life, Harder","hint":"LA 3736 - WorldFinals Tokyo07; try all eight possible blood + Rh types with the information given","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01091","title":null,"url":"https://onlinejudge.org/external/10/1091.pdf","section":"1.6g","topic":"Real Life, Harder","hint":"LA 4786 - WorldFinals Harbin10; tedious simulation and reading comprehension","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"creditcard","title":"creditcard","url":"https://open.kattis.com/problems/creditcard","section":"1.6g","topic":"Real Life, Harder","hint":"real life issue; precision error issue if we do not convert double (with just 2 digits after decimal point) into long lo...","dacu":123,"points":6.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2299","title":"Strong Password Checker II","url":"https://leetcode.com/problems/strong-password-checker-ii/","section":"1.6g","topic":"Real Life, Harder","hint":"we frequently do this in real-life","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"tenis","title":"tenis","url":"https://open.kattis.com/problems/tenis","section":"1.6g","topic":"Real Life, Harder","hint":"Tennis scoring rules; tricky test cases; be careful","dacu":78,"points":5,"cp5":false,"solved":false},{"judge":"UVa","id":"00579","title":null,"url":"https://onlinejudge.org/external/5/579.pdf","section":"1.6h","topic":"Time, Easier","hint":"be careful with corner cases","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12148","title":null,"url":"https://onlinejudge.org/external/121/12148.pdf","section":"1.6h","topic":"Time, Easier","hint":"easy with Gregorian Calendar; use method 'add' to add one day to previous date and see if it is the same as the current ...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"friday","title":"friday","url":"https://open.kattis.com/problems/friday","section":"1.6h","topic":"Time, Easier","hint":"the answer depends on the start day of the month","dacu":1059,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"justaminute","title":"justaminute","url":"https://open.kattis.com/problems/justaminute","section":"1.6h","topic":"Time, Easier","hint":"linear pass; total seconds/(total minutes*60)","dacu":1512,"points":1.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1154","title":"Day of the Year","url":"https://leetcode.com/problems/day-of-the-year/","section":"1.6h","topic":"Time, Easier","hint":"use Python datetime library","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"marswindow","title":"marswindow","url":"https://open.kattis.com/problems/marswindow","section":"1.6h","topic":"Time, Easier","hint":"simple advancing of year and month by 26 months or 2 years+2 months each; direct formula exists","dacu":830,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"savingdaylight","title":"savingdaylight","url":"https://open.kattis.com/problems/savingdaylight","section":"1.6h","topic":"Time, Easier","hint":"convert hh:mm to minute; compute difference of ending and starting; then convert minute to hh:mm again","dacu":986,"points":2.1,"cp5":false,"solved":false},{"judge":"UVa","id":"11947","title":null,"url":"https://onlinejudge.org/external/119/11947.pdf","section":"1.6i","topic":"Time, Harder","hint":"easier with Java GregorianCalendar","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12822","title":null,"url":"https://onlinejudge.org/external/128/12822.pdf","section":"1.6i","topic":"Time, Harder","hint":"convert hh:mm:ss to second to simplify the problem; then this is just a tedious simulation problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bestbefore","title":"bestbefore","url":"https://open.kattis.com/problems/bestbefore","section":"1.6i","topic":"Time, Harder","hint":"tedious; 3! = 6 possibilities to check","dacu":148,"points":4,"cp5":false,"solved":false},{"judge":"Kattis","id":"birthdayboy","title":"birthdayboy","url":"https://open.kattis.com/problems/birthdayboy","section":"1.6i","topic":"Time, Harder","hint":"convert mm-dd into [0..364]; use DAT; find largest gap via brute force","dacu":108,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"natrij","title":"natrij","url":"https://open.kattis.com/problems/natrij","section":"1.6i","topic":"Time, Harder","hint":"convert hh:mm:ss to seconds; make sure the second time is larger than the first time; corner case: 24:00:00","dacu":1136,"points":2.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"timezones","title":"timezones","url":"https://open.kattis.com/problems/timezones","section":"1.6i","topic":"Time, Harder","hint":"follow the description, tedious; also available at UVa 10371 - Time Zones","dacu":67,"points":5.3,"cp5":false,"solved":false},{"judge":"UVa","id":"00185","title":null,"url":"https://onlinejudge.org/external/1/185.pdf","section":"1.6j","topic":"Roman Numerals","hint":"also involving backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00344","title":null,"url":"https://onlinejudge.org/external/3/344.pdf","section":"1.6j","topic":"Roman Numerals","hint":"count Roman chars used in [1..N]","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00759","title":null,"url":"https://onlinejudge.org/external/7/759.pdf","section":"1.6j","topic":"Roman Numerals","hint":"validation problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12397","title":null,"url":"https://onlinejudge.org/external/123/12397.pdf","section":"1.6j","topic":"Roman Numerals","hint":"each Roman digit has a value","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0013","title":"Roman to Integer","url":"https://leetcode.com/problems/roman-to-integer/","section":"1.6j","topic":"Roman Numerals","hint":"classic; programming-skills; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"rimski","title":"rimski","url":"https://open.kattis.com/problems/rimski","section":"1.6j","topic":"Roman Numerals","hint":"to Roman/to Decimal conversion problem; use next permutation to be sure","dacu":118,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"romanholidays","title":"romanholidays","url":"https://open.kattis.com/problems/romanholidays","section":"1.6j","topic":"Roman Numerals","hint":"generate and sort the first 1K Roman strings; ''M'' is at index 945; append prefix 'M' for numbers larger than 1K","dacu":92,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"11638","title":null,"url":"https://onlinejudge.org/external/116/11638.pdf","section":"1.6k","topic":"Time Waster, Easier","hint":"simulation; needs to use bitmask for parameter C","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12085","title":null,"url":"https://onlinejudge.org/external/120/12085.pdf","section":"1.6k","topic":"Time Waster, Easier","hint":"LA 2189 - Dhaka06; watch out for PE","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12608","title":null,"url":"https://onlinejudge.org/external/126/12608.pdf","section":"1.6k","topic":"Time Waster, Easier","hint":"simulation with several corner cases","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"asciiaddition","title":"asciiaddition","url":"https://open.kattis.com/problems/asciiaddition","section":"1.6k","topic":"Time Waster, Easier","hint":"a+b problem in text format","dacu":509,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"glitchbot","title":"glitchbot","url":"https://open.kattis.com/problems/glitchbot","section":"1.6k","topic":"Time Waster, Easier","hint":"O(n^2) simulation; only output one answer","dacu":1036,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"pachydermpeanutpacking","title":"pachydermpeanutpacking","url":"https://open.kattis.com/problems/pachydermpeanutpacking","section":"1.6k","topic":"Time Waster, Easier","hint":"time waster; simple one loop simulation","dacu":322,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"printingcosts","title":"printingcosts","url":"https://open.kattis.com/problems/printingcosts","section":"1.6k","topic":"Time Waster, Easier","hint":"clear time waster; the hard part is in parsing the costs of each character in the problem description","dacu":705,"points":2.2,"cp5":false,"solved":false},{"judge":"UVa","id":"00405","title":null,"url":"https://onlinejudge.org/external/4/405.pdf","section":"1.6l","topic":"Time Waster, Harder","hint":"simulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10188","title":null,"url":"https://onlinejudge.org/external/101/10188.pdf","section":"1.6l","topic":"Time Waster, Harder","hint":"simulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11717","title":null,"url":"https://onlinejudge.org/external/117/11717.pdf","section":"1.6l","topic":"Time Waster, Harder","hint":"tricky simulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12280","title":null,"url":"https://onlinejudge.org/external/122/12280.pdf","section":"1.6l","topic":"Time Waster, Harder","hint":"a tedious problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"froggie","title":"froggie","url":"https://open.kattis.com/problems/froggie","section":"1.6l","topic":"Time Waster, Harder","hint":"just a simulation; but many corner cases; S can be 0","dacu":296,"points":6.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"functionalfun","title":"functionalfun","url":"https://open.kattis.com/problems/functionalfun","section":"1.6l","topic":"Time Waster, Harder","hint":"just follow the description; 5 cases; tedious parsing problem; requires a kind of mapper","dacu":487,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"windows","title":"windows","url":"https://open.kattis.com/problems/windows","section":"1.6l","topic":"Time Waster, Harder","hint":"LA 7162 - WorldFinals Marrakech15; tedious simulation problem; also available at UVa 01721 - Window Manager","dacu":92,"points":7.6,"cp5":false,"solved":false},{"judge":"UVa","id":"12150","title":null,"url":"https://onlinejudge.org/external/121/12150.pdf","section":"2.2a","topic":"1D Array, Medium","hint":"simple manipulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12356","title":null,"url":"https://onlinejudge.org/external/123/12356.pdf","section":"2.2a","topic":"1D Array, Medium","hint":"similar to deletion in doubly linked lists but we can still use a 1D array for the underlying data structure","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"downtime","title":"downtime","url":"https://open.kattis.com/problems/downtime","section":"2.2a","topic":"1D Array, Medium","hint":"1D array; use Fenwick Tree-like operation for Range Update Point Query","dacu":1068,"points":3.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"fluortanten","title":"fluortanten","url":"https://open.kattis.com/problems/fluortanten","section":"2.2a","topic":"1D Array, Medium","hint":"remove Bjorn first; then do O(n) pass to check where is Bjorn's optimal position","dacu":181,"points":3.1,"cp5":true,"solved":false},{"judge":"Kattis","id":"greedilyincreasing","title":"greedilyincreasing","url":"https://open.kattis.com/problems/greedilyincreasing","section":"2.2a","topic":"1D Array, Medium","hint":"just 1D array manipulation; this is not the DP-LIS problem","dacu":1151,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"jollyjumpers","title":"jollyjumpers","url":"https://open.kattis.com/problems/jollyjumpers","section":"2.2a","topic":"1D Array, Medium","hint":"1D Boolean flags to check [1..n-1]; also available at UVa 10038 - Jolly Jumpers","dacu":413,"points":3.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0088","title":"Merge Sorted Array","url":"https://leetcode.com/problems/merge-sorted-array/","section":"2.2a","topic":"1D Array, Medium","hint":"do merge of Merge sort; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0605","title":"Can Place Flowers","url":"https://leetcode.com/problems/can-place-flowers/","section":"2.2a","topic":"1D Array, Medium","hint":"tricky 1D array processing; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"10978","title":null,"url":"https://onlinejudge.org/external/109/10978.pdf","section":"2.2c","topic":"1D Array, Harder","hint":"1D string array","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12662","title":null,"url":"https://onlinejudge.org/external/126/12662.pdf","section":"2.2c","topic":"1D Array, Harder","hint":"1D array manipulation; brute force","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13048","title":null,"url":"https://onlinejudge.org/external/130/13048.pdf","section":"2.2c","topic":"1D Array, Harder","hint":"use 1D Boolean array; simulate","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"divideby100","title":"divideby100","url":"https://open.kattis.com/problems/divideby100","section":"2.2c","topic":"1D Array, Harder","hint":"big 1D character array processing; be careful","dacu":557,"points":4.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0238","title":"Product of Array Except Self","url":"https://leetcode.com/problems/product-of-array-except-self/","section":"2.2c","topic":"1D Array, Harder","hint":"use prefix and suffix products; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc1869","title":"Longer Contiguous Segments of Ones than Zeros","url":"https://leetcode.com/problems/longer-contiguous-segments-of-ones-than-zeros/","section":"2.2c","topic":"1D Array, Harder","hint":"split s using 0 as delimiter; take token with the max length; do the same but using 1 as delimiter; compare","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"mastermind","title":"mastermind","url":"https://open.kattis.com/problems/mastermind","section":"2.2c","topic":"1D Array, Harder","hint":"1D array manipulation to count r and s","dacu":446,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"pivot","title":"pivot","url":"https://open.kattis.com/problems/pivot","section":"2.2c","topic":"1D Array, Harder","hint":"static range min/max query problem; special condition allows this problem to be solvable in O(n) using help of 1D arrays","dacu":1723,"points":3.2,"cp5":false,"solved":false},{"judge":"UVa","id":"11581","title":null,"url":"https://onlinejudge.org/external/115/11581.pdf","section":"2.2d","topic":"2D Array, Medium","hint":"simulate the process","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12667","title":null,"url":"https://onlinejudge.org/external/126/12667.pdf","section":"2.2d","topic":"2D Array, Medium","hint":"use both 1D and 2D arrays to store submission status","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"epigdanceoff","title":"epigdanceoff","url":"https://open.kattis.com/problems/epigdanceoff","section":"2.2d","topic":"2D Array, Medium","hint":"count number of CCs on 2D grid; simpler solution exists: count the number of blank columns plus one","dacu":505,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"flowshop","title":"flowshop","url":"https://open.kattis.com/problems/flowshop","section":"2.2d","topic":"2D Array, Medium","hint":"interesting 2D array manipulation","dacu":392,"points":2.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"imageprocessing","title":"imageprocessing","url":"https://open.kattis.com/problems/imageprocessing","section":"2.2d","topic":"2D Array, Medium","hint":"interesting 2D array manipulation","dacu":344,"points":2.1,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0027","title":"Remove Element","url":"https://leetcode.com/problems/remove-element/","section":"2.2d","topic":"2D Array, Medium","hint":"use Partition algorithm (two pointers) for in-place solution; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc1351","title":"Count Negative Numbers in a Sorted Matrix","url":"https://leetcode.com/problems/count-negative-numbers-in-a-sorted-matrix/","section":"2.2d","topic":"2D Array, Medium","hint":"go row by row; right to left, O(m+n)","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"nineknights","title":"nineknights","url":"https://open.kattis.com/problems/nineknights","section":"2.2d","topic":"2D Array, Medium","hint":"2D array checks; 8 directions","dacu":881,"points":1.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00466","title":null,"url":"https://onlinejudge.org/external/4/466.pdf","section":"2.2e","topic":"2D Array, Harder","hint":"core functions: rotate and reflect","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12291","title":null,"url":"https://onlinejudge.org/external/122/12291.pdf","section":"2.2e","topic":"2D Array, Harder","hint":"do as asked; a bit tedious","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"2048","title":"2048","url":"https://open.kattis.com/problems/2048","section":"2.2e","topic":"2D Array, Harder","hint":"just a 2D array manipulation problem; utilize symmetry using 90 degrees rotation(s) to reduce 4 cases into 1","dacu":3150,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"flagquiz","title":"flagquiz","url":"https://open.kattis.com/problems/flagquiz","section":"2.2e","topic":"2D Array, Harder","hint":"array of array of strings; be careful; duplicates may exists","dacu":167,"points":3.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"funhouse","title":"funhouse","url":"https://open.kattis.com/problems/funhouse","section":"2.2e","topic":"2D Array, Harder","hint":"2D array manipulation; note the direction update","dacu":700,"points":2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0054","title":"Spiral Matrix","url":"https://leetcode.com/problems/spiral-matrix/","section":"2.2e","topic":"2D Array, Harder","hint":"heavy 2D matrix indexing; use dr/dc technique; programming-skills; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"rings2","title":"rings2","url":"https://open.kattis.com/problems/rings2","section":"2.2e","topic":"2D Array, Harder","hint":"more challenging 2D array manipulation; special output formatting style","dacu":385,"points":3.8,"cp5":false,"solved":false},{"judge":"UVa","id":"10107","title":null,"url":"https://onlinejudge.org/external/101/10107.pdf","section":"2.2f","topic":"Sorting, Easier","hint":"find median of a growing/dynamic list of integers; we can use multiple calls of nth_element in algorithm","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12709","title":null,"url":"https://onlinejudge.org/external/127/12709.pdf","section":"2.2f","topic":"Sorting, Easier","hint":"LA 6650 - Dhaka13; although the problem has a complicated story; it has a very easy solution with sort routine","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"basicprogramming2","title":"basicprogramming2","url":"https://open.kattis.com/problems/basicprogramming2","section":"2.2f","topic":"Sorting, Easier","hint":"a nice problem about basic sorting applications","dacu":189,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"height","title":"height","url":"https://open.kattis.com/problems/height","section":"2.2f","topic":"Sorting, Easier","hint":"insertion sort simulation","dacu":899,"points":2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0217","title":"Contains Duplicate","url":"https://leetcode.com/problems/contains-duplicate/","section":"2.2f","topic":"Sorting, Easier","hint":"sort; check adjacent integers","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc1657","title":"Determine if Two Strings Are Close","url":"https://leetcode.com/problems/determine-if-two-strings-are-close/","section":"2.2f","topic":"Sorting, Easier","hint":"check if set of chars and its sorted frequency signatures are the same; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"mjehuric","title":"mjehuric","url":"https://open.kattis.com/problems/mjehuric","section":"2.2f","topic":"Sorting, Easier","hint":"a direct simulation of a bubble sort algorithm","dacu":1349,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"sidewayssorting","title":"sidewayssorting","url":"https://open.kattis.com/problems/sidewayssorting","section":"2.2f","topic":"Sorting, Easier","hint":"stable_sort or sort multi-fields of columns of a 2D array; ignore case","dacu":857,"points":2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0219","title":"Contains Duplicate II","url":"https://leetcode.com/problems/contains-duplicate-ii/","section":"2.2g","topic":"Sorting, Simple Greedy","hint":"sort (keep the original indices as pair (v, i)); check successive elements; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1502","title":"Can Make Arithmetic Progression From Sequence","url":"https://leetcode.com/problems/can-make-arithmetic-progression-from-sequence/","section":"2.2g","topic":"Sorting, Simple Greedy","hint":"sort; check gap of successive elements; programming-skills","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc1637","title":"Widest Vertical Area Between Two Points Containing No Points","url":"https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/","section":"2.2g","topic":"Sorting, Simple Greedy","hint":"sort; remove duplicate x-s; check successive elements","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1984","title":"Minimum Difference Between Highest and Lowest of K Scores","url":"https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/","section":"2.2g","topic":"Sorting, Simple Greedy","hint":"sort; check elements that are k indices apart","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2342","title":"Max Sum of a Pair With Equal Sum of Digits","url":"https://leetcode.com/problems/max-sum-of-a-pair-with-equal-sum-of-digits/","section":"2.2g","topic":"Sorting, Simple Greedy","hint":"sum-of-digits function; sort by (sod(n), n); check successive elements","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2465","title":"Number of Distinct Averages","url":"https://leetcode.com/problems/number-of-distinct-averages/","section":"2.2g","topic":"Sorting, Simple Greedy","hint":"sort; two pointers: smallest and largest","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2500","title":"Delete Greatest Value in Each Row","url":"https://leetcode.com/problems/delete-greatest-value-in-each-row/","section":"2.2g","topic":"Sorting, Simple Greedy","hint":"sort each row; process per column","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"01610","title":null,"url":"https://onlinejudge.org/external/16/1610.pdf","section":"2.2h","topic":"Sorting, Harder","hint":"LA 6196 - MidAtlanticUSA12; median","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11321","title":null,"url":"https://onlinejudge.org/external/113/11321.pdf","section":"2.2h","topic":"Sorting, Harder","hint":"be careful with negative mod!","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"classy","title":"classy","url":"https://open.kattis.com/problems/classy","section":"2.2h","topic":"Sorting, Harder","hint":"sort using modified comparison function; a bit of string parsing/tokenization","dacu":1633,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"dyslectionary","title":"dyslectionary","url":"https://open.kattis.com/problems/dyslectionary","section":"2.2h","topic":"Sorting, Harder","hint":"sort the reverse of original string; output formatting","dacu":775,"points":3.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0001","title":"Two Sum","url":"https://leetcode.com/problems/two-sum/","section":"2.2h","topic":"Sorting, Harder","hint":"classic; O(n log n) solution: sort + two pointers; or hashing; top-100-liked; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"musicyourway","title":"musicyourway","url":"https://open.kattis.com/problems/musicyourway","section":"2.2h","topic":"Sorting, Harder","hint":"stable_sort; custom comparison function","dacu":404,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"sortofsorting","title":"sortofsorting","url":"https://open.kattis.com/problems/sortofsorting","section":"2.2h","topic":"Sorting, Harder","hint":"stable_sort or sort multi-fields","dacu":2667,"points":2.2,"cp5":false,"solved":false},{"judge":"UVa","id":"11462","title":null,"url":"https://onlinejudge.org/external/114/11462.pdf","section":"2.2i","topic":"Special Sorting","hint":"standard Counting Sort problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11495","title":null,"url":"https://onlinejudge.org/external/114/11495.pdf","section":"2.2i","topic":"Special Sorting","hint":"requires O(n log n) merge sort","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13212","title":null,"url":"https://onlinejudge.org/external/132/13212.pdf","section":"2.2i","topic":"Special Sorting","hint":"requires O(n log n) merge sort","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bread","title":"bread","url":"https://open.kattis.com/problems/bread","section":"2.2i","topic":"Special Sorting","hint":"inversion count; hard to derive","dacu":249,"points":5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1122","title":"Relative Sort Array","url":"https://leetcode.com/problems/relative-sort-array/","section":"2.2i","topic":"Special Sorting","hint":"counting sort variant using arr2 order","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"mali","title":"mali","url":"https://open.kattis.com/problems/mali","section":"2.2i","topic":"Special Sorting","hint":"Counting Sort two arrays; greedy matching largest+smallest at that point","dacu":97,"points":5.1,"cp5":false,"solved":false},{"judge":"UVa","id":"12571","title":null,"url":"https://onlinejudge.org/external/125/12571.pdf","section":"2.2j","topic":"Bit Manipulation","hint":"precalculate AND operations","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12720","title":null,"url":"https://onlinejudge.org/external/127/12720.pdf","section":"2.2j","topic":"Bit Manipulation","hint":"observe the pattern in this binary to decimal conversion variant; involves modulo arithmetic","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bitbybit","title":"bitbybit","url":"https://open.kattis.com/problems/bitbybit","section":"2.2j","topic":"Bit Manipulation","hint":"be very careful with and + or corner cases","dacu":955,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"deathstar","title":"deathstar","url":"https://open.kattis.com/problems/deathstar","section":"2.2j","topic":"Bit Manipulation","hint":"can be solved with bit manipulation","dacu":415,"points":2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0338","title":"Counting Bits","url":"https://leetcode.com/problems/counting-bits/","section":"2.2j","topic":"Bit Manipulation","hint":"bit_count; trivial; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1318","title":"Minimum Flips to Make a OR b Equal to c","url":"https://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/","section":"2.2j","topic":"Bit Manipulation","hint":"check all 31 bits; a few sub-cases per bit; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"snapperhard","title":"snapperhard","url":"https://open.kattis.com/problems/snapperhard","section":"2.2j","topic":"Bit Manipulation","hint":"bit manipulation; find the pattern; the easier version is also available at Kattis - snappereasy","dacu":501,"points":2.3,"cp5":false,"solved":false},{"judge":"UVa","id":"10523","title":null,"url":"https://onlinejudge.org/external/105/10523.pdf","section":"2.2k","topic":"Big Integer, Easier","hint":"BigInteger addition; multiplication; and power","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10925","title":null,"url":"https://onlinejudge.org/external/109/10925.pdf","section":"2.2k","topic":"Big Integer, Easier","hint":"BigInteger addition and division","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11879","title":null,"url":"https://onlinejudge.org/external/118/11879.pdf","section":"2.2k","topic":"Big Integer, Easier","hint":"BigInteger: mod; divide; subtract; equals","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0043","title":"Multiply Strings","url":"https://leetcode.com/problems/multiply-strings/","section":"2.2k","topic":"Big Integer, Easier","hint":"basic Big Integer multiplication; programming-skills","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"primaryarithmetic","title":"primaryarithmetic","url":"https://open.kattis.com/problems/primaryarithmetic","section":"2.2k","topic":"Big Integer, Easier","hint":"not a Big Integer problem but a simulation of basic addition","dacu":399,"points":2.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"simpleaddition","title":"simpleaddition","url":"https://open.kattis.com/problems/simpleaddition","section":"2.2k","topic":"Big Integer, Easier","hint":"that A+B on BigInteger question","dacu":1913,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"wizardofodds","title":"wizardofodds","url":"https://open.kattis.com/problems/wizardofodds","section":"2.2k","topic":"Big Integer, Easier","hint":"if K is bigger than 350, the answer is clear; else just check if 2^K ≥ N","dacu":488,"points":2.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2259","title":"Remove Digit From Number to Maximize Result","url":"https://leetcode.com/problems/remove-digit-from-number-to-maximize-result/","section":"2.2l","topic":"Big Integer, Harder","hint":"we can use Big Integer technique to solve this","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"01062","title":null,"url":"https://onlinejudge.org/external/10/1062.pdf","section":"2.2m","topic":"Stack","hint":"LA 3752 - WorldFinals Tokyo07; simulation with stack; maximum answer is 26 stacks; O(n) solution exists","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13055","title":null,"url":"https://onlinejudge.org/external/130/13055.pdf","section":"2.2m","topic":"Stack","hint":"nice problem about stack","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"evenup","title":"evenup","url":"https://open.kattis.com/problems/evenup","section":"2.2m","topic":"Stack","hint":"use stack to solve this problem","dacu":1273,"points":2.7,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc0394","title":"Decode String","url":"https://leetcode.com/problems/decode-string/","section":"2.2m","topic":"Stack","hint":"stack simulation; leetcode-75; top-100-liked","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"pairingsocks","title":"pairingsocks","url":"https://open.kattis.com/problems/pairingsocks","section":"2.2m","topic":"Stack","hint":"simulation using two stacks; just do as asked","dacu":556,"points":3,"cp5":false,"solved":true},{"judge":"Kattis","id":"restaurant","title":"restaurant","url":"https://open.kattis.com/problems/restaurant","section":"2.2m","topic":"Stack","hint":"simulation with stack-based concept; drop plates at stack 2 (LIFO); use move 2-$gt;1 to reverse order; take from stack 1...","dacu":364,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"throwns","title":"throwns","url":"https://open.kattis.com/problems/throwns","section":"2.2m","topic":"Stack","hint":"use stack of egg positions to help with the undo operation; be careful of corner cases involving modulo operation","dacu":1091,"points":2.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00551","title":null,"url":"https://onlinejudge.org/external/5/551.pdf","section":"2.2n","topic":"Stack-based Problems","hint":"bracket matching; use stack","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00727","title":null,"url":"https://onlinejudge.org/external/7/727.pdf","section":"2.2n","topic":"Stack-based Problems","hint":"Infix to Postfix conversion problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11111","title":null,"url":"https://onlinejudge.org/external/111/11111.pdf","section":"2.2n","topic":"Stack-based Problems","hint":"bracket matching with twists","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bungeebuilder","title":"bungeebuilder","url":"https://open.kattis.com/problems/bungeebuilder","section":"2.2n","topic":"Stack-based Problems","hint":"clever usage of stack; linear pass; bracket (mountain) matching variant","dacu":83,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"circuitmath","title":"circuitmath","url":"https://open.kattis.com/problems/circuitmath","section":"2.2n","topic":"Stack-based Problems","hint":"postfix calculator problem","dacu":918,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"delimitersoup","title":"delimitersoup","url":"https://open.kattis.com/problems/delimitersoup","section":"2.2n","topic":"Stack-based Problems","hint":"bracket matching; stack","dacu":382,"points":1.9,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0901","title":"Online Stock Span","url":"https://leetcode.com/problems/online-stock-span/","section":"2.2n","topic":"Stack-based Problems","hint":"process left-to-right (each day); monotonic non-increasing stack (price, days_increasing); leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"11988","title":null,"url":"https://onlinejudge.org/external/119/11988.pdf","section":"2.2o","topic":"List/Queue/Deque","hint":"rare linked list problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12108","title":null,"url":"https://onlinejudge.org/external/121/12108.pdf","section":"2.2o","topic":"List/Queue/Deque","hint":"simulation with N queues","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"integerlists","title":"integerlists","url":"https://open.kattis.com/problems/integerlists","section":"2.2o","topic":"List/Queue/Deque","hint":"use deque for fast deletion from front (normal) & back (reversed list); use stack to reverse the final list if it is...","dacu":882,"points":4.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"joinstrings","title":"joinstrings","url":"https://open.kattis.com/problems/joinstrings","section":"2.2o","topic":"List/Queue/Deque","hint":"all '+' operations must be O(1)","dacu":959,"points":4.1,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0232","title":"Implement Queue using Stacks","url":"https://leetcode.com/problems/implement-queue-using-stacks/","section":"2.2o","topic":"List/Queue/Deque","hint":"the interesting implementation of queue with two stacks: in-stack and out-stack","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"sim","title":"sim","url":"https://open.kattis.com/problems/sim","section":"2.2o","topic":"List/Queue/Deque","hint":"use list and its iterator","dacu":99,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"teque","title":"teque","url":"https://open.kattis.com/problems/teque","section":"2.2o","topic":"List/Queue/Deque","hint":"all operations must be O(1)","dacu":766,"points":3.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0011","title":"Container With Most Water","url":"https://leetcode.com/problems/container-with-most-water/","section":"2.2p","topic":"1D Array, Two Pointers","hint":"two pointers, l=0, r=n-1; we can always move the shorter pointer inside; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0167","title":"Two Sum II - Input Array Is Sorted","url":"https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/","section":"2.2p","topic":"1D Array, Two Pointers","hint":"two pointers: leftmost and rightmost; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0283","title":"Move Zeroes","url":"https://leetcode.com/problems/move-zeroes/","section":"2.2p","topic":"1D Array, Two Pointers","hint":"two pointers: leftmost zero and cur; programming-skills; leetcode-75; top-100-liked","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0392","title":"Is Subsequence","url":"https://leetcode.com/problems/is-subsequence/","section":"2.2p","topic":"1D Array, Two Pointers","hint":"variant of merge of Merge sort; leetcode-75; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc1768","title":"Merge Strings Alternately","url":"https://leetcode.com/problems/merge-strings-alternately/","section":"2.2p","topic":"1D Array, Two Pointers","hint":"variant of merge of Merge sort; programming-skills; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"UVa","id":"00261","title":null,"url":"https://onlinejudge.org/external/2/261.pdf","section":"2.2q","topic":"Sliding Window","hint":"sliding window variant","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01121","title":null,"url":"https://onlinejudge.org/external/11/1121.pdf","section":"2.2q","topic":"Sliding Window","hint":"LA 2678 - SouthEasternEurope06; sliding window variant","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11536","title":null,"url":"https://onlinejudge.org/external/115/11536.pdf","section":"2.2q","topic":"Sliding Window","hint":"sliding window variant","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0003","title":"Longest Substring Without Repeating Characters","url":"https://leetcode.com/problems/longest-substring-without-repeating-characters/","section":"2.2q","topic":"Sliding Window","hint":"increase char freq when extending; reduce window size if duplicate is seen; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0643","title":"Maximum Average Subarray I","url":"https://leetcode.com/problems/maximum-average-subarray-i/","section":"2.2q","topic":"Sliding Window","hint":"slide the window of size k; keep the max; divide by k; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"sound","title":"sound","url":"https://open.kattis.com/problems/sound","section":"2.2q","topic":"Sliding Window","hint":"sliding window variant 4; max and min; similar to Kattis - treeshopping","dacu":104,"points":5.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"subseqhard","title":"subseqhard","url":"https://open.kattis.com/problems/subseqhard","section":"2.2q","topic":"Sliding Window","hint":"interesting sliding window variant","dacu":1119,"points":3.9,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0002","title":"Add Two Numbers","url":"https://leetcode.com/problems/add-two-numbers/","section":"2.2r","topic":"Linked List Exercises","hint":"simple problem but in reverse SLL mode; programming-skills; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0021","title":"Merge Two Sorted Lists","url":"https://leetcode.com/problems/merge-two-sorted-lists/","section":"2.2r","topic":"Linked List Exercises","hint":"merge of merge sort in linked list way; programming-skills; top-100-liked; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0206","title":"Reverse Linked List","url":"https://leetcode.com/problems/reverse-linked-list/","section":"2.2r","topic":"Linked List Exercises","hint":"classic SLL reversal task; programming-skills; leetcode-75; top-100-liked","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0445","title":"Add Two Numbers II","url":"https://leetcode.com/problems/add-two-numbers-ii/","section":"2.2r","topic":"Linked List Exercises","hint":"like LC0002; but need to use two stacks; programming-skills","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2095","title":"Delete the Middle Node of a Linked List","url":"https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/","section":"2.2r","topic":"Linked List Exercises","hint":"first pass to count n; second pass to go to the middle vertex and to skip it; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2130","title":"Maximum Twin Sum of a Linked List","url":"https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/","section":"2.2r","topic":"Linked List Exercises","hint":"use recursion; as it unwinds, sum the values of leftmost and rightmost pointers; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"01203","title":null,"url":"https://onlinejudge.org/external/12/1203.pdf","section":"2.3a","topic":"Priority Queue","hint":"LA 3135 - Beijing04; use priority_queue","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11997","title":null,"url":"https://onlinejudge.org/external/119/11997.pdf","section":"2.3a","topic":"Priority Queue","hint":"sort the lists; merge two sorted lists using priority_queue to keep the K-th smallest sum every time","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"jugglingpatterns","title":"jugglingpatterns","url":"https://open.kattis.com/problems/jugglingpatterns","section":"2.3a","topic":"Priority Queue","hint":"PQ simulation; reading comprehension","dacu":48,"points":6.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"knigsoftheforest","title":"knigsoftheforest","url":"https://open.kattis.com/problems/knigsoftheforest","section":"2.3a","topic":"Priority Queue","hint":"PQ simulation after sorting the entries by year","dacu":184,"points":3.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2462","title":"Total Cost to Hire K Workers","url":"https://leetcode.com/problems/total-cost-to-hire-k-workers/","section":"2.3a","topic":"Priority Queue","hint":"min PQ simulation; two pointers: i=0 and j=n-1; move inwards; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"numbertree","title":"numbertree","url":"https://open.kattis.com/problems/numbertree","section":"2.3a","topic":"Priority Queue","hint":"not a direct priority queue problem, but the indexing strategy is similar to binary heap indexing","dacu":1760,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"stockprices","title":"stockprices","url":"https://open.kattis.com/problems/stockprices","section":"2.3a","topic":"Priority Queue","hint":"PQ simulation; both max and min PQ","dacu":109,"points":3.7,"cp5":false,"solved":false},{"judge":"UVa","id":"00499","title":null,"url":"https://onlinejudge.org/external/4/499.pdf","section":"2.3b","topic":"DAT, ASCII","hint":"ASCII keys","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11340","title":null,"url":"https://onlinejudge.org/external/113/11340.pdf","section":"2.3b","topic":"DAT, ASCII","hint":"ASCII keys","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"UVa","id":"11577","title":null,"url":"https://onlinejudge.org/external/115/11577.pdf","section":"2.3b","topic":"DAT, ASCII","hint":"A-Z keys","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"alphabetspam","title":"alphabetspam","url":"https://open.kattis.com/problems/alphabetspam","section":"2.3b","topic":"DAT, ASCII","hint":"count the frequencies of lowercase, uppercase, and whitespace characters","dacu":3902,"points":1.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0389","title":"Find the Difference","url":"https://leetcode.com/problems/find-the-difference/","section":"2.3b","topic":"DAT, ASCII","hint":"DAT ('a'..'z'); programming-skills","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"quickbrownfox","title":"quickbrownfox","url":"https://open.kattis.com/problems/quickbrownfox","section":"2.3b","topic":"DAT, ASCII","hint":"pangram; frequency counting of 26 alphabets","dacu":4433,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"soundex","title":"soundex","url":"https://open.kattis.com/problems/soundex","section":"2.3b","topic":"DAT, ASCII","hint":"DAT for soundex A-Z code mapping; also available at UVa 10260 - Soundex","dacu":106,"points":2.9,"cp5":true,"solved":false},{"judge":"UVa","id":"01368","title":null,"url":"https://onlinejudge.org/external/13/1368.pdf","section":"2.3c","topic":"DAT, Others","hint":"for each column j, find the highest frequency character among all j-th column of all m DNA strings","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11203","title":null,"url":"https://onlinejudge.org/external/112/11203.pdf","section":"2.3c","topic":"DAT, Others","hint":"count frequency of x/y/z","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bookingaroom","title":"bookingaroom","url":"https://open.kattis.com/problems/bookingaroom","section":"2.3c","topic":"DAT, Others","hint":"only 100 rooms; use 1D Boolean array","dacu":2849,"points":1.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"busnumbers","title":"busnumbers","url":"https://open.kattis.com/problems/busnumbers","section":"2.3c","topic":"DAT, Others","hint":"only 1000 bus numbers; use 1D Boolean array","dacu":2776,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"freefood","title":"freefood","url":"https://open.kattis.com/problems/freefood","section":"2.3c","topic":"DAT, Others","hint":"only 365 days in a year","dacu":1965,"points":1.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0645","title":"Set Mismatch","url":"https://leetcode.com/problems/set-mismatch/","section":"2.3c","topic":"DAT, Others","hint":"DAT [1..10000]; find key with freq 2 (repeated) and 0 (missing)","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"princesspeach","title":"princesspeach","url":"https://open.kattis.com/problems/princesspeach","section":"2.3c","topic":"DAT, Others","hint":"DAT; linear pass","dacu":839,"points":2.1,"cp5":false,"solved":true},{"judge":"UVa","id":"12049","title":null,"url":"https://onlinejudge.org/external/120/12049.pdf","section":"2.3d","topic":"Hash Table (set), E","hint":"unordered_multiset manipulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13148","title":null,"url":"https://onlinejudge.org/external/131/13148.pdf","section":"2.3d","topic":"Hash Table (set), E","hint":"we can store all precomputed answers - which are given - into unordered_set","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cd","title":"cd","url":"https://open.kattis.com/problems/cd","section":"2.3d","topic":"Hash Table (set), E","hint":"unordered_set is faster than set here; or use modified merge as the input is sorted; also available at UVa 11849 - CD","dacu":3176,"points":5.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"esej","title":"esej","url":"https://open.kattis.com/problems/esej","section":"2.3d","topic":"Hash Table (set), E","hint":"use unordered_set to prevent duplicate","dacu":509,"points":3.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2215","title":"Find the Difference of Two Arrays","url":"https://leetcode.com/problems/find-the-difference-of-two-arrays/","section":"2.3d","topic":"Hash Table (set), E","hint":"use set for fast tests; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"shiritori","title":"shiritori","url":"https://open.kattis.com/problems/shiritori","section":"2.3d","topic":"Hash Table (set), E","hint":"linear pass; use unordered_set to keep track of words that have been called","dacu":295,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"greetingcard","title":"greetingcard","url":"https://open.kattis.com/problems/greetingcard","section":"2.3e","topic":"Hash Table (set), H","hint":"use unordered_set; only 12 neighbors","dacu":607,"points":4.9,"cp5":false,"solved":false},{"judge":"UVa","id":"11348","title":null,"url":"https://onlinejudge.org/external/113/11348.pdf","section":"2.3f","topic":"Hash Table (map), E","hint":"use map and set to check uniqueness","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11629","title":null,"url":"https://onlinejudge.org/external/116/11629.pdf","section":"2.3f","topic":"Hash Table (map), E","hint":"use map","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"competitivearcadebasketball","title":"competitivearcadebasketball","url":"https://open.kattis.com/problems/competitivearcadebasketball","section":"2.3f","topic":"Hash Table (map), E","hint":"use unordered_map","dacu":209,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"conformity","title":"conformity","url":"https://open.kattis.com/problems/conformity","section":"2.3f","topic":"Hash Table (map), E","hint":"use unordered_map to count frequencies of the sorted permutations of 5 ids; also available at UVa 11286 - Conformity","dacu":1100,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"grandpabernie","title":"grandpabernie","url":"https://open.kattis.com/problems/grandpabernie","section":"2.3f","topic":"Hash Table (map), E","hint":"use unordered_map plus (sorted) vector","dacu":1065,"points":3.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1679","title":"Max Number of K-Sum Pairs","url":"https://leetcode.com/problems/max-number-of-k-sum-pairs/","section":"2.3f","topic":"Hash Table (map), E","hint":"frequency Counter; pairings; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"recount","title":"recount","url":"https://open.kattis.com/problems/recount","section":"2.3f","topic":"Hash Table (map), E","hint":"use map; frequency counting","dacu":1163,"points":2,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc0347","title":"Top K Frequent Elements","url":"https://leetcode.com/problems/top-k-frequent-elements/","section":"2.3g","topic":"Hash Table (Counter)","hint":"use Counter to count frequency; sort by frequencies; top k; top-100-liked","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"UVa","id":"10145","title":null,"url":"https://onlinejudge.org/external/101/10145.pdf","section":"2.3h","topic":"Hash Table (map), H","hint":"use map and set","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11860","title":null,"url":"https://onlinejudge.org/external/118/11860.pdf","section":"2.3h","topic":"Hash Table (map), H","hint":"use set and map; linear scan","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"addingwords","title":"addingwords","url":"https://open.kattis.com/problems/addingwords","section":"2.3h","topic":"Hash Table (map), H","hint":"use unordered_map","dacu":1880,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"awkwardparty","title":"awkwardparty","url":"https://open.kattis.com/problems/awkwardparty","section":"2.3h","topic":"Hash Table (map), H","hint":"use unordered_map to running max and running min; report the largest difference","dacu":611,"points":3,"cp5":false,"solved":false},{"judge":"Kattis","id":"basicinterpreter","title":"basicinterpreter","url":"https://open.kattis.com/problems/basicinterpreter","section":"2.3h","topic":"Hash Table (map), H","hint":"the harder version of Kattis - variablearithmetic; tedious; be careful; print string inside double quotes verbatim","dacu":152,"points":6.7,"cp5":false,"solved":false},{"judge":"UVa","id":"10815","title":null,"url":"https://onlinejudge.org/external/108/10815.pdf","section":"2.3i","topic":"Balanced BST (set)","hint":"use set and string","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11136","title":null,"url":"https://onlinejudge.org/external/111/11136.pdf","section":"2.3i","topic":"Balanced BST (set)","hint":"use multiset","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13037","title":null,"url":"https://onlinejudge.org/external/130/13037.pdf","section":"2.3i","topic":"Balanced BST (set)","hint":"we can use set or a sorted array","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bst","title":"bst","url":"https://open.kattis.com/problems/bst","section":"2.3i","topic":"Balanced BST (set)","hint":"simulate special BST [1..N] insertions using set","dacu":449,"points":7.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"candydivision","title":"candydivision","url":"https://open.kattis.com/problems/candydivision","section":"2.3i","topic":"Balanced BST (set)","hint":"complete search from 1 to sqrt(N); insert all divisors into set for automatic sorting and elimination of duplicates","dacu":702,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"compoundwords","title":"compoundwords","url":"https://open.kattis.com/problems/compoundwords","section":"2.3i","topic":"Balanced BST (set)","hint":"use set extensively; iterator","dacu":1807,"points":1.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0056","title":"Merge Intervals","url":"https://leetcode.com/problems/merge-intervals/","section":"2.3i","topic":"Balanced BST (set)","hint":"maintain set of intervals using bBST (set); do quick merging of intervals; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"UVa","id":"10138","title":null,"url":"https://onlinejudge.org/external/101/10138.pdf","section":"2.3j","topic":"Balanced BST (map)","hint":"map plates to bills; entrance time; and position","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11308","title":null,"url":"https://onlinejudge.org/external/113/11308.pdf","section":"2.3j","topic":"Balanced BST (map)","hint":"use map and set","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12504","title":null,"url":"https://onlinejudge.org/external/125/12504.pdf","section":"2.3j","topic":"Balanced BST (map)","hint":"use map; string to string","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"administrativeproblems","title":"administrativeproblems","url":"https://open.kattis.com/problems/administrativeproblems","section":"2.3j","topic":"Balanced BST (map)","hint":"use several maps as the output (of spy names) has to be sorted; be careful of corner cases","dacu":194,"points":6.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"doctorkattis","title":"doctorkattis","url":"https://open.kattis.com/problems/doctorkattis","section":"2.3j","topic":"Balanced BST (map)","hint":"Max Priority Queue with frequent (increaseKey) updates; use map","dacu":114,"points":4.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"kattissquest","title":"kattissquest","url":"https://open.kattis.com/problems/kattissquest","section":"2.3j","topic":"Balanced BST (map)","hint":"use map of priority queues; other solutions exist","dacu":834,"points":3.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"srednji","title":"srednji","url":"https://open.kattis.com/problems/srednji","section":"2.3j","topic":"Balanced BST (map)","hint":"go left and right of B; use fast data structure like map to help determine the result fast","dacu":164,"points":4.1,"cp5":false,"solved":false},{"judge":"UVa","id":"10909","title":null,"url":"https://onlinejudge.org/external/109/10909.pdf","section":"2.3k","topic":"Order Statistics Tree","hint":"involves dynamic selection; use pb\\_ds, Fenwick Tree, or augment balanced BST","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"babynames","title":"babynames","url":"https://open.kattis.com/problems/babynames","section":"2.3k","topic":"Order Statistics Tree","hint":"dynamic rank problem; use two pb_ds","dacu":87,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"continuousmedian","title":"continuousmedian","url":"https://open.kattis.com/problems/continuousmedian","section":"2.3k","topic":"Order Statistics Tree","hint":"dynamic selection problem; specifically the median values; pb_ds helps","dacu":140,"points":3.9,"cp5":false,"solved":true},{"judge":"Kattis","id":"cookieselection","title":"cookieselection","url":"https://open.kattis.com/problems/cookieselection","section":"2.3k","topic":"Order Statistics Tree","hint":"map large integers to up to 600K integers; use pb_ds or Fenwick Tree and the select(median) operation of Fenwick Tree","dacu":923,"points":4.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"gcpc","title":"gcpc","url":"https://open.kattis.com/problems/gcpc","section":"2.3k","topic":"Order Statistics Tree","hint":"dynamic rank problem; pb_ds helps","dacu":876,"points":5.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0100","title":"Same Tree","url":"https://leetcode.com/problems/same-tree/","section":"2.3l","topic":"BT Exercises, E","hint":"recursive check; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0104","title":"Maximum Depth of Binary Tree","url":"https://leetcode.com/problems/maximum-depth-of-binary-tree/","section":"2.3l","topic":"BT Exercises, E","hint":"recursive height check; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0236","title":"Lowest Common Ancestor of a Binary Tree","url":"https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/","section":"2.3l","topic":"BT Exercises, E","hint":"find the first vertex using postorder where both p and q are seen; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0437","title":"Path Sum III","url":"https://leetcode.com/problems/path-sum-iii/","section":"2.3l","topic":"BT Exercises, E","hint":"for each vertex, run preorder traversal; check if the path sum equals to target; leetcode-75; top-100-liked","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0872","title":"Leaf-Similar Trees","url":"https://leetcode.com/problems/leaf-similar-trees/","section":"2.3l","topic":"BT Exercises, E","hint":"run inorder traversals on both trees; picking only the leaves; compare them; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1372","title":"Longest ZigZag Path in a Binary Tree","url":"https://leetcode.com/problems/longest-zigzag-path-in-a-binary-tree/","section":"2.3l","topic":"BT Exercises, E","hint":"modified preorder traversal; reset counter if same direction; add counter if zig-zag-ing; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1448","title":"Count Good Nodes in Binary Tree","url":"https://leetcode.com/problems/count-good-nodes-in-binary-tree/","section":"2.3l","topic":"BT Exercises, E","hint":"modified preorder traversal; keep the largest along the way; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0098","title":"Validate Binary Search Tree","url":"https://leetcode.com/problems/validate-binary-search-tree/","section":"2.3n","topic":"BST Exercises","hint":"recursive BST property validator; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0230","title":"Kth Smallest Element in a BST","url":"https://leetcode.com/problems/kth-smallest-element-in-a-bst/","section":"2.3n","topic":"BST Exercises","hint":"inorder traversal; report the k-th element; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0450","title":"Delete Node in a BST","url":"https://leetcode.com/problems/delete-node-in-a-bst/","section":"2.3n","topic":"BST Exercises","hint":"code BST deletion sub-cases; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0530","title":"Minimum Absolute Difference in BST","url":"https://leetcode.com/problems/minimum-absolute-difference-in-bst/","section":"2.3n","topic":"BST Exercises","hint":"the min gap is between successive elements during inorder traversal; same as LC 0783; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0700","title":"Search in a Binary Search Tree","url":"https://leetcode.com/problems/search-in-a-binary-search-tree/","section":"2.3n","topic":"BST Exercises","hint":"the classic BST search process; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0897","title":"Increasing Order Search Tree","url":"https://leetcode.com/problems/increasing-order-search-tree/","section":"2.3n","topic":"BST Exercises","hint":"create new skewed BST using inorder traversal of original BST","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0938","title":"Range Sum of BST","url":"https://leetcode.com/problems/range-sum-of-bst/","section":"2.3n","topic":"BST Exercises","hint":"customize inorder traversal of BST","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"UVa","id":"00599","title":null,"url":"https://onlinejudge.org/external/5/599.pdf","section":"2.4a","topic":"Graph Data Structures","hint":"V-E = number of CCs; use a bitset of size 26 to count the number of vertices that have some edge","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11550","title":null,"url":"https://onlinejudge.org/external/115/11550.pdf","section":"2.4a","topic":"Graph Data Structures","hint":"graph representation; incidence matrix","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11991","title":null,"url":"https://onlinejudge.org/external/119/11991.pdf","section":"2.4a","topic":"Graph Data Structures","hint":"Adjacency List","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"Kattis","id":"abinitio","title":"abinitio","url":"https://open.kattis.com/problems/abinitio","section":"2.4a","topic":"Graph Data Structures","hint":"combo: EL input, AM as working graph DS, AL output (in hash format); all operations must be O(V) or better","dacu":104,"points":7.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"chopwood","title":"chopwood","url":"https://open.kattis.com/problems/chopwood","section":"2.4a","topic":"Graph Data Structures","hint":"Prüfer sequence; use priority_queue","dacu":258,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"traveltheskies","title":"traveltheskies","url":"https://open.kattis.com/problems/traveltheskies","section":"2.4a","topic":"Graph Data Structures","hint":"(graph) DS manipulation; an array of ALs (one per each day); simulate the number of people day by day","dacu":188,"points":3.2,"cp5":false,"solved":false},{"judge":"UVa","id":"01197","title":null,"url":"https://onlinejudge.org/external/11/1197.pdf","section":"2.4b","topic":"Union-Find","hint":"LA 2817 - Kaohsiung03; Connected Components","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01329","title":null,"url":"https://onlinejudge.org/external/13/1329.pdf","section":"2.4b","topic":"Union-Find","hint":"LA 3027 - SouthEasternEurope04; interesting UFDS variant; modify the union and find routine","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10608","title":null,"url":"https://onlinejudge.org/external/106/10608.pdf","section":"2.4b","topic":"Union-Find","hint":"find the set with the largest element","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10685","title":null,"url":"https://onlinejudge.org/external/106/10685.pdf","section":"2.4b","topic":"Union-Find","hint":"find the set with the largest element","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"almostunionfind","title":"almostunionfind","url":"https://open.kattis.com/problems/almostunionfind","section":"2.4b","topic":"Union-Find","hint":"new operation: move; idea: do not destroy the parent array structure; also available at UVa 11987 - Almost Union-Find","dacu":618,"points":7,"cp5":false,"solved":false},{"judge":"Kattis","id":"control","title":"control","url":"https://open.kattis.com/problems/control","section":"2.4b","topic":"Union-Find","hint":"LA 7480 - Singapore15; simulation of UFDS; size of set; number of disjoint sets","dacu":424,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"ladice","title":"ladice","url":"https://open.kattis.com/problems/ladice","section":"2.4b","topic":"Union-Find","hint":"size of set; decrement one per usage","dacu":615,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"unionfind","title":"unionfind","url":"https://open.kattis.com/problems/unionfind","section":"2.4b","topic":"Union-Find","hint":"basic UFDS; similar to UVa 00793","dacu":1086,"points":4.8,"cp5":false,"solved":true},{"judge":"UVa","id":"11402","title":null,"url":"https://onlinejudge.org/external/114/11402.pdf","section":"2.4c","topic":"Tree-related DS","hint":"Segment Tree with lazy updates","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11423","title":null,"url":"https://onlinejudge.org/external/114/11423.pdf","section":"2.4c","topic":"Tree-related DS","hint":"clever usage of Fenwick Tree and large array; important hint: look at the constraints carefully","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12299","title":null,"url":"https://onlinejudge.org/external/122/12299.pdf","section":"2.4c","topic":"Tree-related DS","hint":"Segment Tree with a few point (not range) updates; RMQs","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"fenwick","title":"fenwick","url":"https://open.kattis.com/problems/fenwick","section":"2.4c","topic":"Tree-related DS","hint":"basic Fenwick Tree; use long long","dacu":695,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"justforsidekicks","title":"justforsidekicks","url":"https://open.kattis.com/problems/justforsidekicks","section":"2.4c","topic":"Tree-related DS","hint":"use six Fenwick Trees, one for each gem type","dacu":359,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"moviecollection","title":"moviecollection","url":"https://open.kattis.com/problems/moviecollection","section":"2.4c","topic":"Tree-related DS","hint":"LA 5902 - NorthWesternEurope11; not a stack but a dynamic RSQ problem; also available at UVa 01513 - Movie collection","dacu":547,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"supercomputer","title":"supercomputer","url":"https://open.kattis.com/problems/supercomputer","section":"2.4c","topic":"Tree-related DS","hint":"easy problem if we use Fenwick Tree","dacu":760,"points":3.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00750","title":null,"url":"https://onlinejudge.org/external/7/750.pdf","section":"3.2a","topic":"Pre-calculate-able","hint":"classic backtracking problem; only 92 possible 8-queens positions","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10128","title":null,"url":"https://onlinejudge.org/external/101/10128.pdf","section":"3.2a","topic":"Pre-calculate-able","hint":"backtracking with pruning; try all $N!$ permutations that satisfy the requirement; 13! will TLE; pre-calculate the resul...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10276","title":null,"url":"https://onlinejudge.org/external/102/10276.pdf","section":"3.2a","topic":"Pre-calculate-able","hint":"insert a number one by one","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cardtrick2","title":"cardtrick2","url":"https://open.kattis.com/problems/cardtrick2","section":"3.2a","topic":"Pre-calculate-able","hint":"n <= 13, we can simulate the process using queue and precalculate all 13 possible answers","dacu":869,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"foolingaround","title":"foolingaround","url":"https://open.kattis.com/problems/foolingaround","section":"3.2a","topic":"Pre-calculate-able","hint":"there are only 379 different values of N where Bob wins; pre-calculateable","dacu":117,"points":5.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0052","title":"N-Queens II","url":"https://leetcode.com/problems/n-queens-ii/","section":"3.2a","topic":"Pre-calculate-able","hint":"pre-calculate answers for n = 1 to 9; top-interview-150","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"Kattis","id":"sgcoin","title":"sgcoin","url":"https://open.kattis.com/problems/sgcoin","section":"3.2a","topic":"Pre-calculate-able","hint":"we can either brute force short string message; precompute all possible hash values; or come up with O(1) solution","dacu":271,"points":2.4,"cp5":false,"solved":false},{"judge":"UVa","id":"12488","title":null,"url":"https://onlinejudge.org/external/124/12488.pdf","section":"3.2b","topic":"Iterative (Two Loops), E","hint":"2 nested loops; simulate overtaking process","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"blackfriday","title":"blackfriday","url":"https://open.kattis.com/problems/blackfriday","section":"3.2b","topic":"Iterative (Two Loops), E","hint":"2D nested loops; frequency counting","dacu":2384,"points":2.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"closestsums","title":"closestsums","url":"https://open.kattis.com/problems/closestsums","section":"3.2b","topic":"Iterative (Two Loops), E","hint":"sort and then do O(n^2) pairings; also available at UVa 10487 - Closest Sums","dacu":1105,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"golombrulers","title":"golombrulers","url":"https://open.kattis.com/problems/golombrulers","section":"3.2b","topic":"Iterative (Two Loops), E","hint":"2D nested loops; additional 1D loops for checking","dacu":297,"points":3.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc3184","title":"Count Pairs That Form a Complete Day I","url":"https://leetcode.com/problems/count-pairs-that-form-a-complete-day-i/","section":"3.2b","topic":"Iterative (Two Loops), E","hint":"2 nested loops","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"UVa","id":"01588","title":null,"url":"https://onlinejudge.org/external/15/1588.pdf","section":"3.2c","topic":"Iterative (Two Loops), H","hint":"LA 3712 - NorthEasternEurope06; good iterative brute force problem; beware of corner cases","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00441","title":null,"url":"https://onlinejudge.org/external/4/441.pdf","section":"3.2d","topic":"Three+ Nested Loops, E","hint":"6 nested loops; easy","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"UVa","id":"12515","title":null,"url":"https://onlinejudge.org/external/125/12515.pdf","section":"3.2d","topic":"Three+ Nested Loops, E","hint":"3 nested loops","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12844","title":null,"url":"https://onlinejudge.org/external/128/12844.pdf","section":"3.2d","topic":"Three+ Nested Loops, E","hint":"5 nested loops; scaled down version of UVa 10202; do observations first","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cudoviste","title":"cudoviste","url":"https://open.kattis.com/problems/cudoviste","section":"3.2d","topic":"Three+ Nested Loops, E","hint":"4 nested loops; the inner loops is just 2x2; 5 possibilities of crushed cars; skip 2x2 area that contains building","dacu":1194,"points":1.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1790","title":"Check if One String Swap Can Make Strings Equal","url":"https://leetcode.com/problems/check-if-one-string-swap-can-make-strings-equal/","section":"3.2d","topic":"Three+ Nested Loops, E","hint":"3 nested loops","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"npuzzle","title":"npuzzle","url":"https://open.kattis.com/problems/npuzzle","section":"3.2d","topic":"Three+ Nested Loops, E","hint":"4 nested loops; easy","dacu":683,"points":2.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"set","title":"set","url":"https://open.kattis.com/problems/set","section":"3.2d","topic":"Three+ Nested Loops, E","hint":"4 nested loops; easy","dacu":364,"points":1.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00386","title":null,"url":"https://onlinejudge.org/external/3/386.pdf","section":"3.2e","topic":"Three+ Nested Loops, H","hint":"4 nested loops with pruning","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10660","title":null,"url":"https://onlinejudge.org/external/106/10660.pdf","section":"3.2e","topic":"Three+ Nested Loops, H","hint":"7 nested loops; Manhattan distance","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11804","title":null,"url":"https://onlinejudge.org/external/118/11804.pdf","section":"3.2e","topic":"Three+ Nested Loops, H","hint":"5 nested loops","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"calculatingdartscores","title":"calculatingdartscores","url":"https://open.kattis.com/problems/calculatingdartscores","section":"3.2e","topic":"Three+ Nested Loops, H","hint":"6 nested loops but easy; see if a*i +b*j + c*k == n","dacu":752,"points":2.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2352","title":"Equal Row and Column Pairs","url":"https://leetcode.com/problems/equal-row-and-column-pairs/","section":"3.2e","topic":"Three+ Nested Loops, H","hint":"3 nested loops solution is still acceptable; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"lektira","title":"lektira","url":"https://open.kattis.com/problems/lektira","section":"3.2e","topic":"Three+ Nested Loops, H","hint":"2 nested loops to try all 2 cutting points plus 1 more loop to actually do the reversing of sub words","dacu":376,"points":3.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"tautology","title":"tautology","url":"https://open.kattis.com/problems/tautology","section":"3.2e","topic":"Three+ Nested Loops, H","hint":"try all 2^5 = 32 values with pruning; also available at UVa 11108 - Tautology","dacu":160,"points":3.4,"cp5":false,"solved":false},{"judge":"UVa","id":"00234","title":null,"url":"https://onlinejudge.org/external/2/234.pdf","section":"3.2f","topic":"Iterative (Permutation)","hint":"LA 5173 - WorldFinals Phoenix94; use next_permutation; simulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01064","title":null,"url":"https://onlinejudge.org/external/10/1064.pdf","section":"3.2f","topic":"Iterative (Permutation)","hint":"LA 3808 - WorldFinals Tokyo07; permutation of up to 5 messages; simulation; mind the word 'consecutive'","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11742","title":null,"url":"https://onlinejudge.org/external/117/11742.pdf","section":"3.2f","topic":"Iterative (Permutation)","hint":"try all permutations","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"dancerecital","title":"dancerecital","url":"https://open.kattis.com/problems/dancerecital","section":"3.2f","topic":"Iterative (Permutation)","hint":"try all R! permutations; compare adjacent routines","dacu":274,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"dreamer","title":"dreamer","url":"https://open.kattis.com/problems/dreamer","section":"3.2f","topic":"Iterative (Permutation)","hint":"try all 8! permutations of digits; check if the date is valid; output earliest valid date","dacu":406,"points":2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0046","title":"Permutations","url":"https://leetcode.com/problems/permutations/","section":"3.2f","topic":"Iterative (Permutation)","hint":"C++ next_permutation from sorted to reverse-sorted permutations; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"veci","title":"veci","url":"https://open.kattis.com/problems/veci","section":"3.2f","topic":"Iterative (Permutation)","hint":"try all permutations; get the one that is larger than X","dacu":1193,"points":1.8,"cp5":false,"solved":true},{"judge":"UVa","id":"00639","title":null,"url":"https://onlinejudge.org/external/6/639.pdf","section":"3.2g","topic":"Iterative (Combination)","hint":"generate 2^(4x4) = 2^16 combinations and prune","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01047","title":null,"url":"https://onlinejudge.org/external/10/1047.pdf","section":"3.2g","topic":"Iterative (Combination)","hint":"LA 3278 - WorldFinals Shanghai05; try all 2^n subsets of towers to be taken; use inclusion-exclusion principle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12694","title":null,"url":"https://onlinejudge.org/external/126/12694.pdf","section":"3.2g","topic":"Iterative (Combination)","hint":"LA 6606 - Phuket13; it is safest to just brute force all 2^20 possibilities; greedy solution should be possible too","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"geppetto","title":"geppetto","url":"https://open.kattis.com/problems/geppetto","section":"3.2g","topic":"Iterative (Combination)","hint":"try all 2^N subsets of ingredients","dacu":305,"points":3.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0077","title":"Combinations","url":"https://leetcode.com/problems/combinations/","section":"3.2g","topic":"Iterative (Combination)","hint":"standard nCk; use itertools.combinations; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"squaredeal","title":"squaredeal","url":"https://open.kattis.com/problems/squaredeal","section":"3.2g","topic":"Iterative (Combination)","hint":"try all 3! permutations of rectangles and try all 2^3 combinations of rectangle orientations; test figure 1.a and 1.b co...","dacu":232,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"zagrade","title":"zagrade","url":"https://open.kattis.com/problems/zagrade","section":"3.2g","topic":"Iterative (Combination)","hint":"try all subsets of bracket pairs to be removed","dacu":298,"points":3.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00725","title":null,"url":"https://onlinejudge.org/external/7/725.pdf","section":"3.2h","topic":"Try All Answers","hint":"try all possible answers","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10908","title":null,"url":"https://onlinejudge.org/external/109/10908.pdf","section":"3.2h","topic":"Try All Answers","hint":"4 nested loops; try all possible odd square lengths","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"communication","title":"communication","url":"https://open.kattis.com/problems/communication","section":"3.2h","topic":"Try All Answers","hint":"try all possible bytes; apply the bitmask formula","dacu":764,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"flexible","title":"flexible","url":"https://open.kattis.com/problems/flexible","section":"3.2h","topic":"Try All Answers","hint":"try all possible answers","dacu":2354,"points":1.7,"cp5":false,"solved":true},{"judge":"Kattis","id":"islands","title":"islands","url":"https://open.kattis.com/problems/islands","section":"3.2h","topic":"Try All Answers","hint":"try all possible subsets; prune the non-contiguous ones (only 55 valid bitmasks between [0..1023]); check the 'island' p...","dacu":443,"points":2.6,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc2843","title":"Count Symmetric Integers","url":"https://leetcode.com/problems/count-symmetric-integers/","section":"3.2h","topic":"Try All Answers","hint":"create helper function is_symmetric; try all numbers between low..high","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"walls","title":"walls","url":"https://open.kattis.com/problems/walls","section":"3.2h","topic":"Try All Answers","hint":"try whether the answer is 1/2/3/4; or Impossible; use up to 4 nested loops","dacu":513,"points":4,"cp5":false,"solved":false},{"judge":"UVa","id":"01225","title":null,"url":"https://onlinejudge.org/external/12/1225.pdf","section":"3.2i","topic":"Math Simulation, E","hint":"LA 3996 - Danang07; N is small","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10346","title":null,"url":"https://onlinejudge.org/external/103/10346.pdf","section":"3.2i","topic":"Math Simulation, E","hint":"interesting simulation problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"easiest","title":"easiest","url":"https://open.kattis.com/problems/easiest","section":"3.2i","topic":"Math Simulation, E","hint":"complete search; sum of digit","dacu":3991,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"growlinggears","title":"growlinggears","url":"https://open.kattis.com/problems/growlinggears","section":"3.2i","topic":"Math Simulation, E","hint":"physics of parabola; derivation; try all gears","dacu":496,"points":2.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1823","title":"Find the Winner of the Circular Game","url":"https://leetcode.com/problems/find-the-winner-of-the-circular-game/","section":"3.2i","topic":"Math Simulation, E","hint":"use Josephus formula","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2427","title":"Number of Common Factors","url":"https://leetcode.com/problems/number-of-common-factors/","section":"3.2i","topic":"Math Simulation, E","hint":"try all x; a and b are small","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"trollhunt","title":"trollhunt","url":"https://open.kattis.com/problems/trollhunt","section":"3.2i","topic":"Math Simulation, E","hint":"brute force; simple","dacu":976,"points":2.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"videospeedup","title":"videospeedup","url":"https://open.kattis.com/problems/videospeedup","section":"3.2i","topic":"Math Simulation, E","hint":"brute force; simple for loop; do as asked","dacu":298,"points":2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0970","title":"Powerful Integers","url":"https://leetcode.com/problems/powerful-integers/","section":"3.2j","topic":"Math Simulation, M","hint":"the values of x^i or y^j will grow fast; search space is small","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"00616","title":null,"url":"https://onlinejudge.org/external/6/616.pdf","section":"3.2k","topic":"Math Simulation, H","hint":"brute force up to sqrt(n); get pattern","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11130","title":null,"url":"https://onlinejudge.org/external/111/11130.pdf","section":"3.2k","topic":"Math Simulation, H","hint":"mirror the billiard table to the right (and/or top) so that we will only deal with one straight line instead of bouncing...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11254","title":null,"url":"https://onlinejudge.org/external/112/11254.pdf","section":"3.2k","topic":"Math Simulation, H","hint":"use sum of AP; brute force all values of r from sqrt(2n) down to 1; stop at the first valid a","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11490","title":null,"url":"https://onlinejudge.org/external/114/11490.pdf","section":"3.2k","topic":"Math Simulation, H","hint":"let missing_people = 2*a^2; thickness_of_soldiers = b; derive a formula involving a; b; and the given S","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"crackingrsa","title":"crackingrsa","url":"https://open.kattis.com/problems/crackingrsa","section":"3.2k","topic":"Math Simulation, H","hint":"a bit number theory; solvable with complete search","dacu":258,"points":2.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"falling","title":"falling","url":"https://open.kattis.com/problems/falling","section":"3.2k","topic":"Math Simulation, H","hint":"rework the formula; complete search up to sqrt(D)","dacu":588,"points":3.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"thanosthehero","title":"thanosthehero","url":"https://open.kattis.com/problems/thanosthehero","section":"3.2k","topic":"Math Simulation, H","hint":"for-loop from backwards","dacu":320,"points":3.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00151","title":null,"url":"https://onlinejudge.org/external/1/151.pdf","section":"3.2l","topic":"Josephus Problem","hint":"the original Josephus problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01176","title":null,"url":"https://onlinejudge.org/external/11/1176.pdf","section":"3.2l","topic":"Josephus Problem","hint":"LA 2346 - Dhaka01; special case when k = 2; use Josephus recurrence; simulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11351","title":null,"url":"https://onlinejudge.org/external/113/11351.pdf","section":"3.2l","topic":"Josephus Problem","hint":"use general case Josephus recurrence","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"eenymeeny","title":"eenymeeny","url":"https://open.kattis.com/problems/eenymeeny","section":"3.2l","topic":"Josephus Problem","hint":"Josephus problem; small n; just simulate","dacu":492,"points":1.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"musicalchairs","title":"musicalchairs","url":"https://open.kattis.com/problems/musicalchairs","section":"3.2l","topic":"Josephus Problem","hint":"Josephus variant; brute force","dacu":139,"points":4,"cp5":false,"solved":false},{"judge":"Kattis","id":"toys","title":"toys","url":"https://open.kattis.com/problems/toys","section":"3.2l","topic":"Josephus Problem","hint":"use general case Josephus recurrence","dacu":142,"points":4.5,"cp5":false,"solved":false},{"judge":"UVa","id":"10344","title":null,"url":"https://onlinejudge.org/external/103/10344.pdf","section":"3.2m","topic":"Backtracking, Easier","hint":"5 operands + 3 operators","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10576","title":null,"url":"https://onlinejudge.org/external/105/10576.pdf","section":"3.2m","topic":"Backtracking, Easier","hint":"generate all; prune; take max","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12840","title":null,"url":"https://onlinejudge.org/external/128/12840.pdf","section":"3.2m","topic":"Backtracking, Easier","hint":"simple backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"goodmorning","title":"goodmorning","url":"https://open.kattis.com/problems/goodmorning","section":"3.2m","topic":"Backtracking, Easier","hint":"we can use backtracking to generate all possible (small) numbers that can be pressed according to the constraints","dacu":347,"points":2.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0017","title":"Letter Combinations of a Phone Number","url":"https://leetcode.com/problems/letter-combinations-of-a-phone-number/","section":"3.2m","topic":"Backtracking, Easier","hint":"classic backtracking; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"natjecanje","title":"natjecanje","url":"https://open.kattis.com/problems/natjecanje","section":"3.2m","topic":"Backtracking, Easier","hint":"4 options for each team with kayak: do nothing, pass to left (if damaged), keep to self (if damaged), pass to right (if ...","dacu":701,"points":2.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"paintings","title":"paintings","url":"https://open.kattis.com/problems/paintings","section":"3.2m","topic":"Backtracking, Easier","hint":"try all possible paintings based on Catherine's preference; skip hideous color pairs","dacu":162,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00208","title":null,"url":"https://onlinejudge.org/external/2/208.pdf","section":"3.2n","topic":"Backtracking, Harder","hint":"LA 5147 - WorldFinals SanAntonio91; backtracking with some pruning","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00222","title":null,"url":"https://onlinejudge.org/external/2/222.pdf","section":"3.2n","topic":"Backtracking, Harder","hint":"LA 5161 - WorldFinals Indianapolis93; cannot use DP 'tank' is floating-point; use backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01262","title":null,"url":"https://onlinejudge.org/external/12/1262.pdf","section":"3.2n","topic":"Backtracking, Harder","hint":"LA 4845 - Daejeon10; sort grid columns; process common passwords in lexicographic order; skip two similar passwords","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"dobra","title":"dobra","url":"https://open.kattis.com/problems/dobra","section":"3.2n","topic":"Backtracking, Harder","hint":"try all possible 3^n changes of '_' (to a vowel, an 'L', or other consonant not 'L'); prune invalid states; count valid ...","dacu":44,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"fruitbaskets","title":"fruitbaskets","url":"https://open.kattis.com/problems/fruitbaskets","section":"3.2n","topic":"Backtracking, Harder","hint":"interesting backtracking problem; compute the small numbers < 200; output all minus this value computed via backtrack...","dacu":493,"points":4.1,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0216","title":"Combination Sum III","url":"https://leetcode.com/problems/combination-sum-iii/","section":"3.2n","topic":"Backtracking, Harder","hint":"backtracking; bitmask; generate solutions; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"pagelayout","title":"pagelayout","url":"https://open.kattis.com/problems/pagelayout","section":"3.2n","topic":"Backtracking, Harder","hint":"a bit of geometry; O(2^n \times n^2 iterative bitmask will TLE; need to use recursive backtracking with pruning","dacu":84,"points":5.1,"cp5":false,"solved":false},{"judge":"UVa","id":"11057","title":null,"url":"https://onlinejudge.org/external/110/11057.pdf","section":"3.3a","topic":"Binary Search","hint":"sort; target pair problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11621","title":null,"url":"https://onlinejudge.org/external/116/11621.pdf","section":"3.3a","topic":"Binary Search","hint":"generate numbers with factor 2 and/or 3; sort; upper_bound","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12965","title":null,"url":"https://onlinejudge.org/external/129/12965.pdf","section":"3.3a","topic":"Binary Search","hint":"sort producer/consumer prices; the answer is one of the prices mentioned; use binary searches to count the answer","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"firefly","title":"firefly","url":"https://open.kattis.com/problems/firefly","section":"3.3a","topic":"Binary Search","hint":"sort stalactites vs stalagmites separately; brute force height; binary search the obstacles hit","dacu":323,"points":4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0162","title":"Find Peak Element","url":"https://leetcode.com/problems/find-peak-element/","section":"3.3a","topic":"Binary Search","hint":"interesting binary-search modification; leetcode-75; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"outofsorts","title":"outofsorts","url":"https://open.kattis.com/problems/outofsorts","section":"3.3a","topic":"Binary Search","hint":"do O(log n) binary searches on unsorted array n times","dacu":107,"points":3.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"roompainting","title":"roompainting","url":"https://open.kattis.com/problems/roompainting","section":"3.3a","topic":"Binary Search","hint":"sort the cans at shop (can be used more than once); use lower_bound for what Joe needs at shop","dacu":416,"points":3.8,"cp5":false,"solved":false},{"judge":"UVa","id":"12190","title":null,"url":"https://onlinejudge.org/external/121/12190.pdf","section":"3.3b","topic":"Bisection and BSTA, E","hint":"BSTA + algebra","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13142","title":null,"url":"https://onlinejudge.org/external/131/13142.pdf","section":"3.3b","topic":"Bisection and BSTA, E","hint":"BSTA + Physics simulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"carefulascent","title":"carefulascent","url":"https://open.kattis.com/problems/carefulascent","section":"3.3b","topic":"Bisection and BSTA, E","hint":"BSTA + Physics simulation","dacu":558,"points":1.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"freeweights","title":"freeweights","url":"https://open.kattis.com/problems/freeweights","section":"3.3b","topic":"Bisection and BSTA, E","hint":"BSTA + simulation; Mathematical observation","dacu":356,"points":4.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0875","title":"Koko Eating Bananas","url":"https://leetcode.com/problems/koko-eating-bananas/","section":"3.3b","topic":"Bisection and BSTA, E","hint":"BSTA + simulation check; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"monk","title":"monk","url":"https://open.kattis.com/problems/monk","section":"3.3b","topic":"Bisection and BSTA, E","hint":"BSTA + simulation; cool","dacu":86,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"suspensionbridges","title":"suspensionbridges","url":"https://open.kattis.com/problems/suspensionbridges","section":"3.3b","topic":"Bisection and BSTA, E","hint":"BSTA + Maths; be careful of precision error","dacu":409,"points":4.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00183","title":null,"url":"https://onlinejudge.org/external/1/183.pdf","section":"3.3c","topic":"Ternary Search & Others","hint":"simple exercise of DnC","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10385","title":null,"url":"https://onlinejudge.org/external/103/10385.pdf","section":"3.3c","topic":"Ternary Search & Others","hint":"the function is unimodal; ternary search","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12893","title":null,"url":"https://onlinejudge.org/external/128/12893.pdf","section":"3.3c","topic":"Ternary Search & Others","hint":"convert the given code into recursive DnC","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"a1paper","title":"a1paper","url":"https://open.kattis.com/problems/a1paper","section":"3.3c","topic":"Ternary Search & Others","hint":"division of A1 paper is a kind of DnC principle","dacu":1212,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"ceiling","title":"ceiling","url":"https://open.kattis.com/problems/ceiling","section":"3.3c","topic":"Ternary Search & Others","hint":"LA 7578 - WorldFinals Phuket16; BST insertion then tree equality check; also available at UVa 01738 - Ceiling Function","dacu":1871,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"goingtoseed","title":"goingtoseed","url":"https://open.kattis.com/problems/goingtoseed","section":"3.3c","topic":"Ternary Search & Others","hint":"divide to search into four regions; extension of binary/ternary search concept","dacu":199,"points":6.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2293","title":"Min Max Game","url":"https://leetcode.com/problems/min-max-game/","section":"3.3c","topic":"Ternary Search & Others","hint":"simulate the game; n halves each level","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"01193","title":null,"url":"https://onlinejudge.org/external/11/1193.pdf","section":"3.4a","topic":"Greedy (Classical)","hint":"LA 2519 - Beijing02; interval covering","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10020","title":null,"url":"https://onlinejudge.org/external/100/10020.pdf","section":"3.4a","topic":"Greedy (Classical)","hint":"interval covering","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11264","title":null,"url":"https://onlinejudge.org/external/112/11264.pdf","section":"3.4a","topic":"Greedy (Classical)","hint":"coin change variant","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"classrooms","title":"classrooms","url":"https://open.kattis.com/problems/classrooms","section":"3.4a","topic":"Greedy (Classical)","hint":"variant of interval covering; multiple rooms","dacu":229,"points":5.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"froshweek2","title":"froshweek2","url":"https://open.kattis.com/problems/froshweek2","section":"3.4a","topic":"Greedy (Classical)","hint":"greedy; sort first; similar to Dragon of Loowater; greedy matching","dacu":489,"points":2.3,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc0455","title":"Assign Cookies","url":"https://leetcode.com/problems/assign-cookies/","section":"3.4a","topic":"Greedy (Classical)","hint":"sort; greedy bipartite matching","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"squarepegs","title":"squarepegs","url":"https://open.kattis.com/problems/squarepegs","section":"3.4a","topic":"Greedy (Classical)","hint":"convert square to circular; sort; greedy matching","dacu":265,"points":3.1,"cp5":false,"solved":true},{"judge":"UVa","id":"11369","title":null,"url":"https://onlinejudge.org/external/113/11369.pdf","section":"3.4b","topic":"Involving Sorting, E","hint":"greedy; sorting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11900","title":null,"url":"https://onlinejudge.org/external/119/11900.pdf","section":"3.4b","topic":"Involving Sorting, E","hint":"greedy; sorting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13109","title":null,"url":"https://onlinejudge.org/external/131/13109.pdf","section":"3.4b","topic":"Involving Sorting, E","hint":"greedy; sorting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"icpcteamselection","title":"icpcteamselection","url":"https://open.kattis.com/problems/icpcteamselection","section":"3.4b","topic":"Involving Sorting, E","hint":"greedy; sorting","dacu":586,"points":3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1913","title":"Maximum Product Difference Between Two Pairs","url":"https://leetcode.com/problems/maximum-product-difference-between-two-pairs/","section":"3.4b","topic":"Involving Sorting, E","hint":"sort; use the last and first two","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"minimumscalar","title":"minimumscalar","url":"https://open.kattis.com/problems/minimumscalar","section":"3.4b","topic":"Involving Sorting, E","hint":"one sort increasing; one sort decreasing","dacu":1202,"points":2.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"shopaholic","title":"shopaholic","url":"https://open.kattis.com/problems/shopaholic","section":"3.4b","topic":"Involving Sorting, E","hint":"sort prices in descending order, pick every third item","dacu":959,"points":2.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0435","title":"Non-overlapping Intervals","url":"https://leetcode.com/problems/non-overlapping-intervals/","section":"3.4c","topic":"Involving Sorting, M","hint":"sort by non-decreasing endpoints; greedy; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0452","title":"Minimum Number of Arrows to Burst Balloons","url":"https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/","section":"3.4c","topic":"Involving Sorting, M","hint":"sort by non-decreasing endpoints; greedy; leetcode-75; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0881","title":"Boats to Save People","url":"https://leetcode.com/problems/boats-to-save-people/","section":"3.4c","topic":"Involving Sorting, M","hint":"sort people by non-dec weights; two pointers: lightest+heaviest; greedy","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1090","title":"Largest Values From Labels","url":"https://leetcode.com/problems/largest-values-from-labels/","section":"3.4c","topic":"Involving Sorting, M","hint":"sort by non-increasing values","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1282","title":"Group the People Given the Group Size They Belong To","url":"https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to/","section":"3.4c","topic":"Involving Sorting, M","hint":"sort by non-decreasing size, keep the original indices","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2895","title":"Minimum Processing Time","url":"https://leetcode.com/problems/minimum-processing-time/","section":"3.4c","topic":"Involving Sorting, M","hint":"sort tasks by non-increasing order and processor time by non-decreasing order","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc3301","title":"Maximize the Total Height of Unique Towers","url":"https://leetcode.com/problems/maximize-the-total-height-of-unique-towers/","section":"3.4c","topic":"Involving Sorting, M","hint":"sort by non-increasing maximum height","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"12673","title":null,"url":"https://onlinejudge.org/external/126/12673.pdf","section":"3.4d","topic":"Involving Sorting, H","hint":"LA 6530 - LatinAmerica13; greedy; sorting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12834","title":null,"url":"https://onlinejudge.org/external/128/12834.pdf","section":"3.4d","topic":"Involving Sorting, H","hint":"greedy; sorting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13054","title":null,"url":"https://onlinejudge.org/external/130/13054.pdf","section":"3.4d","topic":"Involving Sorting, H","hint":"greedy; sorting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"airconditioned","title":"airconditioned","url":"https://open.kattis.com/problems/airconditioned","section":"3.4d","topic":"Involving Sorting, H","hint":"greedy; sorting","dacu":1116,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"birds","title":"birds","url":"https://open.kattis.com/problems/birds","section":"3.4d","topic":"Involving Sorting, H","hint":"greedy; sorting","dacu":566,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"delivery","title":"delivery","url":"https://open.kattis.com/problems/delivery","section":"3.4d","topic":"Involving Sorting, H","hint":"sort, process positive and negative delivery separately; go to rightmost, come back and fill as many from the right","dacu":253,"points":3.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0055","title":"Jump Game","url":"https://leetcode.com/problems/jump-game/","section":"3.4d","topic":"Involving Sorting, H","hint":"for each reachable i, greedily extend the furthest jump, if we can; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"UVa","id":"01153","title":null,"url":"https://onlinejudge.org/external/11/1153.pdf","section":"3.4e","topic":"Involving PQ","hint":"greedy; priority queue","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13177","title":null,"url":"https://onlinejudge.org/external/131/13177.pdf","section":"3.4e","topic":"Involving PQ","hint":"greedy; priority queue","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"ballotboxes","title":"ballotboxes","url":"https://open.kattis.com/problems/ballotboxes","section":"3.4e","topic":"Involving PQ","hint":"greedy; priority queue","dacu":776,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"canvas","title":"canvas","url":"https://open.kattis.com/problems/canvas","section":"3.4e","topic":"Involving PQ","hint":"PQ simulation; process from N canvases to 1 all-white canvas; take two minimum canvas size; greedy; add them and re-enqu...","dacu":214,"points":3.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2542","title":"Maximum Subsequence Score","url":"https://leetcode.com/problems/maximum-subsequence-score/","section":"3.4e","topic":"Involving PQ","hint":"sort (nums2[i], nums1[i]) by non-increasing nums2; maintain min PQ of nums1; keep largest k; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"vegetables","title":"vegetables","url":"https://open.kattis.com/problems/vegetables","section":"3.4e","topic":"Involving PQ","hint":"store cut lengths as fractions; keep taking the largest portion; greedy; try to cut 1/2,1/3,1/4,etc; re-enqueue the resu...","dacu":347,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"workstations","title":"workstations","url":"https://open.kattis.com/problems/workstations","section":"3.4e","topic":"Involving PQ","hint":"greedy; priority queue","dacu":1110,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"10656","title":null,"url":"https://onlinejudge.org/external/106/10656.pdf","section":"3.4f","topic":"Non-Classical, Easier","hint":"greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11520","title":null,"url":"https://onlinejudge.org/external/115/11520.pdf","section":"3.4f","topic":"Non-Classical, Easier","hint":"greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12482","title":null,"url":"https://onlinejudge.org/external/124/12482.pdf","section":"3.4f","topic":"Non-Classical, Easier","hint":"greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"ants","title":"ants","url":"https://open.kattis.com/problems/ants","section":"3.4f","topic":"Non-Classical, Easier","hint":"greedy; also available at UVa 10714 - Ants","dacu":1145,"points":2.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"bank","title":"bank","url":"https://open.kattis.com/problems/bank","section":"3.4f","topic":"Non-Classical, Easier","hint":"greedy","dacu":2389,"points":2.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0860","title":"Lemonade Change","url":"https://leetcode.com/problems/lemonade-change/","section":"3.4f","topic":"Non-Classical, Easier","hint":"use 10+5 before 5+5+5; programming-skills","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"marblestree","title":"marblestree","url":"https://open.kattis.com/problems/marblestree","section":"3.4f","topic":"Non-Classical, Easier","hint":"greedy; also available at UVa 10672 - Marbles on a tree","dacu":258,"points":3,"cp5":false,"solved":false},{"judge":"UVa","id":"10821","title":null,"url":"https://onlinejudge.org/external/108/10821.pdf","section":"3.4g","topic":"Non-Classical, Harder","hint":"greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11491","title":null,"url":"https://onlinejudge.org/external/114/11491.pdf","section":"3.4g","topic":"Non-Classical, Harder","hint":"greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11583","title":null,"url":"https://onlinejudge.org/external/115/11583.pdf","section":"3.4g","topic":"Non-Classical, Harder","hint":"greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11890","title":null,"url":"https://onlinejudge.org/external/118/11890.pdf","section":"3.4g","topic":"Non-Classical, Harder","hint":"greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"dvds","title":"dvds","url":"https://open.kattis.com/problems/dvds","section":"3.4g","topic":"Non-Classical, Harder","hint":"greedy","dacu":731,"points":2.9,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0763","title":"Partition Labels","url":"https://leetcode.com/problems/partition-labels/","section":"3.4g","topic":"Non-Classical, Harder","hint":"DAT last occurence of ('a'..'z'); one-pass greedy solution is possible; top-100-liked","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"stockbroker","title":"stockbroker","url":"https://open.kattis.com/problems/stockbroker","section":"3.4g","topic":"Non-Classical, Harder","hint":"greedy","dacu":578,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"virus","title":"virus","url":"https://open.kattis.com/problems/virus","section":"3.4g","topic":"Non-Classical, Harder","hint":"greedy","dacu":753,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"10684","title":null,"url":"https://onlinejudge.org/external/106/10684.pdf","section":"3.5a","topic":"1D Range Sum","hint":"standard; Kadane's algorithm","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"Kattis","id":"commercials","title":"commercials","url":"https://open.kattis.com/problems/commercials","section":"3.5a","topic":"1D Range Sum","hint":"transform each input by -P; Kadane's algorithm","dacu":1570,"points":2,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc0053","title":"Maximum Subarray","url":"https://leetcode.com/problems/maximum-subarray/","section":"3.5a","topic":"1D Range Sum","hint":"Kadane's; special case for all negatives; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"sellingspatulas","title":"sellingspatulas","url":"https://open.kattis.com/problems/sellingspatulas","section":"3.5a","topic":"1D Range Sum","hint":"-8 per time slot initially; read sale data; 1D range sum; complete search","dacu":109,"points":8,"cp5":false,"solved":true},{"judge":"Kattis","id":"shortsell","title":"shortsell","url":"https://open.kattis.com/problems/shortsell","section":"3.5a","topic":"1D Range Sum","hint":"similar to Kadane's algorithm; linear pass; prefix sum","dacu":104,"points":4.1,"cp5":false,"solved":true},{"judge":"UVa","id":"01105","title":null,"url":"https://onlinejudge.org/external/11/1105.pdf","section":"3.5b","topic":"2D Range Sum","hint":"LA 5132 - WorldFinals Orlando11; more advanced 2D Range Sum Queries","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10755","title":null,"url":"https://onlinejudge.org/external/107/10755.pdf","section":"3.5b","topic":"2D Range Sum","hint":"max 2D range sum in 2 of the 3 dimensions; max 1D range sum with Kadane's algorithm on the 3rd dimension","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0085","title":"Maximal Rectangle","url":"https://leetcode.com/problems/maximal-rectangle/","section":"3.5b","topic":"2D Range Sum","hint":"after penalising the 0s heavily, this is just max 2D range sum","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"Kattis","id":"prozor","title":"prozor","url":"https://open.kattis.com/problems/prozor","section":"3.5b","topic":"2D Range Sum","hint":"2D range sum with fix range; output formatting","dacu":558,"points":1.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00481","title":null,"url":"https://onlinejudge.org/external/4/481.pdf","section":"3.5c","topic":"LIS","hint":"O(n log k) LIS+solution","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01196","title":null,"url":"https://onlinejudge.org/external/11/1196.pdf","section":"3.5c","topic":"LIS","hint":"LA 2815 - Kaohsiung03; sort all the blocks in increasing L[i]; then we get the classical LIS problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11790","title":null,"url":"https://onlinejudge.org/external/117/11790.pdf","section":"3.5c","topic":"LIS","hint":"combination of LIS LDS; weighted","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"increasingsubsequence","title":"increasingsubsequence","url":"https://open.kattis.com/problems/increasingsubsequence","section":"3.5c","topic":"LIS","hint":"LIS; n ≤ 200$; print lexicographically smallest solution, 99% similar to 'longincsubseq'","dacu":352,"points":4.1,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0334","title":"Increasing Triplet Subsequence","url":"https://leetcode.com/problems/increasing-triplet-subsequence/","section":"3.5c","topic":"LIS","hint":"LIS problem with a very small tweak; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"nesteddolls","title":"nesteddolls","url":"https://open.kattis.com/problems/nesteddolls","section":"3.5c","topic":"LIS","hint":"sort in one dimension; Dilworth's theorem; LIS in the other; also available at UVa 11368 - Nested Dolls","dacu":115,"points":7.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"trainsorting","title":"trainsorting","url":"https://open.kattis.com/problems/trainsorting","section":"3.5c","topic":"LIS","hint":"max(LIS(i)+LDS(i)-1), ∀i ∈ [0...n-1]; also available at UVa 11456","dacu":522,"points":5.4,"cp5":false,"solved":false},{"judge":"UVa","id":"01213","title":null,"url":"https://onlinejudge.org/external/12/1213.pdf","section":"3.5d","topic":"0-1 KNAPSACK/SS","hint":"LA 3619 - Yokohama06; extension of 0-1 KNAPSACK; s: (id, remN, remK) instead of s: (id, remN)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10130","title":null,"url":"https://onlinejudge.org/external/101/10130.pdf","section":"3.5d","topic":"0-1 KNAPSACK/SS","hint":"basic 0-1 Knapsack problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11832","title":null,"url":"https://onlinejudge.org/external/118/11832.pdf","section":"3.5d","topic":"0-1 KNAPSACK/SS","hint":"interesting DP; s: (id; val); use offset to handle negative numbers; t: plus or minus; print solution","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"knapsack","title":"knapsack","url":"https://open.kattis.com/problems/knapsack","section":"3.5d","topic":"0-1 KNAPSACK/SS","hint":"basic DP KNAPSACK; print the solution","dacu":687,"points":4.8,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc0474","title":"Ones and Zeroes","url":"https://leetcode.com/problems/ones-and-zeroes/","section":"3.5d","topic":"0-1 KNAPSACK/SS","hint":"Knapsack; skip or take a string","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"orders","title":"orders","url":"https://open.kattis.com/problems/orders","section":"3.5d","topic":"0-1 KNAPSACK/SS","hint":"interesting KNAPSACK variant; print the solution","dacu":713,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"presidentialelections","title":"presidentialelections","url":"https://open.kattis.com/problems/presidentialelections","section":"3.5d","topic":"0-1 KNAPSACK/SS","hint":"pre-process the input to discard non winnable states; be careful of negative total voters; then standard DP KNAPSACK","dacu":116,"points":5.7,"cp5":false,"solved":false},{"judge":"UVa","id":"00242","title":null,"url":"https://onlinejudge.org/external/2/242.pdf","section":"3.5e","topic":"COIN-CHANGE","hint":"LA 5181 - WorldFinals Nashville95; Complete Search + DP Coin-Change","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00674","title":null,"url":"https://onlinejudge.org/external/6/674.pdf","section":"3.5e","topic":"COIN-CHANGE","hint":"basic coin change problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11259","title":null,"url":"https://onlinejudge.org/external/112/11259.pdf","section":"3.5e","topic":"COIN-CHANGE","hint":"part of the problem is DP COIN-CHANGE with restricted number of coins per type; inclusion-exclusion","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bagoftiles","title":"bagoftiles","url":"https://open.kattis.com/problems/bagoftiles","section":"3.5e","topic":"COIN-CHANGE","hint":"count number of ways to do COIN-CHANGE; meet in the middle; DP combinatorics (n choose k) to find the answer for a+b","dacu":102,"points":6.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"canonical","title":"canonical","url":"https://open.kattis.com/problems/canonical","section":"3.5e","topic":"COIN-CHANGE","hint":"complete search possible range of counter examples; do both greedy COIN-CHANGE and DP COIN-CHANGE","dacu":502,"points":5.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"exactchange2","title":"exactchange2","url":"https://open.kattis.com/problems/exactchange2","section":"3.5e","topic":"COIN-CHANGE","hint":"a variation to the Coin-Change problem; also available at UVa 11517 - Exact Change","dacu":708,"points":5.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0322","title":"Coin Change","url":"https://leetcode.com/problems/coin-change/","section":"3.5e","topic":"COIN-CHANGE","hint":"COIN-CHANGE; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"UVa","id":"00216","title":null,"url":"https://onlinejudge.org/external/2/216.pdf","section":"3.5f","topic":"TSP","hint":"LA 5155 - WorldFinals KansasCity92; DP TSP problem; but still solvable with backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11795","title":null,"url":"https://onlinejudge.org/external/117/11795.pdf","section":"3.5f","topic":"TSP","hint":"DP TSP variant; counting paths on DAG; DP+bitmask; let Mega Buster owned by a dummy 'Robot 0'","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12841","title":null,"url":"https://onlinejudge.org/external/128/12841.pdf","section":"3.5f","topic":"TSP","hint":"simply find and print the lexicographically smallest Hamiltonian path; use DP-TSP technique","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"beepers","title":"beepers","url":"https://open.kattis.com/problems/beepers","section":"3.5f","topic":"TSP","hint":"DP or recursive backtracking with sufficient pruning; also available at UVa 10496 - Collecting Beepers","dacu":196,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"bustour","title":"bustour","url":"https://open.kattis.com/problems/bustour","section":"3.5f","topic":"TSP","hint":"LA 6028 - WorldFinals Warsaw12; DP TSP variant; also available at UVa 01281 - Bus Tour","dacu":124,"points":6.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"cycleseasy","title":"cycleseasy","url":"https://open.kattis.com/problems/cycleseasy","section":"3.5f","topic":"TSP","hint":"Count number of HAMILTONIAN-TOURs","dacu":108,"points":4.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"errands","title":"errands","url":"https://open.kattis.com/problems/errands","section":"3.5f","topic":"TSP","hint":"map location names to integer indices; DP TSP","dacu":51,"points":7,"cp5":false,"solved":false},{"judge":"UVa","id":"01261","title":null,"url":"https://onlinejudge.org/external/12/1261.pdf","section":"3.5g","topic":"Non-Classical, 1D, E","hint":"LA 4844 - Daejeon10; backtracking possible; but we use a set<string> to prevent recomputation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11420","title":null,"url":"https://onlinejudge.org/external/114/11420.pdf","section":"3.5g","topic":"Non-Classical, 1D, E","hint":"s: (prev; id; numlck); lock/unlock this chest","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12654","title":null,"url":"https://onlinejudge.org/external/126/12654.pdf","section":"3.5g","topic":"Non-Classical, 1D, E","hint":"s: (hole); t: use patch T1 or patch T2","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0746","title":"Min Cost Climbing Stairs","url":"https://leetcode.com/problems/min-cost-climbing-stairs/","section":"3.5g","topic":"Non-Classical, 1D, E","hint":"s: (i); t: to (i+1) or (i+2); Fibonacci variant; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"UVa","id":"10003","title":null,"url":"https://onlinejudge.org/external/100/10003.pdf","section":"3.5h","topic":"Non-Classical, 2D, E","hint":"discussed in this section","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11450","title":null,"url":"https://onlinejudge.org/external/114/11450.pdf","section":"3.5h","topic":"Non-Classical, 2D, E","hint":"discussed in this section","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13141","title":null,"url":"https://onlinejudge.org/external/131/13141.pdf","section":"3.5h","topic":"Non-Classical, 2D, E","hint":"s: (level, branch_previously); t: not branching if branch_previously or branching (one side) otherwise","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"nikola","title":"nikola","url":"https://open.kattis.com/problems/nikola","section":"3.5h","topic":"Non-Classical, 2D, E","hint":"s: (pos, last_jump); t: jump forward or backward","dacu":295,"points":3.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"spiderman","title":"spiderman","url":"https://open.kattis.com/problems/spiderman","section":"3.5h","topic":"Non-Classical, 2D, E","hint":"simple DP; go up or down; print solution","dacu":1010,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"ticketpricing","title":"ticketpricing","url":"https://open.kattis.com/problems/ticketpricing","section":"3.5h","topic":"Non-Classical, 2D, E","hint":"LA 6867 - Rocky Mountain15; similar with UVa 11450 discussed in this book; real life problem; print (the first) part of ...","dacu":138,"points":4.9,"cp5":false,"solved":false},{"judge":"UVa","id":"12324","title":null,"url":"https://onlinejudge.org/external/123/12324.pdf","section":"3.5i","topic":"DP level 2","hint":"spheres > n are useless","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12862","title":null,"url":"https://onlinejudge.org/external/128/12862.pdf","section":"3.5i","topic":"DP level 2","hint":"1D DP to compute the path cost from every vertex that goes up to the mountain top; compute answer","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12955","title":null,"url":"https://onlinejudge.org/external/129/12955.pdf","section":"3.5i","topic":"DP level 2","hint":"there are only 8 eligible factorials under 100000; we can use DP; s: (i, sum); t: take/stay, take/move, don't take/move","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"kutevi","title":"kutevi","url":"https://open.kattis.com/problems/kutevi","section":"3.5i","topic":"DP level 2","hint":"s: (360 integer degrees)","dacu":170,"points":2.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0714","title":"Best Time to Buy and Sell Stock with Transaction Fee","url":"https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/","section":"3.5i","topic":"DP level 2","hint":"s: (own, i); t: skip day i or sell if own/buy if not; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"tight","title":"tight","url":"https://open.kattis.com/problems/tight","section":"3.5i","topic":"DP level 2","hint":"s: (i, j); #tight words of length i that end in digit j divided by #words: (k+1)^n; also available at UVa 10081 - Tight ...","dacu":100,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"walrusweights","title":"walrusweights","url":"https://open.kattis.com/problems/walrusweights","section":"3.5i","topic":"DP level 2","hint":"backtracking with memoization","dacu":570,"points":3.8,"cp5":false,"solved":true},{"judge":"UVa","id":"11749","title":null,"url":"https://onlinejudge.org/external/117/11749.pdf","section":"4.2a","topic":"Finding CCs","hint":"find the largest CC with highest average PPA; also solvable with UFDS","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11906","title":null,"url":"https://onlinejudge.org/external/119/11906.pdf","section":"4.2a","topic":"Finding CCs","hint":"DFS/BFS for reachability; several tricky cases; be careful when M = 0; N = 0; or M = N","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0547","title":"Number of Provinces","url":"https://leetcode.com/problems/number-of-provinces/","section":"4.2a","topic":"Finding CCs","hint":"count number of CCs; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"reachableroads","title":"reachableroads","url":"https://open.kattis.com/problems/reachableroads","section":"4.2a","topic":"Finding CCs","hint":"report number of CC-1","dacu":892,"points":2.1,"cp5":false,"solved":true},{"judge":"Kattis","id":"securitybadge","title":"securitybadge","url":"https://open.kattis.com/problems/securitybadge","section":"4.2a","topic":"Finding CCs","hint":"reachability test; clever idea to compress ids","dacu":129,"points":7.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"terraces","title":"terraces","url":"https://open.kattis.com/problems/terraces","section":"4.2a","topic":"Finding CCs","hint":"group cells with similar height together; if it cannot flow to any other component with lower height, add the size of th...","dacu":339,"points":3.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"wheresmyinternet","title":"wheresmyinternet","url":"https://open.kattis.com/problems/wheresmyinternet","section":"4.2a","topic":"Finding CCs","hint":"check connectivity to vertex 1","dacu":1716,"points":3.7,"cp5":false,"solved":true},{"judge":"UVa","id":"00352","title":null,"url":"https://onlinejudge.org/external/3/352.pdf","section":"4.2b","topic":"Flood Fill, Easier","hint":"count number of CCs; see UVa 00572","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"UVa","id":"11953","title":null,"url":"https://onlinejudge.org/external/119/11953.pdf","section":"4.2b","topic":"Flood Fill, Easier","hint":"interesting twist of flood fill problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"amoebas","title":"amoebas","url":"https://open.kattis.com/problems/amoebas","section":"4.2b","topic":"Flood Fill, Easier","hint":"easy floodfill","dacu":1079,"points":1.8,"cp5":false,"solved":true},{"judge":"Kattis","id":"countingstars","title":"countingstars","url":"https://open.kattis.com/problems/countingstars","section":"4.2b","topic":"Flood Fill, Easier","hint":"basic flood fill problem; count CCs","dacu":1494,"points":2.7,"cp5":false,"solved":true},{"judge":"Kattis","id":"fontan","title":"fontan","url":"https://open.kattis.com/problems/fontan","section":"4.2b","topic":"Flood Fill, Easier","hint":"modified multi-sources BFS/floodfill","dacu":866,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"gold","title":"gold","url":"https://open.kattis.com/problems/gold","section":"4.2b","topic":"Flood Fill, Easier","hint":"flood fill with extra blocking constraint; also available at UVa 11561 - Getting Gold","dacu":735,"points":2.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0733","title":"Flood Fill","url":"https://leetcode.com/problems/flood-fill/","section":"4.2b","topic":"Flood Fill, Easier","hint":"basic flood fill problem","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"UVa","id":"01103","title":null,"url":"https://onlinejudge.org/external/11/1103.pdf","section":"4.2c","topic":"Flood Fill, Harder","hint":"LA 5130 - WorldFinals Orlando11; major hint: each hieroglyph has unique number of white CCs","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"10kindsofpeople","title":"10kindsofpeople","url":"https://open.kattis.com/problems/10kindsofpeople","section":"4.2c","topic":"Flood Fill, Harder","hint":"intelligent flood fill; just run once to avoid TLE as there are many queries","dacu":2380,"points":3.9,"cp5":false,"solved":true},{"judge":"UVa","id":"11585","title":null,"url":"https://onlinejudge.org/external/115/11585.pdf","section":"4.2c","topic":"Flood Fill, Harder","hint":"polynomial-time verifier for an NP-complete puzzle Nurikabe; this verifier requires clever usage of flood fill algorithm","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"coast","title":"coast","url":"https://open.kattis.com/problems/coast","section":"4.2c","topic":"Flood Fill, Harder","hint":"intelligent flood fill; just run once to avoid TLE as there are many queries","dacu":1339,"points":3.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"islands3","title":"islands3","url":"https://open.kattis.com/problems/islands3","section":"4.2c","topic":"Flood Fill, Harder","hint":"optimistic flood fill; assume all Cs are Ls","dacu":936,"points":2.1,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc1254","title":"Number of Closed Islands","url":"https://leetcode.com/problems/number-of-closed-islands/","section":"4.2c","topic":"Flood Fill, Harder","hint":"flood fill; avoiding borders","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"UVa","id":"00872","title":null,"url":"https://onlinejudge.org/external/8/872.pdf","section":"4.2d","topic":"Topological Sort","hint":"similar to UVa 00124; use backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11060","title":null,"url":"https://onlinejudge.org/external/110/11060.pdf","section":"4.2d","topic":"Topological Sort","hint":"Kahn's algorithm---modified BFS toposort","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"brexit","title":"brexit","url":"https://open.kattis.com/problems/brexit","section":"4.2d","topic":"Topological Sort","hint":"toposort; chain reaction; modified Kahn's algorithm","dacu":826,"points":3.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"builddeps","title":"builddeps","url":"https://open.kattis.com/problems/builddeps","section":"4.2d","topic":"Topological Sort","hint":"the graph is acyclic; toposort with DFS from the changed file","dacu":626,"points":4.7,"cp5":false,"solved":true},{"judge":"Kattis","id":"conservation","title":"conservation","url":"https://open.kattis.com/problems/conservation","section":"4.2d","topic":"Topological Sort","hint":"modified Kahn's algorithm; greedily process all steps in a certain lab before alternating to the other lab","dacu":133,"points":4.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0210","title":"Course Schedule II","url":"https://leetcode.com/problems/course-schedule-ii/","section":"4.2d","topic":"Topological Sort","hint":"cycle check; compute toposort if acyclic; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"pickupsticks","title":"pickupsticks","url":"https://open.kattis.com/problems/pickupsticks","section":"4.2d","topic":"Topological Sort","hint":"cycle check + toposort if DAG; also available at item UVa 11686 - Pick up sticks","dacu":373,"points":4.7,"cp5":false,"solved":true},{"judge":"UVa","id":"10116","title":null,"url":"https://onlinejudge.org/external/101/10116.pdf","section":"4.2e","topic":"Graph Properties Check","hint":"traversal on implicit graph; cycle check","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10505","title":null,"url":"https://onlinejudge.org/external/105/10505.pdf","section":"4.2e","topic":"Graph Properties Check","hint":"bipartite; take max(left; right)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"hoppers","title":"hoppers","url":"https://open.kattis.com/problems/hoppers","section":"4.2e","topic":"Graph Properties Check","hint":"the answer is number of CC-1 if there is at least one non-bipartite component in the graph; or number of CC otherwise","dacu":234,"points":3.9,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0207","title":"Course Schedule","url":"https://leetcode.com/problems/course-schedule/","section":"4.2e","topic":"Graph Properties Check","hint":"is the directed graph acyclic?; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"molekule","title":"molekule","url":"https://open.kattis.com/problems/molekule","section":"4.2e","topic":"Graph Properties Check","hint":"undirected tree is also Bipartite/bi-colorable; bi-color it with 0 and 1; direct all edges from 0 to 1 (or vice versa)","dacu":175,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"runningmom","title":"runningmom","url":"https://open.kattis.com/problems/runningmom","section":"4.2e","topic":"Graph Properties Check","hint":"find a cycle in a directed graph","dacu":591,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"torn2pieces","title":"torn2pieces","url":"https://open.kattis.com/problems/torn2pieces","section":"4.2e","topic":"Graph Properties Check","hint":"construct graph from strings; traversal from source to target; reachability check; print path","dacu":1115,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"10765","title":null,"url":"https://onlinejudge.org/external/107/10765.pdf","section":"4.2f","topic":"Cut Vertices/Bridges","hint":"finding articulation points","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12363","title":null,"url":"https://onlinejudge.org/external/123/12363.pdf","section":"4.2f","topic":"Cut Vertices/Bridges","hint":"LA 5796 - Latin America; transform input to graph of its bridges; see if b is reachable from a with only the bridges","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12783","title":null,"url":"https://onlinejudge.org/external/127/12783.pdf","section":"4.2f","topic":"Cut Vertices/Bridges","hint":"finding bridges","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"birthday","title":"birthday","url":"https://open.kattis.com/problems/birthday","section":"4.2f","topic":"Cut Vertices/Bridges","hint":"check if the input graph contains any bridge; N is small though so weaker solution can still be accepted","dacu":323,"points":4.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"caveexploration","title":"caveexploration","url":"https://open.kattis.com/problems/caveexploration","section":"4.2f","topic":"Cut Vertices/Bridges","hint":"find size of bi-connected components that contains vertex 0; identify the bridges","dacu":848,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"gymleadersterritory","title":"gymleadersterritory","url":"https://open.kattis.com/problems/gymleadersterritory","section":"4.2f","topic":"Cut Vertices/Bridges","hint":"if all edges connected to vertex k are bridges, then `YES`; otherwise `NO`","dacu":165,"points":3.5,"cp5":true,"solved":false},{"judge":"Kattis","id":"intercept","title":"intercept","url":"https://open.kattis.com/problems/intercept","section":"4.2f","topic":"Cut Vertices/Bridges","hint":"Articulation Points in SSSP Spanning DAG; clever modification of Dijkstra's","dacu":112,"points":6.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00247","title":null,"url":"https://onlinejudge.org/external/2/247.pdf","section":"4.2g","topic":"Finding SCCs","hint":"SCC + printing solution","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11709","title":null,"url":"https://onlinejudge.org/external/117/11709.pdf","section":"4.2g","topic":"Finding SCCs","hint":"find the number of SCCs","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11770","title":null,"url":"https://onlinejudge.org/external/117/11770.pdf","section":"4.2g","topic":"Finding SCCs","hint":"similar to UVa 11504","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cantinaofbabel","title":"cantinaofbabel","url":"https://open.kattis.com/problems/cantinaofbabel","section":"4.2g","topic":"Finding SCCs","hint":"build directed graph 'can_speak'; compute the largest SCC of 'can_speak'; keep this largest SCC","dacu":1294,"points":3.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"dominos","title":"dominos","url":"https://open.kattis.com/problems/dominos","section":"4.2g","topic":"Finding SCCs","hint":"count the number of SCCs without incoming edge from a vertex outside that SCC; also available at UVa 11504 - Dominos","dacu":248,"points":6.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"equivalences","title":"equivalences","url":"https://open.kattis.com/problems/equivalences","section":"4.2g","topic":"Finding SCCs","hint":"contract input directed graph into SCCs; count SCCs that have in-/out-degrees = 0; report the max","dacu":281,"points":5.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"reversingroads","title":"reversingroads","url":"https://open.kattis.com/problems/reversingroads","section":"4.2g","topic":"Finding SCCs","hint":"if #SCC = 1, print 'valid'; or try reversing one of the m directed edges until we either have #SCC = 1, or print 'invali...","dacu":640,"points":3.7,"cp5":false,"solved":false},{"judge":"UVa","id":"11831","title":null,"url":"https://onlinejudge.org/external/118/11831.pdf","section":"4.2h","topic":"Really Ad Hoc","hint":"traversal on implicit graph","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12442","title":null,"url":"https://onlinejudge.org/external/124/12442.pdf","section":"4.2h","topic":"Really Ad Hoc","hint":"modified DFS; special graph","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"dominoes2","title":"dominoes2","url":"https://open.kattis.com/problems/dominoes2","section":"4.2h","topic":"Really Ad Hoc","hint":"unlike UVa 11504, we treat SCCs as CCs; also available at UVa 11518 - Dominos 2","dacu":599,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"faultyrobot","title":"faultyrobot","url":"https://open.kattis.com/problems/faultyrobot","section":"4.2h","topic":"Really Ad Hoc","hint":"interesting graph traversal variant; add one more state to each vertex: bug_used","dacu":556,"points":3.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0841","title":"Keys and Rooms","url":"https://leetcode.com/problems/keys-and-rooms/","section":"4.2h","topic":"Really Ad Hoc","hint":"DFS/BFS from 0; see if all rooms are visited; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"promotions","title":"promotions","url":"https://open.kattis.com/problems/promotions","section":"4.2h","topic":"Really Ad Hoc","hint":"modified DFS; special graph; DAG; also available at UVa 13015 - Promotions","dacu":129,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"succession","title":"succession","url":"https://open.kattis.com/problems/succession","section":"4.2h","topic":"Really Ad Hoc","hint":"(upwards) traversal of family DAG; use unordered_maps; make the founder has very large starting blood to avoid fraction","dacu":165,"points":3.1,"cp5":false,"solved":false},{"judge":"UVa","id":"11631","title":null,"url":"https://onlinejudge.org/external/116/11631.pdf","section":"4.3a","topic":"MST, Standard","hint":"weight of (all graph edges - all MST edges)","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"UVa","id":"11747","title":null,"url":"https://onlinejudge.org/external/117/11747.pdf","section":"4.3a","topic":"MST, Standard","hint":"sum the edge weights of the chords","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cats","title":"cats","url":"https://open.kattis.com/problems/cats","section":"4.3a","topic":"MST, Standard","hint":"standard MST","dacu":456,"points":4.1,"cp5":false,"solved":true},{"judge":"Kattis","id":"islandhopping","title":"islandhopping","url":"https://open.kattis.com/problems/islandhopping","section":"4.3a","topic":"MST, Standard","hint":"MST on small complete graph","dacu":440,"points":3,"cp5":false,"solved":true},{"judge":"LeetCode","id":"lc1584","title":"Min Cost to Connect All Points","url":"https://leetcode.com/problems/min-cost-to-connect-all-points/","section":"4.3a","topic":"MST, Standard","hint":"basic MST problem","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"lostmap","title":"lostmap","url":"https://open.kattis.com/problems/lostmap","section":"4.3a","topic":"MST, Standard","hint":"actually just a standard MST problem","dacu":782,"points":2.1,"cp5":false,"solved":true},{"judge":"Kattis","id":"minspantree","title":"minspantree","url":"https://open.kattis.com/problems/minspantree","section":"4.3a","topic":"MST, Standard","hint":"very standard MST problem; check if a spanning tree is formed; also output the edges in any spanning tree in lexicograph...","dacu":862,"points":4,"cp5":false,"solved":true},{"judge":"UVa","id":"01013","title":null,"url":"https://onlinejudge.org/external/10/1013.pdf","section":"4.3b","topic":"MST, Variants","hint":"LA 2478 - WorldFinals Honolulu02; very interesting MST variant","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01265","title":null,"url":"https://onlinejudge.org/external/12/1265.pdf","section":"4.3b","topic":"MST, Variants","hint":"LA 4848 - Daejeon10; very interesting non-standard variant of 'maximum' spanning tree","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10457","title":null,"url":"https://onlinejudge.org/external/104/10457.pdf","section":"4.3b","topic":"MST, Variants","hint":"interesting MST modeling","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"millionairemadness","title":"millionairemadness","url":"https://open.kattis.com/problems/millionairemadness","section":"4.3b","topic":"MST, Variants","hint":"MiniMax path problem","dacu":649,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"muddyhike","title":"muddyhike","url":"https://open.kattis.com/problems/muddyhike","section":"4.3b","topic":"MST, Variants","hint":"MiniMax path problem","dacu":209,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"naturereserve","title":"naturereserve","url":"https://open.kattis.com/problems/naturereserve","section":"4.3b","topic":"MST, Variants","hint":"Prim's algorithm from multiple sources","dacu":180,"points":4.6,"cp5":false,"solved":false},{"judge":"UVa","id":"10653","title":null,"url":"https://onlinejudge.org/external/106/10653.pdf","section":"4.4a","topic":"SSSP, BFS, Easier","hint":"need efficient BFS implementation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12160","title":null,"url":"https://onlinejudge.org/external/121/12160.pdf","section":"4.4a","topic":"SSSP, BFS, Easier","hint":"LA 4408 - KualaLumpur08; s: (4-digits number); edges: button pushes; BFS","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"buttonbashing","title":"buttonbashing","url":"https://open.kattis.com/problems/buttonbashing","section":"4.4a","topic":"SSSP, BFS, Easier","hint":"very similar to UVa 12160","dacu":728,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"horror","title":"horror","url":"https://open.kattis.com/problems/horror","section":"4.4a","topic":"SSSP, BFS, Easier","hint":"SSSP from all sources = horror movies; report lowest ID with the highest unweighted SSSP distance","dacu":500,"points":3.3,"cp5":false,"solved":true},{"judge":"UVa","id":"11352","title":null,"url":"https://onlinejudge.org/external/113/11352.pdf","section":"4.4b","topic":"SSSP, BFS, Medium","hint":"filter the graph first; then it becomes SSSP","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12826","title":null,"url":"https://onlinejudge.org/external/128/12826.pdf","section":"4.4b","topic":"SSSP, BFS, Medium","hint":"SSSP from (r1; c1) to (r2; c2) avoiding (r3; c3); BFS","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"fire2","title":"fire2","url":"https://open.kattis.com/problems/fire2","section":"4.4b","topic":"SSSP, BFS, Medium","hint":"very similar to UVa 11624","dacu":395,"points":4.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1926","title":"Nearest Exit from Entrance in Maze","url":"https://leetcode.com/problems/nearest-exit-from-entrance-in-maze/","section":"4.4b","topic":"SSSP, BFS, Medium","hint":"BFS on grid; stop at border (that is not source); leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"lost","title":"lost","url":"https://open.kattis.com/problems/lost","section":"4.4b","topic":"SSSP, BFS, Medium","hint":"interesting twist of BFS/SSSP spanning tree","dacu":269,"points":4.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"mallmania","title":"mallmania","url":"https://open.kattis.com/problems/mallmania","section":"4.4b","topic":"SSSP, BFS, Medium","hint":"multi-sources BFS from m1; get minimum at border of m2; also available at UVa 11101 - Mall Mania","dacu":48,"points":4.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"oceancurrents","title":"oceancurrents","url":"https://open.kattis.com/problems/oceancurrents","section":"4.4b","topic":"SSSP, BFS, Medium","hint":"0/1-weighted SSSP; BFS+deque; also available at UVa 11573 - Ocean Currents","dacu":118,"points":5.4,"cp5":false,"solved":false},{"judge":"UVa","id":"00439","title":null,"url":"https://onlinejudge.org/external/4/439.pdf","section":"4.4c","topic":"Knight Moves, BFS","hint":"one BFS per query is enough","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10426","title":null,"url":"https://onlinejudge.org/external/104/10426.pdf","section":"4.4c","topic":"Knight Moves, BFS","hint":"for each knight, do BFS when the monster is sleep/awake; try: one awake the monster, the rest go around","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10477","title":null,"url":"https://onlinejudge.org/external/104/10477.pdf","section":"4.4c","topic":"Knight Moves, BFS","hint":"s: (row; col; knight_state); implicit unweighted graph; different edges per different knight_state","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"grasshopper","title":"grasshopper","url":"https://open.kattis.com/problems/grasshopper","section":"4.4c","topic":"Knight Moves, BFS","hint":"BFS on implicit Knight jump graph","dacu":136,"points":4,"cp5":false,"solved":false},{"judge":"Kattis","id":"hidingplaces","title":"hidingplaces","url":"https://open.kattis.com/problems/hidingplaces","section":"4.4c","topic":"Knight Moves, BFS","hint":"SSSP from (r, c); find cells with max distance; print","dacu":607,"points":1.9,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2596","title":"Check Knight Tour Configuration","url":"https://leetcode.com/problems/check-knight-tour-configuration/","section":"4.4c","topic":"Knight Moves, BFS","hint":"standard knight tour; BFS; 8 directions","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"01112","title":null,"url":"https://onlinejudge.org/external/11/1112.pdf","section":"4.4e","topic":"SSSP, Dijkstra, Easier","hint":"LA 2425 - SouthwesternEurope01; SDSP","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13127","title":null,"url":"https://onlinejudge.org/external/131/13127.pdf","section":"4.4e","topic":"SSSP, Dijkstra, Easier","hint":"Dijkstra's from multiple sources","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"flowerytrails","title":"flowerytrails","url":"https://open.kattis.com/problems/flowerytrails","section":"4.4e","topic":"SSSP, Dijkstra, Easier","hint":"Dijkstra's; record predecessor graph as there can be multiple shortest paths; also available at UVa 12878 - Flowery Trai...","dacu":305,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"shortestpath1","title":"shortestpath1","url":"https://open.kattis.com/problems/shortestpath1","section":"4.4e","topic":"SSSP, Dijkstra, Easier","hint":"very standard Dijkstra's problem","dacu":1470,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"shortestpath2","title":"shortestpath2","url":"https://open.kattis.com/problems/shortestpath2","section":"4.4e","topic":"SSSP, Dijkstra, Easier","hint":"Dijkstra's with modification; edges only available periodically; be careful with P = 0 case","dacu":423,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"texassummers","title":"texassummers","url":"https://open.kattis.com/problems/texassummers","section":"4.4e","topic":"SSSP, Dijkstra, Easier","hint":"Dijkstra's; complete weighted graph; print path","dacu":97,"points":4,"cp5":false,"solved":false},{"judge":"UVa","id":"00589","title":null,"url":"https://onlinejudge.org/external/5/589.pdf","section":"4.4g","topic":"SSSP, Dijkstra, Harder","hint":"weighted SSSP: move box from s to t + unweighted SSSP: move player to correct position to push the box","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12047","title":null,"url":"https://onlinejudge.org/external/120/12047.pdf","section":"4.4g","topic":"SSSP, Dijkstra, Harder","hint":"clever usage of Dijkstra's; run Dijkstra's from source and from d from destination","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12950","title":null,"url":"https://onlinejudge.org/external/129/12950.pdf","section":"4.4g","topic":"SSSP, Dijkstra, Harder","hint":"clever usage of Dijstra's; instead of extending by one edge, we can extend by two edges at a time","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"blockcrusher","title":"blockcrusher","url":"https://open.kattis.com/problems/blockcrusher","section":"4.4g","topic":"SSSP, Dijkstra, Harder","hint":"Dijkstra's from top row to bottom row (or vice versa); print path","dacu":257,"points":5.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"emptyingbaltic","title":"emptyingbaltic","url":"https://open.kattis.com/problems/emptyingbaltic","section":"4.4g","topic":"SSSP, Dijkstra, Harder","hint":"Dijkstra's variant; grow spanning tree from drain/source","dacu":287,"points":5.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"invasion","title":"invasion","url":"https://open.kattis.com/problems/invasion","section":"4.4g","topic":"SSSP, Dijkstra, Harder","hint":"SSSP with multiple and successive sources; multiple calls of Dijkstra's (gets lighter each time if pruned properly)","dacu":46,"points":4.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"visualgo","title":"visualgo","url":"https://open.kattis.com/problems/visualgo","section":"4.4g","topic":"SSSP, Dijkstra, Harder","hint":"Dijkstra's produces SSSP spanning DAG if there are multiple shortest paths from s to t; counting paths on DAG","dacu":496,"points":3.4,"cp5":false,"solved":false},{"judge":"UVa","id":"00558","title":null,"url":"https://onlinejudge.org/external/5/558.pdf","section":"4.4h","topic":"SSSP, Bellman-Ford","hint":"check if negative cycle exists","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10449","title":null,"url":"https://onlinejudge.org/external/104/10449.pdf","section":"4.4h","topic":"SSSP, Bellman-Ford","hint":"find the minimum weight path; which may be negative; be careful: INF negative weight is lower than INF","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12768","title":null,"url":"https://onlinejudge.org/external/127/12768.pdf","section":"4.4h","topic":"SSSP, Bellman-Ford","hint":"insert -F as edge weight; see if negative cycle exists; or find min SSSP value from s = 1","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"hauntedgraveyard","title":"hauntedgraveyard","url":"https://open.kattis.com/problems/hauntedgraveyard","section":"4.4h","topic":"SSSP, Bellman-Ford","hint":"Bellman-Ford; negative cycle check needed","dacu":95,"points":8.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0743","title":"Network Delay Time","url":"https://leetcode.com/problems/network-delay-time/","section":"4.4h","topic":"SSSP, Bellman-Ford","hint":"SSSP on a small directed weighted graph","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"shortestpath3","title":"shortestpath3","url":"https://open.kattis.com/problems/shortestpath3","section":"4.4h","topic":"SSSP, Bellman-Ford","hint":"Bellman-Ford; do DFS/BFS from vertices that are part of any negative cycle","dacu":524,"points":5.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"xyzzy","title":"xyzzy","url":"https://open.kattis.com/problems/xyzzy","section":"4.4h","topic":"SSSP, Bellman-Ford","hint":"check 'positive' cycle; check connectedness; also available at UVa 10557","dacu":152,"points":6.7,"cp5":false,"solved":false},{"judge":"UVa","id":"00821","title":null,"url":"https://onlinejudge.org/external/8/821.pdf","section":"4.5a","topic":"APSP, Standard","hint":"LA 5221 - WorldFinals Orlando00; one of the easiest ICPC WorldFinals problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01247","title":null,"url":"https://onlinejudge.org/external/12/1247.pdf","section":"4.5a","topic":"APSP, Standard","hint":"LA 4524 - Hsinchu09; Floyd-Warshall with modification: prefer shortest path with less intermediate vertices","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10354","title":null,"url":"https://onlinejudge.org/external/103/10354.pdf","section":"4.5a","topic":"APSP, Standard","hint":"find and remove edges involved in boss's shortest paths; re-run shortest paths from home to market","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"allpairspath","title":"allpairspath","url":"https://open.kattis.com/problems/allpairspath","section":"4.5a","topic":"APSP, Standard","hint":"basic Floyd-Warshall; tricky negative cycle checks","dacu":772,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"importspaghetti","title":"importspaghetti","url":"https://open.kattis.com/problems/importspaghetti","section":"4.5a","topic":"APSP, Standard","hint":"smallest cycle; print path by breaking the self-loop into i - other vertex j - i","dacu":292,"points":5.1,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1334","title":"Find the City With the Smallest Number of Neighbors at a Threshold Distance","url":"https://leetcode.com/problems/find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/","section":"4.5a","topic":"APSP, Standard","hint":"get APSP information using Floyd-Warshall; compute reachability; get the answer","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"transportationplanning","title":"transportationplanning","url":"https://open.kattis.com/problems/transportationplanning","section":"4.5a","topic":"APSP, Standard","hint":"APSP; FW; for each unused edge, use it and see how much distance is reduced; get minimum; O(n^4)","dacu":65,"points":3.9,"cp5":false,"solved":false},{"judge":"UVa","id":"01056","title":null,"url":"https://onlinejudge.org/external/10/1056.pdf","section":"4.5b","topic":"APSP, Variants","hint":"LA 3569 - WorldFinals SanAntonio06; finding diameter of a small graph with Floyd-Warshall","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10342","title":null,"url":"https://onlinejudge.org/external/103/10342.pdf","section":"4.5b","topic":"APSP, Variants","hint":"Floyd-Warshall to get APSP values; to get the second best shortest path, try to make a single mistake","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10987","title":null,"url":"https://onlinejudge.org/external/109/10987.pdf","section":"4.5b","topic":"APSP, Variants","hint":"creative usage of Floyd-Warshall algorithm; if we can detour without increasing cost, then delete the direct edge","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"arbitrage","title":"arbitrage","url":"https://open.kattis.com/problems/arbitrage","section":"4.5b","topic":"APSP, Variants","hint":"arbitrage problem; similar to UVa 00104 and 00436","dacu":324,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"kastenlauf","title":"kastenlauf","url":"https://open.kattis.com/problems/kastenlauf","section":"4.5b","topic":"APSP, Variants","hint":"n ≤ 100; Warshall's transitive closure problem","dacu":713,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"secretchamber","title":"secretchamber","url":"https://open.kattis.com/problems/secretchamber","section":"4.5b","topic":"APSP, Variants","hint":"LA 8047 - WorldFinals RapidCity17; Warshall's transitive closure; also available at UVa 01757 - Secret Chamber ...","dacu":1187,"points":2.2,"cp5":false,"solved":false},{"judge":"UVa","id":"00452","title":null,"url":"https://onlinejudge.org/external/4/452.pdf","section":"4.7a","topic":"S/Longest Paths on DAG","hint":"LONGEST-PATH on DAG","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10350","title":null,"url":"https://onlinejudge.org/external/103/10350.pdf","section":"4.7a","topic":"S/Longest Paths on DAG","hint":"shortest paths; implicit DAG; DP","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"fibtour","title":"fibtour","url":"https://open.kattis.com/problems/fibtour","section":"4.7a","topic":"S/Longest Paths on DAG","hint":"only ~90 Fibonacci numbers not more than 10^18; LONGEST-PATH on DAG problem; special case for first two Fibonacci number...","dacu":105,"points":6.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0064","title":"Minimum Path Sum","url":"https://leetcode.com/problems/minimum-path-sum/","section":"4.7a","topic":"S/Longest Paths on DAG","hint":"basic SSSP on DAG; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"mravi","title":"mravi","url":"https://open.kattis.com/problems/mravi","section":"4.7a","topic":"S/Longest Paths on DAG","hint":"reverse edge directions to change the input tree into a DAG; find longest path from leaf that contains ant to root","dacu":197,"points":2.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"safepassage","title":"safepassage","url":"https://open.kattis.com/problems/safepassage","section":"4.7a","topic":"S/Longest Paths on DAG","hint":"SSSP; implicit DAG; s: (cloak_pos, bitmask); try all ways to go back and forth between gate and dorm; report minimum","dacu":387,"points":4.9,"cp5":false,"solved":false},{"judge":"UVa","id":"10544","title":null,"url":"https://onlinejudge.org/external/105/10544.pdf","section":"4.7b","topic":"Counting Paths, Easier","hint":"counting paths in implicit DAG","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11569","title":null,"url":"https://onlinejudge.org/external/115/11569.pdf","section":"4.7b","topic":"Counting Paths, Easier","hint":"determine the length of one of the longest paths and then count the number of such longest paths in DAG","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"compositions","title":"compositions","url":"https://open.kattis.com/problems/compositions","section":"4.7b","topic":"Counting Paths, Easier","hint":"LA 7365 - Greater NY15; s: (N_left); t: try all values, skip some numbers","dacu":160,"points":2.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0062","title":"Unique Paths","url":"https://leetcode.com/problems/unique-paths/","section":"4.7b","topic":"Counting Paths, Easier","hint":"counting paths; DAG; leetcode-75; top-100-liked","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"robotsonagrid","title":"robotsonagrid","url":"https://open.kattis.com/problems/robotsonagrid","section":"4.7b","topic":"Counting Paths, Easier","hint":"counting paths in implicit DAG","dacu":147,"points":4.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"runningsteps","title":"runningsteps","url":"https://open.kattis.com/problems/runningsteps","section":"4.7b","topic":"Counting Paths, Easier","hint":"LA 7360 - Greater NY15; s: (leg, l2, r2, l1, r1); t: left/right leg 1/2 steps; use unordered_map as memo table; use prun...","dacu":168,"points":2.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"scenes","title":"scenes","url":"https://open.kattis.com/problems/scenes","section":"4.7b","topic":"Counting Paths, Easier","hint":"s: (pos, ribbon_left); t: try all possible heights; ignore the flat scenes first and subtract those cases at the end","dacu":407,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00590","title":null,"url":"https://onlinejudge.org/external/5/590.pdf","section":"4.7c","topic":"Conversion to DAG","hint":"s: (pos; day_left)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10913","title":null,"url":"https://onlinejudge.org/external/109/10913.pdf","section":"4.7c","topic":"Conversion to DAG","hint":"s: (r; c; neg_left; stat); t: down/(left/right)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12875","title":null,"url":"https://onlinejudge.org/external/128/12875.pdf","section":"4.7c","topic":"Conversion to DAG","hint":"LA 6853 - Bangkok14; similar to UVa 10702; s: (cur_store; cur_concert); t: pick any next store for next concert","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cardmagic","title":"cardmagic","url":"https://open.kattis.com/problems/cardmagic","section":"4.7c","topic":"Conversion to DAG","hint":"s: (deck, tgt_left); t: val 1 to K ≤ tgt_left","dacu":133,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"drinkresponsibly","title":"drinkresponsibly","url":"https://open.kattis.com/problems/drinkresponsibly","section":"4.7c","topic":"Conversion to DAG","hint":"s: (cur_drink, money_left, u_left); be careful with precision errors; print solution","dacu":98,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"maximizingwinnings","title":"maximizingwinnings","url":"https://open.kattis.com/problems/maximizingwinnings","section":"4.7c","topic":"Conversion to DAG","hint":"separate the maximizing and minimizing problem; s: (cur_room, turns_left); t: go to other room or stay","dacu":193,"points":3.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00536","title":null,"url":"https://onlinejudge.org/external/5/536.pdf","section":"4.7d","topic":"Tree","hint":"reconstructing binary tree from preorder and inorder binary tree traversal","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11695","title":null,"url":"https://onlinejudge.org/external/116/11695.pdf","section":"4.7d","topic":"Tree","hint":"cut the worst edge along the tree diameter; link two centers; also available at Kattis - flight","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12347","title":null,"url":"https://onlinejudge.org/external/123/12347.pdf","section":"4.7d","topic":"Tree","hint":"given pre-order traversal of a BST; use BST property to get the BST; output the post-order traversal that BST","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12379","title":null,"url":"https://onlinejudge.org/external/123/12379.pdf","section":"4.7d","topic":"Tree","hint":"find the diameter of tree first; we only traverse the diameter once and we traverse the other edges twice","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"adjoin","title":"adjoin","url":"https://open.kattis.com/problems/adjoin","section":"4.7d","topic":"Tree","hint":"the key parts are finding tree diameter and its center (along that diameter); also see UVa 11695","dacu":373,"points":5.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"flight","title":"flight","url":"https://open.kattis.com/problems/flight","section":"4.7d","topic":"Tree","hint":"cut the worst edge along the tree diameter; link two centers; also available at UVa 11695 - Flight Planning","dacu":46,"points":6.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1466","title":"Reorder Routes to Make All Paths Lead to the City Zero","url":"https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/","section":"4.7d","topic":"Tree","hint":"create undirected tree; traverse from the root 0 to identify the answers; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"tourists","title":"tourists","url":"https://open.kattis.com/problems/tourists","section":"4.7d","topic":"Tree","hint":"APSP on Tree (special requirements); LCA","dacu":431,"points":3.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00670","title":null,"url":"https://onlinejudge.org/external/6/670.pdf","section":"4.7e","topic":"Bipartite Graph","hint":"MCBM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11138","title":null,"url":"https://onlinejudge.org/external/111/11138.pdf","section":"4.7e","topic":"Bipartite Graph","hint":"a pure MCBM problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12644","title":null,"url":"https://onlinejudge.org/external/126/12644.pdf","section":"4.7e","topic":"Bipartite Graph","hint":"classic MCBM problem wrapped inside a creative problem statement","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12668","title":null,"url":"https://onlinejudge.org/external/126/12668.pdf","section":"4.7e","topic":"Bipartite Graph","hint":"LA 6525 - LatinAmerica13; split rows/columns due to the presence of pawns; then run MCBM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bookclub","title":"bookclub","url":"https://open.kattis.com/problems/bookclub","section":"4.7e","topic":"Bipartite Graph","hint":"check if perfect MCBM is possible","dacu":307,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"escapeplan","title":"escapeplan","url":"https://open.kattis.com/problems/escapeplan","section":"4.7e","topic":"Bipartite Graph","hint":"left set: robots; right set: holes; 3 version of similar bipartite graphs; MCBM","dacu":98,"points":5.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"flippingcards","title":"flippingcards","url":"https://open.kattis.com/problems/flippingcards","section":"4.7e","topic":"Bipartite Graph","hint":"left set: n card numbers; right set: 2*n picture numbers; possible if MCBM = n; need fast algorithm","dacu":169,"points":7,"cp5":false,"solved":false},{"judge":"UVa","id":"00291","title":null,"url":"https://onlinejudge.org/external/2/291.pdf","section":"4.7f","topic":"Eulerian Graph","hint":"Euler tour on a small graph; backtracking is sufficient","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10054","title":null,"url":"https://onlinejudge.org/external/100/10054.pdf","section":"4.7f","topic":"Eulerian Graph","hint":"printing the Euler tour","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10203","title":null,"url":"https://onlinejudge.org/external/102/10203.pdf","section":"4.7f","topic":"Eulerian Graph","hint":"the underlying graph is Euler graph","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10596","title":null,"url":"https://onlinejudge.org/external/105/10596.pdf","section":"4.7f","topic":"Eulerian Graph","hint":"Euler Graph property check","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"catenyms","title":"catenyms","url":"https://open.kattis.com/problems/catenyms","section":"4.7f","topic":"Eulerian Graph","hint":"Euler graph property check; 26 vertices; directed non simple graph; printing the Euler tour in lexicographic order","dacu":67,"points":7.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"eulerianpath","title":"eulerianpath","url":"https://open.kattis.com/problems/eulerianpath","section":"4.7f","topic":"Eulerian Graph","hint":"Euler graph property check; directed graph; printing the Euler tour","dacu":219,"points":5.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"railroad2","title":"railroad2","url":"https://open.kattis.com/problems/railroad2","section":"4.7f","topic":"Eulerian Graph","hint":"x-shaped level junctions have even degrees - ignore X; y-shaped switches have degree 3 - Y has to be even","dacu":2188,"points":1.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0102","title":"Binary Tree Level Order Traversal","url":"https://leetcode.com/problems/binary-tree-level-order-traversal/","section":"4.7g","topic":"BT Exercises, H","hint":"BFS; expand frontier; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0111","title":"Minimum Depth of Binary Tree","url":"https://leetcode.com/problems/minimum-depth-of-binary-tree/","section":"4.7g","topic":"BT Exercises, H","hint":"BFS until there is a leaf","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0199","title":"Binary Tree Right Side View","url":"https://leetcode.com/problems/binary-tree-right-side-view/","section":"4.7g","topic":"BT Exercises, H","hint":"BFS; last item per level; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0429","title":"N-ary Tree Level Order Traversal","url":"https://leetcode.com/problems/n-ary-tree-level-order-traversal/","section":"4.7g","topic":"BT Exercises, H","hint":"BFS on n-ary tree","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1161","title":"Maximum Level Sum of a Binary Tree","url":"https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree/","section":"4.7g","topic":"BT Exercises, H","hint":"BFS; max level sum; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc1609","title":"Even Odd Tree","url":"https://leetcode.com/problems/even-odd-tree/","section":"4.7g","topic":"BT Exercises, H","hint":"BFS; with custom ordering rules","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"12004","title":null,"url":"https://onlinejudge.org/external/120/12004.pdf","section":"5.2a","topic":"Finding Formula, Easier","hint":"try small n; get the pattern; use long long","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12918","title":null,"url":"https://onlinejudge.org/external/129/12918.pdf","section":"5.2a","topic":"Finding Formula, Easier","hint":"sum of arithmetic progression; long long","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"averageshard","title":"averageshard","url":"https://open.kattis.com/problems/averageshard","section":"5.2a","topic":"Finding Formula, Easier","hint":"find O(n) formula; also see Kattis - averageseasy","dacu":605,"points":2.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"bishops","title":"bishops","url":"https://open.kattis.com/problems/bishops","section":"5.2a","topic":"Finding Formula, Easier","hint":"chess pattern involving bishops; from IPSC 2004","dacu":1185,"points":2.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"crne","title":"crne","url":"https://open.kattis.com/problems/crne","section":"5.2a","topic":"Finding Formula, Easier","hint":"simulate cutting process on small numbers; get formula","dacu":477,"points":2.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1523","title":"Count Odd Numbers in an Interval Range","url":"https://leetcode.com/problems/count-odd-numbers-in-an-interval-range/","section":"5.2a","topic":"Finding Formula, Easier","hint":"simple formula; inclusion-exclusion; programming-skills","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc2413","title":"Smallest Even Multiple","url":"https://leetcode.com/problems/smallest-even-multiple/","section":"5.2a","topic":"Finding Formula, Easier","hint":"a simple number theory; n or 2n","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"twostones","title":"twostones","url":"https://open.kattis.com/problems/twostones","section":"5.2a","topic":"Finding Formula, Easier","hint":"just check odd or even","dacu":15317,"points":1.3,"cp5":false,"solved":false},{"judge":"UVa","id":"10161","title":null,"url":"https://onlinejudge.org/external/101/10161.pdf","section":"5.2b","topic":"Finding Formula, Harder","hint":"sqrt and ceil","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11038","title":null,"url":"https://onlinejudge.org/external/110/11038.pdf","section":"5.2b","topic":"Finding Formula, Harder","hint":"define a function f that counts the number of 0s from 1 to n; also available at Kattis - howmanyzeros","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11718","title":null,"url":"https://onlinejudge.org/external/117/11718.pdf","section":"5.2b","topic":"Finding Formula, Harder","hint":"convert loops to a closed form formula; use modPow to compute the results","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0781","title":"Rabbits in Forest","url":"https://leetcode.com/problems/rabbits-in-forest/","section":"5.2b","topic":"Finding Formula, Harder","hint":"count the answer frequencies; for each answer k, group the rabbits into size k+1","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"mortgage","title":"mortgage","url":"https://open.kattis.com/problems/mortgage","section":"5.2b","topic":"Finding Formula, Harder","hint":"geometric progression; divergent but finite; special case when r = 1.0 (no interest)","dacu":51,"points":7.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"neighborhoodwatch","title":"neighborhoodwatch","url":"https://open.kattis.com/problems/neighborhoodwatch","section":"5.2b","topic":"Finding Formula, Harder","hint":"sum of AP; inclusion-exclusion","dacu":319,"points":3.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"nine","title":"nine","url":"https://open.kattis.com/problems/nine","section":"5.2b","topic":"Finding Formula, Harder","hint":"find the required formula","dacu":681,"points":3.2,"cp5":false,"solved":false},{"judge":"UVa","id":"00389","title":null,"url":"https://onlinejudge.org/external/3/389.pdf","section":"5.2c","topic":"Base Number Conversion","hint":"use Java Integer class","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11952","title":null,"url":"https://onlinejudge.org/external/119/11952.pdf","section":"5.2c","topic":"Base Number Conversion","hint":"check base 2 to 18; special case for base 1","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"allaboutthatbase","title":"allaboutthatbase","url":"https://open.kattis.com/problems/allaboutthatbase","section":"5.2c","topic":"Base Number Conversion","hint":"check base 1 to 36; base 1 is special; Big Integer","dacu":927,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"arithmetic","title":"arithmetic","url":"https://open.kattis.com/problems/arithmetic","section":"5.2c","topic":"Base Number Conversion","hint":"conversion of octal (per 4 bits) to hexa (per 3 bits); be careful with leading zeroes","dacu":726,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"basicremains","title":"basicremains","url":"https://open.kattis.com/problems/basicremains","section":"5.2c","topic":"Base Number Conversion","hint":"also involving Big Integer modulo; also available at UVa 10551 - Basic Remains","dacu":174,"points":3.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0067","title":"Add Binary","url":"https://leetcode.com/problems/add-binary/","section":"5.2c","topic":"Base Number Conversion","hint":"convert a and b from bin to dec; add them; convert back; programming-skills; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"oktalni","title":"oktalni","url":"https://open.kattis.com/problems/oktalni","section":"5.2c","topic":"Base Number Conversion","hint":"convert each 3-bits of binary strings to octal; Big Integer","dacu":634,"points":1.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00575","title":null,"url":"https://onlinejudge.org/external/5/575.pdf","section":"5.2d","topic":"Base Number Variants","hint":"base modification","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10931","title":null,"url":"https://onlinejudge.org/external/109/10931.pdf","section":"5.2d","topic":"Base Number Variants","hint":"convert decimal to binary; count number of 1s","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11121","title":null,"url":"https://onlinejudge.org/external/111/11121.pdf","section":"5.2d","topic":"Base Number Variants","hint":"search for the term 'negabinary'","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"aliennumbers","title":"aliennumbers","url":"https://open.kattis.com/problems/aliennumbers","section":"5.2d","topic":"Base Number Variants","hint":"source base to decimal; decimal to target base","dacu":1050,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"ignore","title":"ignore","url":"https://open.kattis.com/problems/ignore","section":"5.2d","topic":"Base Number Variants","hint":"actually a base 7 conversion problem as only 7 digits are meaningful when rotated","dacu":268,"points":3.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2595","title":"Number of Even and Odd Bits","url":"https://leetcode.com/problems/number-of-even-and-odd-bits/","section":"5.2d","topic":"Base Number Variants","hint":"convert n from base 10 to 2; process","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"mixedbasearithmetic","title":"mixedbasearithmetic","url":"https://open.kattis.com/problems/mixedbasearithmetic","section":"5.2d","topic":"Base Number Variants","hint":"mix of base 10 and two versions of base 26","dacu":54,"points":5.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00443","title":null,"url":"https://onlinejudge.org/external/4/443.pdf","section":"5.2e","topic":"Number Systems/Seqs","hint":"try all 2^i * 3^j * 5^k * 7^l; sort","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11970","title":null,"url":"https://onlinejudge.org/external/119/11970.pdf","section":"5.2e","topic":"Number Systems/Seqs","hint":"square numbers; divisibility; brute force","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"candlebox","title":"candlebox","url":"https://open.kattis.com/problems/candlebox","section":"5.2e","topic":"Number Systems/Seqs","hint":"sum of arithmetic series [1..N]; -6 for Rita or -3 for Theo; brute force Rita's age; also available at UVa 13161 - Candl...","dacu":448,"points":2.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"collatz","title":"collatz","url":"https://open.kattis.com/problems/collatz","section":"5.2e","topic":"Number Systems/Seqs","hint":"similar to UVa 00694; just do as asked","dacu":757,"points":3.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc3099","title":"Harshad Number","url":"https://leetcode.com/problems/harshad-number/","section":"5.2e","topic":"Number Systems/Seqs","hint":"compute sum of digits; check as asked","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"permutedarithmeticsequence","title":"permutedarithmeticsequence","url":"https://open.kattis.com/problems/permutedarithmeticsequence","section":"5.2e","topic":"Number Systems/Seqs","hint":"sort differences of adjacent items","dacu":1262,"points":2,"cp5":false,"solved":false},{"judge":"Kattis","id":"rationalsequence","title":"rationalsequence","url":"https://open.kattis.com/problems/rationalsequence","section":"5.2e","topic":"Number Systems/Seqs","hint":"pattern finding; tree traversal on a special tree","dacu":458,"points":4.6,"cp5":false,"solved":false},{"judge":"UVa","id":"11384","title":null,"url":"https://onlinejudge.org/external/113/11384.pdf","section":"5.2f","topic":"Log, Exp, Pow","hint":"find the smallest power of two greater than n; can be solved easily using ceil(eps log2(n))","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11847","title":null,"url":"https://onlinejudge.org/external/118/11847.pdf","section":"5.2f","topic":"Log, Exp, Pow","hint":"O(1) math formula exists: floor(log2(n))","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cokolada","title":"cokolada","url":"https://open.kattis.com/problems/cokolada","section":"5.2f","topic":"Log, Exp, Pow","hint":"the answers involve powers of two and a simulation","dacu":605,"points":2.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"factstone","title":"factstone","url":"https://open.kattis.com/problems/factstone","section":"5.2f","topic":"Log, Exp, Pow","hint":"use logarithm; power; also available at UVa 10916 - Factstone Benchmark","dacu":200,"points":3.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0231","title":"Power of Two","url":"https://leetcode.com/problems/power-of-two/","section":"5.2f","topic":"Log, Exp, Pow","hint":"n ≤ 0 is False; log2 and exp test","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"lemonadetrade","title":"lemonadetrade","url":"https://open.kattis.com/problems/lemonadetrade","section":"5.2f","topic":"Log, Exp, Pow","hint":"use log transformation technique; linear pass","dacu":82,"points":5.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"thebackslashproblem","title":"thebackslashproblem","url":"https://open.kattis.com/problems/thebackslashproblem","section":"5.2f","topic":"Log, Exp, Pow","hint":"actually power of two","dacu":349,"points":2.2,"cp5":false,"solved":false},{"judge":"UVa","id":"00264","title":null,"url":"https://onlinejudge.org/external/2/264.pdf","section":"5.2g","topic":"Grid","hint":"grid; pattern","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10022","title":null,"url":"https://onlinejudge.org/external/100/10022.pdf","section":"5.2g","topic":"Grid","hint":"this is not an SSSP problem; find the pattern in this grid (triangle)-like system","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10182","title":null,"url":"https://onlinejudge.org/external/101/10182.pdf","section":"5.2g","topic":"Grid","hint":"grid","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10233","title":null,"url":"https://onlinejudge.org/external/102/10233.pdf","section":"5.2g","topic":"Grid","hint":"the number of items in row forms arithmetic progression series; use hypot","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"beehouseperimeter","title":"beehouseperimeter","url":"https://open.kattis.com/problems/beehouseperimeter","section":"5.2g","topic":"Grid","hint":"transform the hexagonal grid like Kattis - honeyheist; flood fill from outside Alice's house; count #walls touched","dacu":155,"points":4,"cp5":false,"solved":false},{"judge":"Kattis","id":"honeyheist","title":"honeyheist","url":"https://open.kattis.com/problems/honeyheist","section":"5.2g","topic":"Grid","hint":"transform the hexagonal grid input into 2D grid first; then run SSSP on unweighted graph; BFS","dacu":135,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"maptiles2","title":"maptiles2","url":"https://open.kattis.com/problems/maptiles2","section":"5.2g","topic":"Grid","hint":"simple conversion between two grid indexing systems","dacu":1338,"points":1.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00930","title":null,"url":"https://onlinejudge.org/external/9/930.pdf","section":"5.2h","topic":"Polynomial","hint":"Ruffini's rule; roots of quadratic eq","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10268","title":null,"url":"https://onlinejudge.org/external/102/10268.pdf","section":"5.2h","topic":"Polynomial","hint":"polynomial derivation; Horner's rule","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10302","title":null,"url":"https://onlinejudge.org/external/103/10302.pdf","section":"5.2h","topic":"Polynomial","hint":"use long double","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10586","title":null,"url":"https://onlinejudge.org/external/105/10586.pdf","section":"5.2h","topic":"Polynomial","hint":"compute number of prime factors of each integer in the desired range; use 1D RSQ DP; binary search","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"ada","title":"ada","url":"https://open.kattis.com/problems/ada","section":"5.2h","topic":"Polynomial","hint":"polynomial problem; apply the given procedure recursively","dacu":346,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"curvyblocks","title":"curvyblocks","url":"https://open.kattis.com/problems/curvyblocks","section":"5.2h","topic":"Polynomial","hint":"differentiate degree 3 to degree 2 polynomial; get roots of quadratic equation; the two blocks will touch at either root...","dacu":89,"points":4.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"plot","title":"plot","url":"https://open.kattis.com/problems/plot","section":"5.2h","topic":"Polynomial","hint":"analyze the given pseudocode; the required pattern involves Binomial Coefficients","dacu":210,"points":2.5,"cp5":false,"solved":false},{"judge":"UVa","id":"00332","title":null,"url":"https://onlinejudge.org/external/3/332.pdf","section":"5.2i","topic":"Fractions","hint":"use GCD","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00834","title":null,"url":"https://onlinejudge.org/external/8/834.pdf","section":"5.2i","topic":"Fractions","hint":"do as asked","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12068","title":null,"url":"https://onlinejudge.org/external/120/12068.pdf","section":"5.2i","topic":"Fractions","hint":"involving fraction; use LCM and GCD","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"deadfraction","title":"deadfraction","url":"https://open.kattis.com/problems/deadfraction","section":"5.2i","topic":"Fractions","hint":"try every single possible repeating decimals; also available at UVa 10555 - Dead Fraction","dacu":153,"points":4.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"fraction","title":"fraction","url":"https://open.kattis.com/problems/fraction","section":"5.2i","topic":"Fractions","hint":"continued fraction to normal fraction and vice versa","dacu":154,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"mixedfractions","title":"mixedfractions","url":"https://open.kattis.com/problems/mixedfractions","section":"5.2i","topic":"Fractions","hint":"convert fraction to mixed fraction","dacu":5154,"points":1.5,"cp5":false,"solved":true},{"judge":"Kattis","id":"thermostat","title":"thermostat","url":"https://open.kattis.com/problems/thermostat","section":"5.2i","topic":"Fractions","hint":"convert one temperature to another; use fraction; use Java BigInteger; gcd","dacu":81,"points":3.4,"cp5":false,"solved":false},{"judge":"UVa","id":"00496","title":null,"url":"https://onlinejudge.org/external/4/496.pdf","section":"5.2j","topic":"Really Ad Hoc","hint":"set manipulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11241","title":null,"url":"https://onlinejudge.org/external/112/11241.pdf","section":"5.2j","topic":"Really Ad Hoc","hint":"the hardest case is computing Dew point given temperature and Humidex; derive it with Algebra","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12036","title":null,"url":"https://onlinejudge.org/external/120/12036.pdf","section":"5.2j","topic":"Really Ad Hoc","hint":"use pigeon hole principle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0598","title":"Range Addition II","url":"https://leetcode.com/problems/range-addition-ii/","section":"5.2j","topic":"Really Ad Hoc","hint":"keep the largest upper-left rectangle size","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"matrix","title":"matrix","url":"https://open.kattis.com/problems/matrix","section":"5.2j","topic":"Really Ad Hoc","hint":"use simple linear algebra; one special case when c = 0","dacu":784,"points":3.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"trip","title":"trip","url":"https://open.kattis.com/problems/trip","section":"5.2j","topic":"Really Ad Hoc","hint":"be careful with precision error; also available at UVa 10137 - The Trip","dacu":103,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"yoda","title":"yoda","url":"https://open.kattis.com/problems/yoda","section":"5.2j","topic":"Really Ad Hoc","hint":"ad hoc; 9 digits comparison","dacu":1607,"points":2.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00543","title":null,"url":"https://onlinejudge.org/external/5/543.pdf","section":"5.3a","topic":"Prime Numbers","hint":"sieve; complete search; Goldbach's conjecture; similar to UVa 00686, 10311, and 10948","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01644","title":null,"url":"https://onlinejudge.org/external/16/1644.pdf","section":"5.3a","topic":"Prime Numbers","hint":"LA 3883 - Tokyo07; sieve; prime check; upper bound - lower bound","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10650","title":null,"url":"https://onlinejudge.org/external/106/10650.pdf","section":"5.3a","topic":"Prime Numbers","hint":"3 uni-distance consecutive primes","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"enlarginghashtables","title":"enlarginghashtables","url":"https://open.kattis.com/problems/enlarginghashtables","section":"5.3a","topic":"Prime Numbers","hint":"use sieve up to 40 000; prime test numbers greater than 2n; check primality of n itself","dacu":448,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"primesieve","title":"primesieve","url":"https://open.kattis.com/problems/primesieve","section":"5.3a","topic":"Prime Numbers","hint":"use sieve up to 10^8; it is fast enough","dacu":865,"points":4.5,"cp5":false,"solved":true},{"judge":"Kattis","id":"reseto","title":"reseto","url":"https://open.kattis.com/problems/reseto","section":"5.3a","topic":"Prime Numbers","hint":"sieve of Eratosthenes until the k-th crossing","dacu":460,"points":2.7,"cp5":false,"solved":true},{"judge":"UVa","id":"01180","title":null,"url":"https://onlinejudge.org/external/11/1180.pdf","section":"5.3b","topic":"(Prob) Prime Testing","hint":"LA 2350 - Dhaka01; small prime check","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01210","title":null,"url":"https://onlinejudge.org/external/12/1210.pdf","section":"5.3b","topic":"(Prob) Prime Testing","hint":"LA 3399 - Tokyo05; simple","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"flowergarden","title":"flowergarden","url":"https://open.kattis.com/problems/flowergarden","section":"5.3b","topic":"(Prob) Prime Testing","hint":"Euclidean dist; small prime check; use isProbablePrime; simulation; faster solutions exist","dacu":317,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"goldbach2","title":"goldbach2","url":"https://open.kattis.com/problems/goldbach2","section":"5.3b","topic":"(Prob) Prime Testing","hint":"simple brute force problem; use isProbablePrime; faster solutions exist","dacu":1219,"points":2.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2614","title":"Prime In Diagonal","url":"https://leetcode.com/problems/prime-in-diagonal/","section":"5.3b","topic":"(Prob) Prime Testing","hint":"check primes (Java isProbablePrime works) along the diagonals","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"primes2","title":"primes2","url":"https://open.kattis.com/problems/primes2","section":"5.3b","topic":"(Prob) Prime Testing","hint":"convert input to either base 2/8/10/16; skip those that cause NumberFormatException error; use isProbablePrime test and ...","dacu":289,"points":4.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"pseudoprime","title":"pseudoprime","url":"https://open.kattis.com/problems/pseudoprime","section":"5.3b","topic":"(Prob) Prime Testing","hint":"yes if !isPrime(p) && a.modPow(p, p) = a; Big Integer; also available at UVa 11287 - Pseudoprime Numbers","dacu":347,"points":3.5,"cp5":false,"solved":false},{"judge":"UVa","id":"00583","title":null,"url":"https://onlinejudge.org/external/5/583.pdf","section":"5.3c","topic":"Finding Prime Factors","hint":"basic factorization problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11466","title":null,"url":"https://onlinejudge.org/external/114/11466.pdf","section":"5.3c","topic":"Finding Prime Factors","hint":"use efficient sieve implementation to get the largest prime factors","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12703","title":null,"url":"https://onlinejudge.org/external/127/12703.pdf","section":"5.3c","topic":"Finding Prime Factors","hint":"uses small Fibonacci numbers up to 40 and simple prime factorization as a and b can be non-primes","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12805","title":null,"url":"https://onlinejudge.org/external/128/12805.pdf","section":"5.3c","topic":"Finding Prime Factors","hint":"prime check; primes of format 4m-1 and 4m plus 1; simple prime factorization","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"pascal","title":"pascal","url":"https://open.kattis.com/problems/pascal","section":"5.3c","topic":"Finding Prime Factors","hint":"find lowest prime factor of N; special case: N = 1","dacu":351,"points":3.8,"cp5":false,"solved":true},{"judge":"Kattis","id":"primalrepresentation","title":"primalrepresentation","url":"https://open.kattis.com/problems/primalrepresentation","section":"5.3c","topic":"Finding Prime Factors","hint":"factorization problem; use sieve to avoid TLE; use long long; 231-1 is a prime","dacu":258,"points":5.4,"cp5":false,"solved":true},{"judge":"Kattis","id":"primereduction","title":"primereduction","url":"https://open.kattis.com/problems/primereduction","section":"5.3c","topic":"Finding Prime Factors","hint":"factorization problem","dacu":465,"points":3.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00294","title":null,"url":"https://onlinejudge.org/external/2/294.pdf","section":"5.3d","topic":"Prime Factors Functions","hint":"numDiv(N)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10179","title":null,"url":"https://onlinejudge.org/external/101/10179.pdf","section":"5.3d","topic":"Prime Factors Functions","hint":"EulerPhi(N)","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"UVa","id":"11353","title":null,"url":"https://onlinejudge.org/external/113/11353.pdf","section":"5.3d","topic":"Prime Factors Functions","hint":"numPF(N); sort variant","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11728","title":null,"url":"https://onlinejudge.org/external/117/11728.pdf","section":"5.3d","topic":"Prime Factors Functions","hint":"sumDiv(N)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"almostperfect","title":"almostperfect","url":"https://open.kattis.com/problems/almostperfect","section":"5.3d","topic":"Prime Factors Functions","hint":"sumDiv(N)-N; minor variation","dacu":1507,"points":3.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"divisors","title":"divisors","url":"https://open.kattis.com/problems/divisors","section":"5.3d","topic":"Prime Factors Functions","hint":"return numDiv(nCk); but do not compute nCk directly; work with its prime factors","dacu":208,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"relatives","title":"relatives","url":"https://open.kattis.com/problems/relatives","section":"5.3d","topic":"Prime Factors Functions","hint":"EulerPhi(N); also available at UVa 10299 - Relatives","dacu":231,"points":3.8,"cp5":false,"solved":false},{"judge":"UVa","id":"10699","title":null,"url":"https://onlinejudge.org/external/106/10699.pdf","section":"5.3e","topic":"Modified Sieve","hint":"numDiffPF(N) for a range","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10990","title":null,"url":"https://onlinejudge.org/external/109/10990.pdf","section":"5.3e","topic":"Modified Sieve","hint":"modified sieve to compute a range of Euler Phi values; use DP to compute depth Phi values; then finally use Max 1D Range...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11426","title":null,"url":"https://onlinejudge.org/external/114/11426.pdf","section":"5.3e","topic":"Modified Sieve","hint":"pre-calculate EulerPhi(N)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12043","title":null,"url":"https://onlinejudge.org/external/120/12043.pdf","section":"5.3e","topic":"Modified Sieve","hint":"sumDiv(N) and numDiv(N); brute force","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"data","title":"data","url":"https://open.kattis.com/problems/data","section":"5.3e","topic":"Modified Sieve","hint":"numDiffPF(V) for V up to N x 1000; Brute force combination/all subsets; DP Subset","dacu":68,"points":5.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"farey","title":"farey","url":"https://open.kattis.com/problems/farey","section":"5.3e","topic":"Modified Sieve","hint":"pre-calculate EulerPhi(N); do prefix sum (1D RSQ) of EulerPhi(N) from 1 to each N; the answer is related to this value","dacu":257,"points":3.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"nonprimefactors","title":"nonprimefactors","url":"https://open.kattis.com/problems/nonprimefactors","section":"5.3e","topic":"Modified Sieve","hint":"numDiv(i) - numDiffPF(i) ∀i in the range; the I/O files are large so Buffered I/O speed is needed","dacu":389,"points":5.6,"cp5":false,"solved":false},{"judge":"UVa","id":"10407","title":null,"url":"https://onlinejudge.org/external/104/10407.pdf","section":"5.3f","topic":"GCD and/or LCM","hint":"subtract the set s with s[0]; find gcd","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11388","title":null,"url":"https://onlinejudge.org/external/113/11388.pdf","section":"5.3f","topic":"GCD and/or LCM","hint":"understand the relationship of GCD with LCM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11417","title":null,"url":"https://onlinejudge.org/external/114/11417.pdf","section":"5.3f","topic":"GCD and/or LCM","hint":"just use brute force as input is small","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"jackpot","title":"jackpot","url":"https://open.kattis.com/problems/jackpot","section":"5.3f","topic":"GCD and/or LCM","hint":"similar to Kattis - smallestmultiple; use Java BigInteger or other faster solutions","dacu":379,"points":3.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc3411","title":"Maximum Subarray With Equal Products","url":"https://leetcode.com/problems/maximum-subarray-with-equal-products/","section":"5.3f","topic":"GCD and/or LCM","hint":"complete search; compute product, GCD, and LCM of all subarrays","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"prsteni","title":"prsteni","url":"https://open.kattis.com/problems/prsteni","section":"5.3f","topic":"GCD and/or LCM","hint":"GCD of first circle radius with subsequent circle radiuses","dacu":993,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"smallestmultiple","title":"smallestmultiple","url":"https://open.kattis.com/problems/smallestmultiple","section":"5.3f","topic":"GCD and/or LCM","hint":"simple LCMs of all numbers; use Java BigInteger to be safe","dacu":335,"points":3.5,"cp5":false,"solved":false},{"judge":"UVa","id":"12335","title":null,"url":"https://onlinejudge.org/external/123/12335.pdf","section":"5.3g","topic":"Factorial","hint":"given the k-th permutation, recover the 1st permutation; use factorial; use Java BigInteger","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12869","title":null,"url":"https://onlinejudge.org/external/128/12869.pdf","section":"5.3g","topic":"Factorial","hint":"LA 6847 - Bangkok 2014; every zero in factorial(n) is due to multiplication of factor 2 and 5; factor 2 grows faster tha...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"inversefactorial","title":"inversefactorial","url":"https://open.kattis.com/problems/inversefactorial","section":"5.3g","topic":"Factorial","hint":"good problem; number of digits in factorial","dacu":1059,"points":5.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"loworderzeros","title":"loworderzeros","url":"https://open.kattis.com/problems/loworderzeros","section":"5.3g","topic":"Factorial","hint":"last non zero digit of factorial; classic","dacu":288,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"namethatpermutation","title":"namethatpermutation","url":"https://open.kattis.com/problems/namethatpermutation","section":"5.3g","topic":"Factorial","hint":"permutation number; involving factorial","dacu":154,"points":4.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"tutorial","title":"tutorial","url":"https://open.kattis.com/problems/tutorial","section":"5.3g","topic":"Factorial","hint":"factorial is just part of the problem; pruning","dacu":1249,"points":2.8,"cp5":false,"solved":false},{"judge":"UVa","id":"10680","title":null,"url":"https://onlinejudge.org/external/106/10680.pdf","section":"5.3h","topic":"Working with PFs","hint":"use primefactors([1..N]) to get LCM(1; 2; ...; N)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11347","title":null,"url":"https://onlinejudge.org/external/113/11347.pdf","section":"5.3h","topic":"Working with PFs","hint":"prime-power factorization; numDiv(N)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11395","title":null,"url":"https://onlinejudge.org/external/113/11395.pdf","section":"5.3h","topic":"Working with PFs","hint":"key hint: a square number multiplied by powers of two; i.e. 2^k * i^2 for k >= 0; i >= 1 has odd sum of divisors","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"consecutivesums","title":"consecutivesums","url":"https://open.kattis.com/problems/consecutivesums","section":"5.3h","topic":"Working with PFs","hint":"work with factor; sum of Arithmetic Progression series","dacu":239,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"factovisors","title":"factovisors","url":"https://open.kattis.com/problems/factovisors","section":"5.3h","topic":"Working with PFs","hint":"factorize m; see if it has support in n!; Legendre's formula; also available at UVa 10139 - Factovisors","dacu":373,"points":6.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"iks","title":"iks","url":"https://open.kattis.com/problems/iks","section":"5.3h","topic":"Working with PFs","hint":"sieve of Eratosthenes; prime factorize each number; spread the factors around to maximize final GCD/minimize total opera...","dacu":115,"points":3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0172","title":"Factorial Trailing Zeroes","url":"https://leetcode.com/problems/factorial-trailing-zeroes/","section":"5.3h","topic":"Working with PFs","hint":"count number of prime factor 5; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2761","title":"Prime Pairs With Target Sum","url":"https://leetcode.com/problems/prime-pairs-with-target-sum/","section":"5.3h","topic":"Working with PFs","hint":"sieve up to 1000; do prime tests","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"10174","title":null,"url":"https://onlinejudge.org/external/101/10174.pdf","section":"5.3i","topic":"Modular Arithmetic","hint":"no Spinster number","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10176","title":null,"url":"https://onlinejudge.org/external/101/10176.pdf","section":"5.3i","topic":"Modular Arithmetic","hint":"convert binary to decimal digit by digit; do modulo 131071 to the intermediate result","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10212","title":null,"url":"https://onlinejudge.org/external/102/10212.pdf","section":"5.3i","topic":"Modular Arithmetic","hint":"multiply numbers from N down to N-M+1; use / 10 to discard the trailing zero(es); use % 1 Billion","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10489","title":null,"url":"https://onlinejudge.org/external/104/10489.pdf","section":"5.3i","topic":"Modular Arithmetic","hint":"keep values small with modulo","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"anothercandies","title":"anothercandies","url":"https://open.kattis.com/problems/anothercandies","section":"5.3i","topic":"Modular Arithmetic","hint":"simple modular arithmetic","dacu":1843,"points":2.7,"cp5":false,"solved":true},{"judge":"Kattis","id":"ones","title":"ones","url":"https://open.kattis.com/problems/ones","section":"5.3i","topic":"Modular Arithmetic","hint":"no factor of 2 and 5 implies that there is no trailing zero; also available at UVa 10127 - Ones","dacu":567,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"threedigits","title":"threedigits","url":"https://open.kattis.com/problems/threedigits","section":"5.3i","topic":"Modular Arithmetic","hint":"simulate factorial computation; remove trailing zeroes; keep many last few non-zero digits using modulo","dacu":289,"points":5.9,"cp5":false,"solved":false},{"judge":"UVa","id":"10090","title":null,"url":"https://onlinejudge.org/external/100/10090.pdf","section":"5.3j","topic":"Extended Euclid","hint":"use solution for Linear Diophantine Equation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10104","title":null,"url":"https://onlinejudge.org/external/101/10104.pdf","section":"5.3j","topic":"Extended Euclid","hint":"pure Ext Euclid problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10633","title":null,"url":"https://onlinejudge.org/external/106/10633.pdf","section":"5.3j","topic":"Extended Euclid","hint":"let C = N-M, N = 10a+b, and M = a; Linear Diophantine Equation: 9a+b = C","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10673","title":null,"url":"https://onlinejudge.org/external/106/10673.pdf","section":"5.3j","topic":"Extended Euclid","hint":"uses Extended Euclidean","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"candydistribution","title":"candydistribution","url":"https://open.kattis.com/problems/candydistribution","section":"5.3j","topic":"Extended Euclid","hint":"the problem boils down to finding C-1 (mod K); be careful when the answer is \"IMPOSSIBLE\" or ≤ K","dacu":199,"points":4.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"modulararithmetic","title":"modulararithmetic","url":"https://open.kattis.com/problems/modulararithmetic","section":"5.3j","topic":"Extended Euclid","hint":"the division operation requires modular inverse; use Extended Euclidean algorithm","dacu":333,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"soyoulikeyourfoodhot","title":"soyoulikeyourfoodhot","url":"https://open.kattis.com/problems/soyoulikeyourfoodhot","section":"5.3j","topic":"Extended Euclid","hint":"Linear Diophantine Equation; still solvable with brute force","dacu":103,"points":5.2,"cp5":false,"solved":false},{"judge":"UVa","id":"10922","title":null,"url":"https://onlinejudge.org/external/109/10922.pdf","section":"5.3k","topic":"Divisibility Test","hint":"test divisibility by 9","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10929","title":null,"url":"https://onlinejudge.org/external/109/10929.pdf","section":"5.3k","topic":"Divisibility Test","hint":"test divisibility by 11","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11344","title":null,"url":"https://onlinejudge.org/external/113/11344.pdf","section":"5.3k","topic":"Divisibility Test","hint":"use divisibility theory of [1..12]","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"divisible","title":"divisible","url":"https://open.kattis.com/problems/divisible","section":"5.3k","topic":"Divisibility Test","hint":"divisibility; linear pass algorithm","dacu":327,"points":4.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1952","title":"Three Divisors","url":"https://leetcode.com/problems/three-divisors/","section":"5.3k","topic":"Divisibility Test","hint":"divisibility test up to sqrt of n","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"meowfactor","title":"meowfactor","url":"https://open.kattis.com/problems/meowfactor","section":"5.3k","topic":"Divisibility Test","hint":"divisibility test of 9^ans; small range of ans","dacu":310,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"thinkingofanumber","title":"thinkingofanumber","url":"https://open.kattis.com/problems/thinkingofanumber","section":"5.3k","topic":"Divisibility Test","hint":"simple range; use min/max properly; then small divisibility tests","dacu":379,"points":3.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00763","title":null,"url":"https://onlinejudge.org/external/7/763.pdf","section":"5.4a","topic":"Fibonacci Numbers","hint":"Zeckendorf representation; greedy; Big Integer","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10689","title":null,"url":"https://onlinejudge.org/external/106/10689.pdf","section":"5.4a","topic":"Fibonacci Numbers","hint":"easy; Pisano period","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"anti11","title":"anti11","url":"https://open.kattis.com/problems/anti11","section":"5.4a","topic":"Fibonacci Numbers","hint":"this problem degenerates into a modified Fibonacci numbers","dacu":518,"points":2.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"batmanacci","title":"batmanacci","url":"https://open.kattis.com/problems/batmanacci","section":"5.4a","topic":"Fibonacci Numbers","hint":"Fibonacci; observation on N; Divide and Conquer","dacu":331,"points":3.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0070","title":"Climbing Stairs","url":"https://leetcode.com/problems/climbing-stairs/","section":"5.4a","topic":"Fibonacci Numbers","hint":"basically compute Fib(n+1); DP; top-100-liked; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc1137","title":"N-th Tribonacci Number","url":"https://leetcode.com/problems/n-th-tribonacci-number/","section":"5.4a","topic":"Fibonacci Numbers","hint":"basic Tribonacci; DP; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"rijeci","title":"rijeci","url":"https://open.kattis.com/problems/rijeci","section":"5.4a","topic":"Fibonacci Numbers","hint":"simple simulation with a single loop; Fibonacci","dacu":2478,"points":1.5,"cp5":false,"solved":false},{"judge":"UVa","id":"00369","title":null,"url":"https://onlinejudge.org/external/3/369.pdf","section":"5.4b","topic":"Binomial Coefficients","hint":"be careful with overflow issue","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10541","title":null,"url":"https://onlinejudge.org/external/105/10541.pdf","section":"5.4b","topic":"Binomial Coefficients","hint":"a good combinatorics problem","dacu":null,"points":0,"cp5":false,"solved":true},{"judge":"UVa","id":"11955","title":null,"url":"https://onlinejudge.org/external/119/11955.pdf","section":"5.4b","topic":"Binomial Coefficients","hint":"pure application; DP","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12712","title":null,"url":"https://onlinejudge.org/external/127/12712.pdf","section":"5.4b","topic":"Binomial Coefficients","hint":"the answer is sum i=M to N of C(L*L;i)*i!; but simplify the computation of this formula instead of running it directly","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"election","title":"election","url":"https://open.kattis.com/problems/election","section":"5.4b","topic":"Binomial Coefficients","hint":"compute the answers with help of binomial coefficients","dacu":213,"points":6.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0118","title":"Pascal's Triangle","url":"https://leetcode.com/problems/pascals-triangle/","section":"5.4b","topic":"Binomial Coefficients","hint":"basic bottom-up DP to generate Pascal's triangle; top-100-liked","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"lockedtreasure","title":"lockedtreasure","url":"https://open.kattis.com/problems/lockedtreasure","section":"5.4b","topic":"Binomial Coefficients","hint":"the answer is nCm-1","dacu":321,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"oddbinom","title":"oddbinom","url":"https://open.kattis.com/problems/oddbinom","section":"5.4b","topic":"Binomial Coefficients","hint":"OEIS A006046","dacu":245,"points":3.5,"cp5":false,"solved":false},{"judge":"UVa","id":"10007","title":null,"url":"https://onlinejudge.org/external/100/10007.pdf","section":"5.4c","topic":"Catalan Numbers","hint":"answer is Cat(n) * n!; BigInteger","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10223","title":null,"url":"https://onlinejudge.org/external/102/10223.pdf","section":"5.4c","topic":"Catalan Numbers","hint":"you can precalculate the answers as there are only 19 Catalan Numbers < 2^{32}-1","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10312","title":null,"url":"https://onlinejudge.org/external/103/10312.pdf","section":"5.4c","topic":"Catalan Numbers","hint":"number of binary bracketing = Cat(n); number of bracketing = Super-Catalan numbers","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"catalan","title":"catalan","url":"https://open.kattis.com/problems/catalan","section":"5.4c","topic":"Catalan Numbers","hint":"basic Catalan Numbers","dacu":521,"points":3.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"catalansquare","title":"catalansquare","url":"https://open.kattis.com/problems/catalansquare","section":"5.4c","topic":"Catalan Numbers","hint":"Catalan Numbers++; follow the description","dacu":507,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"fiat","title":"fiat","url":"https://open.kattis.com/problems/fiat","section":"5.4c","topic":"Catalan Numbers","hint":"N-th Catalan Number; use Fermat's little theorem","dacu":75,"points":6.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0096","title":"Unique Binary Search Trees","url":"https://leetcode.com/problems/unique-binary-search-trees/","section":"5.4c","topic":"Catalan Numbers","hint":"Catalan numbers; pre-calculateable 1 to 19","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"11310","title":null,"url":"https://onlinejudge.org/external/113/11310.pdf","section":"5.4d","topic":"Others, Easier","hint":"requires DP: let dp[i] be the number of ways the cakes can be packed for a box 2*i","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11401","title":null,"url":"https://onlinejudge.org/external/114/11401.pdf","section":"5.4d","topic":"Others, Easier","hint":"spot the pattern","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11597","title":null,"url":"https://onlinejudge.org/external/115/11597.pdf","section":"5.4d","topic":"Others, Easier","hint":"uses knowledge of graph theory; the answer is very trivial","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12463","title":null,"url":"https://onlinejudge.org/external/124/12463.pdf","section":"5.4d","topic":"Others, Easier","hint":"double the socks and the shoes to simplify the problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"character","title":"character","url":"https://open.kattis.com/problems/character","section":"5.4d","topic":"Others, Easier","hint":"OEIS A000295","dacu":841,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"honey","title":"honey","url":"https://open.kattis.com/problems/honey","section":"5.4d","topic":"Others, Easier","hint":"OEIS A002898","dacu":415,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"integerdivision","title":"integerdivision","url":"https://open.kattis.com/problems/integerdivision","section":"5.4d","topic":"Others, Easier","hint":"count frequencies of each remainder of [0..d-1]; add C(freq, 2) per such remainder","dacu":242,"points":3.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1175","title":"Prime Arrangements","url":"https://leetcode.com/problems/prime-arrangements/","section":"5.4d","topic":"Others, Easier","hint":"let k be number of primes up to n; output k! * (n-k)!, mod 10^9+7","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"01224","title":null,"url":"https://onlinejudge.org/external/12/1224.pdf","section":"5.4e","topic":"Others, Harder","hint":"LA 3904 - Seoul07; derive formula from observing the small instances first","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10784","title":null,"url":"https://onlinejudge.org/external/107/10784.pdf","section":"5.4e","topic":"Others, Harder","hint":"the number of diagonals in n-gon = n*(n-3)/2; use it to derive the solution","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11069","title":null,"url":"https://onlinejudge.org/external/110/11069.pdf","section":"5.4e","topic":"Others, Harder","hint":"use Dynamic Programming","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11538","title":null,"url":"https://onlinejudge.org/external/115/11538.pdf","section":"5.4e","topic":"Others, Harder","hint":"count along rows; columns; and diagonals","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"anagramcounting","title":"anagramcounting","url":"https://open.kattis.com/problems/anagramcounting","section":"5.4e","topic":"Others, Harder","hint":"use Big Integer","dacu":1117,"points":3.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"incognito","title":"incognito","url":"https://open.kattis.com/problems/incognito","section":"5.4e","topic":"Others, Harder","hint":"count frequencies; combinatorics; minus one","dacu":791,"points":2.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"tritiling","title":"tritiling","url":"https://open.kattis.com/problems/tritiling","section":"5.4e","topic":"Others, Harder","hint":"there are two related recurrences here; also available at UVa 10918 - Tri Tiling","dacu":465,"points":2.1,"cp5":false,"solved":false},{"judge":"UVa","id":"01636","title":null,"url":"https://onlinejudge.org/external/16/1636.pdf","section":"5.5a","topic":"Probability, Easier","hint":"LA 4596 - NorthEasternEurope09; ad hoc probability question, one tricky special case involving all zeroes","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10238","title":null,"url":"https://onlinejudge.org/external/102/10238.pdf","section":"5.5a","topic":"Probability, Easier","hint":"DP; s: (dice_left, score); try F values; Big Integer; no need to simplify the fraction; see UVa 10759","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10491","title":null,"url":"https://onlinejudge.org/external/104/10491.pdf","section":"5.5a","topic":"Probability, Easier","hint":"two ways to get a car: either pick a cow first; then switch to a car; or pick a car first; and then switch to another ca...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11181","title":null,"url":"https://onlinejudge.org/external/111/11181.pdf","section":"5.5a","topic":"Probability, Easier","hint":"iterative brute force; try all possibilities","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bobby","title":"bobby","url":"https://open.kattis.com/problems/bobby","section":"5.5a","topic":"Probability, Easier","hint":"computation of expected value","dacu":618,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"dicebetting","title":"dicebetting","url":"https://open.kattis.com/problems/dicebetting","section":"5.5a","topic":"Probability, Easier","hint":"s: (dice_left, distinct_numbers_so_far); each throw can increase distinct_numbers_so_far or not","dacu":261,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"odds","title":"odds","url":"https://open.kattis.com/problems/odds","section":"5.5a","topic":"Probability, Easier","hint":"complete search; simple probability","dacu":142,"points":2.5,"cp5":false,"solved":false},{"judge":"UVa","id":"10056","title":null,"url":"https://onlinejudge.org/external/100/10056.pdf","section":"5.5b","topic":"Probability, Harder","hint":"get the closed form formula","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10648","title":null,"url":"https://onlinejudge.org/external/106/10648.pdf","section":"5.5b","topic":"Probability, Harder","hint":"DP; s: (rem_boxes; num_empty)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11176","title":null,"url":"https://onlinejudge.org/external/111/11176.pdf","section":"5.5b","topic":"Probability, Harder","hint":"DP, s: (rem_games, streak); t: lose this game, or win the next W = [1..n] games and lose the (W+1)-th game","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11628","title":null,"url":"https://onlinejudge.org/external/116/11628.pdf","section":"5.5b","topic":"Probability, Harder","hint":"p[i] = ticket bought by i at the last round/total tickets bought at the last round by all n; gcd","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"anthony","title":"anthony","url":"https://open.kattis.com/problems/anthony","section":"5.5b","topic":"Probability, Harder","hint":"DP probability; need to drop one parameter (N or M) and recover it from the other one","dacu":203,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"goodcoalition","title":"goodcoalition","url":"https://open.kattis.com/problems/goodcoalition","section":"5.5b","topic":"Probability, Harder","hint":"DP probability; like KNAPSACK","dacu":276,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"lostinthewoods","title":"lostinthewoods","url":"https://open.kattis.com/problems/lostinthewoods","section":"5.5b","topic":"Probability, Harder","hint":"simulate random walks of various lengths and distribute the probabilities per iteration; the answer will converge eventu...","dacu":77,"points":3.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00350","title":null,"url":"https://onlinejudge.org/external/3/350.pdf","section":"5.6a","topic":"Cycle Finding","hint":"very basic cycle-finding problem; simply run Floyd's cycle-finding algorithm","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11036","title":null,"url":"https://onlinejudge.org/external/110/11036.pdf","section":"5.6a","topic":"Cycle Finding","hint":"cycle-finding; evaluate Reverse Polish f with a stack","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11053","title":null,"url":"https://onlinejudge.org/external/110/11053.pdf","section":"5.6a","topic":"Cycle Finding","hint":"cycle-finding; the answer is N-lambda","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"fibonaccicycles","title":"fibonaccicycles","url":"https://open.kattis.com/problems/fibonaccicycles","section":"5.6a","topic":"Cycle Finding","hint":"detect cycle of fib(n)%k using fast data structure","dacu":118,"points":3.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0287","title":"Find the Duplicate Number","url":"https://leetcode.com/problems/find-the-duplicate-number/","section":"5.6a","topic":"Cycle Finding","hint":"find μ, start of the cycle; Floyd's cycle-finding algorithm; popularized by Joma Tech YouTube video; top-100-liked","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"rats","title":"rats","url":"https://open.kattis.com/problems/rats","section":"5.6a","topic":"Cycle Finding","hint":"string processing plus cycle-finding; unordered_set","dacu":92,"points":6.3,"cp5":false,"solved":false},{"judge":"UVa","id":"10111","title":null,"url":"https://onlinejudge.org/external/101/10111.pdf","section":"5.7a","topic":"Game Theory (Basic)","hint":"Tic-Tac-Toe; minimax; backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10536","title":null,"url":"https://onlinejudge.org/external/105/10536.pdf","section":"5.7a","topic":"Game Theory (Basic)","hint":"model the 4*4 board and 48 possible pins as bitmask; then this is a simple two player game","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bachetsgame","title":"bachetsgame","url":"https://open.kattis.com/problems/bachetsgame","section":"5.7a","topic":"Game Theory (Basic)","hint":"2 players game; Dynamic Programming; also available at UVa 10404 - Bachet's Game","dacu":724,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"blockgame2","title":"blockgame2","url":"https://open.kattis.com/problems/blockgame2","section":"5.7a","topic":"Game Theory (Basic)","hint":"observe the pattern; 2 winnable cases if N == M and N%M == 0; only 1 move if M < N < 2M; we can always win if N &g...","dacu":314,"points":3.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"euclidsgame","title":"euclidsgame","url":"https://open.kattis.com/problems/euclidsgame","section":"5.7a","topic":"Game Theory (Basic)","hint":"minimax; backtracking; also available at UVa 10368 - Euclid's Game","dacu":199,"points":4.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc3360","title":"Stone Removal Game","url":"https://leetcode.com/problems/stone-removal-game/","section":"5.7a","topic":"Game Theory (Basic)","hint":"simulate the process to determine the winner","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"linije","title":"linije","url":"https://open.kattis.com/problems/linije","section":"5.7a","topic":"Game Theory (Basic)","hint":"game theory; check conditions on how Mirko can win and when Slavko can win; involves MCBM","dacu":39,"points":7.9,"cp5":false,"solved":false},{"judge":"UVa","id":"10229","title":null,"url":"https://onlinejudge.org/external/102/10229.pdf","section":"5.8a","topic":"Matrix Power","hint":"Fibonacci; modPow","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10655","title":null,"url":"https://onlinejudge.org/external/106/10655.pdf","section":"5.8a","topic":"Matrix Power","hint":"derive the square matrix","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12796","title":null,"url":"https://onlinejudge.org/external/127/12796.pdf","section":"5.8a","topic":"Matrix Power","hint":"count the number of paths of length L in an undirected graph where L can be up to 2^30","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"checkingforcorrectness","title":"checkingforcorrectness","url":"https://open.kattis.com/problems/checkingforcorrectness","section":"5.8a","topic":"Matrix Power","hint":"Java Big Integer; one subtask uses modPow","dacu":244,"points":4.1,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0050","title":"Pow(x, n)","url":"https://leetcode.com/problems/powx-n/","section":"5.8a","topic":"Matrix Power","hint":"D&C exponentiation; programming-skills; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"porpoises","title":"porpoises","url":"https://open.kattis.com/problems/porpoises","section":"5.8a","topic":"Matrix Power","hint":"Fibonacci; matrix power; modulo","dacu":268,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"squawk","title":"squawk","url":"https://open.kattis.com/problems/squawk","section":"5.8a","topic":"Matrix Power","hint":"count the number of paths of length L in an undirected graph after t steps that are reachable from source s","dacu":409,"points":3.5,"cp5":false,"solved":false},{"judge":"UVa","id":"00213","title":null,"url":"https://onlinejudge.org/external/2/213.pdf","section":"6.2a","topic":"Cipher, Harder","hint":"LA 5152 - WorldFinals SanAntonio91","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00554","title":null,"url":"https://onlinejudge.org/external/5/554.pdf","section":"6.2a","topic":"Cipher, Harder","hint":"try all shifts; output formatting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11385","title":null,"url":"https://onlinejudge.org/external/113/11385.pdf","section":"6.2a","topic":"Cipher, Harder","hint":"string manipulation and Fibonacci","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"crackingthecode","title":"crackingthecode","url":"https://open.kattis.com/problems/crackingthecode","section":"6.2a","topic":"Cipher, Harder","hint":"one corner case involving the 25th to 26th character determination","dacu":48,"points":6.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"itsasecret","title":"itsasecret","url":"https://open.kattis.com/problems/itsasecret","section":"6.2a","topic":"Cipher, Harder","hint":"playfair cipher; 2D array; quite tedious","dacu":81,"points":5.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"playfair","title":"playfair","url":"https://open.kattis.com/problems/playfair","section":"6.2a","topic":"Cipher, Harder","hint":"follow the description; a bit tedious; also available at UVa 11697 - Playfair Cipher","dacu":156,"points":2.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"progressivescramble","title":"progressivescramble","url":"https://open.kattis.com/problems/progressivescramble","section":"6.2a","topic":"Cipher, Harder","hint":"the encode part is trivial; the decode part requires a bit of thinking","dacu":977,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"textencryption","title":"textencryption","url":"https://open.kattis.com/problems/textencryption","section":"6.2a","topic":"Cipher, Harder","hint":"convert input alphabets to UPPERCASEs; loop","dacu":305,"points":3.2,"cp5":false,"solved":false},{"judge":"UVa","id":"11070","title":null,"url":"https://onlinejudge.org/external/110/11070.pdf","section":"6.2b","topic":"Input Parsing (Rec)","hint":"recursive grammar evaluation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11291","title":null,"url":"https://onlinejudge.org/external/112/11291.pdf","section":"6.2b","topic":"Input Parsing (Rec)","hint":"recursive grammar check","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"calculator","title":"calculator","url":"https://open.kattis.com/problems/calculator","section":"6.2b","topic":"Input Parsing (Rec)","hint":"recursive parser and evaluator","dacu":351,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"otpor","title":"otpor","url":"https://open.kattis.com/problems/otpor","section":"6.2b","topic":"Input Parsing (Rec)","hint":"parallel vs series evaluation; write a recursive parser; or use linear pass with stack","dacu":94,"points":4.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"polish","title":"polish","url":"https://open.kattis.com/problems/polish","section":"6.2b","topic":"Input Parsing (Rec)","hint":"recursive parser","dacu":224,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"subexpression","title":"subexpression","url":"https://open.kattis.com/problems/subexpression","section":"6.2b","topic":"Input Parsing (Rec)","hint":"recursive parsing; use DP; similar to https://visualgo.net/en/recursion tree versus DAG","dacu":44,"points":5.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00494","title":null,"url":"https://onlinejudge.org/external/4/494.pdf","section":"6.2c","topic":"Regular Expression","hint":"trivial with regex","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00576","title":null,"url":"https://onlinejudge.org/external/5/576.pdf","section":"6.2c","topic":"Regular Expression","hint":"solvable with regex","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10058","title":null,"url":"https://onlinejudge.org/external/100/10058.pdf","section":"6.2c","topic":"Regular Expression","hint":"solvable with regex","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"apaxiaaans","title":"apaxiaaans","url":"https://open.kattis.com/problems/apaxiaaans","section":"6.2c","topic":"Regular Expression","hint":"solvable with regex","dacu":6751,"points":1.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"hidden","title":"hidden","url":"https://open.kattis.com/problems/hidden","section":"6.2c","topic":"Regular Expression","hint":"just a careful 1D array manipulation; we can also use regex","dacu":1100,"points":2.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"lindenmayorsystem","title":"lindenmayorsystem","url":"https://open.kattis.com/problems/lindenmayorsystem","section":"6.2c","topic":"Regular Expression","hint":"DAT; map char to string; simulation; max answer ≤ 30*5^5; we can also use regex","dacu":302,"points":2.5,"cp5":false,"solved":false},{"judge":"UVa","id":"11403","title":null,"url":"https://onlinejudge.org/external/114/11403.pdf","section":"6.2d","topic":"Output Formatting, H","hint":"similar with UVa 00338; tedious","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12155","title":null,"url":"https://onlinejudge.org/external/121/12155.pdf","section":"6.2d","topic":"Output Formatting, H","hint":"LA 4403 - KualaLumpur08; use proper index manipulation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"asciifigurerotation","title":"asciifigurerotation","url":"https://open.kattis.com/problems/asciifigurerotation","section":"6.2d","topic":"Output Formatting, H","hint":"rotate the input 90 degrees clockwise; remove trailing whitespaces; tedious","dacu":521,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"imagedecoding","title":"imagedecoding","url":"https://open.kattis.com/problems/imagedecoding","section":"6.2d","topic":"Output Formatting, H","hint":"simple Run-Length Encoding","dacu":321,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"juryjeopardy","title":"juryjeopardy","url":"https://open.kattis.com/problems/juryjeopardy","section":"6.2d","topic":"Output Formatting, H","hint":"tedious problem","dacu":309,"points":2.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"nizovi","title":"nizovi","url":"https://open.kattis.com/problems/nizovi","section":"6.2d","topic":"Output Formatting, H","hint":"formatting with indentation; not that trivial but sample input/output helps","dacu":199,"points":3.8,"cp5":false,"solved":false},{"judge":"UVa","id":"11048","title":null,"url":"https://onlinejudge.org/external/110/11048.pdf","section":"6.2e","topic":"String Comparison","hint":"flexible string comparison with respect to a dictionary","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11056","title":null,"url":"https://onlinejudge.org/external/110/11056.pdf","section":"6.2e","topic":"String Comparison","hint":"sorting; case-insensitive string comparison","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11734","title":null,"url":"https://onlinejudge.org/external/117/11734.pdf","section":"6.2e","topic":"String Comparison","hint":"custom comparison","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0014","title":"Longest Common Prefix","url":"https://leetcode.com/problems/longest-common-prefix/","section":"6.2e","topic":"String Comparison","hint":"complete search; try each prefix; see if it all strings start with it; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"phonelist","title":"phonelist","url":"https://open.kattis.com/problems/phonelist","section":"6.2e","topic":"String Comparison","hint":"sort the numbers; see if num i is a prefix of num i+1","dacu":1955,"points":4.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"rhyming","title":"rhyming","url":"https://open.kattis.com/problems/rhyming","section":"6.2e","topic":"String Comparison","hint":"compare suffix of a common word with the list of other given words","dacu":296,"points":2.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"smartphone","title":"smartphone","url":"https://open.kattis.com/problems/smartphone","section":"6.2e","topic":"String Comparison","hint":"compare prefix so far with the target string and the 3 suggestions; output 1 of 4 options with shortest number of keypre...","dacu":354,"points":2.6,"cp5":false,"solved":false},{"judge":"UVa","id":"11483","title":null,"url":"https://onlinejudge.org/external/114/11483.pdf","section":"6.2f","topic":"Really Ad Hoc","hint":"straightforward; use 'escape character'","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12916","title":null,"url":"https://onlinejudge.org/external/129/12916.pdf","section":"6.2f","topic":"Really Ad Hoc","hint":"factorize n; string period; also see UVa 11452","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"irepeatmyself","title":"irepeatmyself","url":"https://open.kattis.com/problems/irepeatmyself","section":"6.2f","topic":"Really Ad Hoc","hint":"string period; complete search","dacu":380,"points":2.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0459","title":"Repeated Substring Pattern","url":"https://leetcode.com/problems/repeated-substring-pattern/","section":"6.2f","topic":"Really Ad Hoc","hint":"complete search; test repeated substring; programming-skills","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0890","title":"Find and Replace Pattern","url":"https://leetcode.com/problems/find-and-replace-pattern/","section":"6.2f","topic":"Really Ad Hoc","hint":"custom matching; map each word to appropriate index (signature); compare signatures","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"periodicstrings","title":"periodicstrings","url":"https://open.kattis.com/problems/periodicstrings","section":"6.2f","topic":"Really Ad Hoc","hint":"brute force; skip non divisor","dacu":299,"points":3,"cp5":false,"solved":false},{"judge":"Kattis","id":"raggedright","title":"raggedright","url":"https://open.kattis.com/problems/raggedright","section":"6.2f","topic":"Really Ad Hoc","hint":"just simulate the requirement","dacu":1708,"points":1.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"zipfslaw","title":"zipfslaw","url":"https://open.kattis.com/problems/zipfslaw","section":"6.2f","topic":"Really Ad Hoc","hint":"sort the words to simplify this problem; also available at UVa 10126 - Zipf's Law","dacu":157,"points":5.7,"cp5":false,"solved":false},{"judge":"UVa","id":"01192","title":null,"url":"https://onlinejudge.org/external/11/1192.pdf","section":"6.3a","topic":"DP String, Classic","hint":"LA2460 - Singapore01; classic String Alignment DP problem with a bit of (unclear) output formatting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12747","title":null,"url":"https://onlinejudge.org/external/127/12747.pdf","section":"6.3a","topic":"DP String, Classic","hint":"similar to UVa 10635","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13146","title":null,"url":"https://onlinejudge.org/external/131/13146.pdf","section":"6.3a","topic":"DP String, Classic","hint":"classic Edit Distance problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"inflagrantedelicto","title":"inflagrantedelicto","url":"https://open.kattis.com/problems/inflagrantedelicto","section":"6.3a","topic":"DP String, Classic","hint":"k_p is always 2 (read the problem description); k_r is the LCS of the two permutations plus one; O(n log k) solution","dacu":75,"points":4.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1143","title":"Longest Common Subsequence","url":"https://leetcode.com/problems/longest-common-subsequence/","section":"6.3a","topic":"DP String, Classic","hint":"classic; leetcode-75; top-100-liked","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"pandachess","title":"pandachess","url":"https://open.kattis.com/problems/pandachess","section":"6.3a","topic":"DP String, Classic","hint":"LCS of 2 permutations → LIS; O(n log k) solution; also see UVa 10635","dacu":267,"points":6,"cp5":false,"solved":false},{"judge":"Kattis","id":"princeandprincess","title":"princeandprincess","url":"https://open.kattis.com/problems/princeandprincess","section":"6.3a","topic":"DP String, Classic","hint":"find LCS of two permutations; also available at UVa 10635 - Prince and Princess","dacu":140,"points":6.7,"cp5":false,"solved":false},{"judge":"UVa","id":"11258","title":null,"url":"https://onlinejudge.org/external/112/11258.pdf","section":"6.3b","topic":"DP String, Non Classic","hint":"dp(i) = int from substring [i..k] dp(k)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11552","title":null,"url":"https://onlinejudge.org/external/115/11552.pdf","section":"6.3b","topic":"DP String, Non Classic","hint":"dp(i; c) = minimum number of chunks after considering the first i segments ending with character c","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"exam","title":"exam","url":"https://open.kattis.com/problems/exam","section":"6.3b","topic":"DP String, Non Classic","hint":"s: (pos, correct_left); t: either your friend is wrong or your friend is right, process accordingly; easier solution exi...","dacu":891,"points":1.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"heritage","title":"heritage","url":"https://open.kattis.com/problems/heritage","section":"6.3b","topic":"DP String, Non Classic","hint":"s: (cur_pos); t: try all N words in dictionary; final answer modulo prime","dacu":348,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"hillnumbers","title":"hillnumbers","url":"https://open.kattis.com/problems/hillnumbers","section":"6.3b","topic":"DP String, Non Classic","hint":"digit DP; s: (prev_digit, pos, is_rising, is_lower); try digit by digit","dacu":84,"points":6.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0097","title":"Interleaving String","url":"https://leetcode.com/problems/interleaving-string/","section":"6.3b","topic":"DP String, Non Classic","hint":"s: (i, j); k is derived from i+j; t: use a[i] or b[i] next; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"stringfactoring","title":"stringfactoring","url":"https://open.kattis.com/problems/stringfactoring","section":"6.3b","topic":"DP String, Non Classic","hint":"s: the min weight of substring [i..j]; also available at UVa 11022 - String Factoring","dacu":57,"points":5.1,"cp5":false,"solved":false},{"judge":"UVa","id":"01449","title":null,"url":"https://onlinejudge.org/external/14/1449.pdf","section":"6.4a","topic":"String Matching","hint":"LA 4670 - Hefei09; just use strstr; Suffix Array will get TLE as there are too many long strings to be processed","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11837","title":null,"url":"https://onlinejudge.org/external/118/11837.pdf","section":"6.4a","topic":"String Matching","hint":"transform the input of X notes into X-1 distances; then apply KMP","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"geneticsearch","title":"geneticsearch","url":"https://open.kattis.com/problems/geneticsearch","section":"6.4a","topic":"String Matching","hint":"multiple string matchings","dacu":346,"points":2.1,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0028","title":"Find the Index of the First Occurrence in a String","url":"https://leetcode.com/problems/find-the-index-of-the-first-occurrence-in-a-string/","section":"6.4a","topic":"String Matching","hint":"simple string matching; programming-skills; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"powerstrings","title":"powerstrings","url":"https://open.kattis.com/problems/powerstrings","section":"6.4a","topic":"String Matching","hint":"find s in s+s; similar with UVa 00455; also available at UVa 10298 - Power Strings","dacu":451,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"quiteaproblem","title":"quiteaproblem","url":"https://open.kattis.com/problems/quiteaproblem","section":"6.4a","topic":"String Matching","hint":"trivial string matching per line","dacu":1212,"points":2.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"scrollingsign","title":"scrollingsign","url":"https://open.kattis.com/problems/scrollingsign","section":"6.4a","topic":"String Matching","hint":"modified string matching; complete search; also available at UVa 11576 - Scrolling Sign","dacu":238,"points":3.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00736","title":null,"url":"https://onlinejudge.org/external/7/736.pdf","section":"6.4b","topic":"String Matching, 2D","hint":"2D grid; a bit modified","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10010","title":null,"url":"https://onlinejudge.org/external/100/10010.pdf","section":"6.4b","topic":"String Matching, 2D","hint":"2D grid; backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11283","title":null,"url":"https://onlinejudge.org/external/112/11283.pdf","section":"6.4b","topic":"String Matching, 2D","hint":"2D grid; backtracking; do not count twice","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"boggle","title":"boggle","url":"https://open.kattis.com/problems/boggle","section":"6.4b","topic":"String Matching, 2D","hint":"2D grid; backtracking","dacu":323,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"kinarow","title":"kinarow","url":"https://open.kattis.com/problems/kinarow","section":"6.4b","topic":"String Matching, 2D","hint":"brute the top left point of each possible x or o row, then straight-line (horizontal, vertical) or two diagonals 2D stri...","dacu":107,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"knightsearch","title":"knightsearch","url":"https://open.kattis.com/problems/knightsearch","section":"6.4b","topic":"String Matching, 2D","hint":"2D grid; backtracking or DP","dacu":425,"points":3.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0079","title":"Word Search","url":"https://leetcode.com/problems/word-search/","section":"6.4b","topic":"String Matching, 2D","hint":"backtracking; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"bing","title":"bing","url":"https://open.kattis.com/problems/bing","section":"6.5a","topic":"Trie","hint":"map all prefixes to frequencies using Hash Table; or use Trie","dacu":1061,"points":3.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0208","title":"Implement Trie (Prefix Tree)","url":"https://leetcode.com/problems/implement-trie-prefix-tree/","section":"6.5a","topic":"Trie","hint":"Trie implementation; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0648","title":"Replace Words","url":"https://leetcode.com/problems/replace-words/","section":"6.5a","topic":"Trie","hint":"use Trie to speed-up the identification of the shortest root for each derivative","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1268","title":"Search Suggestions System","url":"https://leetcode.com/problems/search-suggestions-system/","section":"6.5a","topic":"Trie","hint":"use Trie to speed-up; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc2416","title":"Sum of Prefix Scores of Strings","url":"https://leetcode.com/problems/sum-of-prefix-scores-of-strings/","section":"6.5a","topic":"Trie","hint":"we can use Trie or frequency Counter of each prefixes","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"UVa","id":"01254","title":null,"url":"https://onlinejudge.org/external/12/1254.pdf","section":"6.5b","topic":"Suffix Tree/Array","hint":"LA 4657 - Jakarta09; Suffix Array with Segment Tree or Sparse Table; LCP range","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01584","title":null,"url":"https://onlinejudge.org/external/15/1584.pdf","section":"6.5b","topic":"Suffix Tree/Array","hint":"LA 3225 - Seoul04; min lexicographic rotation; similar with UVa 00719; other solutions exist","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"automatictrading","title":"automatictrading","url":"https://open.kattis.com/problems/automatictrading","section":"6.5b","topic":"Suffix Tree/Array","hint":"Suffix Array; LCP of a range; use Sparse Table","dacu":160,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"buzzwords","title":"buzzwords","url":"https://open.kattis.com/problems/buzzwords","section":"6.5b","topic":"Suffix Tree/Array","hint":"Longest Repeated Substring that appears X times (2 ≤ X < N); also available at UVa 11855 - Buzzwords","dacu":141,"points":5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1044","title":"Longest Duplicate Substring","url":"https://leetcode.com/problems/longest-duplicate-substring/","section":"6.5b","topic":"Suffix Tree/Array","hint":"classic Longest Repeated Substring problem; solvable with Suffix Array","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"Kattis","id":"suffixarrayreconstruction","title":"suffixarrayreconstruction","url":"https://open.kattis.com/problems/suffixarrayreconstruction","section":"6.5b","topic":"Suffix Tree/Array","hint":"clever creative problem involving Suffix Array concept; be careful that '*' can be more than one character","dacu":125,"points":4.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"suffixsorting","title":"suffixsorting","url":"https://open.kattis.com/problems/suffixsorting","section":"6.5b","topic":"Suffix Tree/Array","hint":"basic Suffix Array construction problem; be careful with terminating symbol","dacu":201,"points":5.7,"cp5":false,"solved":false},{"judge":"UVa","id":"12467","title":null,"url":"https://onlinejudge.org/external/124/12467.pdf","section":"6.6a","topic":"String Hashing","hint":"hashing/'border' of KMP; see UVa 11475","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12604","title":null,"url":"https://onlinejudge.org/external/126/12604.pdf","section":"6.6a","topic":"String Hashing","hint":"try Rabin-Karp/KMP up to 62 times","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"hashing","title":"hashing","url":"https://open.kattis.com/problems/hashing","section":"6.6a","topic":"String Hashing","hint":"the problem description is very clear; good rolling hash practice; or use Suffix Array+Sparse Table","dacu":142,"points":7.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0187","title":"Repeated DNA Sequences","url":"https://leetcode.com/problems/repeated-dna-sequences/","section":"6.6a","topic":"String Hashing","hint":"classic rolling hash task; maintain hash of 10-characters substring as the window slides","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"stringmatching","title":"stringmatching","url":"https://open.kattis.com/problems/stringmatching","section":"6.6a","topic":"String Hashing","hint":"try Rabin-Karp or KMP","dacu":719,"points":4.5,"cp5":false,"solved":false},{"judge":"UVa","id":"00156","title":null,"url":"https://onlinejudge.org/external/1/156.pdf","section":"6.7a","topic":"Anagram","hint":"easier with algorithm::sort","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00195","title":null,"url":"https://onlinejudge.org/external/1/195.pdf","section":"6.7a","topic":"Anagram","hint":"use algorithm::next_permutation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12641","title":null,"url":"https://onlinejudge.org/external/126/12641.pdf","section":"6.7a","topic":"Anagram","hint":"anagram problem variation","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12770","title":null,"url":"https://onlinejudge.org/external/127/12770.pdf","section":"6.7a","topic":"Anagram","hint":"count frequencies; print odd frequency characters with except the last one -- put it in the middle of a palindrome","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0242","title":"Valid Anagram","url":"https://leetcode.com/problems/valid-anagram/","section":"6.7a","topic":"Anagram","hint":"sort s and t; compare; programming-skills; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"multigram","title":"multigram","url":"https://open.kattis.com/problems/multigram","section":"6.7a","topic":"Anagram","hint":"brute force lengths that is divisor of the original length of the string; test","dacu":221,"points":2.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00401","title":null,"url":"https://onlinejudge.org/external/4/401.pdf","section":"6.7b","topic":"Palindrome (Checking)","hint":"simple palindrome check","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10848","title":null,"url":"https://onlinejudge.org/external/108/10848.pdf","section":"6.7b","topic":"Palindrome (Checking)","hint":"related to UVa 10453; palindrome check, character frequency check, and a few others","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11888","title":null,"url":"https://onlinejudge.org/external/118/11888.pdf","section":"6.7b","topic":"Palindrome (Checking)","hint":"let ss = s+s; find reverse(s) in ss, but it cannot match the first n chars or the last n chars of ss","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"kaleidoscopicpalindromes","title":"kaleidoscopicpalindromes","url":"https://open.kattis.com/problems/kaleidoscopicpalindromes","section":"6.7b","topic":"Palindrome (Checking)","hint":"test all; when you try enlarging k, the answers are actually 'small'","dacu":233,"points":3.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0647","title":"Palindromic Substrings","url":"https://leetcode.com/problems/palindromic-substrings/","section":"6.7b","topic":"Palindrome (Checking)","hint":"complete search all substrings plus DP isPalindrome(l, r) speedup","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"palindromesubstring","title":"palindromesubstring","url":"https://open.kattis.com/problems/palindromesubstring","section":"6.7b","topic":"Palindrome (Checking)","hint":"try all pairs of O(n^2) substrings with at least 2 characters; keep the ones that are palindrome (use DP) in a sorted se...","dacu":298,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"peragrams","title":"peragrams","url":"https://open.kattis.com/problems/peragrams","section":"6.7b","topic":"Palindrome (Checking)","hint":"only one odd frequency character can be in the center of palindrome once; the rest need to have even frequency","dacu":1692,"points":1.7,"cp5":false,"solved":false},{"judge":"UVa","id":"01239","title":null,"url":"https://onlinejudge.org/external/12/1239.pdf","section":"6.7c","topic":"Palindrome (Generating)","hint":"LA 4144 - Jakarta08; as S <= 1000; brute-force is enough; consider odd and even length palindromes","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10018","title":null,"url":"https://onlinejudge.org/external/100/10018.pdf","section":"6.7c","topic":"Palindrome (Generating)","hint":"generating palindrome with specific math simulation; very easy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12718","title":null,"url":"https://onlinejudge.org/external/127/12718.pdf","section":"6.7c","topic":"Palindrome (Generating)","hint":"LA 6659 - Dhaka13; try all substrings; count character frequencies in them and analyze","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"evilstraw","title":"evilstraw","url":"https://open.kattis.com/problems/evilstraw","section":"6.7c","topic":"Palindrome (Generating)","hint":"greedily match leftmost char s[0]/rightmost char s[n-1] with rightmost/leftmost matching s[i], respectively","dacu":137,"points":3.8,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0409","title":"Longest Palindrome","url":"https://leetcode.com/problems/longest-palindrome/","section":"6.7c","topic":"Palindrome (Generating)","hint":"count character frequencies; even cases are easy; odd cases need a small observation","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"names","title":"names","url":"https://open.kattis.com/problems/names","section":"6.7c","topic":"Palindrome (Generating)","hint":"add a letter or change a letter; complete search","dacu":368,"points":4,"cp5":false,"solved":false},{"judge":"UVa","id":"01595","title":null,"url":"https://onlinejudge.org/external/15/1595.pdf","section":"7.2a","topic":"Points","hint":"use set to record the positions of all sorted points; check half of the points if the symmetries are in the set too?","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11894","title":null,"url":"https://onlinejudge.org/external/118/11894.pdf","section":"7.2a","topic":"Points","hint":"about rotating and translating points","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"browniepoints","title":"browniepoints","url":"https://open.kattis.com/problems/browniepoints","section":"7.2a","topic":"Points","hint":"points and quadrants; simple; also available at UVa 10865 - Brownie Points","dacu":154,"points":2.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"cursethedarkness","title":"cursethedarkness","url":"https://open.kattis.com/problems/cursethedarkness","section":"7.2a","topic":"Points","hint":"Euclidean dist","dacu":596,"points":2.2,"cp5":false,"solved":true},{"judge":"Kattis","id":"imperfectgps","title":"imperfectgps","url":"https://open.kattis.com/problems/imperfectgps","section":"7.2a","topic":"Points","hint":"Euclidean dist; simulation","dacu":487,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"jointjogjam","title":"jointjogjam","url":"https://open.kattis.com/problems/jointjogjam","section":"7.2a","topic":"Points","hint":"take the max Euclidean dist between two starting vs two ending points","dacu":448,"points":1.6,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc1232","title":"Check If It Is a Straight Line","url":"https://leetcode.com/problems/check-if-it-is-a-straight-line/","section":"7.2a","topic":"Points","hint":"check if all other points are collinear with the line defined by the first two points; programming-skills","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"UVa","id":"10263","title":null,"url":"https://onlinejudge.org/external/102/10263.pdf","section":"7.2b","topic":"Lines","hint":"use distToLineSegment","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11783","title":null,"url":"https://onlinejudge.org/external/117/11783.pdf","section":"7.2b","topic":"Lines","hint":"O(N^2) brute force line segment intersection tests","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13117","title":null,"url":"https://onlinejudge.org/external/131/13117.pdf","section":"7.2b","topic":"Lines","hint":"dist + distToLineSegment","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"hurricanedanger","title":"hurricanedanger","url":"https://open.kattis.com/problems/hurricanedanger","section":"7.2b","topic":"Lines","hint":"distance from point to line (not vector); be careful of precision error; work with integers","dacu":114,"points":5.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"logo2","title":"logo2","url":"https://open.kattis.com/problems/logo2","section":"7.2b","topic":"Lines","hint":"n vectors that sum to 0; given n-1 vectors, find the unknown vector; also available at UVa 11519 - Logo 2","dacu":114,"points":5.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"platforme","title":"platforme","url":"https://open.kattis.com/problems/platforme","section":"7.2b","topic":"Lines","hint":"line segment intersection tests; N ≤ 100; complete search","dacu":210,"points":2.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"unlockpattern","title":"unlockpattern","url":"https://open.kattis.com/problems/unlockpattern","section":"7.2b","topic":"Lines","hint":"complete search; Euclidean dist","dacu":902,"points":1.7,"cp5":false,"solved":false},{"judge":"UVa","id":"01388","title":null,"url":"https://onlinejudge.org/external/13/1388.pdf","section":"7.2c","topic":"Circles","hint":"LA 3708 - NortheasternEurope06; divide the circle into n sectors first and then into (n m) sectors","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10678","title":null,"url":"https://onlinejudge.org/external/106/10678.pdf","section":"7.2c","topic":"Circles","hint":"area of an ellipse; generalization of the formula for area of a circle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"amsterdamdistance","title":"amsterdamdistance","url":"https://open.kattis.com/problems/amsterdamdistance","section":"7.2c","topic":"Circles","hint":"arcs of circles; no need to model this as an SSSP problem/Dijkstra's","dacu":571,"points":2.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"biggest","title":"biggest","url":"https://open.kattis.com/problems/biggest","section":"7.2c","topic":"Circles","hint":"find biggest area of sector using simulation; use array (not that larget) to avoid precision error","dacu":147,"points":6.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"estimatingtheareaofacircle","title":"estimatingtheareaofacircle","url":"https://open.kattis.com/problems/estimatingtheareaofacircle","section":"7.2c","topic":"Circles","hint":"PI estimation experiment","dacu":2084,"points":1.6,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1828","title":"Queries on Number of Points Inside a Circle","url":"https://leetcode.com/problems/queries-on-number-of-points-inside-a-circle/","section":"7.2c","topic":"Circles","hint":"for each circle query, check how many points are inside; O(QN)","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"ornaments","title":"ornaments","url":"https://open.kattis.com/problems/ornaments","section":"7.2c","topic":"Circles","hint":"arch length plus two times tangent lengths","dacu":236,"points":2.2,"cp5":false,"solved":false},{"judge":"UVa","id":"00427","title":null,"url":"https://onlinejudge.org/external/4/427.pdf","section":"7.2d","topic":"Triangles (Trig)","hint":"for each 2 consecutive corridors, try rotating the piano by a angle α ∈ [0.1..89.9] degrees; trigonometry","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11326","title":null,"url":"https://onlinejudge.org/external/113/11326.pdf","section":"7.2d","topic":"Triangles (Trig)","hint":"trigonometry; tangent; reflection trick","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"alldifferentdirections","title":"alldifferentdirections","url":"https://open.kattis.com/problems/alldifferentdirections","section":"7.2d","topic":"Triangles (Trig)","hint":"use trigonometry to compute x and y displacement","dacu":446,"points":2.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"billiard","title":"billiard","url":"https://open.kattis.com/problems/billiard","section":"7.2d","topic":"Triangles (Trig)","hint":"enlarge the billiard table; then this is solvable with atan2","dacu":856,"points":1.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"egypt","title":"egypt","url":"https://open.kattis.com/problems/egypt","section":"7.2d","topic":"Triangles (Trig)","hint":"Pythagorean theorem/triple; also available at UVa 11854 - Egypt","dacu":862,"points":1.9,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1925","title":"Count Square Sum Triples","url":"https://leetcode.com/problems/count-square-sum-triples/","section":"7.2d","topic":"Triangles (Trig)","hint":"Pythagorean triples; complete search","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"mountainbiking","title":"mountainbiking","url":"https://open.kattis.com/problems/mountainbiking","section":"7.2d","topic":"Triangles (Trig)","hint":"up to 4 line segments; simple trigonometry; simple Physics/Kinematic equation","dacu":216,"points":2.8,"cp5":false,"solved":false},{"judge":"UVa","id":"00438","title":null,"url":"https://onlinejudge.org/external/4/438.pdf","section":"7.2e","topic":"Triangles + Circles","hint":"compute triangle's circumcircle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10577","title":null,"url":"https://onlinejudge.org/external/105/10577.pdf","section":"7.2e","topic":"Triangles + Circles","hint":"get center radius of outer circle from 3 points; get all vertices; get the min-x/max-x/min-y/max-y of the polygon; also ...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11281","title":null,"url":"https://onlinejudge.org/external/112/11281.pdf","section":"7.2e","topic":"Triangles + Circles","hint":"circumcircle for a non obtuse triangle; largest side of the triangle for an obtuse triangle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13215","title":null,"url":"https://onlinejudge.org/external/132/13215.pdf","section":"7.2e","topic":"Triangles + Circles","hint":"area of rectangle minus area of squares and equilateral triangles","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cropeasy","title":"cropeasy","url":"https://open.kattis.com/problems/cropeasy","section":"7.2e","topic":"Triangles + Circles","hint":"complete search 3 points/tree; check if the center is integer","dacu":178,"points":3,"cp5":false,"solved":false},{"judge":"Kattis","id":"stickysituation","title":"stickysituation","url":"https://open.kattis.com/problems/stickysituation","section":"7.2e","topic":"Triangles + Circles","hint":"see if 3 sides form a triangle; see UVa 11579","dacu":675,"points":2.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"trilemma","title":"trilemma","url":"https://open.kattis.com/problems/trilemma","section":"7.2e","topic":"Triangles + Circles","hint":"triangle properties; sort the 3 sides first","dacu":225,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00209","title":null,"url":"https://onlinejudge.org/external/2/209.pdf","section":"7.2f","topic":"Quadrilaterals","hint":"LA 5148 - WorldFinals SanAntonio91; brute force check; answer is either triangle, parallelogram, or hexagon","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11800","title":null,"url":"https://onlinejudge.org/external/118/11800.pdf","section":"7.2f","topic":"Quadrilaterals","hint":"use next_permutation to try all possible 4! = 24 permutations of 4 points; check the requirements","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"cetvrta","title":"cetvrta","url":"https://open.kattis.com/problems/cetvrta","section":"7.2f","topic":"Quadrilaterals","hint":"sort the x and y points, then you will know the 4th point","dacu":4727,"points":1.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0836","title":"Rectangle Overlap","url":"https://leetcode.com/problems/rectangle-overlap/","section":"7.2f","topic":"Quadrilaterals","hint":"set rec2 as reference point; simple case analysis of where rec1 is vs rec2","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"officespace","title":"officespace","url":"https://open.kattis.com/problems/officespace","section":"7.2f","topic":"Quadrilaterals","hint":"rectangles; small numbers; 2D Boolean arrays","dacu":143,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"rectanglesurrounding","title":"rectanglesurrounding","url":"https://open.kattis.com/problems/rectanglesurrounding","section":"7.2f","topic":"Quadrilaterals","hint":"rectangles; small; 2D Boolean arrays","dacu":187,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"roundedbuttons","title":"roundedbuttons","url":"https://open.kattis.com/problems/roundedbuttons","section":"7.2f","topic":"Quadrilaterals","hint":"in-rectangle/in-square test; in-4-circles tests","dacu":176,"points":2.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00634","title":null,"url":"https://onlinejudge.org/external/6/634.pdf","section":"7.3a","topic":"Polygon, Easier","hint":"basic inPolygon routine; notice that the input polygon can be convex or concave","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11447","title":null,"url":"https://onlinejudge.org/external/114/11447.pdf","section":"7.3a","topic":"Polygon, Easier","hint":"area of polygon","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"convexhull","title":"convexhull","url":"https://open.kattis.com/problems/convexhull","section":"7.3a","topic":"Polygon, Easier","hint":"basic convex hull problem; be careful with duplicate points and collinear points","dacu":644,"points":4.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"cuttingcorners","title":"cuttingcorners","url":"https://open.kattis.com/problems/cuttingcorners","section":"7.3a","topic":"Polygon, Easier","hint":"simulation of angle checks","dacu":95,"points":3.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0587","title":"Erect the Fence","url":"https://leetcode.com/problems/erect-the-fence/","section":"7.3a","topic":"Polygon, Easier","hint":"Convex Hull; collinear allowed","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"Kattis","id":"robotprotection","title":"robotprotection","url":"https://open.kattis.com/problems/robotprotection","section":"7.3a","topic":"Polygon, Easier","hint":"simply find the area of convex hull","dacu":236,"points":2.4,"cp5":false,"solved":false},{"judge":"UVa","id":"00361","title":null,"url":"https://onlinejudge.org/external/3/361.pdf","section":"7.3b","topic":"Polygon, Harder","hint":"check if a point is inside CH of Cop/Robber; if $pt$ is inside CH, pt satisfies the requirement","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01111","title":null,"url":"https://onlinejudge.org/external/11/1111.pdf","section":"7.3b","topic":"Polygon, Harder","hint":"LA 5138 - WorldFinals Orlando11; CH; output minimax distance of each CH side to the other vertices","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10256","title":null,"url":"https://onlinejudge.org/external/102/10256.pdf","section":"7.3b","topic":"Polygon, Harder","hint":"given 2 CHs, output 'No' if there is a point in 1st CH inside the 2nd one; 'Yes' otherwise","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11265","title":null,"url":"https://onlinejudge.org/external/112/11265.pdf","section":"7.3b","topic":"Polygon, Harder","hint":"seems to be a complex problem; but essentially just cutPolygon; inPolygon; area","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"convex","title":"convex","url":"https://open.kattis.com/problems/convex","section":"7.3b","topic":"Polygon, Harder","hint":"must understand the concept of convex polygon; a bit of mathematical insights: GCD; sort","dacu":132,"points":6.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"pointinpolygon","title":"pointinpolygon","url":"https://open.kattis.com/problems/pointinpolygon","section":"7.3b","topic":"Polygon, Harder","hint":"in/out and on polygon","dacu":311,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"roberthood","title":"roberthood","url":"https://open.kattis.com/problems/roberthood","section":"7.3b","topic":"Polygon, Harder","hint":"the classic furthest pair problem; use convex hull and then rotating caliper","dacu":376,"points":4.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00535","title":null,"url":"https://onlinejudge.org/external/5/535.pdf","section":"7.4a","topic":"3D Geometry","hint":"gcDistance","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00737","title":null,"url":"https://onlinejudge.org/external/7/737.pdf","section":"7.4a","topic":"3D Geometry","hint":"cube and cube intersection","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00815","title":null,"url":"https://onlinejudge.org/external/8/815.pdf","section":"7.4a","topic":"3D Geometry","hint":"LA 5215 - WorldFinals Eindhoven99; volume; greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11817","title":null,"url":"https://onlinejudge.org/external/118/11817.pdf","section":"7.4a","topic":"3D Geometry","hint":"gcDistance; 3D Euclidean distance; also available at Kattis - tunnelingtheearth","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"airlinehub","title":"airlinehub","url":"https://open.kattis.com/problems/airlinehub","section":"7.4a","topic":"3D Geometry","hint":"gcDistance; also available at UVa 10316 - Airline Hub","dacu":211,"points":6.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"beavergnaw","title":"beavergnaw","url":"https://open.kattis.com/problems/beavergnaw","section":"7.4a","topic":"3D Geometry","hint":"volumes of cylinders and cones; inclusion-exclusion; also available at UVa 10297 - Beavergnaw","dacu":1210,"points":1.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"bottles","title":"bottles","url":"https://open.kattis.com/problems/bottles","section":"7.4a","topic":"3D Geometry","hint":"LA 6027 - WorldFinals Warsaw12; BSTA+geometric formula; also available at UVa 01280 - Curvy Little Bottles","dacu":217,"points":3,"cp5":false,"solved":false},{"judge":"Kattis","id":"flowers","title":"flowers","url":"https://open.kattis.com/problems/flowers","section":"7.4a","topic":"3D Geometry","hint":"the key part of this problem is integration","dacu":63,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"movingday","title":"movingday","url":"https://open.kattis.com/problems/movingday","section":"7.4a","topic":"3D Geometry","hint":"output volume of the largest cuboid - V","dacu":261,"points":2.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00711","title":null,"url":"https://onlinejudge.org/external/7/711.pdf","section":"8.2a","topic":"Harder Backtracking","hint":"backtracking with pruning","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01052","title":null,"url":"https://onlinejudge.org/external/10/1052.pdf","section":"8.2a","topic":"Harder Backtracking","hint":"LA 3565 - WorldFinals SanAntonio06; backtracking with some form of bitmask","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11090","title":null,"url":"https://onlinejudge.org/external/110/11090.pdf","section":"8.2a","topic":"Harder Backtracking","hint":"this is the simplest form of Min Mean Cycle problem; however it has small constraints and thus this problem is still sol...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11451","title":null,"url":"https://onlinejudge.org/external/114/11451.pdf","section":"8.2a","topic":"Harder Backtracking","hint":"the input constraints are small; backtracking with bitmask without memoization; or use DP","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11699","title":null,"url":"https://onlinejudge.org/external/116/11699.pdf","section":"8.2a","topic":"Harder Backtracking","hint":"try all the possible row combinations on which we put rooks and keep the best","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"committeeassignment","title":"committeeassignment","url":"https://open.kattis.com/problems/committeeassignment","section":"8.2a","topic":"Harder Backtracking","hint":"backtracking; pruning; add a member to existing committee or create a new committee; TLE with DP bitmask","dacu":68,"points":7.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"greatswercporto","title":"greatswercporto","url":"https://open.kattis.com/problems/greatswercporto","section":"8.2a","topic":"Harder Backtracking","hint":"use backtracking with pruning; testing up to 10! possible permutations possibly TLE","dacu":120,"points":4.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"holeynqueensbatman","title":"holeynqueensbatman","url":"https://open.kattis.com/problems/holeynqueensbatman","section":"8.2a","topic":"Harder Backtracking","hint":"similar with UVa 11195","dacu":527,"points":2.2,"cp5":false,"solved":false},{"judge":"UVa","id":"01600","title":null,"url":"https://onlinejudge.org/external/16/1600.pdf","section":"8.2b","topic":"State-Space, BFS, E","hint":"LA 3670 - Hanoi06; s: (row; col; k_left); reset k_left to the original k as soon as the robot enters a non obstacle cell","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10047","title":null,"url":"https://onlinejudge.org/external/100/10047.pdf","section":"8.2b","topic":"State-Space, BFS, E","hint":"s: (row, col, dir, color)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12135","title":null,"url":"https://onlinejudge.org/external/121/12135.pdf","section":"8.2b","topic":"State-Space, BFS, E","hint":"LA 4201 - Dhaka08; s: (bitmask); BFS; similar with UVa 11974","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"ecoins","title":"ecoins","url":"https://open.kattis.com/problems/ecoins","section":"8.2b","topic":"State-Space, BFS, E","hint":"s: (conventional-value, infotechnological-value); BFS; also available at UVa 10306 - e-Coins","dacu":169,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"flipfive","title":"flipfive","url":"https://open.kattis.com/problems/flipfive","section":"8.2b","topic":"State-Space, BFS, E","hint":"s: (bitmask); only 2^9 = 512 grid configurations; BFS","dacu":621,"points":2.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0433","title":"Minimum Genetic Mutation","url":"https://leetcode.com/problems/minimum-genetic-mutation/","section":"8.2b","topic":"State-Space, BFS, E","hint":"unweighted SSSP; BFS; s: (8-char-gene); t: as described; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"safe","title":"safe","url":"https://open.kattis.com/problems/safe","section":"8.2b","topic":"State-Space, BFS, E","hint":"s: (convert 3x3 grid into a base 4 integer); BFS","dacu":181,"points":3,"cp5":false,"solved":false},{"judge":"UVa","id":"11198","title":null,"url":"https://onlinejudge.org/external/111/11198.pdf","section":"8.2c","topic":"State-Space, BFS, H","hint":"s: (permutation); tricky to code","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11212","title":null,"url":"https://onlinejudge.org/external/112/11212.pdf","section":"8.2c","topic":"State-Space, BFS, H","hint":"meet in the middle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11329","title":null,"url":"https://onlinejudge.org/external/113/11329.pdf","section":"8.2c","topic":"State-Space, BFS, H","hint":"s: (bitmask); 4 bits for die position; 16 bits for cells with fleas; 6 bits for side with a flea; use map; tedious","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"keyboard","title":"keyboard","url":"https://open.kattis.com/problems/keyboard","section":"8.2c","topic":"State-Space, BFS, H","hint":"LA 7155 - WorldFinals Marrakech15; s: (row, col, char_typed); also available at UVa 01714 - Keyboarding","dacu":258,"points":5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0126","title":"Word Ladder II","url":"https://leetcode.com/problems/word-ladder-ii/","section":"8.2c","topic":"State-Space, BFS, H","hint":"map string to indices; BFS on state-space graph; backtrack","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"Kattis","id":"robotmaze","title":"robotmaze","url":"https://open.kattis.com/problems/robotmaze","section":"8.2c","topic":"State-Space, BFS, H","hint":"s: (r, c, dir, steps); be careful of corner cases","dacu":87,"points":5.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"robotturtles","title":"robotturtles","url":"https://open.kattis.com/problems/robotturtles","section":"8.2c","topic":"State-Space, BFS, H","hint":"s: (r, c, dir, bitmask_ice_castles); print solution; very tedious","dacu":114,"points":4.5,"cp5":false,"solved":false},{"judge":"UVa","id":"00658","title":null,"url":"https://onlinejudge.org/external/6/658.pdf","section":"8.2d","topic":"State-Space, Dijkstra","hint":"s: (bitmask---whether a bug is present or not); the state-space graph is weighted","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01048","title":null,"url":"https://onlinejudge.org/external/10/1048.pdf","section":"8.2d","topic":"State-Space, Dijkstra","hint":"LA 3561 - WorldFinals SanAntonio06; tedious state-space search problem; use Dijkstra's","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01057","title":null,"url":"https://onlinejudge.org/external/10/1057.pdf","section":"8.2d","topic":"State-Space, Dijkstra","hint":"LA 3570 - WorldFinals SanAntonio06; Floyd-Warshall; APSP; reduce to weighted SSSP problem; Dijkstra's","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10269","title":null,"url":"https://onlinejudge.org/external/102/10269.pdf","section":"8.2d","topic":"State-Space, Dijkstra","hint":"use Floyd-Warshall to pre-compute APSP using only Villages; use Dijkstra's on s: (u, super_run_left)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bumped","title":"bumped","url":"https://open.kattis.com/problems/bumped","section":"8.2d","topic":"State-Space, Dijkstra","hint":"s: (city, has_use_free_ticket); use Dijkstra's","dacu":545,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"destinationunknown","title":"destinationunknown","url":"https://open.kattis.com/problems/destinationunknown","section":"8.2d","topic":"State-Space, Dijkstra","hint":"use Dijkstra's twice; one normally; one with s: (point, has_edge_g_h_used); compare the results","dacu":101,"points":5.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"justpassingthrough","title":"justpassingthrough","url":"https://open.kattis.com/problems/justpassingthrough","section":"8.2d","topic":"State-Space, Dijkstra","hint":"s: (r, c, n_left); Dijkstra's/SSSP on DAG","dacu":92,"points":5.1,"cp5":false,"solved":false},{"judge":"UVa","id":"01172","title":null,"url":"https://onlinejudge.org/external/11/1172.pdf","section":"8.3a","topic":"DP level 3","hint":"LA 3986 - SouthWesternEurope07; weighted bipartite matching with additional constraints","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01211","title":null,"url":"https://onlinejudge.org/external/12/1211.pdf","section":"8.3a","topic":"DP level 3","hint":"LA 3404 - Tokyo05; precompute T[L], the time to run a path of length L; s: (i) - checkpoint i is we change tire","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10645","title":null,"url":"https://onlinejudge.org/external/106/10645.pdf","section":"8.3a","topic":"DP level 3","hint":"s: (days_left, budget_left, prev_dish, prev_dish_cnt); the first 2 params are knapsack-style; the last 2 params to deter...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"aspenavenue","title":"aspenavenue","url":"https://open.kattis.com/problems/aspenavenue","section":"8.3a","topic":"DP level 3","hint":"sort; compute tree positions; s: (l_left, r_left), t: put next tree on the left/right; also available at UVa 11555 - Asp...","dacu":223,"points":5.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"busticket","title":"busticket","url":"https://open.kattis.com/problems/busticket","section":"8.3a","topic":"DP level 3","hint":"s: (day_i); t: either buy daily ticket or jump to end of period ticket (use binary search to avoid TLE)","dacu":186,"points":4.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0188","title":"Best Time to Buy and Sell Stock IV","url":"https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/","section":"8.3a","topic":"DP level 3","hint":"s: (i, own, k_left); t: skip or buy/sell; also consider k_left; top-interview-150","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"UVa","id":"01238","title":null,"url":"https://onlinejudge.org/external/12/1238.pdf","section":"8.3b","topic":"DP level 4","hint":"LA 4143 - Jakarta08; offset technique","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12870","title":null,"url":"https://onlinejudge.org/external/128/12870.pdf","section":"8.3b","topic":"DP level 4","hint":"LA 6848 - Bangkok14; split DP for fishing and nourishing; try all combination of K fishing + 2K nourishing events","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"coke","title":"coke","url":"https://open.kattis.com/problems/coke","section":"8.3b","topic":"DP level 4","hint":"drop parameter n1; recover it from b (number of coke bought), n5, and n10; also available at UVa 10626 - Buying Coke","dacu":304,"points":5.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"companypicnic","title":"companypicnic","url":"https://open.kattis.com/problems/companypicnic","section":"8.3b","topic":"DP level 4","hint":"s: (name, has_been_matched); DP weighted matching (both cardinality and weight) on Tree","dacu":200,"points":5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0790","title":"Domino and Tromino Tiling","url":"https://leetcode.com/problems/domino-and-tromino-tiling/","section":"8.3b","topic":"DP level 4","hint":"s: (n, got_hole); t: depends whether there is a hole (due to a Triomino) or not; simple profile DP; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"rollercoasterfun","title":"rollercoasterfun","url":"https://open.kattis.com/problems/rollercoasterfun","section":"8.3b","topic":"DP level 4","hint":"s: (T); split DPs when b = 0 and when b != 0","dacu":101,"points":7.7,"cp5":false,"solved":false},{"judge":"UVa","id":"11125","title":null,"url":"https://onlinejudge.org/external/111/11125.pdf","section":"8.3c","topic":"Counting Paths, Harder","hint":"counting paths in implicit DAG; the implicit DAG is not trivial; 8 parameters","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11375","title":null,"url":"https://onlinejudge.org/external/113/11375.pdf","section":"8.3c","topic":"Counting Paths, Harder","hint":"counting paths in DAG; 2 parameters; be careful that we can create a 0 with 6 sticks; need to use Java BigInteger","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11432","title":null,"url":"https://onlinejudge.org/external/114/11432.pdf","section":"8.3c","topic":"Counting Paths, Harder","hint":"counting paths in DAG; the implicit DAG is not trivial; 6 parameters","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"countcircuits","title":"countcircuits","url":"https://open.kattis.com/problems/countcircuits","section":"8.3c","topic":"Counting Paths, Harder","hint":"s: (id, cur_x, cur_y); t: skip or use this vector; use offset technique to avoid negative indices","dacu":278,"points":5.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"favourable","title":"favourable","url":"https://open.kattis.com/problems/favourable","section":"8.3c","topic":"Counting Paths, Harder","hint":"s: (cur_page); t: jump to one of the 3 sections","dacu":304,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"pachinkoprobability","title":"pachinkoprobability","url":"https://open.kattis.com/problems/pachinkoprobability","section":"8.3c","topic":"Counting Paths, Harder","hint":"s: (pos); DAG modeling; long long","dacu":113,"points":5.8,"cp5":false,"solved":false},{"judge":"UVa","id":"01099","title":null,"url":"https://onlinejudge.org/external/10/1099.pdf","section":"8.3d","topic":"DP with Bitmask","hint":"LA 4794 - WorldFinals Harbin10; s: (w; bitmask); recover parameter value h","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01252","title":null,"url":"https://onlinejudge.org/external/12/1252.pdf","section":"8.3d","topic":"DP with Bitmask","hint":"LA 4643 - Tokyo09; DP, s: (mask1, mask2) where mask1/mask2 describes the features/answers, respectively","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10911","title":null,"url":"https://onlinejudge.org/external/109/10911.pdf","section":"8.3d","topic":"DP with Bitmask","hint":"the intro problem of this book; DP with bitmask; weighted MCM; small complete weighted graph","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"hidingchickens","title":"hidingchickens","url":"https://open.kattis.com/problems/hidingchickens","section":"8.3d","topic":"DP with Bitmask","hint":"weighted MCM; small complete weighted graph; make fox goes back to the killing spot first after hiding one or two chicke...","dacu":89,"points":5.7,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc3530","title":"Maximum Profit from Valid Topological Order in DAG","url":"https://leetcode.com/problems/maximum-profit-from-valid-topological-order-in-dag/","section":"8.3d","topic":"DP with Bitmask","hint":"s: (mult, mask); t: go to unprocessed vertex if the topological order is not violated","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"Kattis","id":"narrowartgallery","title":"narrowartgallery","url":"https://open.kattis.com/problems/narrowartgallery","section":"8.3d","topic":"DP with Bitmask","hint":"interesting DP; s: (row, state_of_prev_row, k_left)","dacu":1417,"points":2.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"pebblesolitaire2","title":"pebblesolitaire2","url":"https://open.kattis.com/problems/pebblesolitaire2","section":"8.3d","topic":"DP with Bitmask","hint":"backtracking suffices  for Kattis - pebblesolitair; but this version needs extra memoization","dacu":400,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00820","title":null,"url":"https://onlinejudge.org/external/8/820.pdf","section":"8.4a","topic":"Network Flow, Standard","hint":"LA 5220 - WorldFinals Orlando00; very basic max flow problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11167","title":null,"url":"https://onlinejudge.org/external/111/11167.pdf","section":"8.4a","topic":"Network Flow, Standard","hint":"many edges in the flow graph; compress the capacity-1 edges when possible; use Dinic's","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11418","title":null,"url":"https://onlinejudge.org/external/114/11418.pdf","section":"8.4a","topic":"Network Flow, Standard","hint":"two layers of graph matching (not really bipartite matching); use max flow solution","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12873","title":null,"url":"https://onlinejudge.org/external/128/12873.pdf","section":"8.4a","topic":"Network Flow, Standard","hint":"LA 6851 - Bangkok14; assignment problem; similar to UVa 00259, 11045, and 10092; use Dinic's","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"maxflow","title":"maxflow","url":"https://open.kattis.com/problems/maxflow","section":"8.4a","topic":"Network Flow, Standard","hint":"standard max flow problem for practice; print edges used in the max flow","dacu":531,"points":6.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"mazemovement","title":"mazemovement","url":"https://open.kattis.com/problems/mazemovement","section":"8.4a","topic":"Network Flow, Standard","hint":"use gcd for all pairs of vertices to construct the flow graph; then it is just a standard max flow problem","dacu":135,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"mincut","title":"mincut","url":"https://open.kattis.com/problems/mincut","section":"8.4a","topic":"Network Flow, Standard","hint":"standard min cut problem for practice; print vertices reachable from source s after max flow","dacu":293,"points":4.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00563","title":null,"url":"https://onlinejudge.org/external/5/563.pdf","section":"8.4b","topic":"Network Flow, Variants","hint":"check whether the maximum number of independent paths on the flow graph equals to b banks","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11380","title":null,"url":"https://onlinejudge.org/external/113/11380.pdf","section":"8.4b","topic":"Network Flow, Variants","hint":"max flow modeling with vertex capacities; similar to UVa 12125","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11757","title":null,"url":"https://onlinejudge.org/external/117/11757.pdf","section":"8.4b","topic":"Network Flow, Variants","hint":"creative problem about min cut; build the flow graph with a bit of simple geometry involving circle; then find the min c...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11765","title":null,"url":"https://onlinejudge.org/external/117/11765.pdf","section":"8.4b","topic":"Network Flow, Variants","hint":"interesting min cut variant","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"avoidingtheapocalypse","title":"avoidingtheapocalypse","url":"https://open.kattis.com/problems/avoidingtheapocalypse","section":"8.4b","topic":"Network Flow, Variants","hint":"interesting max flow modeling; blow the vertices based on time","dacu":191,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"thekingofthenorth","title":"thekingofthenorth","url":"https://open.kattis.com/problems/thekingofthenorth","section":"8.4b","topic":"Network Flow, Variants","hint":"interesting min cut problem","dacu":193,"points":5,"cp5":false,"solved":false},{"judge":"Kattis","id":"transportation","title":"transportation","url":"https://open.kattis.com/problems/transportation","section":"8.4b","topic":"Network Flow, Variants","hint":"max flow with vertex capacities","dacu":165,"points":5.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00989","title":null,"url":"https://onlinejudge.org/external/9/989.pdf","section":"8.6a","topic":"NP-hard/C, small, E","hint":"classic SUDOKU puzzle; the small 9x9 instance is solvable with backtracking with pruning; use bitmask to speed up","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11088","title":null,"url":"https://onlinejudge.org/external/110/11088.pdf","section":"8.6a","topic":"NP-hard/C, small, E","hint":"similar to UVa 10911 but partitioning of three persons to one team; PARTITION-INTO-TRIANGLES","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12455","title":null,"url":"https://onlinejudge.org/external/124/12455.pdf","section":"8.6a","topic":"NP-hard/C, small, E","hint":"SUBSET-SUM; try all; see the harder UVa 12911 that requires meet in the middle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"equalsumseasy","title":"equalsumseasy","url":"https://open.kattis.com/problems/equalsumseasy","section":"8.6a","topic":"NP-hard/C, small, E","hint":"PARTITION; generate all possible subsets with bitmask; use set to record which sums have been computed","dacu":474,"points":2.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"flowfree","title":"flowfree","url":"https://open.kattis.com/problems/flowfree","section":"8.6a","topic":"NP-hard/C, small, E","hint":"brute force combination 3^10 or 4^8; then LONGEST-PATH problem on non DAG between two end points of the same color","dacu":109,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"font","title":"font","url":"https://open.kattis.com/problems/font","section":"8.6a","topic":"NP-hard/C, small, E","hint":"count number of possible SET-COVERs; use 2^N backtracking; but use bitmask to represent small set of covered letters","dacu":199,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"socialadvertising","title":"socialadvertising","url":"https://open.kattis.com/problems/socialadvertising","section":"8.6a","topic":"NP-hard/C, small, E","hint":"MIN-DOMINATING-SET/MIN-SET-COVER; n ≤ 20; use compact Adjacency Matrix technique","dacu":59,"points":5.1,"cp5":false,"solved":false},{"judge":"UVa","id":"01098","title":null,"url":"https://onlinejudge.org/external/10/1098.pdf","section":"8.6b","topic":"NP-hard/C, small, H","hint":"LA 4793 - WorldFinals Harbin10; HAMILTONIAN-TOUR; backtracking+pruning; meet in the middle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11095","title":null,"url":"https://onlinejudge.org/external/110/11095.pdf","section":"8.6b","topic":"NP-hard/C, small, H","hint":"optimization version of Min Vertex Cover on general graph which is NP-Hard","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12911","title":null,"url":"https://onlinejudge.org/external/129/12911.pdf","section":"8.6b","topic":"NP-hard/C, small, H","hint":"SUBSET-SUM; we cannot use DP as 1 ≤ N ≤ 40 and -10^9 ≤ T ≤ 10^9; use meet in the middle","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"beanbag","title":"beanbag","url":"https://open.kattis.com/problems/beanbag","section":"8.6b","topic":"NP-hard/C, small, H","hint":"SET-COVER problem; T farmers can collude to give Jack the hardest possible subset of beans to be given freely to Jack","dacu":119,"points":4.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"busplanning","title":"busplanning","url":"https://open.kattis.com/problems/busplanning","section":"8.6b","topic":"NP-hard/C, small, H","hint":"MIN-CLIQUE-COVER; DP bitmask over sets","dacu":91,"points":5.4,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0015","title":"3Sum","url":"https://leetcode.com/problems/3sum/","section":"8.6b","topic":"NP-hard/C, small, H","hint":"one possible way is to hash all numbers and try all-pairs; avoid duplicates; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"programmingteamselection","title":"programmingteamselection","url":"https://open.kattis.com/problems/programmingteamselection","section":"8.6b","topic":"NP-hard/C, small, H","hint":"PARTITION-INTO-TRIANGLES; prune if #students % 3 != 0; generate up to m/3 teams; backtracking with memo","dacu":64,"points":7.2,"cp5":false,"solved":false},{"judge":"UVa","id":"01347","title":null,"url":"https://onlinejudge.org/external/13/1347.pdf","section":"8.6c","topic":"NP-hard/C, special, E","hint":"LA 3305 - SoutheasternEurope05; this is the pure version of Bitonic TSP problem; you may want to start from here","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10859","title":null,"url":"https://onlinejudge.org/external/108/10859.pdf","section":"8.6c","topic":"NP-hard/C, special, E","hint":"Min-Vertex-Cover; on several trees; maximize number of edges with its two endpoints covered","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11159","title":null,"url":"https://onlinejudge.org/external/111/11159.pdf","section":"8.6c","topic":"NP-hard/C, special, E","hint":"MAX-INDEPENDENT-SET; on Bipartite Graph; ans equals to its MCBM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"bilateral","title":"bilateral","url":"https://open.kattis.com/problems/bilateral","section":"8.6c","topic":"NP-hard/C, special, E","hint":"MIN-VERTEX-COVER on Bipartite Graph; MCBM; Konig's theorem that can handle the 1009 case correctly","dacu":43,"points":6.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"europeantrip","title":"europeantrip","url":"https://open.kattis.com/problems/europeantrip","section":"8.6c","topic":"NP-hard/C, special, E","hint":"STEINER-TREE with 3 terminal vertices and up to 1 Steiner point; we can use two ternary searches","dacu":297,"points":3.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0198","title":"House Robber","url":"https://leetcode.com/problems/house-robber/","section":"8.6c","topic":"NP-hard/C, special, E","hint":"MWIS; on line graph; simple DP; leetcode-75; top-100-liked; top-interview-150","dacu":0,"points":4,"cp5":true,"solved":true},{"judge":"Kattis","id":"reactivity","title":"reactivity","url":"https://open.kattis.com/problems/reactivity","section":"8.6c","topic":"NP-hard/C, special, E","hint":"verify if a HAMILTONIAN-PATH exists in the DAG; find one topological sort of the DAG; verify if it is the only one in li...","dacu":280,"points":4,"cp5":false,"solved":false},{"judge":"UVa","id":"01086","title":null,"url":"https://onlinejudge.org/external/10/1086.pdf","section":"8.6d","topic":"NP-hard/C, special, H","hint":"LA 4452 - WorldFinals Stockholm09; can be modeled as a 2-SAT problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01096","title":null,"url":"https://onlinejudge.org/external/10/1096.pdf","section":"8.6d","topic":"NP-hard/C, special, H","hint":"LA 4791 - WorldFinals Harbin10; Bitonic TSP variant; print the actual path","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01184","title":null,"url":"https://onlinejudge.org/external/11/1184.pdf","section":"8.6d","topic":"NP-hard/C, special, H","hint":"LA 2696 - Dhaka02; MPC on DAG ~ MCBM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01212","title":null,"url":"https://onlinejudge.org/external/12/1212.pdf","section":"8.6d","topic":"NP-hard/C, special, H","hint":"LA 3483 - Hangzhou05; MWIS on Bipartite Graph","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"jailbreak","title":"jailbreak","url":"https://open.kattis.com/problems/jailbreak","section":"8.6d","topic":"NP-hard/C, special, H","hint":"STEINER-TREE; grid; BFS from 3 vertices: 'outside' and 2 prisoners (open doors independently or meet a Steiner point fir...","dacu":130,"points":4.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"ridofcoins","title":"ridofcoins","url":"https://open.kattis.com/problems/ridofcoins","section":"8.6d","topic":"NP-hard/C, special, H","hint":"not the minimizing COIN-CHANGE problem; but the maximizing one; greedy pruning; complete search on much smaller instance","dacu":94,"points":7.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"wedding","title":"wedding","url":"https://open.kattis.com/problems/wedding","section":"8.6d","topic":"NP-hard/C, special, H","hint":"can be modeled as a 2-SAT problem; also available at UVa 11294 - Wedding","dacu":36,"points":6.7,"cp5":false,"solved":false},{"judge":"UVa","id":"00714","title":null,"url":"https://onlinejudge.org/external/7/714.pdf","section":"8.7a","topic":"BSTA+Other, Easier","hint":"binary search the answer and greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11262","title":null,"url":"https://onlinejudge.org/external/112/11262.pdf","section":"8.7a","topic":"BSTA+Other, Easier","hint":"binary search the answer and MCBM; similar with UVa 10804","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12097","title":null,"url":"https://onlinejudge.org/external/120/12097.pdf","section":"8.7a","topic":"BSTA+Other, Easier","hint":"binary search the answer and geometric formula","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"arrivingontime","title":"arrivingontime","url":"https://open.kattis.com/problems/arrivingontime","section":"8.7a","topic":"BSTA+Other, Easier","hint":"BSTA: the latest starting time; use Dijkstra's to compute whether we can still arrive at meeting point on time","dacu":79,"points":6.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"charlesincharge","title":"charlesincharge","url":"https://open.kattis.com/problems/charlesincharge","section":"8.7a","topic":"BSTA+Other, Easier","hint":"BSTA: max edge that Charles can use; SSSP from 1 to $N$ passing through edges that do not exceed that; is it OK?","dacu":149,"points":4.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"programmingtutors","title":"programmingtutors","url":"https://open.kattis.com/problems/programmingtutors","section":"8.7a","topic":"BSTA+Other, Easier","hint":"+perfect MCBM","dacu":161,"points":3.7,"cp5":false,"solved":false},{"judge":"UVa","id":"01221","title":null,"url":"https://onlinejudge.org/external/12/1221.pdf","section":"8.7b","topic":"BSTA+Other, Harder","hint":"LA 3795 - Tehran06; +MCBM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10537","title":null,"url":"https://onlinejudge.org/external/105/10537.pdf","section":"8.7b","topic":"BSTA+Other, Harder","hint":"+Dijkstra's on State-Space graph","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10983","title":null,"url":"https://onlinejudge.org/external/109/10983.pdf","section":"8.7b","topic":"BSTA+Other, Harder","hint":"binary search the answer and max flow","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"catandmice","title":"catandmice","url":"https://open.kattis.com/problems/catandmice","section":"8.7b","topic":"BSTA+Other, Harder","hint":"BSTA: the initial velocity of Cartesian Cat; DP TSP to verify if the cat can catch all mice in the shortest possible tim...","dacu":141,"points":6.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"enemyterritory","title":"enemyterritory","url":"https://open.kattis.com/problems/enemyterritory","section":"8.7b","topic":"BSTA+Other, Harder","hint":"MSSP from all enemy vertices; BSTA, run BFS from (xi, yi) to (xr, yr) avoiding vertices that are too close to any enemy","dacu":66,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"gravamen","title":"gravamen","url":"https://open.kattis.com/problems/gravamen","section":"8.7b","topic":"BSTA+Other, Harder","hint":"BSTA + max flow","dacu":45,"points":6.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"wifi","title":"wifi","url":"https://open.kattis.com/problems/wifi","section":"8.7b","topic":"BSTA+Other, Harder","hint":"+greedy; also available at UVa 11516 - WiFi","dacu":214,"points":4.3,"cp5":false,"solved":false},{"judge":"UVa","id":"11960","title":null,"url":"https://onlinejudge.org/external/119/11960.pdf","section":"8.7c","topic":"Fast DS+Other, Easier","hint":"modified Sieve; number of divisors; static Range Maximum Query; use Sparse Table data structure","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12318","title":null,"url":"https://onlinejudge.org/external/123/12318.pdf","section":"8.7c","topic":"Fast DS+Other, Easier","hint":"brute force with unordered_set","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12460","title":null,"url":"https://onlinejudge.org/external/124/12460.pdf","section":"8.7c","topic":"Fast DS+Other, Easier","hint":"a simple BFS problem; use set of string data structure to speed up the check if a word is inside dictionary","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"busnumbers2","title":"busnumbers2","url":"https://open.kattis.com/problems/busnumbers2","section":"8.7c","topic":"Fast DS+Other, Easier","hint":"complete search; use unordered_map","dacu":377,"points":3,"cp5":false,"solved":false},{"judge":"Kattis","id":"quickscope","title":"quickscope","url":"https://open.kattis.com/problems/quickscope","section":"8.7c","topic":"Fast DS+Other, Easier","hint":"use stack of sets and hash table of stacks","dacu":1326,"points":3.9,"cp5":true,"solved":false},{"judge":"Kattis","id":"selfsimilarstrings","title":"selfsimilarstrings","url":"https://open.kattis.com/problems/selfsimilarstrings","section":"8.7c","topic":"Fast DS+Other, Easier","hint":"complete search as the string is short; frequency counting; use unordered_map; repetition","dacu":181,"points":3.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"undetected","title":"undetected","url":"https://open.kattis.com/problems/undetected","section":"8.7c","topic":"Fast DS+Other, Easier","hint":"brute force; simple geometry; UFDS","dacu":274,"points":3.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00843","title":null,"url":"https://onlinejudge.org/external/8/843.pdf","section":"8.7d","topic":"Fast DS+Other, Harder","hint":"backtracking; try mapping each letter to another letter in alphabet; use Trie data structure for speed up","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11474","title":null,"url":"https://onlinejudge.org/external/114/11474.pdf","section":"8.7d","topic":"Fast DS+Other, Harder","hint":"UFDS; connect all tree branches; connect two reachable trees (use geometry); connect trees that can reach doctor","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11525","title":null,"url":"https://onlinejudge.org/external/115/11525.pdf","section":"8.7d","topic":"Fast DS+Other, Harder","hint":"use Fenwick Tree and binary search the answer to find the lowest index i that has RSQ(1;i) = Si","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"dictionaryattack","title":"dictionaryattack","url":"https://open.kattis.com/problems/dictionaryattack","section":"8.7d","topic":"Fast DS+Other, Harder","hint":"time limit is generous; you can generate all possible password with just 3 swaps; store in sets","dacu":101,"points":7,"cp5":false,"solved":false},{"judge":"Kattis","id":"doublets","title":"doublets","url":"https://open.kattis.com/problems/doublets","section":"8.7d","topic":"Fast DS+Other, Harder","hint":"s: (string); BFS; use trie to quickly identify neighbor that is one Hamming distance away; also available at UVa 10150 -...","dacu":56,"points":8.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"magicallights","title":"magicallights","url":"https://open.kattis.com/problems/magicallights","section":"8.7d","topic":"Fast DS+Other, Harder","hint":"LA 7487 - Singapore15; flatten the tree with DFS; use Fenwick Tree for Range Odd Query; use long long","dacu":309,"points":5.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"sparklesseven","title":"sparklesseven","url":"https://open.kattis.com/problems/sparklesseven","section":"8.7d","topic":"Fast DS+Other, Harder","hint":"seven nested loops with fast DS","dacu":52,"points":5.7,"cp5":false,"solved":false},{"judge":"UVa","id":"10012","title":null,"url":"https://onlinejudge.org/external/100/10012.pdf","section":"8.7e","topic":"Geometry+CS","hint":"try all 8! permutations; Euclidean dist","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11227","title":null,"url":"https://onlinejudge.org/external/112/11227.pdf","section":"8.7e","topic":"Geometry+CS","hint":"brute force; collinear test","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"collidingtraffic","title":"collidingtraffic","url":"https://open.kattis.com/problems/collidingtraffic","section":"8.7e","topic":"Geometry+CS","hint":"try all pairs of boats; 0.0 if one pair collide; or, use a quadratic equation; also available at UVa 11574 - Colliding T...","dacu":48,"points":5,"cp5":false,"solved":false},{"judge":"Kattis","id":"cranes","title":"cranes","url":"https://open.kattis.com/problems/cranes","section":"8.7e","topic":"Geometry+CS","hint":"circle-circle intersection; backtracking or brute force subsets with bitmask; also available at UVa 11515 - Cranes","dacu":137,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"doggopher","title":"doggopher","url":"https://open.kattis.com/problems/doggopher","section":"8.7e","topic":"Geometry+CS","hint":"complete search; Euclidean distance dist; also available at UVa 10310 - Dog and Gopher","dacu":119,"points":2.5,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0149","title":"Max Points on a Line","url":"https://leetcode.com/problems/max-points-on-a-line/","section":"8.7e","topic":"Geometry+CS","hint":"identical with UVa 11227; top-interview-150","dacu":0,"points":6,"cp5":true,"solved":false},{"judge":"UVa","id":"11008","title":null,"url":"https://onlinejudge.org/external/110/11008.pdf","section":"8.7f","topic":"Geometry+Other","hint":"collinear test; DP bitmask","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12322","title":null,"url":"https://onlinejudge.org/external/123/12322.pdf","section":"8.7f","topic":"Geometry+Other","hint":"first; use atan2 to convert angles to 1D intervals; then sort it and use a greedy scan to get the answer","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"findinglines","title":"findinglines","url":"https://open.kattis.com/problems/findinglines","section":"8.7f","topic":"Geometry+Other","hint":"randomly pick two points; there is a good chance that 20% or more points are on that line defined by those two points","dacu":209,"points":6.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"humancannonball","title":"humancannonball","url":"https://open.kattis.com/problems/humancannonball","section":"8.7f","topic":"Geometry+Other","hint":"build the travel time graph with Euclidean distance computations; use Floyd-Warshall","dacu":757,"points":2.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0976","title":"Largest Perimeter Triangle","url":"https://leetcode.com/problems/largest-perimeter-triangle/","section":"8.7f","topic":"Geometry+Other","hint":"sort nums in non-increasing order; do triangle inequality checks; programming-skills","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"Kattis","id":"walkway","title":"walkway","url":"https://open.kattis.com/problems/walkway","section":"8.7f","topic":"Geometry+Other","hint":"we can build the graph and compute area of trapezoid using simple geometry; SSSP on weighted graph; Dijkstra's","dacu":190,"points":3.4,"cp5":false,"solved":false},{"judge":"UVa","id":"00393","title":null,"url":"https://onlinejudge.org/external/3/393.pdf","section":"8.7g","topic":"Graph+Other","hint":"build the small visibility graph with line segment intersection checks; run Floyd-Warshall routine to get the answer","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01092","title":null,"url":"https://onlinejudge.org/external/10/1092.pdf","section":"8.7g","topic":"Graph+Other","hint":"LA 4787 - WorldFinals Harbin10; compress graph; traversal from exit with S/W direction; inclusion-exclusion","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12159","title":null,"url":"https://onlinejudge.org/external/121/12159.pdf","section":"8.7g","topic":"Graph+Other","hint":"LA 4407 - KualaLumpur08; use simple CCW tests (geometry) to build the bipartite graph; MCBM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"crowdcontrol","title":"crowdcontrol","url":"https://open.kattis.com/problems/crowdcontrol","section":"8.7g","topic":"Graph+Other","hint":"maximin path problem; MST; DFS from train station to BAPC; block unused edges","dacu":100,"points":3.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"gears2","title":"gears2","url":"https://open.kattis.com/problems/gears2","section":"8.7g","topic":"Graph+Other","hint":"graph reachability test; cycle with equal ratio is actually OK; math fraction","dacu":95,"points":3.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"gridmst","title":"gridmst","url":"https://open.kattis.com/problems/gridmst","section":"8.7g","topic":"Graph+Other","hint":"Singapore15 preliminary; rectilinear MST problem; small 2D grid; multi-sources BFS to construct short edges; Kruskal's t...","dacu":245,"points":7.4,"cp5":false,"solved":false},{"judge":"UVa","id":"01069","title":null,"url":"https://onlinejudge.org/external/10/1069.pdf","section":"8.7h","topic":"Mathematics+Other","hint":"LA 4119 - WorldFinals Banff08; string parsing, divisibility of polynomial, brute force, and modPow","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11282","title":null,"url":"https://onlinejudge.org/external/112/11282.pdf","section":"8.7h","topic":"Mathematics+Other","hint":"derangement and binomial coefficient; Big Integer","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"emergency","title":"emergency","url":"https://open.kattis.com/problems/emergency","section":"8.7h","topic":"Mathematics+Other","hint":"the problem is posed as an SSSP problem on special graph; but turns out a simple formula solves the problem; Big Integer","dacu":319,"points":3.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"industrialspy","title":"industrialspy","url":"https://open.kattis.com/problems/industrialspy","section":"8.7h","topic":"Mathematics+Other","hint":"brute force recursive bitmask with prime check; also available at UVa 12218 - An Industrial Spy","dacu":556,"points":3.3,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc1071","title":"Greatest Common Divisor of Strings","url":"https://leetcode.com/problems/greatest-common-divisor-of-strings/","section":"8.7h","topic":"Mathematics+Other","hint":"divisibility; on string; leetcode-75","dacu":0,"points":2,"cp5":true,"solved":false},{"judge":"Kattis","id":"megainversions","title":"megainversions","url":"https://open.kattis.com/problems/megainversions","section":"8.7h","topic":"Mathematics+Other","hint":"a bit of combinatorics; use Fenwick Tree to compute smaller/larger numbers quickly","dacu":333,"points":5,"cp5":false,"solved":false},{"judge":"Kattis","id":"ontrack","title":"ontrack","url":"https://open.kattis.com/problems/ontrack","section":"8.7h","topic":"Mathematics+Other","hint":"DFS on Tree; the input is a tree, we can try all possible junctions as the critical junction","dacu":156,"points":4.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00976","title":null,"url":"https://onlinejudge.org/external/9/976.pdf","section":"8.7i","topic":"Graph+DP","hint":"flood fill to separate North and South banks; compute the cost of installing a bridge at each column; DP","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10937","title":null,"url":"https://onlinejudge.org/external/109/10937.pdf","section":"8.7i","topic":"Graph+DP","hint":"BFS -> APSP information for TSP; then DP or backtracking","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11324","title":null,"url":"https://onlinejudge.org/external/113/11324.pdf","section":"8.7i","topic":"Graph+DP","hint":"LONGEST-PATH on DAG; first, transform the graph into DAG of its SCCs; toposort","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11331","title":null,"url":"https://onlinejudge.org/external/113/11331.pdf","section":"8.7i","topic":"Graph+DP","hint":"bipartite graph checks; compute size of left/right sets per bipartite component; DP SUBSET-SUM","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"treasurediving","title":"treasurediving","url":"https://open.kattis.com/problems/treasurediving","section":"8.7i","topic":"Graph+DP","hint":"SSSP from source and all idol positions; TSP-like but there is a knapsack style parameter 'air_left'; use backtracking","dacu":87,"points":7.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"walkforest","title":"walkforest","url":"https://open.kattis.com/problems/walkforest","section":"8.7i","topic":"Graph+DP","hint":"counting paths in DAG; build the DAG; Dijkstra's from 'home'; also available at UVa 10917 - A Walk Through the Forest","dacu":245,"points":4.4,"cp5":false,"solved":false},{"judge":"UVa","id":"10533","title":null,"url":"https://onlinejudge.org/external/105/10533.pdf","section":"8.7j","topic":"Other+DP 1D RSQ/RMQ","hint":"sieve; check if a prime is a digit prime; DP 1D range sum","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10891","title":null,"url":"https://onlinejudge.org/external/108/10891.pdf","section":"8.7j","topic":"Other+DP 1D RSQ/RMQ","hint":"Double DP; 1D RSQ plus another DP to evaluate decision tree; s: (i, j); try all splitting points; minimax","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11032","title":null,"url":"https://onlinejudge.org/external/110/11032.pdf","section":"8.7j","topic":"Other+DP 1D RSQ/RMQ","hint":"observation: sod(i) can be only from 1 to 63; use 1D Range Sum Query for fun(a; b)","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11408","title":null,"url":"https://onlinejudge.org/external/114/11408.pdf","section":"8.7j","topic":"Other+DP 1D RSQ/RMQ","hint":"need 1D Range Sum Query","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"centsavings","title":"centsavings","url":"https://open.kattis.com/problems/centsavings","section":"8.7j","topic":"Other+DP 1D RSQ/RMQ","hint":"1D RSQ DP for sum of prices from [i..j]; round up/down; s: (idx, d_left); t: try all positioning of the next divider","dacu":531,"points":4.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"dvoniz","title":"dvoniz","url":"https://open.kattis.com/problems/dvoniz","section":"8.7j","topic":"Other+DP 1D RSQ/RMQ","hint":"involving 1D RSQ DP; binary search the answer","dacu":47,"points":7.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"program","title":"program","url":"https://open.kattis.com/problems/program","section":"8.7j","topic":"Other+DP 1D RSQ/RMQ","hint":"somewhat like Sieve of Eratosthenes initially and 1D RSQ DP speedup at the end","dacu":89,"points":7.7,"cp5":false,"solved":false},{"judge":"UVa","id":"00295","title":null,"url":"https://onlinejudge.org/external/2/295.pdf","section":"8.7k","topic":"Three++ Components, E","hint":"BSTA x: if the person has diameter x, can he go from left to right? graph connectivity; similar with UVa 10876","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01250","title":null,"url":"https://onlinejudge.org/external/12/1250.pdf","section":"8.7k","topic":"Three++ Components, E","hint":"LA 4607 - SoutheastUSA09; geometry; SSSP on DAG -> DP; DP 1D range sum","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"beeproblem","title":"beeproblem","url":"https://open.kattis.com/problems/beeproblem","section":"8.7k","topic":"Three++ Components, E","hint":"transform bee grid into 2D grid; compute size of each CCs; sort; greedy","dacu":156,"points":4.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"gettingthrough","title":"gettingthrough","url":"https://open.kattis.com/problems/gettingthrough","section":"8.7k","topic":"Three++ Components, E","hint":"BSTA+graph connectivity; Union-Find; similar to UVa 00295","dacu":51,"points":7.2,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc2300","title":"Successful Pairs of Spells and Potions","url":"https://leetcode.com/problems/successful-pairs-of-spells-and-potions/","section":"8.7k","topic":"Three++ Components, E","hint":"sort potions; try all spells and BSTA each time; leetcode-75","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"researchproductivityindex","title":"researchproductivityindex","url":"https://open.kattis.com/problems/researchproductivityindex","section":"8.7k","topic":"Three++ Components, E","hint":"sort papers by decreasing probability; brute force k and greedily submit k best papers; DP probability; keep max","dacu":358,"points":3.2,"cp5":false,"solved":false},{"judge":"UVa","id":"00811","title":null,"url":"https://onlinejudge.org/external/8/811.pdf","section":"8.7l","topic":"Three++ Components, H","hint":"LA 5211 - WorldFinals Eindhoven99; get CH and perimeter of polygon; generate all subsets iteratively with bitmask","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01040","title":null,"url":"https://onlinejudge.org/external/10/1040.pdf","section":"8.7l","topic":"Three++ Components, H","hint":"LA 3271 - WorldFinals Shanghai05; try all subsets of 2^20 cities; MST; complex output formatting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01079","title":null,"url":"https://onlinejudge.org/external/10/1079.pdf","section":"8.7l","topic":"Three++ Components, H","hint":"LA 4445 - WorldFinals Stockholm09; iterative complete search (permutation); BSTA + greedy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"carpool","title":"carpool","url":"https://open.kattis.com/problems/carpool","section":"8.7l","topic":"Three++ Components, H","hint":"Floyd-Warshall/APSP; iterative brute force subset and permutation; DP; also available at UVa 11288 - Carpool","dacu":40,"points":6.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"clockpictures","title":"clockpictures","url":"https://open.kattis.com/problems/clockpictures","section":"8.7l","topic":"Three++ Components, H","hint":"sort angles; compute 'string' of differences of adjacent angles (use modulo); min lexicographic rotation; use SA or KMP","dacu":463,"points":5.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"guessthenumbers","title":"guessthenumbers","url":"https://open.kattis.com/problems/guessthenumbers","section":"8.7l","topic":"Three++ Components, H","hint":"brute force permute up to 5!; recursive string parsing (simple BNF); also available at UVa 12392 - Guess the Numbers","dacu":64,"points":8.5,"cp5":false,"solved":false},{"judge":"UVa","id":"00588","title":null,"url":"https://onlinejudge.org/external/5/588.pdf","section":"9.artg","topic":"Art Gallery","hint":"cutPolygon","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01304","title":null,"url":"https://onlinejudge.org/external/13/1304.pdf","section":"9.artg","topic":"Art Gallery","hint":"LA 2512 - SouthEasternEurope02; cutPolygon and area of polygon","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01571","title":null,"url":"https://onlinejudge.org/external/15/1571.pdf","section":"9.artg","topic":"Art Gallery","hint":"LA 3617 - Yokohama06; cutPolygon","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10078","title":null,"url":"https://onlinejudge.org/external/100/10078.pdf","section":"9.artg","topic":"Art Gallery","hint":"isConvex","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00652","title":null,"url":"https://onlinejudge.org/external/6/652.pdf","section":"9.asta","topic":"A* or IDA*","hint":"classic sliding block 8-puzzle; IDA*","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"00656","title":null,"url":"https://onlinejudge.org/external/6/656.pdf","section":"9.asta","topic":"A* or IDA*","hint":"we can use IDDFS with pruning","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10181","title":null,"url":"https://onlinejudge.org/external/101/10181.pdf","section":"9.asta","topic":"A* or IDA*","hint":"similar with UVa 652 but larger (now 15 instead of 8); we can use IDA*","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11163","title":null,"url":"https://onlinejudge.org/external/111/11163.pdf","section":"9.asta","topic":"A* or IDA*","hint":"another puzzle game solvable with IDA*","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"joggingtrails","title":"joggingtrails","url":"https://open.kattis.com/problems/joggingtrails","section":"9.chi1","topic":"Chinese Postman","hint":"basic Chinese Postman Problem; also available at UVa 10296 - Jogging Trails","dacu":75,"points":5,"cp5":false,"solved":false},{"judge":"UVa","id":"00756","title":null,"url":"https://onlinejudge.org/external/7/756.pdf","section":"9.chi2","topic":"Chinese Remainder","hint":"CRT or brute force","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"chineseremainder","title":"chineseremainder","url":"https://open.kattis.com/problems/chineseremainder","section":"9.chi2","topic":"Chinese Remainder","hint":"basic CRT; 2 linear congruences; Big Integer","dacu":343,"points":5.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"generalchineseremainder","title":"generalchineseremainder","url":"https://open.kattis.com/problems/generalchineseremainder","section":"9.chi2","topic":"Chinese Remainder","hint":"general CRT; 2 linear congruences","dacu":362,"points":3.7,"cp5":false,"solved":false},{"judge":"Kattis","id":"granica","title":"granica","url":"https://open.kattis.com/problems/granica","section":"9.chi2","topic":"Chinese Remainder","hint":"CRT; GCD of all N differences of 2 numbers","dacu":95,"points":6.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"heliocentric","title":"heliocentric","url":"https://open.kattis.com/problems/heliocentric","section":"9.chi2","topic":"Chinese Remainder","hint":"CRT or brute force","dacu":1030,"points":1.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"remainderreminder","title":"remainderreminder","url":"https://open.kattis.com/problems/remainderreminder","section":"9.chi2","topic":"Chinese Remainder","hint":"a bit of brute force + sorting; generalized CRT","dacu":124,"points":5.2,"cp5":false,"solved":false},{"judge":"UVa","id":"10245","title":null,"url":"https://onlinejudge.org/external/102/10245.pdf","section":"9.clos","topic":"Closest Pair","hint":"classic","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11378","title":null,"url":"https://onlinejudge.org/external/113/11378.pdf","section":"9.clos","topic":"Closest Pair","hint":"also a closest pair problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"closestpair1","title":"closestpair1","url":"https://open.kattis.com/problems/closestpair1","section":"9.clos","topic":"Closest Pair","hint":"classic closest pair problem - the easier one","dacu":269,"points":5.7,"cp5":false,"solved":false},{"judge":"UVa","id":"10165","title":null,"url":"https://onlinejudge.org/external/101/10165.pdf","section":"9.comb","topic":"Comb Game Theory","hint":"Nim game; application of Sprague-Grundy theorem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11311","title":null,"url":"https://onlinejudge.org/external/113/11311.pdf","section":"9.comb","topic":"Comb Game Theory","hint":"there are 4 heaps; Nim sum","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"01266","title":null,"url":"https://onlinejudge.org/external/12/1266.pdf","section":"9.cons","topic":"Construction","hint":"LA 3478 - LatinAmerica05; follow the given construction strategy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10741","title":null,"url":"https://onlinejudge.org/external/107/10741.pdf","section":"9.cons","topic":"Construction","hint":"similar idea as 2D Magic Square; but now in 3D; just follow the given construction strategy","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"base2palindrome","title":"base2palindrome","url":"https://open.kattis.com/problems/base2palindrome","section":"9.cons","topic":"Construction","hint":"construct all possible base 2 palindromes; put into a set to remove duplicates and maintain order; output the M-th one","dacu":385,"points":4.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"espressobucks","title":"espressobucks","url":"https://open.kattis.com/problems/espressobucks","section":"9.cons","topic":"Construction","hint":"easy brute force construction; small nxm; not about Min-Vertex-Cover","dacu":159,"points":2.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"exofficio","title":"exofficio","url":"https://open.kattis.com/problems/exofficio","section":"9.cons","topic":"Construction","hint":"we can use BFS spanning tree from center of the grid; be careful of corner cases","dacu":41,"points":7.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"plowking","title":"plowking","url":"https://open.kattis.com/problems/plowking","section":"9.cons","topic":"Construction","hint":"greedy construction; reverse MST problem","dacu":92,"points":3.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"poplava","title":"poplava","url":"https://open.kattis.com/problems/poplava","section":"9.cons","topic":"Construction","hint":"actually there is a rather simple construction algorithm to achieve the required requirement","dacu":105,"points":3.4,"cp5":false,"solved":false},{"judge":"UVa","id":"10506","title":null,"url":"https://onlinejudge.org/external/105/10506.pdf","section":"9.debr","topic":"De Bruijn Sequence","hint":"any valid solution is AC; generate all possible next digit (up to base 10/digit [0..9]); check if it is still a valid Ou...","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11439","title":null,"url":"https://onlinejudge.org/external/114/11439.pdf","section":"9.edmo","topic":"Edmonds' Matching","hint":"BSTA (the minimum weight); use it to reconstruct the graph; perfect matching on medium-sized general graph","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10934","title":null,"url":"https://onlinejudge.org/external/109/10934.pdf","section":"9.eggd","topic":"Egg Dropping Puzzle","hint":"Egg dropping puzzle; interesting DP; try all possible answers","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"batteries","title":"batteries","url":"https://open.kattis.com/problems/batteries","section":"9.eggd","topic":"Egg Dropping Puzzle","hint":"Egg dropping puzzle with just 2 batteries; special case","dacu":146,"points":3.6,"cp5":false,"solved":false},{"judge":"Kattis","id":"powereggs","title":"powereggs","url":"https://open.kattis.com/problems/powereggs","section":"9.eggd","topic":"Egg Dropping Puzzle","hint":"Egg dropping puzzle; similar to UVa 10934","dacu":92,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"golfbot","title":"golfbot","url":"https://open.kattis.com/problems/golfbot","section":"9.fast","topic":"Fast Fourier Trans","hint":"count frequencies dist of each reachable distance in one shot; use FFT to multiply dist*dist; count distances reachable ...","dacu":133,"points":6.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"polymul2","title":"polymul2","url":"https://open.kattis.com/problems/polymul2","section":"9.fast","topic":"Fast Fourier Trans","hint":"basic polynomial multiplication problem that needs an O(n log n) algorithm; also see Kattis - polymul1","dacu":227,"points":6.8,"cp5":false,"solved":false},{"judge":"UVa","id":"01645","title":null,"url":"https://onlinejudge.org/external/16/1645.pdf","section":"9.form","topic":"Formulas/Theorems","hint":"LA 6368 - Chengdu12; number of rooted trees with n vertices in which vertices at the same level have the same degree","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11719","title":null,"url":"https://onlinejudge.org/external/117/11719.pdf","section":"9.form","topic":"Formulas/Theorems","hint":"count the number of spanning tree in a complete bipartite graph; use Java BigInteger","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12786","title":null,"url":"https://onlinejudge.org/external/127/12786.pdf","section":"9.form","topic":"Formulas/Theorems","hint":"similar to UVa 10720 and 11414; Erdos-Gallai Theorem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"13108","title":null,"url":"https://onlinejudge.org/external/131/13108.pdf","section":"9.form","topic":"Formulas/Theorems","hint":"Moser's circle; the formula is hard to derive; g(n) = nC4 + nC2 + 1","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"houseofcards","title":"houseofcards","url":"https://open.kattis.com/problems/houseofcards","section":"9.form","topic":"Formulas/Theorems","hint":"number of cards for certain height h is h * (3*h + 1) / 2; use Python to handle Big Integer","dacu":432,"points":3.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"janitortroubles","title":"janitortroubles","url":"https://open.kattis.com/problems/janitortroubles","section":"9.form","topic":"Formulas/Theorems","hint":"Brahmagupta's formula","dacu":745,"points":1.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"sjecista","title":"sjecista","url":"https://open.kattis.com/problems/sjecista","section":"9.form","topic":"Formulas/Theorems","hint":"number of intersections of diagonals in a convex polygon","dacu":581,"points":1.9,"cp5":false,"solved":false},{"judge":"UVa","id":"00684","title":null,"url":"https://onlinejudge.org/external/6/684.pdf","section":"9.gaus","topic":"Gauss Elimination","hint":"modified Gaussian elimination to find (integral) determinant of a square matrix","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11319","title":null,"url":"https://onlinejudge.org/external/113/11319.pdf","section":"9.gaus","topic":"Gauss Elimination","hint":"solve the system of the first 7 linear equations; then use all 1500 equations for 'smart sequence' checks","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"seti","title":"seti","url":"https://open.kattis.com/problems/seti","section":"9.gaus","topic":"Gauss Elimination","hint":"n equations and n unknowns; but there are division under modulo, so use Gaussian elimination with modular multiplicative...","dacu":52,"points":3.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"pizza","title":"pizza","url":"https://open.kattis.com/problems/pizza","section":"9.grad","topic":"Gradient Descent","hint":"gradient descent","dacu":252,"points":4.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"amazing","title":"amazing","url":"https://open.kattis.com/problems/amazing","section":"9.inte","topic":"Interactive Problem","hint":"run DFS and react based on the output of the program","dacu":215,"points":5.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"askmarilyn","title":"askmarilyn","url":"https://open.kattis.com/problems/askmarilyn","section":"9.inte","topic":"Interactive Problem","hint":"the famous Monty hall problem in interactive format","dacu":135,"points":4.2,"cp5":false,"solved":false},{"judge":"Kattis","id":"blackout","title":"blackout","url":"https://open.kattis.com/problems/blackout","section":"9.inte","topic":"Interactive Problem","hint":"interactive game theory; block one row; mirror jury's move","dacu":129,"points":3.1,"cp5":false,"solved":false},{"judge":"Kattis","id":"crusaders","title":"crusaders","url":"https://open.kattis.com/problems/crusaders","section":"9.inte","topic":"Interactive Problem","hint":"another nice interactive problem about binary search","dacu":34,"points":7.4,"cp5":false,"solved":false},{"judge":"Kattis","id":"guess","title":"guess","url":"https://open.kattis.com/problems/guess","section":"9.inte","topic":"Interactive Problem","hint":"interactive problem; binary search","dacu":1682,"points":2.7,"cp5":false,"solved":false},{"judge":"UVa","id":"01045","title":null,"url":"https://onlinejudge.org/external/10/1045.pdf","section":"9.kuhn","topic":"Kuhn-Munkres","hint":"LA 3276 - WorldFinals Shanghai05; try all configurations; weighted matching; pick the best; Kuhn-Munkres","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10746","title":null,"url":"https://onlinejudge.org/external/107/10746.pdf","section":"9.kuhn","topic":"Kuhn-Munkres","hint":"min weighted bipartite matching","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10888","title":null,"url":"https://onlinejudge.org/external/108/10888.pdf","section":"9.kuhn","topic":"Kuhn-Munkres","hint":"BFS/SSSP; min weighted bipartite matching","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11553","title":null,"url":"https://onlinejudge.org/external/115/11553.pdf","section":"9.kuhn","topic":"Kuhn-Munkres","hint":"brute force; DP bitmask; or Hungarian","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"aqueducts","title":"aqueducts","url":"https://open.kattis.com/problems/aqueducts","section":"9.kuhn","topic":"Kuhn-Munkres","hint":"build bipartite graph; weighted MCBM; Hungarian","dacu":51,"points":6,"cp5":false,"solved":false},{"judge":"Kattis","id":"engaging","title":"engaging","url":"https://open.kattis.com/problems/engaging","section":"9.kuhn","topic":"Kuhn-Munkres","hint":"LA 8437 - HoChiMinhCity17; Hungarian; print solution","dacu":135,"points":5.8,"cp5":false,"solved":false},{"judge":"Kattis","id":"cheeseifyouplease","title":"cheeseifyouplease","url":"https://open.kattis.com/problems/cheeseifyouplease","section":"9.line","topic":"Linear Programming","hint":"simple Linear Programming problem; use Simplex","dacu":51,"points":3.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"maximumrent","title":"maximumrent","url":"https://open.kattis.com/problems/maximumrent","section":"9.line","topic":"Linear Programming","hint":"basic Linear Programming problem with integer output; we can use simplex algorithm or another simpler solution","dacu":241,"points":3.1,"cp5":false,"solved":false},{"judge":"UVa","id":"10938","title":null,"url":"https://onlinejudge.org/external/109/10938.pdf","section":"9.lowe","topic":"Lowest Common Anc","hint":"basic LCA problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12238","title":null,"url":"https://onlinejudge.org/external/122/12238.pdf","section":"9.lowe","topic":"Lowest Common Anc","hint":"similar to UVa 10938","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"chewbacca","title":"chewbacca","url":"https://open.kattis.com/problems/chewbacca","section":"9.lowe","topic":"Lowest Common Anc","hint":"complete short k-ary tree; binary heap indexing; LCA","dacu":186,"points":3.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00348","title":null,"url":"https://onlinejudge.org/external/3/348.pdf","section":"9.matr","topic":"Matrix Chain Mult","hint":"DP; s(i, j); output the optimal solution; the optimal sequence is not unique","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10594","title":null,"url":"https://onlinejudge.org/external/105/10594.pdf","section":"9.minc","topic":"Min Cost (Max) Flow","hint":"basic min cost max flow problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10806","title":null,"url":"https://onlinejudge.org/external/108/10806.pdf","section":"9.minc","topic":"Min Cost (Max) Flow","hint":"send 2 edge-disjoint flows with min cost","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"11301","title":null,"url":"https://onlinejudge.org/external/113/11301.pdf","section":"9.minc","topic":"Min Cost (Max) Flow","hint":"modeling; vertex capacity; MCMF","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"12821","title":null,"url":"https://onlinejudge.org/external/128/12821.pdf","section":"9.minc","topic":"Min Cost (Max) Flow","hint":"similar to UVa 10806","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"Kattis","id":"catering","title":"catering","url":"https://open.kattis.com/problems/catering","section":"9.minc","topic":"Min Cost (Max) Flow","hint":"LA 7152 - WorldFinals Marrakech15; MCMF modeling","dacu":246,"points":3.9,"cp5":false,"solved":false},{"judge":"Kattis","id":"mincostmaxflow","title":"mincostmaxflow","url":"https://open.kattis.com/problems/mincostmaxflow","section":"9.minc","topic":"Min Cost (Max) Flow","hint":"very basic MCMF problem; good starting point","dacu":232,"points":5.3,"cp5":false,"solved":false},{"judge":"Kattis","id":"ragingriver","title":"ragingriver","url":"https://open.kattis.com/problems/ragingriver","section":"9.minc","topic":"Min Cost (Max) Flow","hint":"MCMF; unit capacity and unit cost","dacu":96,"points":7.1,"cp5":false,"solved":false},{"judge":"UVa","id":"00120","title":null,"url":"https://onlinejudge.org/external/1/120.pdf","section":"9.panc","topic":"Pancake Sorting","hint":"greedy pancake sorting","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0969","title":"Pancake Sorting","url":"https://leetcode.com/problems/pancake-sorting/","section":"9.panc","topic":"Pancake Sorting","hint":"the easier form of Pancake Sorting; flip largest to top (index 1), then to target; at most 2*n flips","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"UVa","id":"11476","title":null,"url":"https://onlinejudge.org/external/114/11476.pdf","section":"9.poll","topic":"Pollard's rho","hint":"basic integer factorization problem that requires Pollard's rho algorithm","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"LeetCode","id":"lc0169","title":"Majority Element","url":"https://leetcode.com/problems/majority-element/","section":"9.rand","topic":"Randomized Algo","hint":"try a random number and see if it is the majority element, repeat; top-100-liked; top-interview-150","dacu":0,"points":2,"cp5":true,"solved":true},{"judge":"LeetCode","id":"lc0398","title":"Random Pick Index","url":"https://leetcode.com/problems/random-pick-index/","section":"9.rand","topic":"Randomized Algo","hint":"separate chaining; record indices of each value; randomly return a valid index","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"LeetCode","id":"lc0519","title":"Random Flip Matrix","url":"https://leetcode.com/problems/random-flip-matrix/","section":"9.rand","topic":"Randomized Algo","hint":"randomly pick (r, c) inside the grid; repeat if it has been taken","dacu":0,"points":4,"cp5":true,"solved":false},{"judge":"Kattis","id":"cardboardcontainer","title":"cardboardcontainer","url":"https://open.kattis.com/problems/cardboardcontainer","section":"9.sqrt","topic":"Square Root Decomp","hint":"two out of L, W, and H  must be ≤ sqrt(V); brute force L and W in sqrt(V)*sqrt(V) and test if V is divisible by (L*W)","dacu":141,"points":2.5,"cp5":false,"solved":false},{"judge":"Kattis","id":"modulodatastructures","title":"modulodatastructures","url":"https://open.kattis.com/problems/modulodatastructures","section":"9.sqrt","topic":"Square Root Decomp","hint":"basic problem that can be solved with Square Root Decomposition technique","dacu":277,"points":4.6,"cp5":false,"solved":false},{"judge":"UVa","id":"00254","title":null,"url":"https://onlinejudge.org/external/2/254.pdf","section":"9.towe","topic":"Tower of Hanoi","hint":"define a recursive formula","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10017","title":null,"url":"https://onlinejudge.org/external/100/10017.pdf","section":"9.towe","topic":"Tower of Hanoi","hint":"classical problem","dacu":null,"points":0,"cp5":false,"solved":false},{"judge":"UVa","id":"10254","title":null,"url":"https://onlinejudge.org/external/102/10254.pdf","section":"9.towe","topic":"Tower of Hanoi","hint":"find pattern; use Java BigInteger","dacu":null,"points":0,"cp5":false,"solved":false}]}