Competitive Programming


Methods to Solve (2000-present)

Use these filters to narrow down your next problem to solve:

OJ: , Topic: , Quality:

You can now sort these problems based on Distinct ACcepted Users (DACU) column.
Generally, problems with high DACU are the easier problems.
Note that we only update DACU column manually (not a live data).

Note: Column Point is only relevant for Kattis online judge.

Both OJ Problem Title CP4 Hint DACU Point
10740 Fetching from uHunt non-starred standard K-Best Shortest Paths problem 0.0
10989 Fetching from uHunt non-starred this is the basic problem solvable with Stoer Wagner's algorithm 0.0
11594 Fetching from uHunt non-starred use Gomory-Hu tree 0.0
11603 Fetching from uHunt non-starred get the maximum spanning tree of the input table; then check if its all pairs maximum flow equals to the input table 0.0
mnist10class mnist10class non-starred partial scoring problem - neural network 258 8.3
mnist2class mnist2class non-starred partial scoring problem - neural network 242 8.0
mwvc mwvc non-starred optimization problem involving large MWVC instance up to N ≤ 4000. To get high score for this problem, you need to us... 48 9.6
tsp tsp non-starred optimization problem involving large TSP instance up to N ≤ 1000. To get high score for this problem, you need to use... 1334 9.6
10071 Fetching from uHunt 1.4a, I/O + Sequences Only super simple: output 2*v*t 0.0
11614 Fetching from uHunt 1.4a, I/O + Sequences Only root of a quadratic equation 0.0
11805 Fetching from uHunt 1.4a, I/O + Sequences Only very simple O(1) formula exists 0.0
12478 Fetching from uHunt 1.4a, I/O + Sequences Only try one of the eight names 0.0
13025 Fetching from uHunt 1.4a, I/O + Sequences Only giveaway, just print the one-line answer 0.0
carrots carrots 1.4a, I/O + Sequences Only just print P 15155 1.3
faktor faktor 1.4a, I/O + Sequences Only just print (I-1)*A+1 8022 1.2
greetings2 greetings2 1.4a, I/O + Sequences Only just reprint the input as requested 589 1.3
hello hello 1.4a, I/O + Sequences Only just print "Hello World!" 39217 1.2
jackolanternjuxtaposition jackolanternjuxtaposition 1.4a, I/O + Sequences Only just print N*T*M 53 1.7
planina planina 1.4a, I/O + Sequences Only just print (2^N+1)^2; OEIS A028400 5965 1.3
r2 r2 1.4a, I/O + Sequences Only just print 2*S-R1 14929 1.2
romans romans 1.4a, I/O + Sequences Only just print round(X * 1087.7626) 2088 1.4
thelastproblem thelastproblem 1.4a, I/O + Sequences Only S can have space(s) 76 1.8
01124 Fetching from uHunt 1.4b, Repetition Only LA 2681 - SouthEasternEurope06; just echo/re-print the input again 0.0
10055 Fetching from uHunt 1.4b, Repetition Only absolute function; the only trap is to use long long 0.0
11044 Fetching from uHunt 1.4b, Repetition Only one liner code/formula exists 0.0
11547 Fetching from uHunt 1.4b, Repetition Only a one liner O(1) solution exists 0.0
different different 1.4b, Repetition Only use abs function per test case 8964 2.3
jumbojavelin jumbojavelin 1.4b, Repetition Only sum and offset by (N-1) 112 1.5
qaly qaly 1.4b, Repetition Only trivial loop 5955 1.2
tarifa tarifa 1.4b, Repetition Only one pass; array not needed 9768 1.3
timeloop timeloop 1.4b, Repetition Only just print 'num Abracadabra' N times 17170 1.3
conteststruggles conteststruggles 1.4c, Selection Only simple formula; check if answer in [0..100] 101 1.9
fyi fyi 1.4c, Selection Only if-else; 2 cases; output 1/0 if the input starts with '555'/not, respectively 90 1.6
isithalloween isithalloween 1.4c, Selection Only if-else; 2 cases 3761 1.3
judgingmoose judgingmoose 1.4c, Selection Only if-else if-else; 3 cases 4516 1.4
moscowdream moscowdream 1.4c, Selection Only if-else; 2 cases; check n ≥ 3 443 1.7
onechicken onechicken 1.4c, Selection Only if-else if-else; 4 cases (piece vs pieces) 3014 1.6
provincesandgold provincesandgold 1.4c, Selection Only if-else if-else; 6 cases 1779 1.4
quadrant quadrant 1.4c, Selection Only if-else if-else; 4 cases 13625 1.3
temperature temperature 1.4c, Selection Only if-else if-else; 3 cases; derive formula 685 2.2
vajningsplikt vajningsplikt 1.4c, Selection Only selection; multiple cases; be careful 114 1.8
00621 Fetching from uHunt 1.4d, Multiple TC + Selection case analysis for only 4 possible outputs 0.0
11172 Fetching from uHunt 1.4d, Multiple TC + Selection very easy; one liner 0.0
11723 Fetching from uHunt 1.4d, Multiple TC + Selection simple math 0.0
11727 Fetching from uHunt 1.4d, Multiple TC + Selection sort the 3 numbers and get the median 0.0
12250 Fetching from uHunt 1.4d, Multiple TC + Selection LA 4995 - KualaLumpur10; if-else 0.0
12289 Fetching from uHunt 1.4d, Multiple TC + Selection just use if-else statements 0.0
12372 Fetching from uHunt 1.4d, Multiple TC + Selection just check if all L, W, H ≤ 20 0.0
12468 Fetching from uHunt 1.4d, Multiple TC + Selection easy; there are only 4 possibilities 0.0
12577 Fetching from uHunt 1.4d, Multiple TC + Selection straightforward 0.0
12646 Fetching from uHunt 1.4d, Multiple TC + Selection simply enumerate all cases 0.0
12917 Fetching from uHunt 1.4d, Multiple TC + Selection simple O(1) check 0.0
astrologicalsign astrologicalsign 1.4d, Multiple TC + Selection 12 cases (Capricorn is a bit different) 226 1.6
eligibility eligibility 1.4d, Multiple TC + Selection 3 cases 1741 1.6
helpaphd helpaphd 1.4d, Multiple TC + Selection 2 cases 2044 1.6
leftbeehind leftbeehind 1.4d, Multiple TC + Selection 4 cases 2014 1.6
nastyhacks nastyhacks 1.4d, Multiple TC + Selection 3 cases 6308 1.3
numberfun numberfun 1.4d, Multiple TC + Selection 2 cases (out of 6 combinations; addition/multiplication are commutative); remember integer division 3436 1.4
oddities oddities 1.4d, Multiple TC + Selection 2 cases 11523 1.3
00272 Fetching from uHunt 1.4e, Control Flow replace all double quotes to TeX style quotes 0.0
10300 Fetching from uHunt 1.4e, Control Flow ignore the number of animals 0.0
11364 Fetching from uHunt 1.4e, Control Flow linear scan to get l and r; answer = 2*(r-l) 0.0
11498 Fetching from uHunt 1.4e, Control Flow just use if-else statements 0.0
11764 Fetching from uHunt 1.4e, Control Flow one linear scan to count high low jumps 0.0
11799 Fetching from uHunt 1.4e, Control Flow one linear scan; find max value 0.0
12279 Fetching from uHunt 1.4e, Control Flow simple linear scan 0.0
12403 Fetching from uHunt 1.4e, Control Flow straightforward 0.0
13012 Fetching from uHunt 1.4e, Control Flow giveaway 0.0
13034 Fetching from uHunt 1.4e, Control Flow giveaway, simple loop 13 times 0.0
13130 Fetching from uHunt 1.4e, Control Flow simple 0.0
babybites babybites 1.4e, Control Flow easy simulation 1624 1.7
basketballoneonone basketballoneonone 1.4e, Control Flow linear pass 957 1.6
brokencalculator brokencalculator 1.4e, Control Flow trivial; just do as asked 13 3.7
cold cold 1.4e, Control Flow linear pass; array not really needed 12609 1.3
earlywinter earlywinter 1.4e, Control Flow linear pass 543 1.9
fizzbuzz fizzbuzz 1.4e, Control Flow actually just about easy divisibility properties 10274 1.3
fromatob fromatob 1.4e, Control Flow we can only go up via (a bunch of) +1 move(s); we can only go down via (an optional +1 move to make even) and then divid... 44 3.1
jobexpenses jobexpenses 1.4e, Control Flow simple loop 1427 1.4
licensetolaunch licensetolaunch 1.4e, Control Flow easy linear pass 1969 1.4
oddgnome oddgnome 1.4e, Control Flow linear pass 2388 1.6
speeding speeding 1.4e, Control Flow just loop; keep the running max 84 1.4
speedlimit speedlimit 1.4e, Control Flow standard simulation problem 7164 1.4
spellingbee spellingbee 1.4e, Control Flow trivial; just do as asked; string property checks 17 3.2
stararrangements stararrangements 1.4e, Control Flow one loop 1637 1.4
statistics statistics 1.4e, Control Flow one pass; array not needed 2942 1.7
thanos thanos 1.4e, Control Flow simple simulation; R is at least 2 335 3.2
tornbygge tornbygge 1.4e, Control Flow linear pass 272 1.8
zanzibar zanzibar 1.4e, Control Flow one pass; array not needed 2308 1.5
01709 Fetching from uHunt 1.4f, Function LA 7150 - WorldFinals Marrakech15; linear scan; probably one of the easiest WorldFinals problem; also available at Katti... 0.0
10424 Fetching from uHunt 1.4f, Function just do as asked 0.0
10550 Fetching from uHunt 1.4f, Function simple; do as asked; also available at Kattis - combinationlock 0.0
11078 Fetching from uHunt 1.4f, Function one linear scan; max function 0.0
11332 Fetching from uHunt 1.4f, Function simple recursion 0.0
11687 Fetching from uHunt 1.4f, Function direct simulation; also available at Kattis - digits 0.0
abc abc 1.4f, Function sort 3 numbers into ABC; then print output as needed 5282 1.8
artichoke artichoke 1.4f, Function LA 7150 - WorldFinals Marrakech15; linear scan; probably one of the easiest WorldFinals problem; also available at UVa 0... 1390 2.8
combinationlock combinationlock 1.4f, Function simple; do as asked; also available at UVa 10550 - Combination Lock 633 2.5
digits digits 1.4f, Function direct simulation; also available at UVa 11687 - Digits 214 3.5
filip filip 1.4f, Function create a 'reverse string' function; then if-else check 6345 1.3
mia mia 1.4f, Function just if-else check 1136 2.1
sifferprodukt sifferprodukt 1.4f, Function easy digit product function 460 1.5
treasurehunt treasurehunt 1.4f, Function simple simulation on 2D grid 1006 2.6
01585 Fetching from uHunt 1.4g, 1D Array, Easier LA 3354 - Seoul05; very easy one pass algorithm 0.0
11679 Fetching from uHunt 1.4g, 1D Array, Easier simulate; see if all banks have ≥ 0 reserve 0.0
11942 Fetching from uHunt 1.4g, 1D Array, Easier check if input is sorted 0.0
12015 Fetching from uHunt 1.4g, 1D Array, Easier traverse the list twice 0.0
acm acm 1.4g, 1D Array, Easier simple simulation; one pass 3526 1.5
cetiri cetiri 1.4g, 1D Array, Easier sort 3 number helps; 3 cases 1165 1.9
finalexam2 finalexam2 1.4g, 1D Array, Easier compare array with itself (but shifted by one index) 378 1.3
forcedchoice forcedchoice 1.4g, 1D Array, Easier simple in-small-array test 205 1.3
hothike hothike 1.4g, 1D Array, Easier one pass; using array helps a bit 835 1.7
lineup lineup 1.4g, 1D Array, Easier sort ascending/descending and compare 3703 1.6
lostlineup lostlineup 1.4g, 1D Array, Easier simple 1D array manipulation 550 1.5
ofugsnuid ofugsnuid 1.4g, 1D Array, Easier simple list reversal problem; one liner with Python 636 1.4
trainboarding trainboarding 1.4g, 1D Array, Easier simulation with arrays 58 3.0
vaccineefficacy vaccineefficacy 1.4g, 1D Array, Easier use small arrays; just compute as described 102 2.6
01641 Fetching from uHunt 1.4h, Easy scan row by row; flip the status of inside/outside polygon due to the presence of character slash or backslash 0.0
10963 Fetching from uHunt 1.4h, Easy for two blocks to be merge-able, the gaps between their columns must be the same 0.0
12503 Fetching from uHunt 1.4h, Easy easy simulation 0.0
12554 Fetching from uHunt 1.4h, Easy easy simulation 0.0
12658 Fetching from uHunt 1.4h, Easy character recognition check 0.0
12696 Fetching from uHunt 1.4h, Easy LA 6608 - Phuket 2013; easy problem 0.0
12750 Fetching from uHunt 1.4h, Easy simply loop through the given dataset in O(n) and output the answer 0.0
12798 Fetching from uHunt 1.4h, Easy simply loop through the given dataset in O(N*M) and output the answer 0.0
armystrengtheasy armystrengtheasy 1.4h, Easy also see Kattis - armystrengthhard 1585 2.1
armystrengthhard armystrengthhard 1.4h, Easy also see Kattis - armystrengtheasy; re-read the problem statement several times to unveil a trivial solution 1466 2.2
batterup batterup 1.4h, Easy easy one loop 4542 1.3
brokenswords brokenswords 1.4h, Easy easy counting problem 367 1.7
drinkingsong drinkingsong 1.4h, Easy just one loop; but be careful of with the grammar 336 2.4
hangingout hangingout 1.4h, Easy simple loop 2218 1.3
hissingmicrophone hissingmicrophone 1.4h, Easy simple loop 7690 1.3
methodicmultiplication methodicmultiplication 1.4h, Easy reading comprehension; very easy answer 381 1.6
mosquito mosquito 1.4h, Easy direct simulation 822 1.9
nop nop 1.4h, Easy one loop; simply count and modify distances between two UPPERCASE characters 94 2.1
pokerhand pokerhand 1.4h, Easy frequency count; report max 2173 1.4
ptice ptice 1.4h, Easy just a simple simulation 2100 1.5
sevenwonders sevenwonders 1.4h, Easy one pass 4776 1.4
stopwatch stopwatch 1.4h, Easy linear pass; simulation 390 1.3
volim volim 1.4h, Easy simple simulation 1855 1.7
yinyangstones yinyangstones 1.4h, Easy trick question; just check if number of whites equals to number of blacks 1365 1.8
10114 Fetching from uHunt 1.4i, Still Easy just simulate the process 0.0
10141 Fetching from uHunt 1.4i, Still Easy solvable with one linear scan 0.0
10324 Fetching from uHunt 1.4i, Still Easy simplify using 1D array: change counter 0.0
10919 Fetching from uHunt 1.4i, Still Easy process the requirements as the input is read; also available at Kattis - prerequisites 0.0
11559 Fetching from uHunt 1.4i, Still Easy one linear pass 0.0
11586 Fetching from uHunt 1.4i, Still Easy TLE if brute force; find the pattern 0.0
11661 Fetching from uHunt 1.4i, Still Easy linear scan 0.0
11683 Fetching from uHunt 1.4i, Still Easy one linear pass is enough 0.0
11786 Fetching from uHunt 1.4i, Still Easy need to observe the pattern 0.0
12614 Fetching from uHunt 1.4i, Still Easy this problem has nice bitmask story camouflage; the final solution--after some thought--is very easy 0.0
13007 Fetching from uHunt 1.4i, Still Easy simple simulation 0.0
architecture architecture 1.4i, Still Easy 2D array problem with an easy two 1D arrays solution 78 2.7
bossbattle bossbattle 1.4i, Still Easy trick question 1391 1.8
boundingrobots boundingrobots 1.4i, Still Easy maintain separate variables 1141 1.6
bubbletea bubbletea 1.4i, Still Easy simple simulation 806 2.2
climbingstairs climbingstairs 1.4i, Still Easy observation: go to office (k), go to registration desk (r), go up/down 1 floor until you reach n steps, go home; repetit... 210 4.1
deathtaxes deathtaxes 1.4i, Still Easy direct simulation; a bit of reading comprehension 179 3.3
driversdilemma driversdilemma 1.4i, Still Easy only 6 different cases; note that starting fuel is C/2 200 2.0
eventplanning eventplanning 1.4i, Still Easy just simulate; 2D loop 458 2.0
exactlyelectrical exactlyelectrical 1.4i, Still Easy Manhattan distance; waste energy at the end by moving 1 cell around target 469 2.0
missingnumbers missingnumbers 1.4i, Still Easy two linear loops; use a small array of Booleans 1622 1.7
peasoup peasoup 1.4i, Still Easy one linear pass 771 2.4
prerequisites prerequisites 1.4i, Still Easy process the requirements as the input is read; also available at UVa 10919 - Prerequisites? 284 1.9
sok sok 1.4i, Still Easy case analysis 750 1.7
vote vote 1.4i, Still Easy follow the requirements 1584 2.2
00119 Fetching from uHunt 1.4j, Medium simulate the give and receive process 0.0
00573 Fetching from uHunt 1.4j, Medium simulation; several corner cases 0.0
00661 Fetching from uHunt 1.4j, Medium simulation 0.0
01237 Fetching from uHunt 1.4j, Medium LA 4142 - Jakarta08; input is small 0.0
11507 Fetching from uHunt 1.4j, Medium simulation; if-else 0.0
11956 Fetching from uHunt 1.4j, Medium simulation; ignore '.' 0.0
12157 Fetching from uHunt 1.4j, Medium LA 4405 - KualaLumpur08; compute and compare the two plans 0.0
12545 Fetching from uHunt 1.4j, Medium analyzing patterns; not that hard; also available at Kattis - bitsequalizer 0.0
12643 Fetching from uHunt 1.4j, Medium it has tricky test cases 0.0
anotherbrick anotherbrick 1.4j, Medium simple simulation 1424 1.9
basicprogramming1 basicprogramming1 1.4j, Medium a nice summative problem for programming examination of a basic programming methodology course 201 4.0
battlesimulation battlesimulation 1.4j, Medium one pass; special check on 3! = 6 possible combinations of 3 combo moves 900 2.8
beekeeper beekeeper 1.4j, Medium single loop; be careful that vowel set here includes 'y' 1025 2.7
bitsequalizer bitsequalizer 1.4j, Medium analyzing patterns; also available at UVa 12545 - Bits Equalizer 174 4.5
bottledup bottledup 1.4j, Medium find integer a and b so that a*v1 + b*v2 == s; single loop 637 2.6
carousel 1.4j, Medium single loop; keep best; skip a > m 335 2.8
climbingworm climbingworm 1.4j, Medium simulation; similar with UVa 00573 - The Snail 222 2.4
codecleanups codecleanups 1.4j, Medium a bit tricky 515 2.4
cowcrane cowcrane 1.4j, Medium reading comprehension; case analysis; eventually there are only 4 possible cases 181 3.9
fastfood fastfood 1.4j, Medium eventually just one pass due to the constraints 330 2.2
howl howl 1.4j, Medium simply extend the input by one correct character; case analysis exercise 288 1.8
shatteredcake shatteredcake 1.4j, Medium sum the area of the pieces and relate it with L*W 957 1.6
00162 Fetching from uHunt 1.6a, Game (Card) card game simulation; straightforward 0.0
00462 Fetching from uHunt 1.6a, Game (Card) simulation; card 0.0
00555 Fetching from uHunt 1.6a, Game (Card) card game 0.0
10205 Fetching from uHunt 1.6a, Game (Card) card game 0.0
10315 Fetching from uHunt 1.6a, Game (Card) tedious problem 0.0
10388 Fetching from uHunt 1.6a, Game (Card) card simulation; uses random number to determine moves; need data structure to maintain the face-up and face-down cards 0.0
10646 Fetching from uHunt 1.6a, Game (Card) shuffle cards with some rules and then get a certain card 0.0
11225 Fetching from uHunt 1.6a, Game (Card) card game 0.0
11678 Fetching from uHunt 1.6a, Game (Card) just an array manipulation problem 0.0
12247 Fetching from uHunt 1.6a, Game (Card) This is a starred problem; refer to CP3/4 book 0.0
12366 Fetching from uHunt 1.6a, Game (Card) set and pair checks; various corner cases; but the given sample I/O is quite thorough 0.0
12952 Fetching from uHunt 1.6a, Game (Card) returning the max of (A, B) is always the best strategy for this problem 0.0
bela bela 1.6a, Game (Card) simple card scoring problem 3731 1.3
karte karte 1.6a, Game (Card) simple 1600 1.7
memorymatch memorymatch 1.6a, Game (Card) interesting simulation game; many corner cases 161 4.0
shuffling shuffling 1.6a, Game (Card) simulate card shuffling operation 218 2.8
00255 Fetching from uHunt 1.6b, Game (Chess) check the validity of chess moves 0.0
00278 Fetching from uHunt 1.6b, Game (Chess) basic chess knowledge is needed; derive the closed form formulas 0.0
00696 Fetching from uHunt 1.6b, Game (Chess) ad hoc; chess 0.0
10196 Fetching from uHunt 1.6b, Game (Chess) ad hoc; chess; tedious 0.0
10284 Fetching from uHunt 1.6b, Game (Chess) FEN = Forsyth-Edwards Notation is a standard notation for describing board positions in a chess game 0.0
10849 Fetching from uHunt 1.6b, Game (Chess) chess 0.0
11494 Fetching from uHunt 1.6b, Game (Chess) ad hoc;chess 0.0
bijele bijele 1.6b, Game (Chess) super simple 10381 1.4
chess chess 1.6b, Game (Chess) bishop movements; either impossible, 0, 1, or 2 ways - one of this can be invalid; just use brute force 856 2.9
empleh empleh 1.6b, Game (Chess) the reverse problem of Kattis - helpme 245 1.8
helpme helpme 1.6b, Game (Chess) convert the given chess board into chess notation 302 2.4
hexagonalrooks hexagonalrooks 1.6b, Game (Chess) count number of two consecutive rook movements on hexagonal grid; try all possible 91 (intermediate) cells after simplif... 18 3.2
00340 Fetching from uHunt 1.6c, Game (Others), Easier determine strong and weak matches 0.0
00489 Fetching from uHunt 1.6c, Game (Others), Easier just do as asked 0.0
00947 Fetching from uHunt 1.6c, Game (Others), Easier similar to UVa 340 0.0
10189 Fetching from uHunt 1.6c, Game (Others), Easier simulate the classic Minesweeper game; similar to UVa 10279 0.0
10279 Fetching from uHunt 1.6c, Game (Others), Easier a 2D array helps; similar to UVa 10189 0.0
10409 Fetching from uHunt 1.6c, Game (Others), Easier just simulate the die movement 0.0
10530 Fetching from uHunt 1.6c, Game (Others), Easier use a 1D flag array; also available at Kattis - guessinggame 0.0
11459 Fetching from uHunt 1.6c, Game (Others), Easier simulate it; similar to UVa 647 0.0
12239 Fetching from uHunt 1.6c, Game (Others), Easier try all 90^2 pairs; see if all numbers in [0..N] are there 0.0
connectthedots connectthedots 1.6c, Game (Others), Easier classic children game; output formatting 213 3.6
gamerank gamerank 1.6c, Game (Others), Easier simulate the ranking update process 732 3.9
guessinggame guessinggame 1.6c, Game (Others), Easier use a 1D flag array; also available at UVa 10530 - Guessing Game 684 2.7
trik trik 1.6c, Game (Others), Easier simple simulation game 7191 1.4
00114 Fetching from uHunt 1.6d, Game (Others), Harder simulation of pinball machine 0.0
00141 Fetching from uHunt 1.6d, Game (Others), Harder solvable with one linear scan 0.0
00220 Fetching from uHunt 1.6d, Game (Others), Harder follow the game rules; a bit tedious 0.0
00227 Fetching from uHunt 1.6d, Game (Others), Harder parse the input; array manipulation 0.0
00232 Fetching from uHunt 1.6d, Game (Others), Harder complex array manipulation problem 0.0
00339 Fetching from uHunt 1.6d, Game (Others), Harder follow problem description 0.0
00379 Fetching from uHunt 1.6d, Game (Others), Harder follow problem description 0.0
00584 Fetching from uHunt 1.6d, Game (Others), Harder simulation; games; reading comprehension 0.0
00647 Fetching from uHunt 1.6d, Game (Others), Harder childhood board game; also see UVa 11459 0.0
10363 Fetching from uHunt 1.6d, Game (Others), Harder check validity of Tic Tac Toe game; tricky; also available at Kattis - tictactoe2 0.0
10443 Fetching from uHunt 1.6d, Game (Others), Harder 2D arrays manipulation; also available at Kattis - rockscissorspaper 0.0
10813 Fetching from uHunt 1.6d, Game (Others), Harder follow the problem description 0.0
10903 Fetching from uHunt 1.6d, Game (Others), Harder count wins and losses; output win average; also available at Kattis - rockpaperscissors 0.0
11013 Fetching from uHunt 1.6d, Game (Others), Harder check permutations of 5 cards to determine the best run; brute force the 6th card and replace one of your card with it 0.0
battleship battleship 1.6d, Game (Others), Harder simulation; reading comprehension; many corner cases 120 5.4
rockpaperscissors rockpaperscissors 1.6d, Game (Others), Harder count wins and losses; output win average; also available at UVa 10903 - Rock-Paper-Scissors ... 820 3.7
rockscissorspaper rockscissorspaper 1.6d, Game (Others), Harder 2D arrays manipulation; also available at UVa 10443 - Rock, Scissors, Paper 153 4.8
tictactoe2 tictactoe2 1.6d, Game (Others), Harder check validity of Tic Tac Toe game; tricky; also available at UVa 10363 - Tic Tac Toe 167 5.3
turtlemaster turtlemaster 1.6d, Game (Others), Harder interesting board game to teach programming for children; simulation 323 2.9
00362 Fetching from uHunt 1.6e, Real Life, Easier typical file download situation 0.0
00637 Fetching from uHunt 1.6e, Real Life, Easier application in printer driver software 0.0
01586 Fetching from uHunt 1.6e, Real Life, Easier LA 3900 - Seoul07; basic Chemistry 0.0
10082 Fetching from uHunt 1.6e, Real Life, Easier use 2D mapper array to simplify the problem; also available at Kattis - wertyu 0.0
10554 Fetching from uHunt 1.6e, Real Life, Easier are you concerned with your weights? 0.0
11530 Fetching from uHunt 1.6e, Real Life, Easier handphone users encounter this issue in the past 0.0
11744 Fetching from uHunt 1.6e, Real Life, Easier this is another topic on Computer Organization; this time on Digital Logic design 0.0
11945 Fetching from uHunt 1.6e, Real Life, Easier a bit of output formatting 0.0
11984 Fetching from uHunt 1.6e, Real Life, Easier F to C conversion and vice versa 0.0
12195 Fetching from uHunt 1.6e, Real Life, Easier count the number of correct measures 0.0
12808 Fetching from uHunt 1.6e, Real Life, Easier basic Physics formula for freefall is H = 1/2*g*t*t or t = sqrt(2*H/g) and the formula for displacement is X = V*t; they... 0.0
13151 Fetching from uHunt 1.6e, Real Life, Easier marking programming exam; ad hoc; straightforward 0.0
calories calories 1.6e, Real Life, Easier are you concerned with your weights?; also available at UVa 10554 - Calories from Fat 328 2.0
chopin chopin 1.6e, Real Life, Easier you can learn a bit of music with this problem 823 1.8
compass compass 1.6e, Real Life, Easier your typical smartphone's compass function usually has this small feature 1529 2.0
fbiuniversal fbiuniversal 1.6e, Real Life, Easier a bit of base number conversion; base 27 to base 10, if valid 369 2.2
heartrate heartrate 1.6e, Real Life, Easier real life problem 3205 1.3
measurement measurement 1.6e, Real Life, Easier going down: multiply; going up: divide 641 2.0
parking parking 1.6e, Real Life, Easier a possible real life application; simple loops and if-statements are enough to solve this problem 1523 1.6
trainpassengers trainpassengers 1.6e, Real Life, Easier create a verifier; be careful of corner cases 1807 2.1
transitwoes transitwoes 1.6e, Real Life, Easier a possible real life scenario; simulate as asked 353 1.3
wertyu wertyu 1.6e, Real Life, Easier use 2D mapper array to simplify the problem; also available at UVa 10082 - WERTYU 768 2.9
00161 Fetching from uHunt 1.6f, Real Life, Medium this is a typical situation on the road 0.0
00187 Fetching from uHunt 1.6f, Real Life, Medium an accounting problem 0.0
00447 Fetching from uHunt 1.6f, Real Life, Medium life simulation model 0.0
00457 Fetching from uHunt 1.6f, Real Life, Medium simplified game of life simulation; similar idea with UVa 00447; explore the Internet for that term 0.0
00857 Fetching from uHunt 1.6f, Real Life, Medium MIDI; application in computer music 0.0
10191 Fetching from uHunt 1.6f, Real Life, Medium you may want to apply this to your own schedule 0.0
10528 Fetching from uHunt 1.6f, Real Life, Medium music knowledge in problem description 0.0
10812 Fetching from uHunt 1.6f, Real Life, Medium be careful with boundary cases! 0.0
11736 Fetching from uHunt 1.6f, Real Life, Medium this is a (simplified) introduction to Computer Organization on how computer stores data in memory 0.0
11743 Fetching from uHunt 1.6f, Real Life, Medium Luhn's algorithm to check credit card numbers; search the Internet to learn more 0.0
12555 Fetching from uHunt 1.6f, Real Life, Medium one of the first question asked when a new baby is born; requires a bit of input processing 0.0
beatspread beatspread 1.6f, Real Life, Medium be careful with boundary cases!; also available at UVa 10812 - Beat the Spread 980 2.4
dodecaphony dodecaphony 1.6f, Real Life, Medium music lesson; do as asked 98 3.2
luhnchecksum luhnchecksum 1.6f, Real Life, Medium very similar (~95%) to UVa 11743 836 1.6
musicalscales musicalscales 1.6f, Real Life, Medium music lesson; use array(s) to help simplify the code 674 1.6
recipes recipes 1.6f, Real Life, Medium real life problem for a cook; just simulate the requirements 731 1.8
score score 1.6f, Real Life, Medium medium difficulty; do as asked; just be careful 173 3.5
toilet toilet 1.6f, Real Life, Medium simulation; be careful of corner cases 1756 2.4
wordcloud wordcloud 1.6f, Real Life, Medium just a simulation; but be careful of corner cases 322 2.4
00139 Fetching from uHunt 1.6g, Real Life, Harder calculate phone bill; string manipulation 0.0
00145 Fetching from uHunt 1.6g, Real Life, Harder similar to UVa 00139 0.0
00333 Fetching from uHunt 1.6g, Real Life, Harder this problem has buggy test data with blank lines that potentially cause lots of Presentation Errors 0.0
00346 Fetching from uHunt 1.6g, Real Life, Harder musical chord; major/minor 0.0
00403 Fetching from uHunt 1.6g, Real Life, Harder emulation of printer driver; tedious 0.0
00448 Fetching from uHunt 1.6g, Real Life, Harder tedious hexadecimal to assembly language conversion 0.0
00449 Fetching from uHunt 1.6g, Real Life, Harder easier if you have a musical background 0.0
00538 Fetching from uHunt 1.6g, Real Life, Harder the problem's premise is quite true 0.0
00706 Fetching from uHunt 1.6g, Real Life, Harder like in old digital display 0.0
01061 Fetching from uHunt 1.6g, Real Life, Harder LA 3736 - WorldFinals Tokyo07; try all eight possible blood + Rh types with the information given 0.0
01091 Fetching from uHunt 1.6g, Real Life, Harder LA 4786 - WorldFinals Harbin10; tedious simulation and reading comprehension 0.0
10415 Fetching from uHunt 1.6g, Real Life, Harder about musical instruments; also available at Kattis - saxophone 0.0
10659 Fetching from uHunt 1.6g, Real Life, Harder typical presentation programs do this 0.0
11223 Fetching from uHunt 1.6g, Real Life, Harder tedious morse code conversion 0.0
11279 Fetching from uHunt 1.6g, Real Life, Harder an extension of UVa 11278 problem; it is interesting to compare QWERTY and DVORAK keyboard layout 0.0
12342 Fetching from uHunt 1.6g, Real Life, Harder tax computation can be tricky indeed 0.0
12394 Fetching from uHunt 1.6g, Real Life, Harder interesting problem with real life back story; be careful of various corner cases 0.0
bungeejumping bungeejumping 1.6g, Real Life, Harder real life Physics simulation; need someone who is good with Physics to understand the problem and derive the required fo... 64 4.8
creditcard creditcard 1.6g, Real Life, Harder real life issue; precision error issue if we do not convert double (with just 2 digits after decimal point) into long lo... 123 6.3
saxophone saxophone 1.6g, Real Life, Harder about musical instruments; also available at UVa 10415 - Eb Alto Saxophone Player 268 2.4
tenis tenis 1.6g, Real Life, Harder Tennis scoring rules; tricky test cases; be careful 78 5.0
touchscreenkeyboard touchscreenkeyboard 1.6g, Real Life, Harder follow the requirements; sort 636 1.9
workout workout 1.6g, Real Life, Harder gym simulation; use 1D arrays to help you simulate the time quickly 151 5.7
00579 Fetching from uHunt 1.6h, Time, Easier be careful with corner cases 0.0
00893 Fetching from uHunt 1.6h, Time, Easier use Java GregorianCalendar; similar to UVa 11356 0.0
10683 Fetching from uHunt 1.6h, Time, Easier simple clock system conversion 0.0
11219 Fetching from uHunt 1.6h, Time, Easier be careful with boundary cases! 0.0
11356 Fetching from uHunt 1.6h, Time, Easier very easy if you use Java GregorianCalendar 0.0
11650 Fetching from uHunt 1.6h, Time, Easier some mathematics required; similar to UVa 11677 0.0
11677 Fetching from uHunt 1.6h, Time, Easier similar idea with UVa 11650 0.0
11958 Fetching from uHunt 1.6h, Time, Easier be careful with 'past midnight' 0.0
12019 Fetching from uHunt 1.6h, Time, Easier Gregorian Calendar; get DAY_OF_WEEK 0.0
12136 Fetching from uHunt 1.6h, Time, Easier LA 4202 - Dhaka08; check time 0.0
12148 Fetching from uHunt 1.6h, Time, Easier easy with Gregorian Calendar; use method 'add' to add one day to previous date and see if it is the same as the current ... 0.0
12531 Fetching from uHunt 1.6h, Time, Easier angles between two clock hands 0.0
13275 Fetching from uHunt 1.6h, Time, Easier QY-Y (if not 29 Feb) or NumOfLeapYears(QY)-NumOfLeapYears(Y) otherwise 0.0
datum datum 1.6h, Time, Easier Java GregorianCalendar, DAY_OF_WEEK 3019 1.4
friday friday 1.6h, Time, Easier the answer depends on the start day of the month 1059 1.9
justaminute justaminute 1.6h, Time, Easier linear pass; total seconds/(total minutes*60) 1512 1.7
marswindow marswindow 1.6h, Time, Easier simple advancing of year and month by 26 months or 2 years+2 months each; direct formula exists 830 2.0
savingdaylight savingdaylight 1.6h, Time, Easier convert hh:mm to minute; compute difference of ending and starting; then convert minute to hh:mm again 986 2.1
spavanac spavanac 1.6h, Time, Easier convert hh:mm to minute, reduce by 45 minutes, then convert minute to hh:mm again 8877 1.4
00150 Fetching from uHunt 1.6i, Time, Harder convert between Julian and Gregorian dates 0.0
00158 Fetching from uHunt 1.6i, Time, Harder a simulation of calendar manager; it requires sorting and a bit of string processing 0.0
00170 Fetching from uHunt 1.6i, Time, Harder simulation; time 0.0
00300 Fetching from uHunt 1.6i, Time, Harder ad hoc; time 0.0
00602 Fetching from uHunt 1.6i, Time, Harder Gregorian versus Julian calendar 0.0
10070 Fetching from uHunt 1.6i, Time, Harder more than ordinary leap years 0.0
10339 Fetching from uHunt 1.6i, Time, Harder find the formula 0.0
10371 Fetching from uHunt 1.6i, Time, Harder follow the description, tedious; also available at Kattis - timezones 0.0
10942 Fetching from uHunt 1.6i, Time, Harder try all 3! = 6 permutations of 3 integers to form YY MM DD; check validity of the date; pick the earliest valid date 0.0
11947 Fetching from uHunt 1.6i, Time, Harder easier with Java GregorianCalendar 0.0
12439 Fetching from uHunt 1.6i, Time, Harder inclusion-exclusion; lots of corner cases; be careful 0.0
12822 Fetching from uHunt 1.6i, Time, Harder convert hh:mm:ss to second to simplify the problem; then this is just a tedious simulation problem 0.0
bestbefore bestbefore 1.6i, Time, Harder tedious; 3! = 6 possibilities to check 148 4.0
birthdayboy birthdayboy 1.6i, Time, Harder convert mm-dd into [0..364]; use DAT; find largest gap via brute force 108 4.6
busyschedule busyschedule 1.6i, Time, Harder sort the time; be careful of corner cases 811 2.4
dst dst 1.6i, Time, Harder straightforward; modulo 611 2.1
natrij natrij 1.6i, Time, Harder convert hh:mm:ss to seconds; make sure the second time is larger than the first time; corner case: 24:00:00 1136 2.6
semafori semafori 1.6i, Time, Harder simple simulation 724 2.0
tgif tgif 1.6i, Time, Harder given the day of 1 Jan of an unspecified year, find the DAY_OF_WEEK of another day of that year; use Java GregorianCalen... 82 3.2
timezones timezones 1.6i, Time, Harder follow the description, tedious; also available at UVa 10371 - Time Zones 67 5.3
00185 Fetching from uHunt 1.6j, Roman Numerals also involving backtracking 0.0
00344 Fetching from uHunt 1.6j, Roman Numerals count Roman chars used in [1..N] 0.0
00759 Fetching from uHunt 1.6j, Roman Numerals validation problem 0.0
11616 Fetching from uHunt 1.6j, Roman Numerals Roman numeral conversion problem 0.0
12397 Fetching from uHunt 1.6j, Roman Numerals each Roman digit has a value 0.0
rimski rimski 1.6j, Roman Numerals to Roman/to Decimal conversion problem; use next permutation to be sure 118 4.5
romanholidays romanholidays 1.6j, Roman Numerals generate and sort the first 1K Roman strings; ''M'' is at index 945; append prefix 'M' for numbers larger than 1K 92 3.6
00444 Fetching from uHunt 1.6k, Cipher, Easier each char is mapped to 2 or 3 digits 0.0
00458 Fetching from uHunt 1.6k, Cipher, Easier shift ASCII values by -7 0.0
00641 Fetching from uHunt 1.6k, Cipher, Easier reverse the given formula and simulate 0.0
00795 Fetching from uHunt 1.6k, Cipher, Easier prepare an 'inverse mapper' 0.0
00865 Fetching from uHunt 1.6k, Cipher, Easier simple character substitution mapping 0.0
01339 Fetching from uHunt 1.6k, Cipher, Easier count character frequencies of both strings; sort and compare 0.0
10019 Fetching from uHunt 1.6k, Cipher, Easier find the pattern 0.0
10222 Fetching from uHunt 1.6k, Cipher, Easier simple decoding mechanism 0.0
10851 Fetching from uHunt 1.6k, Cipher, Easier ignore border; treat '\/' as 1/0 0.0
10878 Fetching from uHunt 1.6k, Cipher, Easier treat space/'o' as 0/1; then it is binary to decimal conversion 0.0
10896 Fetching from uHunt 1.6k, Cipher, Easier try all possible keys; use tokenizer 0.0
10921 Fetching from uHunt 1.6k, Cipher, Easier simple conversion problem 0.0
11220 Fetching from uHunt 1.6k, Cipher, Easier follow instruction in the problem 0.0
11278 Fetching from uHunt 1.6k, Cipher, Easier map QWERTY keys to DVORAK 0.0
11541 Fetching from uHunt 1.6k, Cipher, Easier read char by char and simulate 0.0
11946 Fetching from uHunt 1.6k, Cipher, Easier ad hoc 0.0
12896 Fetching from uHunt 1.6k, Cipher, Easier simple cipher; use mapper 0.0
13107 Fetching from uHunt 1.6k, Cipher, Easier simple encode; be careful with 20-26 0.0
13145 Fetching from uHunt 1.6k, Cipher, Easier shift alphabet values by +6 characters to read the problem statement; simple Caesar Cipher problem 0.0
conundrum conundrum 1.6k, Cipher, Easier simple cipher 5240 1.4
drmmessages drmmessages 1.6k, Cipher, Easier simple decrypt; follow instruction 1949 1.6
drunkvigenere drunkvigenere 1.6k, Cipher, Easier simple decrypt; reverse the given instruction 189 1.5
encodedmessage encodedmessage 1.6k, Cipher, Easier simple 2D grid cipher 2316 1.4
kemija08 kemija08 1.6k, Cipher, Easier simple vowel checks 3070 1.4
keytocrypto keytocrypto 1.6k, Cipher, Easier simple decrypt 1029 1.7
reverserot reverserot 1.6k, Cipher, Easier simple cipher 2641 1.7
runlengthencodingrun runlengthencodingrun 1.6k, Cipher, Easier encode and decode 1929 1.7
t9spelling t9spelling 1.6k, Cipher, Easier similar to (the reverse of) UVa 12896 2425 1.7
00245 Fetching from uHunt 1.6l, Cipher, Medium LA 5184 - WorldFinals Nashville95 0.0
00483 Fetching from uHunt 1.6l, Cipher, Medium read char by char from left to right 0.0
00492 Fetching from uHunt 1.6l, Cipher, Medium ad hoc; similar to UVa 483 0.0
00632 Fetching from uHunt 1.6l, Cipher, Medium simulate the process; use sorting 0.0
00739 Fetching from uHunt 1.6l, Cipher, Medium straightforward conversion problem 0.0
00740 Fetching from uHunt 1.6l, Cipher, Medium just simulate the process 0.0
11716 Fetching from uHunt 1.6l, Cipher, Medium simple cipher 0.0
11787 Fetching from uHunt 1.6l, Cipher, Medium follow the description 0.0
anewalphabet anewalphabet 1.6l, Cipher, Medium simple cipher; 26 characters 4154 1.8
falsesecurity falsesecurity 1.6l, Cipher, Medium a bit tedious decoder problem 948 1.6
permcode permcode 1.6l, Cipher, Medium reading comprehension problem 166 2.2
piglatin piglatin 1.6l, Cipher, Medium simple; check the vowels that include 'y' and process it 916 2.1
secretmessage secretmessage 1.6l, Cipher, Medium just do as asked; use 2D grid 2866 1.7
tajna tajna 1.6l, Cipher, Medium simple 2D grid cipher 471 2.1
00271 Fetching from uHunt 1.6m, Input Parsing (Iter) grammar check; linear scan 0.0
00327 Fetching from uHunt 1.6m, Input Parsing (Iter) implementation can be tricky 0.0
00391 Fetching from uHunt 1.6m, Input Parsing (Iter) use flags; tedious parsing 0.0
00397 Fetching from uHunt 1.6m, Input Parsing (Iter) iteratively perform the next operation 0.0
00442 Fetching from uHunt 1.6m, Input Parsing (Iter) properties of matrix chain multiplication 0.0
00486 Fetching from uHunt 1.6m, Input Parsing (Iter) parsing 0.0
00537 Fetching from uHunt 1.6m, Input Parsing (Iter) simple formula; parsing is difficult 0.0
01200 Fetching from uHunt 1.6m, Input Parsing (Iter) LA 2972 - Tehran03; tokenize input 0.0
10252 Fetching from uHunt 1.6m, Input Parsing (Iter) A-Z keys 0.0
10906 Fetching from uHunt 1.6m, Input Parsing (Iter) BNF parsing; iterative solution 0.0
11148 Fetching from uHunt 1.6m, Input Parsing (Iter) extract integers; simple/mixed fractions from a line; a bit of gcd 0.0
11878 Fetching from uHunt 1.6m, Input Parsing (Iter) expression parsing 0.0
12543 Fetching from uHunt 1.6m, Input Parsing (Iter) LA 6150 - HatYai12; iterative parser 0.0
12820 Fetching from uHunt 1.6m, Input Parsing (Iter) count letter frequencies; let n be the number of different letter frequencies; n has to be greater or equal to 2; then w... 0.0
13047 Fetching from uHunt 1.6m, Input Parsing (Iter) simple parsing; left-to-right or right-to-left checks 0.0
13093 Fetching from uHunt 1.6m, Input Parsing (Iter) simple string tokenize; take first characters of each word 0.0
autori autori 1.6m, Input Parsing (Iter) simple string tokenizer problem 11602 1.2
genealogical genealogical 1.6m, Input Parsing (Iter) iterative parser; need to be careful when trimming the tokens; do not print new line as the last line; otherwise this is... 77 3.5
pervasiveheartmonitor pervasiveheartmonitor 1.6m, Input Parsing (Iter) simple parsing; then finding average 950 1.7
timebomb timebomb 1.6m, Input Parsing (Iter) just a tedious input parsing problem; divisibility by 6 1174 1.8
tripletexting tripletexting 1.6m, Input Parsing (Iter) print characters that appear at least two times out of three 56 1.8
00110 Fetching from uHunt 1.6n, Output Formatting, E actually an ad hoc sorting problem 0.0
00320 Fetching from uHunt 1.6n, Output Formatting, E requires flood fill technique 0.0
00445 Fetching from uHunt 1.6n, Output Formatting, E simulation; output formatting 0.0
00488 Fetching from uHunt 1.6n, Output Formatting, E use several loops 0.0
00490 Fetching from uHunt 1.6n, Output Formatting, E 2d array manipulation; output formatting 0.0
01605 Fetching from uHunt 1.6n, Output Formatting, E LA 4044 - NortheasternEurope07; we can answer this problem with just h=2 levels 0.0
10146 Fetching from uHunt 1.6n, Output Formatting, E the problem description tries to hide the meaning of 'dictionary'; it is not a hard problem actually 0.0
10500 Fetching from uHunt 1.6n, Output Formatting, E simulate; output formatting 0.0
10894 Fetching from uHunt 1.6n, Output Formatting, E how fast can you can solve this problem? 0.0
11074 Fetching from uHunt 1.6n, Output Formatting, E output formatting 0.0
11482 Fetching from uHunt 1.6n, Output Formatting, E tedious 0.0
11965 Fetching from uHunt 1.6n, Output Formatting, E replace consecutive spaces with only one space 0.0
12364 Fetching from uHunt 1.6n, Output Formatting, E 2D array check; check all possible digits [0..9] 0.0
13091 Fetching from uHunt 1.6n, Output Formatting, E just output formatting 0.0
display display 1.6n, Output Formatting, E unordered_map; map a digit -> enlarged 7x5 version 635 2.5
krizaljka krizaljka 1.6n, Output Formatting, E simple 2D character array formatting 483 1.8
mirror mirror 1.6n, Output Formatting, E simple 2D character array formatting 1757 1.7
multiplication multiplication 1.6n, Output Formatting, E tedious time waster output formatting problem 162 2.2
musicalnotation musicalnotation 1.6n, Output Formatting, E simple but tedious 421 2.0
okvir okvir 1.6n, Output Formatting, E simple 2D output formatting problem 399 2.0
okviri okviri 1.6n, Output Formatting, E use 2D array to simplify the process 447 1.9
skener skener 1.6n, Output Formatting, E enlarging 2D character array 2067 1.5
00144 Fetching from uHunt 1.6o, Time Waster, Easier simulation 0.0
00214 Fetching from uHunt 1.6o, Time Waster, Easier just simulate the process; be careful with subtract (-); divide (/); and negate (@); tedious 0.0
00335 Fetching from uHunt 1.6o, Time Waster, Easier simulation 0.0
00349 Fetching from uHunt 1.6o, Time Waster, Easier simulation 0.0
00556 Fetching from uHunt 1.6o, Time Waster, Easier simulation 0.0
01721 Fetching from uHunt 1.6o, Time Waster, Easier LA 7162 - WorldFinals Marrakech15; tedious simulation problem; also available at Kattis - windows 0.0
10028 Fetching from uHunt 1.6o, Time Waster, Easier tedious simulation with several corner cases 0.0
10033 Fetching from uHunt 1.6o, Time Waster, Easier adhoc; simulation 0.0
10134 Fetching from uHunt 1.6o, Time Waster, Easier must be very careful with details 0.0
10281 Fetching from uHunt 1.6o, Time Waster, Easier distance = speed*time elapsed; also available at Kattis - averagespeed 0.0
10850 Fetching from uHunt 1.6o, Time Waster, Easier gossip spread simulation 0.0
11638 Fetching from uHunt 1.6o, Time Waster, Easier simulation; needs to use bitmask for parameter C 0.0
12060 Fetching from uHunt 1.6o, Time Waster, Easier LA 3012 - Dhaka04; output format 0.0
12085 Fetching from uHunt 1.6o, Time Waster, Easier LA 2189 - Dhaka06; watch out for PE 0.0
12608 Fetching from uHunt 1.6o, Time Waster, Easier simulation with several corner cases 0.0
12700 Fetching from uHunt 1.6o, Time Waster, Easier just do as instructed 0.0
asciiaddition asciiaddition 1.6o, Time Waster, Easier a+b problem in text format; total gimmick; time waster 509 1.9
averagespeed averagespeed 1.6o, Time Waster, Easier distance = speed*time elapsed; also available at UVa 10281 - Average Speed 322 3.7
gerrymandering gerrymandering 1.6o, Time Waster, Easier just a reading comprehension problem; do as asked 1187 1.4
glitchbot glitchbot 1.6o, Time Waster, Easier time waster; O(n^2) simulation; do not output more than one possible answer 1036 2.0
pachydermpeanutpacking pachydermpeanutpacking 1.6o, Time Waster, Easier time waster; simple one loop simulation 322 1.9
printingcosts printingcosts 1.6o, Time Waster, Easier clear time waster; the hard part is in parsing the costs of each character in the problem description 705 2.2
00337 Fetching from uHunt 1.6p, Time Waster, Harder simulation; output related 0.0
00381 Fetching from uHunt 1.6p, Time Waster, Harder simulation 0.0
00405 Fetching from uHunt 1.6p, Time Waster, Harder simulation 0.0
00603 Fetching from uHunt 1.6p, Time Waster, Harder simulation 0.0
00618 Fetching from uHunt 1.6p, Time Waster, Harder tedious 0.0
00830 Fetching from uHunt 1.6p, Time Waster, Harder very hard to get AC; one minor error = WA; not recommended 0.0
00945 Fetching from uHunt 1.6p, Time Waster, Harder simulate the given cargo loading process 0.0
10142 Fetching from uHunt 1.6p, Time Waster, Harder simulation 0.0
10188 Fetching from uHunt 1.6p, Time Waster, Harder simulation 0.0
10267 Fetching from uHunt 1.6p, Time Waster, Harder simulation 0.0
10961 Fetching from uHunt 1.6p, Time Waster, Harder tedious simulation 0.0
11140 Fetching from uHunt 1.6p, Time Waster, Harder ad hoc 0.0
11717 Fetching from uHunt 1.6p, Time Waster, Harder tricky simulation 0.0
12280 Fetching from uHunt 1.6p, Time Waster, Harder a tedious problem 0.0
froggie froggie 1.6p, Time Waster, Harder just a simulation; but many corner cases; S can be 0 296 6.8
functionalfun functionalfun 1.6p, Time Waster, Harder just follow the description; 5 cases; tedious parsing problem; requires a kind of mapper 487 1.9
interpreter interpreter 1.6p, Time Waster, Harder need careful implementation; just follow the instruction 224 3.7
lumbercraft lumbercraft 1.6p, Time Waster, Harder time waster; 2D grid simulation 69 5.0
sabor sabor 1.6p, Time Waster, Harder ad hoc; hard simulation; analyze that the simulation terminates 53 5.2
windows windows 1.6p, Time Waster, Harder LA 7162 - WorldFinals Marrakech15; tedious simulation problem; also available at UVa 01721 - Window Manager 92 7.6
00414 Fetching from uHunt 2.2a, 1D Array, Medium get the longest stretch of Bs 0.0
00482 Fetching from uHunt 2.2a, 1D Array, Medium you may need to use a string tokenizer as the size of the array is not specified 0.0
00591 Fetching from uHunt 2.2a, 1D Array, Medium sum all items; get the average; sum the total absolute differences of each item from the average divided by two 0.0
10038 Fetching from uHunt 2.2a, 1D Array, Medium 1D Boolean flags to check [1..n-1]; also available at Kattis - jollyjumpers 0.0
10050 Fetching from uHunt 2.2a, 1D Array, Medium 1D boolean flag 0.0
11192 Fetching from uHunt 2.2a, 1D Array, Medium character array 0.0
11496 Fetching from uHunt 2.2a, 1D Array, Medium store data in 1D array; count the peaks 0.0
11608 Fetching from uHunt 2.2a, 1D Array, Medium use three arrays: created; required; available 0.0
11875 Fetching from uHunt 2.2a, 1D Array, Medium get median of a sorted input 0.0
12150 Fetching from uHunt 2.2a, 1D Array, Medium simple manipulation 0.0
12356 Fetching from uHunt 2.2a, 1D Array, Medium similar to deletion in doubly linked lists but we can still use a 1D array for the underlying data structure 0.0
12854 Fetching from uHunt 2.2a, 1D Array, Medium 1D array of size 5; trivial 0.0
12959 Fetching from uHunt 2.2a, 1D Array, Medium just go through the 1D array 0.0
12996 Fetching from uHunt 2.2a, 1D Array, Medium we need 1D array to store the number of N mango types first 0.0
13026 Fetching from uHunt 2.2a, 1D Array, Medium you have to store the N strings in an array first 0.0
13181 Fetching from uHunt 2.2a, 1D Array, Medium find the largest gap between two Xs; special corner cases at the two end points 0.0
baloni baloni 2.2a, 1D Array, Medium clever use of 1D histogram array to decompose the shots as per requirement 689 3.5
downtime downtime 2.2a, 1D Array, Medium 1D array; use Fenwick Tree-like operation for Range Update Point Query 1068 3.2
erase erase 2.2a, 1D Array, Medium if N is odd, the second line has to be the inverse of the first; if N is even, both lines have to be the same 2166 1.6
fluortanten fluortanten 2.2a, 1D Array, Medium remove Bjorn first; then do O(n) pass to check where is Bjorn's optimal position 181 3.1
greedilyincreasing greedilyincreasing 2.2a, 1D Array, Medium just 1D array manipulation; this is not the DP-LIS problem 1151 1.9
jollyjumpers jollyjumpers 2.2a, 1D Array, Medium 1D Boolean flags to check [1..n-1]; also available at UVa 10038 - Jolly Jumpers 413 3.4
00230 Fetching from uHunt 2.2b, 1D Array, Harder string parsing; maintain sorted books by author names then by title; the input size is small; we do not need balanced BS... 0.0
00394 Fetching from uHunt 2.2b, 1D Array, Harder any n-dimensional array is stored in computer memory as a single dimensional array; follow the problem description 0.0
00467 Fetching from uHunt 2.2b, 1D Array, Harder linear scan; 1D boolean flag 0.0
00665 Fetching from uHunt 2.2b, 1D Array, Harder use 1D boolean flags; each =; <; or > tells us an information; check if there is only one candidate false coin left at t... 0.0
00946 Fetching from uHunt 2.2b, 1D Array, Harder just 1D array manipulation; be careful with the special restriction 0.0
10978 Fetching from uHunt 2.2b, 1D Array, Harder 1D string array 0.0
11093 Fetching from uHunt 2.2b, 1D Array, Harder linear scan; circular array; a bit challenging 0.0
11222 Fetching from uHunt 2.2b, 1D Array, Harder use several 1D arrays 0.0
11850 Fetching from uHunt 2.2b, 1D Array, Harder for each integer location from 0 to 1322; can Brenda reach (anywhere within 200 miles of) any charging stations? 0.0
12662 Fetching from uHunt 2.2b, 1D Array, Harder 1D array manipulation; brute force 0.0
13048 Fetching from uHunt 2.2b, 1D Array, Harder use 1D Boolean array; simulate 0.0
astro astro 2.2b, 1D Array, Harder use large Boolean array 115 4.3
crashingrobots crashingrobots 2.2b, 1D Array, Harder just simulate the x/y/direction of the N robots 107 4.6
divideby100 divideby100 2.2b, 1D Array, Harder big 1D character array processing; be careful 557 4.2
flippingpatties flippingpatties 2.2b, 1D Array, Harder use 1D int array of size 43 201; at each time t, we need one cook (hand) at time t-2d (to start), t-d (to flip), ... 116 2.4
inverteddeck inverteddeck 2.2b, 1D Array, Harder can we sort the array with just one contiguous swap?; compress duplicates; use sentinel so that we only check /&bsol... 203 3.7
keypad keypad 2.2b, 1D Array, Harder 2D array manipulation 200 3.3
mastermind mastermind 2.2b, 1D Array, Harder 1D array manipulation to count r and s 446 2.4
physicalmusic physicalmusic 2.2b, 1D Array, Harder a reading comprehension problem to come up with a simple algorithm to determine the answer 168 5.5
piperotation piperotation 2.2b, 1D Array, Harder use 1D Boolean array to check if cell (r, c) needs to be connected from the top (r-1) or left (c-1) and pass information... 50 2.6
pivot pivot 2.2b, 1D Array, Harder static range min/max query problem; special condition allows this problem to be solvable in O(n) using help of 1D arrays 1723 3.2
queens queens 2.2b, 1D Array, Harder simple N queens verifier program; use several 1D Boolean arrays to help do this check in O(N) 725 3.3
rockband rockband 2.2b, 1D Array, Harder interesting usage of 1D array to simplify the solution; a bit of sorting to arrange the output 194 3.9
upsanddownsofinvesting upsanddownsofinvesting 2.2b, 1D Array, Harder simplify by a factor of two by realizing that peaks and valleys are symmetrical 147 3.6
00541 Fetching from uHunt 2.2c, 2D Array, Easier count the number of 1s for each row/col; which must be even; if there is an error; see if the odd number of 1s appear on... 0.0
00585 Fetching from uHunt 2.2c, 2D Array, Easier recursive grammar check and output formatting 0.0
10703 Fetching from uHunt 2.2c, 2D Array, Easier use 2D boolean array of size 500*500 0.0
10920 Fetching from uHunt 2.2c, 2D Array, Easier simulate the process 0.0
11040 Fetching from uHunt 2.2c, 2D Array, Easier non trivial 2D array manipulation 0.0
11349 Fetching from uHunt 2.2c, 2D Array, Easier use long long to avoid issues 0.0
11581 Fetching from uHunt 2.2c, 2D Array, Easier simulate the process 0.0
11835 Fetching from uHunt 2.2c, 2D Array, Easier do as asked 0.0
12187 Fetching from uHunt 2.2c, 2D Array, Easier simulate the process 0.0
12667 Fetching from uHunt 2.2c, 2D Array, Easier use both 1D and 2D arrays to store submission status 0.0
12981 Fetching from uHunt 2.2c, 2D Array, Easier small 2x2 matrix rotation 0.0
compromise compromise 2.2c, 2D Array, Easier 2D array manipulation; take the majority bits of each column; output either 0 or 1 for ties 363 2.2
epigdanceoff epigdanceoff 2.2c, 2D Array, Easier count number of CCs on 2D grid; simpler solution exists: count the number of blank columns plus one 505 1.9
flowshop flowshop 2.2c, 2D Array, Easier interesting 2D array manipulation 392 2.5
imageprocessing imageprocessing 2.2c, 2D Array, Easier interesting 2D array manipulation 344 2.1
nineknights nineknights 2.2c, 2D Array, Easier 2D array checks; 8 directions 881 1.9
thisaintyourgrandpascheckerboard thisaintyourgrandpaschecke... 2.2c, 2D Array, Easier simple 2D array manipulation 578 1.6
00101 Fetching from uHunt 2.2d, 2D Array, Harder stack-like simulation; but we need to access the content of each stack too; so it is better to use 2D array 0.0
00434 Fetching from uHunt 2.2d, 2D Array, Harder a kind of visibility problem in geometry; solvable with using 2D array manipulation 0.0
00466 Fetching from uHunt 2.2d, 2D Array, Harder core functions: rotate and reflect 0.0
00512 Fetching from uHunt 2.2d, 2D Array, Harder apply all rows/columns modifications in descending order; for each query; report the new position of the cell or report ... 0.0
00707 Fetching from uHunt 2.2d, 2D Array, Harder this requires 3D array; but as there is no such category; it is classified here 0.0
10016 Fetching from uHunt 2.2d, 2D Array, Harder tedious 0.0
10855 Fetching from uHunt 2.2d, 2D Array, Harder string array; 90 degrees clockwise rotation 0.0
11360 Fetching from uHunt 2.2d, 2D Array, Harder do as asked 0.0
12291 Fetching from uHunt 2.2d, 2D Array, Harder do as asked; a bit tedious 0.0
12398 Fetching from uHunt 2.2d, 2D Array, Harder simulate backwards; do not forget to mod 10 0.0
2048 2048 2.2d, 2D Array, Harder just a 2D array manipulation problem; utilize symmetry using 90 degrees rotation(s) to reduce 4 cases into 1 3150 2.1
apples apples 2.2d, 2D Array, Harder 2D array manipulation; gravity simulation 439 3.6
falcondive falcondive 2.2d, 2D Array, Harder 2D array manipulation; translation vector of the Falcon 64 2.8
flagquiz flagquiz 2.2d, 2D Array, Harder array of array of strings; be careful; duplicates may exists 167 3.7
funhouse funhouse 2.2d, 2D Array, Harder 2D array manipulation; note the direction update 700 2.0
prva prva 2.2d, 2D Array, Harder 2D array manipulation; check vertically and horizontally 756 1.7
rings2 rings2 2.2d, 2D Array, Harder more challenging 2D array manipulation; special output formatting style 385 3.8
tetris tetris 2.2d, 2D Array, Harder actually 3D pattern array to simulate various shape positions 322 1.8
00400 Fetching from uHunt 2.2e, Sorting, Easier this command is very frequently used in UNIX 0.0
00855 Fetching from uHunt 2.2e, Sorting, Easier sort; median 0.0
10107 Fetching from uHunt 2.2e, Sorting, Easier find median of a growing/dynamic list of integers; we can use multiple calls of nth_element in algorithm 0.0
10880 Fetching from uHunt 2.2e, Sorting, Easier use sort 0.0
10905 Fetching from uHunt 2.2e, Sorting, Easier modified comparison function; use sort 0.0
11039 Fetching from uHunt 2.2e, Sorting, Easier use sort then count different signs 0.0
11588 Fetching from uHunt 2.2e, Sorting, Easier sort simplifies the problem 0.0
11777 Fetching from uHunt 2.2e, Sorting, Easier sort simplifies the problem 0.0
11824 Fetching from uHunt 2.2e, Sorting, Easier sort simplifies the problem 0.0
12071 Fetching from uHunt 2.2e, Sorting, Easier reading comprehension; sort the input; compute something 0.0
12541 Fetching from uHunt 2.2e, Sorting, Easier LA 6148 - HatYai12; sort; youngest + oldest 0.0
12709 Fetching from uHunt 2.2e, Sorting, Easier LA 6650 - Dhaka13; although the problem has a complicated story; it has a very easy solution with sort routine 0.0
12861 Fetching from uHunt 2.2e, Sorting, Easier sort the timezones first and try adjacent pairings (two possibilities) 0.0
13113 Fetching from uHunt 2.2e, Sorting, Easier count the votes; sort; pick the top 2 0.0
basicprogramming2 basicprogramming2 2.2e, Sorting, Easier a nice problem about basic sorting applications 189 3.4
closingtheloop closingtheloop 2.2e, Sorting, Easier sort first 1415 1.6
cups cups 2.2e, Sorting, Easier a bit of string parsing; sort 2987 1.5
height height 2.2e, Sorting, Easier insertion sort simulation 899 2.0
judging judging 2.2e, Sorting, Easier sort DOM judge and Kattis outputs; then do the O(n) merge procedure of mergesort to count common outputs 1183 2.5
mjehuric mjehuric 2.2e, Sorting, Easier a direct simulation of a bubble sort algorithm 1349 1.6
musicaltrees musicaltrees 2.2e, Sorting, Easier sort p and t; then just simulate as asked with Boolean array 23 2.8
sidewayssorting sidewayssorting 2.2e, Sorting, Easier stable_sort or sort multi-fields of columns of a 2D array; ignore case 857 2.0
00123 Fetching from uHunt 2.2f, Sorting, Harder modified comparison function; use sort 0.0
00450 Fetching from uHunt 2.2f, Sorting, Harder tedious sorting problem 0.0
00790 Fetching from uHunt 2.2f, Sorting, Harder multi-fields sorting; use sort; similar to UVa 10258 0.0
01610 Fetching from uHunt 2.2f, Sorting, Harder LA 6196 - MidAtlanticUSA12; median 0.0
10194 Fetching from uHunt 2.2f, Sorting, Harder multi-fields sorting; use sort 0.0
10258 Fetching from uHunt 2.2f, Sorting, Harder multi-fields sorting; use sort; similar to UVa 00790 0.0
10698 Fetching from uHunt 2.2f, Sorting, Harder multi-fields sorting; use sort 0.0
11300 Fetching from uHunt 2.2f, Sorting, Harder use sort; involving the median 0.0
11321 Fetching from uHunt 2.2f, Sorting, Harder be careful with negative mod! 0.0
12269 Fetching from uHunt 2.2f, Sorting, Harder sort and check if Guido covers all land (end-to-end and side-to-side); also available at Kattis - lawnmower 0.0
addemup addemup 2.2f, Sorting, Harder create a helper function to read digits upside down; add all possibilities; sort; then use fast O(n) target pair solutio... 338 4.4
booking booking 2.2f, Sorting, Harder 2 events per booking (need room and release room); convert to minutes; be careful of leap year on 2016; sort the events;... 164 5.4
chartingprogress chartingprogress 2.2f, Sorting, Harder sort using modified comparison function (by column); transpose the input 757 2.2
classy classy 2.2f, Sorting, Harder sort using modified comparison function; a bit of string parsing/tokenization 1633 4.5
dirtydriving dirtydriving 2.2f, Sorting, Harder sort; find max - derive the formula; reading comprehension problem 279 2.1
dyslectionary dyslectionary 2.2f, Sorting, Harder sort the reverse of original string; output formatting 775 3.4
gearchanging gearchanging 2.2f, Sorting, Harder generate all O(N*M) possible gear ratios; sort; check consecutive ratios (it is ok to have duplicates) 161 3.2
includescoring includescoring 2.2f, Sorting, Harder sort; custom comparison function, tedious 342 3.7
lawnmower lawnmower 2.2f, Sorting, Harder sort and check if Guido covers all land (end-to-end and side-to-side); also available at UVa 12269 - Land Mower 448 2.1
longswaps longswaps 2.2f, Sorting, Harder observation: if k ≤ n/2, output 'Yes'; otherwise the middle chars at s[n-k..k-1] cannot move; sort s and compare the ... 172 3.3
musicyourway musicyourway 2.2f, Sorting, Harder stable_sort; custom comparison function 404 2.4
sortofsorting sortofsorting 2.2f, Sorting, Harder stable_sort or sort multi-fields 2667 2.2
zipfsong zipfsong 2.2f, Sorting, Harder sort; custom comparison function; zipf law 209 4.5
00299 Fetching from uHunt 2.2g, Special Sorting can use O(n^2) bubble sort 0.0
00612 Fetching from uHunt 2.2g, Special Sorting needs O(n^2) stable_sort 0.0
10327 Fetching from uHunt 2.2g, Special Sorting solvable with O(n^2) bubble sort 0.0
10810 Fetching from uHunt 2.2g, Special Sorting requires O(n log n) merge sort; also available at Kattis - ultraquicksort 0.0
11462 Fetching from uHunt 2.2g, Special Sorting standard Counting Sort problem 0.0
11495 Fetching from uHunt 2.2g, Special Sorting requires O(n log n) merge sort 0.0
11858 Fetching from uHunt 2.2g, Special Sorting requires O(n log n) merge sort; 64-bit integer; also available at Kattis - froshweek 0.0
13212 Fetching from uHunt 2.2g, Special Sorting requires O(n log n) merge sort 0.0
bread bread 2.2g, Special Sorting inversion index; hard to derive 249 5.0
excursion excursion 2.2g, Special Sorting inversion index; requires O(n log n) merge sort 387 4.3
froshweek froshweek 2.2g, Special Sorting requires O(n log n) merge sort; 64-bit integer; also available at UVa 11858 - Frosh Week 694 5.6
gamenight gamenight 2.2g, Special Sorting Counting Sort is a subproblem; count frequency of A/B/Cs; complete search AA..ABB..BCC..C or AA..ACC..CBB..B 70 2.8
mali mali 2.2g, Special Sorting Counting Sort two arrays; greedy matching largest+smallest at that point 97 5.1
sort sort 2.2g, Special Sorting Counting Sort variant 318 2.3
ultraquicksort ultraquicksort 2.2g, Special Sorting requires O(n log n) merge sort; also available at UVa 10810 - Ultra Quicksort 180 5.2
00594 Fetching from uHunt 2.2h, Bit Manipulation manipulate bit string with bitset 0.0
00700 Fetching from uHunt 2.2h, Bit Manipulation can be solved with bitset 0.0
01241 Fetching from uHunt 2.2h, Bit Manipulation LA 4147 - Jakarta08; easy 0.0
10264 Fetching from uHunt 2.2h, Bit Manipulation heavy bitmask manipulation 0.0
10469 Fetching from uHunt 2.2h, Bit Manipulation super simple if you use xor 0.0
11173 Fetching from uHunt 2.2h, Bit Manipulation Divide and Conquer pattern or one liner bit manipulation 0.0
11760 Fetching from uHunt 2.2h, Bit Manipulation separate row col checks; use two bitsets 0.0
11926 Fetching from uHunt 2.2h, Bit Manipulation use 1M bitset to check if a slot is free 0.0
11933 Fetching from uHunt 2.2h, Bit Manipulation simple bit exercise 0.0
12571 Fetching from uHunt 2.2h, Bit Manipulation precalculate AND operations 0.0
12720 Fetching from uHunt 2.2h, Bit Manipulation observe the pattern in this binary to decimal conversion variant; involves modulo arithmetic 0.0
bitbybit bitbybit 2.2h, Bit Manipulation be very careful with and + or corner cases 955 2.9
bits bits 2.2h, Bit Manipulation use GNU C++ __builtin_popcount 1066 2.6
deathstar deathstar 2.2h, Bit Manipulation can be solved with bit manipulation 415 2.0
hypercube hypercube 2.2h, Bit Manipulation given a gray code; we can binary search its index: upper half/first digit 0 and bottom half/first digit 1 376 3.0
iboard iboard 2.2h, Bit Manipulation simulation; LSB to MSB; all ASCII values are 7-bits; we may need to add leading zeroes 363 2.3
snappereasy snappereasy 2.2h, Bit Manipulation see Kattis - snapperhard 424 2.7
snapperhard snapperhard 2.2h, Bit Manipulation bit manipulation; find the pattern; the easier version is also available at Kattis - snappereasy 501 2.3
zebrasocelots zebrasocelots 2.2h, Bit Manipulation zebra is 1; ocelot is 0; simulation of long long 563 3.2
00424 Fetching from uHunt 2.2i, Big Integer BigInteger addition 0.0
00465 Fetching from uHunt 2.2i, Big Integer BigInteger add/multiply; compare with 2^31-1$ 0.0
00619 Fetching from uHunt 2.2i, Big Integer BigInteger 0.0
00713 Fetching from uHunt 2.2i, Big Integer BigInteger StringBuffer reverse() 0.0
00748 Fetching from uHunt 2.2i, Big Integer BigInteger exponentiation 0.0
01226 Fetching from uHunt 2.2i, Big Integer LA 3997 - Danang07; mod operation 0.0
01647 Fetching from uHunt 2.2i, Big Integer find the simple pattern first using brute force; then precompute the answers using BigInteger 0.0
10013 Fetching from uHunt 2.2i, Big Integer BigInteger addition 0.0
10083 Fetching from uHunt 2.2i, Big Integer BigInteger number theory 0.0
10106 Fetching from uHunt 2.2i, Big Integer BigInteger multiplication 0.0
10198 Fetching from uHunt 2.2i, Big Integer recurrences; BigInteger 0.0
10430 Fetching from uHunt 2.2i, Big Integer BigInteger; derive formula first 0.0
10433 Fetching from uHunt 2.2i, Big Integer BigInteger: pow; substract; mod 0.0
10464 Fetching from uHunt 2.2i, Big Integer Java BigDecimal class 0.0
10494 Fetching from uHunt 2.2i, Big Integer BigInteger division 0.0
10519 Fetching from uHunt 2.2i, Big Integer recurrences; BigInteger 0.0
10523 Fetching from uHunt 2.2i, Big Integer BigInteger addition; multiplication; and power 0.0
10669 Fetching from uHunt 2.2i, Big Integer Big Integer is for 3^n; binary rep of set; also available at Kattis - threepowers 0.0
10925 Fetching from uHunt 2.2i, Big Integer BigInteger addition and division 0.0
10992 Fetching from uHunt 2.2i, Big Integer input size is up to 50 digits 0.0
11448 Fetching from uHunt 2.2i, Big Integer BigInteger subtraction 0.0
11664 Fetching from uHunt 2.2i, Big Integer simple simulation involving BigInteger 0.0
11821 Fetching from uHunt 2.2i, Big Integer Java BigDecimal class 0.0
11830 Fetching from uHunt 2.2i, Big Integer use BigInteger string representation 0.0
11879 Fetching from uHunt 2.2i, Big Integer BigInteger: mod; divide; subtract; equals 0.0
12143 Fetching from uHunt 2.2i, Big Integer LA 4209 - Dhaka08; formula simplification---the hard part; use BigInteger---the easy part 0.0
12459 Fetching from uHunt 2.2i, Big Integer draw the ancestor tree to see the pattern 0.0
12930 Fetching from uHunt 2.2i, Big Integer Java BigDecimal class; compareTo 0.0
buka buka 2.2i, Big Integer a trivial problem if we use Python or Java BigInteger 152 1.8
disastrousdoubling disastrousdoubling 2.2i, Big Integer simulation; wrong answer if not using Big Integer 324 3.7
generalizedrecursivefunctions generalizedrecursivefuncti... 2.2i, Big Integer direct implementation of the given generalized recursive functions; but using Big Integer 141 3.9
primaryarithmetic primaryarithmetic 2.2i, Big Integer not a Big Integer problem but a simulation of basic addition 399 2.7
simpleaddition simpleaddition 2.2i, Big Integer that A+B on BigInteger question 1913 1.9
threepowers threepowers 2.2i, Big Integer Big Integer is for 3^n; binary rep of set; also available at UVa 10669 - Three powers 700 2.6
wizardofodds wizardofodds 2.2i, Big Integer if K is bigger than 350, the answer is clear; else just check if 2^K ≥ N 488 2.6
00127 Fetching from uHunt 2.2j, Stack shuffling stack 0.0
00514 Fetching from uHunt 2.2j, Stack use stack to simulate the process 0.0
00732 Fetching from uHunt 2.2j, Stack use stack to simulate the process 0.0
01062 Fetching from uHunt 2.2j, Stack LA 3752 - WorldFinals Tokyo07; simulation with stack; maximum answer is 26 stacks; O(n) solution exists 0.0
10858 Fetching from uHunt 2.2j, Stack use stack 0.0
13055 Fetching from uHunt 2.2j, Stack nice problem about stack 0.0
dream dream 2.2j, Stack stack simulation; reading comprehension problem, need other fast DS for mapping strings to indices 219 6.4
evenup evenup 2.2j, Stack use stack to solve this problem 1273 2.7
pairingsocks pairingsocks 2.2j, Stack simulation using two stacks; just do as asked 556 3.0
restaurant restaurant 2.2j, Stack simulation with stack-based concept; drop plates at stack 2 (LIFO); use move 2-$gt;1 to reverse order; take from stack 1... 364 4.5
reversebinary reversebinary 2.2j, Stack decimal to binary; reverse it; binary to decimal 7144 1.5
symmetricorder symmetricorder 2.2j, Stack use stack to help reverse even-indexed names 3584 1.5
thegrandadventure thegrandadventure 2.2j, Stack stack simulation 348 2.0
throwns throwns 2.2j, Stack use stack of egg positions to help with the undo operation; be careful of corner cases involving modulo operation 1091 2.6
00551 Fetching from uHunt 2.2k, Stack-based Problems bracket matching; use stack 0.0
00673 Fetching from uHunt 2.2k, Stack-based Problems similar to UVa 551; classic 0.0
00727 Fetching from uHunt 2.2k, Stack-based Problems Infix to Postfix conversion problem 0.0
11111 Fetching from uHunt 2.2k, Stack-based Problems bracket matching with twists 0.0
bungeebuilder bungeebuilder 2.2k, Stack-based Problems clever usage of stack; linear pass; bracket (mountain) matching variant 83 3.3
circuitmath circuitmath 2.2k, Stack-based Problems postfix calculator problem 918 2.4
delimitersoup delimitersoup 2.2k, Stack-based Problems bracket matching; stack 382 1.9
00246 Fetching from uHunt 2.2l, List/Queue/Deque card simulation with queue and deque 0.0
00540 Fetching from uHunt 2.2l, List/Queue/Deque modified queue 0.0
10172 Fetching from uHunt 2.2l, List/Queue/Deque use both queue and stack 0.0
10901 Fetching from uHunt 2.2l, List/Queue/Deque simulation with queue; also available at Kattis - ferryloading3 0.0
10935 Fetching from uHunt 2.2l, List/Queue/Deque simulation with queue 0.0
11034 Fetching from uHunt 2.2l, List/Queue/Deque simulation with queue; also available at Kattis - ferryloading4 0.0
11797 Fetching from uHunt 2.2l, List/Queue/Deque simulation with 5 queues 0.0
11988 Fetching from uHunt 2.2l, List/Queue/Deque rare linked list problem 0.0
12100 Fetching from uHunt 2.2l, List/Queue/Deque simulation with queue 0.0
12108 Fetching from uHunt 2.2l, List/Queue/Deque simulation with N queues 0.0
12207 Fetching from uHunt 2.2l, List/Queue/Deque use both queue and deque 0.0
backspace backspace 2.2l, List/Queue/Deque we can use deque (or vector) to help solve this problem 2517 3.0
ferryloading3 ferryloading3 2.2l, List/Queue/Deque simulation with queue; also available at UVa 10901 - Ferry Loading III 368 3.6
ferryloading4 ferryloading4 2.2l, List/Queue/Deque simulation with queue; also available at UVa 11034 - Ferry Loading IV 703 3.6
foosball foosball 2.2l, List/Queue/Deque queue simulation; tedious 186 3.7
integerlists integerlists 2.2l, List/Queue/Deque use deque for fast deletion from front (normal) & back (reversed list); use stack to reverse the final list if it is... 882 4.8
joinstrings joinstrings 2.2l, List/Queue/Deque all '+' operations must be O(1) 959 4.1
lyklagangriti lyklagangriti 2.2l, List/Queue/Deque use list and its iterator; very similar to Kattis - sim 114 2.7
server server 2.2l, List/Queue/Deque one first come first serve pass; we can use queue although overkill 3331 1.9
sim sim 2.2l, List/Queue/Deque use list and its iterator 99 2.0
teque teque 2.2l, List/Queue/Deque all operations must be O(1) 766 3.3
trendingtopic trendingtopic 2.2l, List/Queue/Deque use queue of length 7 to maintain words in the past 7 days, unordered_map to count frequencies, sort to format the outpu... 181 5.8
01203 Fetching from uHunt 2.3a, Priority Queue LA 3135 - Beijing04; use priority_queue 0.0
11995 Fetching from uHunt 2.3a, Priority Queue stack; queue; and priority_queue 0.0
11997 Fetching from uHunt 2.3a, Priority Queue sort the lists; merge two sorted lists using priority_queue to keep the K-th smallest sum every time 0.0
13190 Fetching from uHunt 2.3a, Priority Queue similar to UVa 01203; use PQ; use drug numbering id as tie-breaker 0.0
alehouse alehouse 2.3a, Priority Queue discretize the events; PQ simulation 223 4.6
clinic clinic 2.3a, Priority Queue interesting PQ simulation; reverse thinking; project to time 0 165 3.0
guessthedatastructure guessthedatastructure 2.3a, Priority Queue stack, queue, and priority_queue; also available at UVa 11995 - I Can Guess ... 2148 2.5
janeeyre janeeyre 2.3a, Priority Queue simulate Anna's reading behavior with PQ; the input parsing is tedious 79 4.8
jugglingpatterns jugglingpatterns 2.3a, Priority Queue PQ simulation; reading comprehension 48 6.3
knigsoftheforest knigsoftheforest 2.3a, Priority Queue PQ simulation after sorting the entries by year 184 3.6
numbertree numbertree 2.3a, Priority Queue not a direct priority queue problem, but the indexing strategy is similar to binary heap indexing 1760 2.1
rationalsequence2 rationalsequence2 2.3a, Priority Queue the L/R pattern can be easily derived and indexing strategy is similar to binary heap indexing 1388 1.5
rationalsequence3 rationalsequence3 2.3a, Priority Queue the reverse problem of rationalsequence2 587 1.8
stockprices stockprices 2.3a, Priority Queue PQ simulation; both max and min PQ 109 3.7
00499 Fetching from uHunt 2.3b, DAT, ASCII ASCII keys 0.0
00895 Fetching from uHunt 2.3b, DAT, ASCII get the letter frequency of each word; compare with puzzle line 0.0
10008 Fetching from uHunt 2.3b, DAT, ASCII A-Z keys 0.0
10062 Fetching from uHunt 2.3b, DAT, ASCII ASCII character frequency count 0.0
10260 Fetching from uHunt 2.3b, DAT, ASCII DAT for soundex A-Z code mapping; also available at Kattis - soundex 0.0
10293 Fetching from uHunt 2.3b, DAT, ASCII A-Z keys 0.0
10625 Fetching from uHunt 2.3b, DAT, ASCII ASCII character; frequency addition n times 0.0
11340 Fetching from uHunt 2.3b, DAT, ASCII ASCII keys 0.0
11577 Fetching from uHunt 2.3b, DAT, ASCII A-Z keys 0.0
12626 Fetching from uHunt 2.3b, DAT, ASCII A-Z keys 0.0
alphabetspam alphabetspam 2.3b, DAT, ASCII count the frequencies of lowercase, uppercase, and whitespace characters 3902 1.4
keyboardd keyboardd 2.3b, DAT, ASCII frequency counting of A-Zs and spaces 92 2.0
quickbrownfox quickbrownfox 2.3b, DAT, ASCII pangram; frequency counting of 26 alphabets 4433 1.6
soundex soundex 2.3b, DAT, ASCII DAT for soundex A-Z code mapping; also available at UVa 10260 - Soundex 106 2.9
00755 Fetching from uHunt 2.3c, DAT, Others Direct Addressing Table; convert the letters except Q and Z to 2-9; keep 0-9 as 0-9; sort the integers; find duplicates ... 0.0
01368 Fetching from uHunt 2.3c, DAT, Others for each column j, find the highest frequency character among all j-th column of all m DNA strings 0.0
11203 Fetching from uHunt 2.3c, DAT, Others count frequency of x/y/z 0.0
12650 Fetching from uHunt 2.3c, DAT, Others use 1D Boolean array for each person 0.0
bookingaroom bookingaroom 2.3c, DAT, Others only 100 rooms; use 1D Boolean array 2849 1.7
busnumbers busnumbers 2.3c, DAT, Others only 1000 bus numbers; use 1D Boolean array 2776 2.4
freefood freefood 2.3c, DAT, Others only 365 days in a year 1965 1.5
hardware hardware 2.3c, DAT, Others parsing is tedious; count the frequency of digits 244 2.0
heimavinna heimavinna 2.3c, DAT, Others DAT of 1000 problems 431 1.4
princesspeach princesspeach 2.3c, DAT, Others DAT; linear pass 839 2.1
relocation relocation 2.3c, DAT, Others just use DAT 1112 1.5
10887 Fetching from uHunt 2.3d, Hash Table (set) Use O(M*N*log(MN)*10) algorithm; concatenate all pairs of strings; put them in a set; report set size 0.0
11849 Fetching from uHunt 2.3d, Hash Table (set) unordered_set is faster than set here; or use modified merge as the input is sorted; also available at Kattis - cd 0.0
12049 Fetching from uHunt 2.3d, Hash Table (set) unordered_multiset manipulation 0.0
13148 Fetching from uHunt 2.3d, Hash Table (set) we can store all precomputed answers - which are given - into unordered_set 0.0
bard bard 2.3d, Hash Table (set) use one unordered_set per villager; simulate the singing process 637 2.6
boatparts boatparts 2.3d, Hash Table (set) use unordered_set 1398 1.6
cd cd 2.3d, Hash Table (set) unordered_set is faster than set here; or use modified merge as the input is sorted; also available at UVa 11849 - CD 3176 5.3
deduplicatingfiles deduplicatingfiles 2.3d, Hash Table (set) use vector to store the strings; unordered_set to store unique strings; and complete search to compare the n^2 hash code... 583 4.4
engineeringenglish engineeringenglish 2.3d, Hash Table (set) use unordered_set to remember duplicated words; transform to lowercase 1627 2.2
esej esej 2.3d, Hash Table (set) use unordered_set to prevent duplicate 509 3.3
everywhere everywhere 2.3d, Hash Table (set) use unordered_set 7015 1.4
greetingcard greetingcard 2.3d, Hash Table (set) use unordered_set; good question; major hint: only 12 neighbors 607 4.9
icpcawards icpcawards 2.3d, Hash Table (set) use unordered_set; print first 12 distinct Universities (and their first teams) 2167 1.4
iwannabe iwannabe 2.3d, Hash Table (set) sort Pokenoms based on each stat; pick top K ids and put in an unordered_set; report final size of unordered_set 739 2.5
keywords keywords 2.3d, Hash Table (set) pre-process the strings; put inside unordered_set; report final size 349 2.3
nodup nodup 2.3d, Hash Table (set) use unordered_set; string 3564 1.3
oddmanout oddmanout 2.3d, Hash Table (set) use unordered_set to find and eliminate pairs 4450 1.5
pizzahawaii pizzahawaii 2.3d, Hash Table (set) use Python to help with (unordered) set intersection and difference operations 335 2.6
proofs proofs 2.3d, Hash Table (set) parsing; use unordered_set to store past conclusions; a few corner cases 48 2.4
securedoors securedoors 2.3d, Hash Table (set) use unordered_set to keep track of the people 2108 1.8
shiritori shiritori 2.3d, Hash Table (set) linear pass; use unordered_set to keep track of words that have been called 295 2.9
shoppinglist shoppinglist 2.3d, Hash Table (set) simple set intersection problem 16 4.4
shoppinglisteasy shoppinglisteasy 2.3d, Hash Table (set) see Kattis - shoppinglist 23 3.4
upprodun upprodun 2.3d, Hash Table (set) not really a Hash Table problem but uses Hash Table concept; the number of teams in each room is the 'load factor' of th... 197 1.9
whatdoesthefoxsay whatdoesthefoxsay 2.3d, Hash Table (set) use unordered_set to record excluded sounds 2578 2.1
00484 Fetching from uHunt 2.3e, Hash Table (map), E maintain frequency with map 0.0
00860 Fetching from uHunt 2.3e, Hash Table (map), E frequency counting 0.0
00902 Fetching from uHunt 2.3e, Hash Table (map), E read char by char; count word freq 0.0
10282 Fetching from uHunt 2.3e, Hash Table (map), E a pure dictionary problem; use unordered_map; also available at Kattis - babelfish 0.0
10295 Fetching from uHunt 2.3e, Hash Table (map), E use unordered_map to deal with Hay Points dictionary; also available at Kattis - haypoints 0.0
10374 Fetching from uHunt 2.3e, Hash Table (map), E use unordered_map for frequency counting 0.0
10686 Fetching from uHunt 2.3e, Hash Table (map), E use map to manage the data 0.0
11286 Fetching from uHunt 2.3e, Hash Table (map), E use unordered_map to count frequencies of the sorted permutations of 5 ids; also available at Kattis - conformity 0.0
11348 Fetching from uHunt 2.3e, Hash Table (map), E use map and set to check uniqueness 0.0
11629 Fetching from uHunt 2.3e, Hash Table (map), E use map 0.0
12592 Fetching from uHunt 2.3e, Hash Table (map), E use map; string to string 0.0
babelfish babelfish 2.3e, Hash Table (map), E a pure dictionary problem; use unordered_map; also available at UVa 10282 - Babelfish 2835 2.3
competitivearcadebasketball competitivearcadebasketbal... 2.3e, Hash Table (map), E use unordered_map 209 2.8
conformity conformity 2.3e, Hash Table (map), E use unordered_map to count frequencies of the sorted permutations of 5 ids; also available at UVa 11286 - Conformity 1100 1.9
costumecontest costumecontest 2.3e, Hash Table (map), E use unordered_map to map frequency of each category; get the minimum one; print output lexicographically 532 2.0
election2 election2 2.3e, Hash Table (map), E frequency counting; be careful of tie breaker 166 2.4
grandpabernie grandpabernie 2.3e, Hash Table (map), E use unordered_map plus (sorted) vector 1065 3.2
haypoints haypoints 2.3e, Hash Table (map), E use unordered_map to deal with Hay Points dictionary; also available at UVa 10295 - Hay Points 1055 2.0
marko marko 2.3e, Hash Table (map), E frequency counting with unordered_map 495 1.9
metaprogramming metaprogramming 2.3e, Hash Table (map), E use unordered_map; somewhat similar with Kattis - addingwords 820 2.4
recount recount 2.3e, Hash Table (map), E use map; frequency counting 1163 2.0
rollcall rollcall 2.3e, Hash Table (map), E use unordered_map to count frequency; sort 530 2.4
variablearithmetic variablearithmetic 2.3e, Hash Table (map), E use unordered_map as mapper 394 2.6
00417 Fetching from uHunt 2.3f, Hash Table (map), H generate all words; add to map for auto sorting 0.0
10132 Fetching from uHunt 2.3f, Hash Table (map), H use map; brute force 0.0
10145 Fetching from uHunt 2.3f, Hash Table (map), H use map and set 0.0
11572 Fetching from uHunt 2.3f, Hash Table (map), H use unordered_map to record the occurrence index of a certain snowflake size; use this to determine the answer in linear... 0.0
11860 Fetching from uHunt 2.3f, Hash Table (map), H use set and map; linear scan 0.0
11917 Fetching from uHunt 2.3f, Hash Table (map), H use map 0.0
addingwords addingwords 2.3f, Hash Table (map), H use unordered_map 1880 3.9
awkwardparty awkwardparty 2.3f, Hash Table (map), H use unordered_map to running max and running min; report the largest difference 611 3.0
basicinterpreter basicinterpreter 2.3f, Hash Table (map), H the harder version of Kattis - variablearithmetic; tedious; be careful; print string inside double quotes verbatim 152 6.7
conversationlog conversationlog 2.3f, Hash Table (map), H use combo DS: unordered_map, set, plus (sorted) vector 507 2.8
iforaneye iforaneye 2.3f, Hash Table (map), H use unordered_map to map the various rules mentioned in the problem description; tedious 143 5.0
magicalcows magicalcows 2.3f, Hash Table (map), H use unordered_map of farm size to frequency; small simulation; but since C is small, we can also use DAT 257 4.6
minorsetback minorsetback 2.3f, Hash Table (map), H use unordered_map of string to another unordered_map of int to string; need a bit of music theory to solve the problem; ... 147 3.6
parallelanalysis parallelanalysis 2.3f, Hash Table (map), H reading comprehension; use unordered_map to map memory address to last time it is written 80 4.8
recenice recenice 2.3f, Hash Table (map), H use unordered_map to prepare pronunciation of [1..999]; precalculate the answer afterwards using another unordered_map 225 3.1
snowflakes snowflakes 2.3f, Hash Table (map), H use unordered_map to record the occurrence index of a certain snowflake size; use this to determine the answer in linear... 404 4.4
00501 Fetching from uHunt 2.3g, Balanced BST (set) use multiset with efficient iterator manipulation 0.0
00978 Fetching from uHunt 2.3g, Balanced BST (set) simulation; use multiset 0.0
10815 Fetching from uHunt 2.3g, Balanced BST (set) use set and string 0.0
11062 Fetching from uHunt 2.3g, Balanced BST (set) similar to UVa 10815 with twists 0.0
11136 Fetching from uHunt 2.3g, Balanced BST (set) use multiset 0.0
13037 Fetching from uHunt 2.3g, Balanced BST (set) we can use set or a sorted array 0.0
bst bst 2.3g, Balanced BST (set) simulate special BST [1..N] insertions using set 449 7.3
caching caching 2.3g, Balanced BST (set) combo ds (unordered_map and set) 210 5.8
candydivision candydivision 2.3g, Balanced BST (set) complete search from 1 to sqrt(N); insert all divisors into set for automatic sorting and elimination of duplicates 702 3.4
compoundwords compoundwords 2.3g, Balanced BST (set) use set extensively; iterator 1807 1.7
coursescheduling coursescheduling 2.3g, Balanced BST (set) keep (ordered) set of courses and (unordered) map of course to students taking the course 40 3.1
ministryofmagic ministryofmagic 2.3g, Balanced BST (set) simulate directly, use of queue and set (PQ with update key/increase key; use STL set) 63 6.0
missinggnomes missinggnomes 2.3g, Balanced BST (set) use set to keep ordered list of missing gnomes 659 2.6
palindromicpassword palindromicpassword 2.3g, Balanced BST (set) there are not more than 900 3-digits number; generate all and store them in a (sorted) set; find ceil and floor of input... 431 3.3
raidteams raidteams 2.3g, Balanced BST (set) use more than one PQs that can support erase operation 75 3.5
00939 Fetching from uHunt 2.3h, Balanced BST (map) map child name to his/her gene and parents' names 0.0
10138 Fetching from uHunt 2.3h, Balanced BST (map) map plates to bills; entrance time; and position 0.0
10226 Fetching from uHunt 2.3h, Balanced BST (map) use map; sorted output; also available at Kattis - hardwoodspecies 0.0
10420 Fetching from uHunt 2.3h, Balanced BST (map) word frequency counting; use map 0.0
11239 Fetching from uHunt 2.3h, Balanced BST (map) use map and set to check previous strings; order needed; also available at Kattis - opensource 0.0
11308 Fetching from uHunt 2.3h, Balanced BST (map) use map and set 0.0
12504 Fetching from uHunt 2.3h, Balanced BST (map) use map; string to string 0.0
administrativeproblems administrativeproblems 2.3h, Balanced BST (map) use several maps as the output (of spy names) has to be sorted; be careful of corner cases 194 6.3
baconeggsandspam baconeggsandspam 2.3h, Balanced BST (map) use map; sort 1712 1.6
cakeymccakeface cakeymccakeface 2.3h, Balanced BST (map) map differences to frequencies; return the one with maximum frequency and if ties, the smallest difference 197 3.8
doctorkattis doctorkattis 2.3h, Balanced BST (map) Max Priority Queue with frequent (increaseKey) updates; use map 114 4.7
fantasydraft fantasydraft 2.3h, Balanced BST (map) use map to keep ordering; simulate; need to erase 111 4.0
fodelsedagsmemorisering fodelsedagsmemorisering 2.3h, Balanced BST (map) use map; sorted output 289 1.8
hardwoodspecies hardwoodspecies 2.3h, Balanced BST (map) use map; sorted output; also available at UVa 10226 - Hardwood Species 378 2.7
kattissquest kattissquest 2.3h, Balanced BST (map) use map of priority queues; other solutions exist 834 3.1
notamused notamused 2.3h, Balanced BST (map) use map; sorted output 601 2.0
opensource opensource 2.3h, Balanced BST (map) use map and set to check previous strings; order needed; also available at UVa 11239 - Open Source 291 3.3
problemclassification problemclassification 2.3h, Balanced BST (map) mapper; frequency counting 345 3.1
srednji srednji 2.3h, Balanced BST (map) go left and right of B; use fast data structure like map to help determine the result fast 164 4.1
warehouse warehouse 2.3h, Balanced BST (map) use unordered_map and multimap 920 2.1
zoo zoo 2.3h, Balanced BST (map) parsing; keep last token; tolower; frequency counting with map; order needed 1499 1.7
10909 Fetching from uHunt 2.3i, Order Statistics Tree involves dynamic selection; use pb\_ds, Fenwick Tree, or augment balanced BST 0.0
babynames babynames 2.3i, Order Statistics Tree dynamic rank problem; use two pb_ds 87 5.5
continuousmedian continuousmedian 2.3i, Order Statistics Tree dynamic selection problem; specifically the median values; pb_ds helps 140 3.9
cookieselection cookieselection 2.3i, Order Statistics Tree map large integers to up to 600K integers; use pb_ds or Fenwick Tree and the select(median) operation of Fenwick Tree 923 4.3
gcpc gcpc 2.3i, Order Statistics Tree dynamic rank problem; pb_ds helps 876 5.3
00599 Fetching from uHunt 2.4a, Graph Data Structures V-E = number of CCs; use a bitset of size 26 to count the number of vertices that have some edge 0.0
10895 Fetching from uHunt 2.4a, Graph Data Structures transpose adjacency list 0.0
10928 Fetching from uHunt 2.4a, Graph Data Structures counting out-degrees 0.0
11550 Fetching from uHunt 2.4a, Graph Data Structures graph representation; incidence matrix 0.0
11991 Fetching from uHunt 2.4a, Graph Data Structures Adjacency List 0.0
abinitio abinitio 2.4a, Graph Data Structures combo: EL input, AM as working graph DS, AL output (in hash format); all operations must be O(V) or better 104 7.3
alphabetanimals alphabetanimals 2.4a, Graph Data Structures somewhat an Adjacency List data structure 478 3.4
chopwood chopwood 2.4a, Graph Data Structures Prüfer sequence; use priority_queue 258 3.5
flyingsafely flyingsafely 2.4a, Graph Data Structures trivial solution exists 1421 1.7
railroad railroad 2.4a, Graph Data Structures do as asked; graph DS modification; bypass vertices with degree 2 95 6.3
traveltheskies traveltheskies 2.4a, Graph Data Structures (graph) DS manipulation; an array of ALs (one per each day); simulate the number of people day by day 188 3.2
weakvertices weakvertices 2.4a, Graph Data Structures graph edge existence checks 1775 1.5
00793 Fetching from uHunt 2.4b, Union-Find trivial; application of disjoint sets 0.0
01197 Fetching from uHunt 2.4b, Union-Find LA 2817 - Kaohsiung03; Connected Components 0.0
01329 Fetching from uHunt 2.4b, Union-Find LA 3027 - SouthEasternEurope04; interesting UFDS variant; modify the union and find routine 0.0
10158 Fetching from uHunt 2.4b, Union-Find advanced usage of disjoint sets with a nice twist; memorize list of enemies 0.0
10227 Fetching from uHunt 2.4b, Union-Find merge two disjoint sets if they are consistent; also available at Kattis - forests 0.0
10507 Fetching from uHunt 2.4b, Union-Find disjoint sets simplifies this problem 0.0
10583 Fetching from uHunt 2.4b, Union-Find count disjoint sets after all unions 0.0
10608 Fetching from uHunt 2.4b, Union-Find find the set with the largest element 0.0
10685 Fetching from uHunt 2.4b, Union-Find find the set with the largest element 0.0
11503 Fetching from uHunt 2.4b, Union-Find maintain set attribute (size) in rep item; also available at Kattis - virtualfriends 0.0
11690 Fetching from uHunt 2.4b, Union-Find check if total money from each member is 0 0.0
11987 Fetching from uHunt 2.4b, Union-Find maintain set attribute (size and sum) in rep item; new operation: move; key idea: do not destroy the parent array struct... 0.0
almostunionfind almostunionfind 2.4b, Union-Find new operation: move; idea: do not destroy the parent array structure; also available at UVa 11987 - Almost Union-Find 618 7.0
bridgesandtunnels bridgesandtunnels 2.4b, Union-Find map buildings to integer IDs; UFDS; size of set 57 3.2
chatter chatter 2.4b, Union-Find UFDS simulation using random number generation 59 3.1
control control 2.4b, Union-Find LA 7480 - Singapore15; simulation of UFDS; size of set; number of disjoint sets 424 4.6
forests forests 2.4b, Union-Find merge two disjoint sets if they are consistent; also available at UVa 10227 - Forests 127 3.0
ladice ladice 2.4b, Union-Find size of set; decrement one per usage 615 2.8
more10 more10 2.4b, Union-Find UFDS; a bit of string processing; tedious 94 7.1
skolavslutningen skolavslutningen 2.4b, Union-Find group classes that share the same column into the same CC; report number of CCs 152 1.9
swaptosort swaptosort 2.4b, Union-Find it boils down to finding CCs of 1 with N-1; 2 with N-2; and so on... 423 3.9
tildes tildes 2.4b, Union-Find basic UFDS with size of set query 165 2.6
unionfind unionfind 2.4b, Union-Find basic UFDS; similar to UVa 00793 1086 4.8
virtualfriends virtualfriends 2.4b, Union-Find maintain set attribute (size) in rep item; also available at UVa 11503 - Virtual Friends 1078 3.9
00297 Fetching from uHunt 2.4c, Tree-related DS simple quadtree problem 0.0
01232 Fetching from uHunt 2.4c, Tree-related DS LA 4108 - Singapore07; we have to use a Segment Tree; note that this problem is not about RSQ/RMQ 0.0
01513 Fetching from uHunt 2.4c, Tree-related DS LA 5902 - NorthWesternEurope11; not stack but dynamic RSQ problem; use DAT (for mapping) and Fenwick Tree (for RSQ); als... 0.0
11235 Fetching from uHunt 2.4c, Tree-related DS range maximum query 0.0
11297 Fetching from uHunt 2.4c, Tree-related DS Quad Tree with updates or use 2D segment tree 0.0
11350 Fetching from uHunt 2.4c, Tree-related DS simple tree data structure question 0.0
11402 Fetching from uHunt 2.4c, Tree-related DS Segment Tree with lazy updates 0.0
11423 Fetching from uHunt 2.4c, Tree-related DS clever usage of Fenwick Tree and large array; important hint: look at the constraints carefully 0.0
12086 Fetching from uHunt 2.4c, Tree-related DS LA 2191 - Dhaka06; pure dynamic RSQ problem; solvable with Fenwick Tree or Segment Tree 0.0
12299 Fetching from uHunt 2.4c, Tree-related DS Segment Tree with a few point (not range) updates; RMQs 0.0
12532 Fetching from uHunt 2.4c, Tree-related DS clever usage of Fenwick/Segment Tree 0.0
fenwick fenwick 2.4c, Tree-related DS basic Fenwick Tree; use long long 695 4.5
justforsidekicks justforsidekicks 2.4c, Tree-related DS use six Fenwick Trees, one for each gem type 103 4.9
moviecollection moviecollection 2.4c, Tree-related DS LA 5902 - NorthWesternEurope11; not a stack but a dynamic RSQ problem; also available at UVa 01513 - Movie collection 547 5.5
supercomputer supercomputer 2.4c, Tree-related DS easy problem if we use Fenwick Tree 760 3.8
turbo turbo 2.4c, Tree-related DS somewhat similar with UVa 01513/Kattis - moviecollection; use DAT (for mapping) and Fenwick Tree (for RSQ) 507 4.3
worstweather worstweather 2.4c, Tree-related DS store the year+rain data in a (sorted) array; binary search; Segment Tree/Sparse Table: static RMaxQueries 118 7.7
00165 Fetching from uHunt 3.2a, Pre-calculate-able requires some DP too; can be pre-calculated 0.0
00167 Fetching from uHunt 3.2a, Pre-calculate-able 8-queens chess problem 0.0
00256 Fetching from uHunt 3.2a, Pre-calculate-able brute force; math; pre-calculate-able 0.0
00347 Fetching from uHunt 3.2a, Pre-calculate-able simulate the process; pre-calculate-able 0.0
00750 Fetching from uHunt 3.2a, Pre-calculate-able classic backtracking problem; only 92 possible 8-queens positions 0.0
00861 Fetching from uHunt 3.2a, Pre-calculate-able backtracking with pruning as in 8-queens recursive backtracking solution; then pre-calculate the results 0.0
10128 Fetching from uHunt 3.2a, Pre-calculate-able backtracking with pruning; try all $N!$ permutations that satisfy the requirement; 13! will TLE; pre-calculate the resul... 0.0
10177 Fetching from uHunt 3.2a, Pre-calculate-able 2/3/4 nested loops; precalculate 0.0
10276 Fetching from uHunt 3.2a, Pre-calculate-able insert a number one by one 0.0
11085 Fetching from uHunt 3.2a, Pre-calculate-able see UVa 750; pre-calculation 0.0
4thought 4thought 3.2a, Pre-calculate-able brute force 4^3 possibilities; integer division; pre-calculate 2353 2.8
cardtrick2 cardtrick2 3.2a, Pre-calculate-able n <= 13, we can simulate the process using queue and precalculate all 13 possible answers 869 1.6
chocolates chocolates 3.2a, Pre-calculate-able RxC ≤ 16; use iterative bitmask to try all combinations; test combination with 2 floodfills (on 1s/chocolates and on ... 48 5.0
foolingaround foolingaround 3.2a, Pre-calculate-able there are only 379 different values of N where Bob wins; pre-calculateable 117 5.8
gridmagic gridmagic 3.2a, Pre-calculate-able run a complete search solution and pre-calculate the answers 104 2.2
lastfactorialdigit lastfactorialdigit 3.2a, Pre-calculate-able very easy due to small range of N; pre-calculateable 4942 1.3
luckynumber luckynumber 3.2a, Pre-calculate-able there is an increasing and decreasing output pattern; for N > 25, the answer is 0; for N ∈ [2..25], use naive brut... 275 4.7
mancala mancala 3.2a, Pre-calculate-able we can generate all possible winnable Mancala boards from smaller Mancala boards 320 1.7
primematrix primematrix 3.2a, Pre-calculate-able Notice that we can just find 1 row answer for 2 ≤ n ≤ 50; then store the results; we can use this to generate the ... 140 4.2
sgcoin sgcoin 3.2a, Pre-calculate-able we can either brute force short string message; precompute all possible hash values; or come up with O(1) solution 271 2.4
00105 Fetching from uHunt 3.2b, Iterative (Two Loops) height map; sweep left-right 0.0
00592 Fetching from uHunt 3.2b, Iterative (Two Loops) key idea: there are only 3^5*2 possible states: the status of each person and whether it is day or night 0.0
00617 Fetching from uHunt 3.2b, Iterative (Two Loops) try all integer speeds from 30 to 60 mph 0.0
01260 Fetching from uHunt 3.2b, Iterative (Two Loops) LA 4843 - Daejeon10; check all 0.0
01588 Fetching from uHunt 3.2b, Iterative (Two Loops) LA 3712 - NorthEasternEurope06; good iterative brute force problem; beware of corner cases 0.0
10041 Fetching from uHunt 3.2b, Iterative (Two Loops) try all possible locations 0.0
10487 Fetching from uHunt 3.2b, Iterative (Two Loops) sort and then do O(n^2) pairings; also available at Kattis - closestsums 0.0
10570 Fetching from uHunt 3.2b, Iterative (Two Loops) brute force all possible final configurations (ascending/descending) and see which one requires the smallest number of e... 0.0
10670 Fetching from uHunt 3.2b, Iterative (Two Loops) 2 nested loops; with sorting; also available at Kattis - reduction 0.0
10730 Fetching from uHunt 3.2b, Iterative (Two Loops) 2 nested loops with pruning can still pass the time limit; compare this with UVa 11129; also available at Kattis - antia... 0.0
11242 Fetching from uHunt 3.2b, Iterative (Two Loops) brute force plus sorting; also available at Kattis - tourdefrance 0.0
12205 Fetching from uHunt 3.2b, Iterative (Two Loops) brute force; check intervals; also available at Kattis - telephones 0.0
12488 Fetching from uHunt 3.2b, Iterative (Two Loops) 2 nested loops; simulate overtaking process 0.0
12583 Fetching from uHunt 3.2b, Iterative (Two Loops) 2 nested loops; be careful of overcounting 0.0
13018 Fetching from uHunt 3.2b, Iterative (Two Loops) 2 dices, small range; 2 nested loops 0.0
8queens 8queens 3.2b, Iterative (Two Loops) classic 8-Queens problem; write a checker 2385 3.2
antiarithmetic antiarithmetic 3.2b, Iterative (Two Loops) 2 nested loops with pruning can still pass the time limit; compare this with UVa 11129; also available at UVa 10730 - An... 195 7.3
bestrelayteam bestrelayteam 3.2b, Iterative (Two Loops) sort runners based on flying start times; brute force first runner and pick top 3 other flying start runners 1420 1.9
bikegears bikegears 3.2b, Iterative (Two Loops) 2D nested loops; sort the output 185 5.4
blackfriday blackfriday 3.2b, Iterative (Two Loops) 2D nested loops; frequency counting 2384 2.2
closestsums closestsums 3.2b, Iterative (Two Loops) sort and then do O(n^2) pairings; also available at UVa 10487 - Closest Sums 1105 2.9
golombrulers golombrulers 3.2b, Iterative (Two Loops) 2D nested loops; additional 1D loops for checking 297 3.2
kafkaesque kafkaesque 3.2b, Iterative (Two Loops) 2D nested loops; simple 293 1.7
liga liga 3.2b, Iterative (Two Loops) 2D nested loops; interesting logic game; each team is independent; if number played and number loss both not defined, as... 71 6.1
majstor majstor 3.2b, Iterative (Two Loops) for the second output line; just try each of 'S', 'P', or 'R' at every round and take the max 101 1.9
peg peg 3.2b, Iterative (Two Loops) 2D nested loops; try all possible moves 931 1.8
pet pet 3.2b, Iterative (Two Loops) very simple 2D nested loops problem 7932 1.4
putovanje putovanje 3.2b, Iterative (Two Loops) clever problem with hint that masks possible brute force solution; just use 2D nested loops 413 2.5
reduction reduction 3.2b, Iterative (Two Loops) 2 nested loops; with sorting; also available at UVa 10670 - Work Reduction 119 5.8
register register 3.2b, Iterative (Two Loops) clever problem with hint that masks possible brute force solution; just use 2D nested loops 583 2.1
summertrip summertrip 3.2b, Iterative (Two Loops) 3 loops TLE; clever 2D nested loops; try all possible ending index i; use DAT to remember the latest lowest starting ind... 632 2.4
telephones telephones 3.2b, Iterative (Two Loops) brute force; check intervals; also available at UVa 12205 - Happy Telephones 302 2.6
tourdefrance tourdefrance 3.2b, Iterative (Two Loops) brute force plus sorting; also available at UVa 11242 - Tour de France 354 2.7
00154 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops 0.0
00441 Fetching from uHunt 3.2c, Three+ Nested Loops, E 6 nested loops; easy 0.0
00626 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops 0.0
00703 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops 0.0
00735 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops; then count 0.0
10102 Fetching from uHunt 3.2c, Three+ Nested Loops, E 4 nested loops will do; we do not need BFS; get max of minimum Manhattan distance from a 1 to a 3 0.0
10662 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops 0.0
11059 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops; input is small 0.0
12498 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops 0.0
12515 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops 0.0
12801 Fetching from uHunt 3.2c, Three+ Nested Loops, E 3 nested loops; still possible to be optimized further 0.0
12844 Fetching from uHunt 3.2c, Three+ Nested Loops, E 5 nested loops; scaled down version of UVa 10202; do observations first 0.0
cudoviste cudoviste 3.2c, Three+ Nested Loops, E 4 nested loops; the inner loops is just 2x2; 5 possibilities of crushed cars; skip 2x2 area that contains building 1194 1.4
mathhomework mathhomework 3.2c, Three+ Nested Loops, E 3 nested loops 257 2.1
npuzzle npuzzle 3.2c, Three+ Nested Loops, E 4 nested loops; easy 683 2.2
patuljci patuljci 3.2c, Three+ Nested Loops, E 3 nested loops; n = 9 1123 1.8
safehouses safehouses 3.2c, Three+ Nested Loops, E 4 nested loops 261 3.1
set set 3.2c, Three+ Nested Loops, E 4 nested loops; easy 364 1.8
00253 Fetching from uHunt 3.2d, Three+ Nested Loops, H try all; similar problem in UVa 11959 0.0
00296 Fetching from uHunt 3.2d, Three+ Nested Loops, H try all 10000 possible codes; 4 nested loops; use similar solution as Master-Mind game 0.0
00386 Fetching from uHunt 3.2d, Three+ Nested Loops, H 4 nested loops with pruning 0.0
10360 Fetching from uHunt 3.2d, Three+ Nested Loops, H also solvable using 1024^2 DP max sum 0.0
10365 Fetching from uHunt 3.2d, Three+ Nested Loops, H use 3 nested loops with pruning 0.0
10483 Fetching from uHunt 3.2d, Three+ Nested Loops, H 2 nested loops for a; b; derive c from a; b; there are 354 answers for range [0.01 .. 255.99]; similar to UVa 11236 0.0
10502 Fetching from uHunt 3.2d, Three+ Nested Loops, H 6 nested loops; rectangle 0.0
10660 Fetching from uHunt 3.2d, Three+ Nested Loops, H 7 nested loops; Manhattan distance 0.0
10973 Fetching from uHunt 3.2d, Three+ Nested Loops, H 3 nested loops with pruning 0.0
11108 Fetching from uHunt 3.2d, Three+ Nested Loops, H try all 2^5 = 32 values with pruning; also available at Kattis - tautology 0.0
11236 Fetching from uHunt 3.2d, Three+ Nested Loops, H 3 nested loops for a; b; c; derive d from a; b; c; check if you have 949 lines of output 0.0
11342 Fetching from uHunt 3.2d, Three+ Nested Loops, H pre-calculate squared values from 0^2 to 224^2; use 3 nested loops to generate the answers; use map to avoid duplicates 0.0
11548 Fetching from uHunt 3.2d, Three+ Nested Loops, H 4 nested loops; string; pruning 0.0
11565 Fetching from uHunt 3.2d, Three+ Nested Loops, H 3 nested loops with pruning 0.0
11804 Fetching from uHunt 3.2d, Three+ Nested Loops, H 5 nested loops 0.0
11959 Fetching from uHunt 3.2d, Three+ Nested Loops, H try all possible dice positions; compare with the 2nd one 0.0
11975 Fetching from uHunt 3.2d, Three+ Nested Loops, H 3 nested loops; simulate the game as asked 0.0
12337 Fetching from uHunt 3.2d, Three+ Nested Loops, H try all possible row x col size and test if it is beautiful 0.0
calculatingdartscores calculatingdartscores 3.2d, Three+ Nested Loops, H 6 nested loops but easy; see if a*i +b*j + c*k == n 752 2.8
goblingardenguards goblingardenguards 3.2d, Three+ Nested Loops, H 3 nested loops; use 2D Boolean array to avoid over counting 345 6.1
lektira lektira 3.2d, Three+ Nested Loops, H 2 nested loops to try all 2 cutting points plus 1 more loop to actually do the reversing of sub words 376 3.2
medals medals 3.2d, Three+ Nested Loops, H not an easy problem; require analysis to realize that the search space is small; also available at UVa 10997 - Medals 69 5.9
misa misa 3.2d, Three+ Nested Loops, H 4 nested loops; grid; check to 8 directions 502 2.2
tautology tautology 3.2d, Three+ Nested Loops, H try all 2^5 = 32 values with pruning; also available at UVa 11108 - Tautology 160 3.4
00140 Fetching from uHunt 3.2e, Iterative (Permutation) max n is just 8; use next_permutation; the algorithm inside next_permutation is iterative 0.0
00146 Fetching from uHunt 3.2e, Iterative (Permutation) use next_permutation 0.0
00234 Fetching from uHunt 3.2e, Iterative (Permutation) LA 5173 - WorldFinals Phoenix94; use next_permutation; simulation 0.0
00418 Fetching from uHunt 3.2e, Iterative (Permutation) use next_permutation to permute the 4 molecule locations and then use 12^6 six-nested-loops to check the area of the sup... 0.0
01064 Fetching from uHunt 3.2e, Iterative (Permutation) LA 3808 - WorldFinals Tokyo07; permutation of up to 5 messages; simulation; mind the word 'consecutive' 0.0
01209 Fetching from uHunt 3.2e, Iterative (Permutation) LA 3173 - Manila06; STL next and prev_permutation 0.0
10997 Fetching from uHunt 3.2e, Iterative (Permutation) not an easy problem; require analysis to realize that the search space is small; also available at Kattis - medals 0.0
11412 Fetching from uHunt 3.2e, Iterative (Permutation) next_permutation; find one possibility from 6! 0.0
11742 Fetching from uHunt 3.2e, Iterative (Permutation) try all permutations 0.0
12249 Fetching from uHunt 3.2e, Iterative (Permutation) LA 4994 - KualaLumpur10; try all permutations; a bit of string matching 0.0
classpicture classpicture 3.2e, Iterative (Permutation) try all permutation; filter forbidden pairs; fast simulation 157 6.9
dancerecital dancerecital 3.2e, Iterative (Permutation) try all R! permutations; compare adjacent routines 274 4.2
dreamer dreamer 3.2e, Iterative (Permutation) try all 8! permutations of digits; check if the date is valid; output earliest valid date 406 2.0
towering towering 3.2e, Iterative (Permutation) try all 6! permutations; get the one that works 986 2.1
veci veci 3.2e, Iterative (Permutation) try all permutations; get the one that is larger than X 1193 1.8
victorythroughsynergy victorythroughsynergy 3.2e, Iterative (Permutation) try all 10! team formations; get the one that works 60 4.3
00435 Fetching from uHunt 3.2f, Iterative (Combination) only 2^20 possible coalition combinations 0.0
00517 Fetching from uHunt 3.2f, Iterative (Combination) convert (a; b) to (0; 1) first so that we only work with integers; there can only be 2^16 possibilities although s can b... 0.0
00639 Fetching from uHunt 3.2f, Iterative (Combination) generate 2^(4x4) = 2^16 combinations and prune 0.0
01047 Fetching from uHunt 3.2f, Iterative (Combination) LA 3278 - WorldFinals Shanghai05; try all 2^n subsets of towers to be taken; use inclusion-exclusion principle 0.0
11205 Fetching from uHunt 3.2f, Iterative (Combination) try all 2^15 bitmask 0.0
11659 Fetching from uHunt 3.2f, Iterative (Combination) try all 2^20 bitmask and check 0.0
12346 Fetching from uHunt 3.2f, Iterative (Combination) LA 5723 - Phuket11; try all 2^n combinations; pick the best one 0.0
12348 Fetching from uHunt 3.2f, Iterative (Combination) LA 5725 - Phuket11; try all 2^n combinations 0.0
12406 Fetching from uHunt 3.2f, Iterative (Combination) try all 2^p possible bitmasks; change '0's to '2's 0.0
12694 Fetching from uHunt 3.2f, Iterative (Combination) LA 6606 - Phuket13; it is safest to just brute force all 2^20 possibilities; greedy solution should be possible too 0.0
13103 Fetching from uHunt 3.2f, Iterative (Combination) try all 2^k combinations; swapping a 0-bit with another 0-bit or 1-bit with another 1-bit has no effect 0.0
buildingboundaries buildingboundaries 3.2f, Iterative (Combination) try all 2^3 = 8 orientations of 3 buildings; 3 horizontal packing; 3 vertical packing; 3! = 3 of 1 building on top of 2 ... 207 3.4
doubleplusgood doubleplusgood 3.2f, Iterative (Combination) only up to 2^17 possible combinations; use to_string and stoll 228 2.8
geppetto geppetto 3.2f, Iterative (Combination) try all 2^N subsets of ingredients 305 3.3
perket perket 3.2f, Iterative (Combination) try all 2^N subsets of ingredients 511 2.2
squaredeal squaredeal 3.2f, Iterative (Combination) try all 3! permutations of rectangles and try all 2^3 combinations of rectangle orientations; test figure 1.a and 1.b co... 232 4.6
zagrade zagrade 3.2f, Iterative (Combination) try all subsets of bracket pairs to be removed 298 3.1
00102 Fetching from uHunt 3.2g, Try All Answers try all 6 combinations of possible answers 0.0
00188 Fetching from uHunt 3.2g, Try All Answers 3 nested loops; keep trying until an answer is found 0.0
00471 Fetching from uHunt 3.2g, Try All Answers somewhat similar to UVa 00725 0.0
00725 Fetching from uHunt 3.2g, Try All Answers try all possible answers 0.0
10908 Fetching from uHunt 3.2g, Try All Answers 4 nested loops; try all possible odd square lengths 0.0
communication communication 3.2g, Try All Answers try all possible bytes; apply the bitmask formula 764 2.0
cookingwater cookingwater 3.2g, Try All Answers try all possible answers 446 2.0
flexible flexible 3.2g, Try All Answers try all possible answers 2354 1.7
heirsdilemma heirsdilemma 3.2g, Try All Answers try all possible answers; small range; avoid division by zero (this digit is not used) 821 1.6
islands islands 3.2g, Try All Answers try all possible subsets; prune the non-contiguous ones (only 55 valid bitmasks between [0..1023]); check the 'island' p... 443 2.6
owlandfox owlandfox 3.2g, Try All Answers try all answers; complete search 743 1.8
parking2 parking2 3.2g, Try All Answers try all possible parking spaces; pick the best 2049 1.4
prinova prinova 3.2g, Try All Answers sort first, then try all possible answers, which are the values in betweens two even boy 'names' and values around A, A+... 96 4.2
savingforretirement savingforretirement 3.2g, Try All Answers try all possible answers; small constraint 1248 1.7
walls walls 3.2g, Try All Answers try whether the answer is 1/2/3/4; or Impossible; use up to 4 nested loops 513 4.0
00100 Fetching from uHunt 3.2h, Math Simulation, Easier simply do as asked; the only trap is that j can be < i 0.0
00371 Fetching from uHunt 3.2h, Math Simulation, Easier similar to UVa 100 0.0
00382 Fetching from uHunt 3.2h, Math Simulation, Easier do trial division 0.0
00654 Fetching from uHunt 3.2h, Math Simulation, Easier just use brute force 0.0
00906 Fetching from uHunt 3.2h, Math Simulation, Easier compute c from d = 1 until a/b < c/d 0.0
01225 Fetching from uHunt 3.2h, Math Simulation, Easier LA 3996 - Danang07; N is small 0.0
01583 Fetching from uHunt 3.2h, Math Simulation, Easier N is small; prepare an array of size 100044; that is the largest possible digit sum for this problem 0.0
10346 Fetching from uHunt 3.2h, Math Simulation, Easier interesting simulation problem 0.0
10370 Fetching from uHunt 3.2h, Math Simulation, Easier compute average; see how many are above it; also available at Kattis - aboveaverage 0.0
10783 Fetching from uHunt 3.2h, Math Simulation, Easier input range is very small; just brute force it 0.0
10879 Fetching from uHunt 3.2h, Math Simulation, Easier just use brute force 0.0
11001 Fetching from uHunt 3.2h, Math Simulation, Easier brute force math; maximize function 0.0
11150 Fetching from uHunt 3.2h, Math Simulation, Easier similar to UVa 10346; be careful with boundary cases! 0.0
11247 Fetching from uHunt 3.2h, Math Simulation, Easier brute force around the answer to be safe 0.0
11313 Fetching from uHunt 3.2h, Math Simulation, Easier similar to UVa 10346 0.0
11689 Fetching from uHunt 3.2h, Math Simulation, Easier similar to UVa 10346; also available at Kattis - sodasurpler 0.0
11877 Fetching from uHunt 3.2h, Math Simulation, Easier similar to UVa 10346 0.0
11934 Fetching from uHunt 3.2h, Math Simulation, Easier just do plain brute-force 0.0
12527 Fetching from uHunt 3.2h, Math Simulation, Easier try all; check repeated digits 0.0
12938 Fetching from uHunt 3.2h, Math Simulation, Easier complete search; 4 digits; square numbers 0.0
13059 Fetching from uHunt 3.2h, Math Simulation, Easier just simulate the counting; it will only runs in logarithmic steps; use long long 0.0
13131 Fetching from uHunt 3.2h, Math Simulation, Easier brute force version of modified sumDiv(N) function 0.0
aboveaverage aboveaverage 3.2h, Math Simulation, Easier compute average; see how many are above it; also available at UVa 10370 - Above Average 3190 2.0
damagedequation damagedequation 3.2h, Math Simulation, Easier try all 4*4 = 16 possibilities and test them 62 2.1
dicecup dicecup 3.2h, Math Simulation, Easier complete search; use map - order needed; pick the sum with the max frequency 5454 1.2
easiest easiest 3.2h, Math Simulation, Easier complete search; sum of digit 3991 1.6
growlinggears growlinggears 3.2h, Math Simulation, Easier physics of parabola; derivation; try all gears 496 2.4
harshadnumbers harshadnumbers 3.2h, Math Simulation, Easier sum of digits; brute force 1715 1.4
powersof2easy powersof2easy 3.2h, Math Simulation, Easier try all integers in [0..n]; convert to string; search for 2^e as substring 13 3.5
socialrunning socialrunning 3.2h, Math Simulation, Easier try all possible starting runner; first and last runners will run alone at first and last segment, respectively 138 1.8
sodaslurper sodaslurper 3.2h, Math Simulation, Easier similar to UVa 10346; also available at UVa 11689 - Soda Surpler 1920 1.6
somesum somesum 3.2h, Math Simulation, Easier use complete search to get the answer 575 1.8
sumoftheothers sumoftheothers 3.2h, Math Simulation, Easier parsing; try each number as the sum; sum the rest 1261 1.9
tri tri 3.2h, Math Simulation, Easier brute force all possibilities 3924 1.6
trollhunt trollhunt 3.2h, Math Simulation, Easier brute force; simple 976 2.6
videospeedup videospeedup 3.2h, Math Simulation, Easier brute force; simple for loop; do as asked 298 2.0
zamka zamka 3.2h, Math Simulation, Easier Sum of Digit problem; brute force is sufficient 5255 1.4
00493 Fetching from uHunt 3.2i, Math Simulation, Harder simulate the spiral process 0.0
00550 Fetching from uHunt 3.2i, Math Simulation, Harder rotamult property; try one by one starting from 1 digit 0.0
00616 Fetching from uHunt 3.2i, Math Simulation, Harder brute force up to sqrt(n); get pattern 0.0
00697 Fetching from uHunt 3.2i, Math Simulation, Harder output formatting and basic Physics 0.0
00846 Fetching from uHunt 3.2i, Math Simulation, Harder uses the sum of arithmetic progression formula 0.0
10025 Fetching from uHunt 3.2i, Math Simulation, Harder simplify the formula first; iterative 0.0
10035 Fetching from uHunt 3.2i, Math Simulation, Harder count the number of carry operations 0.0
11130 Fetching from uHunt 3.2i, Math Simulation, Harder mirror the billiard table to the right (and/or top) so that we will only deal with one straight line instead of bouncing... 0.0
11254 Fetching from uHunt 3.2i, Math Simulation, Harder use sum of AP; brute force all values of r from sqrt(2n) down to 1; stop at the first valid a 0.0
11490 Fetching from uHunt 3.2i, Math Simulation, Harder let missing_people = 2*a^2; thickness_of_soldiers = b; derive a formula involving a; b; and the given S 0.0
11968 Fetching from uHunt 3.2i, Math Simulation, Harder average; fabs; if ties; choose the smaller one! 0.0
12169 Fetching from uHunt 3.2i, Math Simulation, Harder brute force constants a and b between [0..10 000] and do O(n) checks; break early as soon as a solution is found; also... 0.0
12290 Fetching from uHunt 3.2i, Math Simulation, Harder no -1 in the answer 0.0
12665 Fetching from uHunt 3.2i, Math Simulation, Harder be careful with boundary conditions 0.0
12792 Fetching from uHunt 3.2i, Math Simulation, Harder simulate the process to get the answer 0.0
12895 Fetching from uHunt 3.2i, Math Simulation, Harder verbatim brute force check 0.0
crackingrsa crackingrsa 3.2i, Math Simulation, Harder a bit number theory; solvable with complete search 258 2.3
disgruntledjudge disgruntledjudge 3.2i, Math Simulation, Harder brute force constants a and b between [0..10 000] and do O(n) checks; break early as soon as a solution is found; also... 76 3.3
falling falling 3.2i, Math Simulation, Harder rework the formula; complete search up to sqrt(D) 588 3.1
houselawn houselawn 3.2i, Math Simulation, Harder just do ask asked; use long long 313 3.4
lipschitzconstant lipschitzconstant 3.2i, Math Simulation, Harder sort; brute force; math observation 253 4.6
milestones milestones 3.2i, Math Simulation, Harder brute force all possibilities, use floating point fraction as both numerator and denominator are very high 137 2.8
repeatingdecimal repeatingdecimal 3.2i, Math Simulation, Harder simulate the process until we have printed c digits; append trailing zeroes if necessary 397 3.6
robotopia robotopia 3.2i, Math Simulation, Harder 2 linear equations; 2 unknowns; small range 582 6.2
thanosthehero thanosthehero 3.2i, Math Simulation, Harder for-loop from backwards 320 3.9
00130 Fetching from uHunt 3.2j, Josephus Problem the original Josephus problem 0.0
00133 Fetching from uHunt 3.2j, Josephus Problem brute force; similar to UVa 130 0.0
00151 Fetching from uHunt 3.2j, Josephus Problem the original Josephus problem 0.0
00305 Fetching from uHunt 3.2j, Josephus Problem the answer can be precalculated 0.0
00402 Fetching from uHunt 3.2j, Josephus Problem modified Josephus; simulation 0.0
00440 Fetching from uHunt 3.2j, Josephus Problem brute force; similar to UVa 151 0.0
01176 Fetching from uHunt 3.2j, Josephus Problem LA 2346 - Dhaka01; special case when k = 2; use Josephus recurrence; simulation 0.0
10015 Fetching from uHunt 3.2j, Josephus Problem modified Josephus; dynamic k; variant of UVa 305 0.0
10771 Fetching from uHunt 3.2j, Josephus Problem brute force; input size is small 0.0
10774 Fetching from uHunt 3.2j, Josephus Problem repeated special case of Josephus when k = 2 0.0
11351 Fetching from uHunt 3.2j, Josephus Problem use general case Josephus recurrence 0.0
coconut coconut 3.2j, Josephus Problem maintain a circular linked list of hand symbols; variant of Josephus problem; other solution exists 636 1.6
eenymeeny eenymeeny 3.2j, Josephus Problem Josephus problem; small n; just simulate 492 1.7
musicalchairs musicalchairs 3.2j, Josephus Problem Josephus variant; brute force 139 4.0
toys toys 3.2j, Josephus Problem use general case Josephus recurrence 142 4.5
00380 Fetching from uHunt 3.2k, Backtracking (Easier) simple backtracking; but we have to work with strings 0.0
00487 Fetching from uHunt 3.2k, Backtracking (Easier) use map to store the generated words 0.0
00524 Fetching from uHunt 3.2k, Backtracking (Easier) involving prime number 0.0
00529 Fetching from uHunt 3.2k, Backtracking (Easier) use backtracking to get the solution 0.0
00571 Fetching from uHunt 3.2k, Backtracking (Easier) solution can be suboptimal; add flag to avoid cycling 0.0
00598 Fetching from uHunt 3.2k, Backtracking (Easier) print all solutions with backtracking 0.0
00628 Fetching from uHunt 3.2k, Backtracking (Easier) backtracking; follow the rules in description 0.0
00677 Fetching from uHunt 3.2k, Backtracking (Easier) print all solutions with backtracking 0.0
00729 Fetching from uHunt 3.2k, Backtracking (Easier) generate all possible bit strings 0.0
00868 Fetching from uHunt 3.2k, Backtracking (Easier) backtracking from row 1 to N; 4 choices per step; some constraints 0.0
10344 Fetching from uHunt 3.2k, Backtracking (Easier) 5 operands + 3 operators 0.0
10452 Fetching from uHunt 3.2k, Backtracking (Easier) at each pos; Indy can go forth/left/right; try all 0.0
10503 Fetching from uHunt 3.2k, Backtracking (Easier) max 13 spaces only 0.0
10576 Fetching from uHunt 3.2k, Backtracking (Easier) generate all; prune; take max 0.0
10624 Fetching from uHunt 3.2k, Backtracking (Easier) backtracking with divisibility check 0.0
10776 Fetching from uHunt 3.2k, Backtracking (Easier) recursive backtracking 0.0
10950 Fetching from uHunt 3.2k, Backtracking (Easier) sort the input; run backtracking; the output should be sorted; only display the first 100 sorted output 0.0
11201 Fetching from uHunt 3.2k, Backtracking (Easier) backtracking involving strings 0.0
11961 Fetching from uHunt 3.2k, Backtracking (Easier) up to 4^10 possible DNA strings; mutation power is at most K ≤ 5 so the search space is much smaller; sort the output... 0.0
12840 Fetching from uHunt 3.2k, Backtracking (Easier) simple backtracking 0.0
goodmorning goodmorning 3.2k, Backtracking (Easier) we can use backtracking to generate all possible (small) numbers that can be pressed according to the constraints 347 2.7
gradecurving gradecurving 3.2k, Backtracking (Easier) try all possible answers; function grows fast to 100 170 4.5
natjecanje natjecanje 3.2k, Backtracking (Easier) 4 options for each team with kayak: do nothing, pass to left (if damaged), keep to self (if damaged), pass to right (if ... 701 2.5
paintings paintings 3.2k, Backtracking (Easier) try all possible paintings based on Catherine's preference; skip hideous color pairs 162 3.6
00129 Fetching from uHunt 3.2l, Backtracking (Harder) backtracking; string processing check; a bit of output formatting 0.0
00208 Fetching from uHunt 3.2l, Backtracking (Harder) LA 5147 - WorldFinals SanAntonio91; backtracking with some pruning 0.0
00222 Fetching from uHunt 3.2l, Backtracking (Harder) LA 5161 - WorldFinals Indianapolis93; cannot use DP 'tank' is floating-point; use backtracking 0.0
00301 Fetching from uHunt 3.2l, Backtracking (Harder) 2^22 with pruning is possible 0.0
00307 Fetching from uHunt 3.2l, Backtracking (Harder) sort the sticks in descending length; group similar lengths; brute force the number of sticks; backtracking to check fea... 0.0
00331 Fetching from uHunt 3.2l, Backtracking (Harder) n <= 5... 0.0
00416 Fetching from uHunt 3.2l, Backtracking (Harder) backtrack; try all 0.0
00433 Fetching from uHunt 3.2l, Backtracking (Harder) similar to UVa 416 0.0
00565 Fetching from uHunt 3.2l, Backtracking (Harder) backtracking with lots of pruning 0.0
01262 Fetching from uHunt 3.2l, Backtracking (Harder) LA 4845 - Daejeon10; sort grid columns; process common passwords in lexicographic order; skip two similar passwords 0.0
10001 Fetching from uHunt 3.2l, Backtracking (Harder) the upperbound of 2^32 is scary but with efficient pruning; we can pass the time limit as the test case is not extreme 0.0
10063 Fetching from uHunt 3.2l, Backtracking (Harder) do as asked 0.0
10094 Fetching from uHunt 3.2l, Backtracking (Harder) this problem is like the n-queens chess problem; but must find/use the pattern! 0.0
10460 Fetching from uHunt 3.2l, Backtracking (Harder) similar nature with UVa 10063 0.0
10475 Fetching from uHunt 3.2l, Backtracking (Harder) generate and prune; try all 0.0
10582 Fetching from uHunt 3.2l, Backtracking (Harder) simplify complex input first; then backtrack 0.0
11052 Fetching from uHunt 3.2l, Backtracking (Harder) the worst case time complexity of 2^1000 looks scary but the search space is apparently not that big 0.0
11753 Fetching from uHunt 3.2l, Backtracking (Harder) the state is probably too big if we use DP; but we can pass the time limit with just backtracking 0.0
carvet carvet 3.2l, Backtracking (Harder) backtrack; similar to Kattis - solitaire; checkers jumping style 120 3.9
dobra dobra 3.2l, Backtracking (Harder) try all possible 3^n changes of '_' (to a vowel, an 'L', or other consonant not 'L'); prune invalid states; count valid ... 44 3.9
fruitbaskets fruitbaskets 3.2l, Backtracking (Harder) interesting backtracking problem; compute the small numbers < 200; output all minus this value computed via backtrack... 493 4.1
pagelayout pagelayout 3.2l, Backtracking (Harder) a bit of geometry; O(2^n imes n^2 iterative bitmask will TLE; need to use recursive backtracking with pruning 84 5.1
primes primes 3.2l, Backtracking (Harder) backtrack; s: (id; num); prune if num exceeds Y; t: keeps this prime P[id] or try next prime factor; count num that is b... 165 5.8
solitaire solitaire 3.2l, Backtracking (Harder) backtrack; similar to Kattis - crackerbarrel and Kattis - peggamefortwo; but on simpler grid graph and there is no need ... 169 3.4
00679 Fetching from uHunt 3.3a, Binary Search binary search; bit manipulation solutions exist 0.0
00957 Fetching from uHunt 3.3a, Binary Search complete search binary search: upper_bound 0.0
10057 Fetching from uHunt 3.3a, Binary Search involves the median; use STL sort; upper_bound; lower_bound and some checks 0.0
10077 Fetching from uHunt 3.3a, Binary Search binary search 0.0
10474 Fetching from uHunt 3.3a, Binary Search simple: use sort and then lower_bound 0.0
10567 Fetching from uHunt 3.3a, Binary Search store inc indices of each char of S in 52 vectors; binary search for the position of the char in the correct vector 0.0
10611 Fetching from uHunt 3.3a, Binary Search binary search 0.0
10706 Fetching from uHunt 3.3a, Binary Search binary search some mathematical insights 0.0
10742 Fetching from uHunt 3.3a, Binary Search use sieve; binary search 0.0
11057 Fetching from uHunt 3.3a, Binary Search sort; target pair problem 0.0
11621 Fetching from uHunt 3.3a, Binary Search generate numbers with factor 2 and/or 3; sort; upper_bound 0.0
11876 Fetching from uHunt 3.3a, Binary Search [lower|upper]_bound on sorted sequence N 0.0
12192 Fetching from uHunt 3.3a, Binary Search input array is specially sorted; lower_bound 0.0
12965 Fetching from uHunt 3.3a, Binary Search sort producer/consumer prices; the answer is one of the prices mentioned; use binary searches to count the answer 0.0
firefly firefly 3.3a, Binary Search sort stalactites vs stalagmites separately; brute force height; binary search the obstacles hit 323 4.0
outofsorts outofsorts 3.3a, Binary Search do O(log n) binary searches on unsorted array n times 107 3.7
roompainting roompainting 3.3a, Binary Search sort the cans at shop (can be used more than once); use lower_bound for what Joe needs at shop 416 3.8
synchronizinglists synchronizinglists 3.3a, Binary Search sort and lower_bound 2130 1.5
01753 Fetching from uHunt 3.3b, Bisection and BSTA, E LA 8043 - WorldFinals RapidCity17; BSTA + Physics; also available at Kattis - speed 0.0
10341 Fetching from uHunt 3.3b, Bisection and BSTA, E bisection method; for alternative solutions; see http://www.algorithmist.com/index.php/UVa_10341 0.0
11413 Fetching from uHunt 3.3b, Bisection and BSTA, E BSTA + simulation 0.0
11627 Fetching from uHunt 3.3b, Bisection and BSTA, E binary search the answer + Physics simulation; also available at Kattis - slalom2 0.0
11881 Fetching from uHunt 3.3b, Bisection and BSTA, E bisection method 0.0
11935 Fetching from uHunt 3.3b, Bisection and BSTA, E BSTA + simulation 0.0
12032 Fetching from uHunt 3.3b, Bisection and BSTA, E BSTA + simulation 0.0
12190 Fetching from uHunt 3.3b, Bisection and BSTA, E BSTA + algebra 0.0
12791 Fetching from uHunt 3.3b, Bisection and BSTA, E BSTA + math formula to check if the leader pilot can overtake the backmarker pilot at that lap 0.0
13142 Fetching from uHunt 3.3b, Bisection and BSTA, E BSTA + Physics simulation 0.0
carefulascent carefulascent 3.3b, Bisection and BSTA, E BSTA + Physics simulation 558 1.8
financialplanning financialplanning 3.3b, Bisection and BSTA, E BSTA + observation 108 3.5
freeweights freeweights 3.3b, Bisection and BSTA, E BSTA + simulation; Mathematical observation 356 4.5
hindex hindex 3.3b, Bisection and BSTA, E BSTA + another binary search 460 3.3
htoo htoo 3.3b, Bisection and BSTA, E BSTA + simulation; use DAT 200 2.4
monk monk 3.3b, Bisection and BSTA, E BSTA + simulation; cool 86 3.3
slalom2 slalom2 3.3b, Bisection and BSTA, E BSTA + Physics simulation; also available at UVa 11627 - Slalom 43 5.4
smallschedule smallschedule 3.3b, Bisection and BSTA, E BSTA + greedy or math 302 3.1
speed speed 3.3b, Bisection and BSTA, E LA 8043 - WorldFinals RapidCity17; BSTA + Physics; also available at UVa 01753 - Need for Speed 955 3.2
suspensionbridges suspensionbridges 3.3b, Bisection and BSTA, E BSTA + Maths; be careful of precision error 409 4.6
svada svada 3.3b, Bisection and BSTA, E BSTA + simulation; process the two types of monkeys separately 144 3.5
00183 Fetching from uHunt 3.3c, Ternary Search & Others simple exercise of DnC 0.0
00608 Fetching from uHunt 3.3c, Ternary Search & Others classical problem; after each weighing; we can halve the search space 0.0
01738 Fetching from uHunt 3.3c, Ternary Search & Others LA 7578 - WorldFinals Phuket16; BST insertion then tree equality check; also available at Kattis - ceiling 0.0
10385 Fetching from uHunt 3.3c, Ternary Search & Others the function is unimodal; ternary search 0.0
11147 Fetching from uHunt 3.3c, Ternary Search & Others implement the given recursive DnC 0.0
11701 Fetching from uHunt 3.3c, Ternary Search & Others a kind of ternary search 0.0
12893 Fetching from uHunt 3.3c, Ternary Search & Others convert the given code into recursive DnC 0.0
a1paper a1paper 3.3c, Ternary Search & Others division of A1 paper is a kind of DnC principle 1212 3.9
cantor cantor 3.3c, Ternary Search & Others ternary search; also available at UVa 11701 - Cantor 255 2.7
ceiling ceiling 3.3c, Ternary Search & Others LA 7578 - WorldFinals Phuket16; BST insertion then tree equality check; also available at UVa 01738 - Ceiling Function 1871 1.9
euclideantsp euclideantsp 3.3c, Ternary Search & Others that complex formula described in problem description is unimodal; c ranges from ≥ 0.1 to ≤ 500.0; ternary search;... 288 2.3
goingtoseed goingtoseed 3.3c, Ternary Search & Others divide to search into four regions; extension of binary/ternary search concept 78 4.5
jewelrybox jewelrybox 3.3c, Ternary Search & Others the objective function is unimodal; ternary search 775 1.6
qanat qanat 3.3c, Ternary Search & Others the low rating is misleading; this is a difficult math problem that requires (two) ternary searches; other solution exis... 173 2.2
reconnaissance reconnaissance 3.3c, Ternary Search & Others the objective function is unimodal; ternary search 101 3.8
sretan sretan 3.3c, Ternary Search & Others the pattern is like Gray code; find the pattern via Divide and Conquer 110 4.1
sylvester sylvester 3.3c, Ternary Search & Others 2D grid; DnC into 4 regions; count how many times that cell is part of the fourth quadrant 359 2.2
tricktreat tricktreat 3.3c, Ternary Search & Others ternary search; the function is unimodal 156 3.9
zipline zipline 3.3c, Ternary Search & Others min = straight line distance; max = use ternary search 555 3.5
00410 Fetching from uHunt 3.4a, Greedy (Classical) load balancing 0.0
01193 Fetching from uHunt 3.4a, Greedy (Classical) LA 2519 - Beijing02; interval covering 0.0
10020 Fetching from uHunt 3.4a, Greedy (Classical) interval covering 0.0
10249 Fetching from uHunt 3.4a, Greedy (Classical) greedy; sorting 0.0
10382 Fetching from uHunt 3.4a, Greedy (Classical) interval covering; also available at Kattis - grass 0.0
11264 Fetching from uHunt 3.4a, Greedy (Classical) coin change variant 0.0
11292 Fetching from uHunt 3.4a, Greedy (Classical) sort; greedy matching; also available at Kattis - loowater 0.0
11389 Fetching from uHunt 3.4a, Greedy (Classical) load balancing 0.0
12210 Fetching from uHunt 3.4a, Greedy (Classical) greedy; sorting 0.0
12321 Fetching from uHunt 3.4a, Greedy (Classical) interval covering 0.0
12405 Fetching from uHunt 3.4a, Greedy (Classical) simpler interval covering problem 0.0
avoidland avoidland 3.4a, Greedy (Classical) observe that number of rows with 0 pawn and rows with > 1 pawns should be the same; greedy bipartite matching 256 3.4
classrooms classrooms 3.4a, Greedy (Classical) variant of interval covering; multiple rooms 229 5.9
color color 3.4a, Greedy (Classical) sort the sock colors and greedily assign them to washing machines 980 2.2
distributingseats distributingseats 3.4a, Greedy (Classical) sort; greedy bipartite matching; assign passenger to earliest available row first 60 5.8
fishmongers fishmongers 3.4a, Greedy (Classical) sort; greedy bipartite matching 160 3.6
froshweek2 froshweek2 3.4a, Greedy (Classical) greedy; sort first; similar to Dragon of Loowater; greedy matching 489 2.3
grass grass 3.4a, Greedy (Classical) interval covering; also available at UVa 10382 - Watering Grass 330 5.3
inflation inflation 3.4a, Greedy (Classical) sort; greedy matching 711 1.8
intervalcover intervalcover 3.4a, Greedy (Classical) classic interval covering; be very careful with floating point errors 268 5.6
loowater loowater 3.4a, Greedy (Classical) sort; greedy matching; also available at UVa 11292 - The Dragon of Loowater 710 3.0
messages messages 3.4a, Greedy (Classical) simple string matching; sort; like greedy interval covering 134 5.2
squarepegs squarepegs 3.4a, Greedy (Classical) convert square to circular; sort; greedy matching 265 3.1
10763 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
10785 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
11269 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
11369 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
11729 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
11900 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
12485 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
13031 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
13109 Fetching from uHunt 3.4b, Involving Sorting, E greedy; sorting 0.0
acm2 acm2 3.4b, Involving Sorting, E greedy; sorting 790 2.6
akcija akcija 3.4b, Involving Sorting, E greedy; sorting 2658 2.0
aprizenoonecanwin aprizenoonecanwin 3.4b, Involving Sorting, E greedy; sorting 790 2.5
fallingapart fallingapart 3.4b, Involving Sorting, E greedy; sorting 1011 1.6
fridge fridge 3.4b, Involving Sorting, E greedy; sorting 429 3.1
gettowork gettowork 3.4b, Involving Sorting, E greedy; sorting 255 2.2
help help 3.4b, Involving Sorting, E greedy; sorting 60 7.5
hotsprings hotsprings 3.4b, Involving Sorting, E greedy; sorting 86 1.9
icpcteamselection icpcteamselection 3.4b, Involving Sorting, E greedy; sorting 586 3.0
minimumscalar minimumscalar 3.4b, Involving Sorting, E greedy; sorting 1202 2.3
pikemaneasy pikemaneasy 3.4b, Involving Sorting, E greedy; sorting 473 3.5
planetaris planetaris 3.4b, Involving Sorting, E greedy; sorting 143 2.8
plantingtrees plantingtrees 3.4b, Involving Sorting, E greedy; sorting 3462 2.0
redistribution redistribution 3.4b, Involving Sorting, E greedy; sorting 537 2.0
shopaholic shopaholic 3.4b, Involving Sorting, E greedy; sorting 959 2.4
standings standings 3.4b, Involving Sorting, E greedy; sorting 329 4.1
textmessaging textmessaging 3.4b, Involving Sorting, E greedy; sorting 222 2.9
woodcutting woodcutting 3.4b, Involving Sorting, E greedy; sorting 572 3.1
10026 Fetching from uHunt 3.4c, Involving Sorting, H greedy; sorting 0.0
10037 Fetching from uHunt 3.4c, Involving Sorting, H greedy; sorting 0.0
11100 Fetching from uHunt 3.4c, Involving Sorting, H greedy; sorting; also available at Kattis - trip2007 0.0
11103 Fetching from uHunt 3.4c, Involving Sorting, H greedy; sorting; also available at Kattis - wffnproof 0.0
12673 Fetching from uHunt 3.4c, Involving Sorting, H LA 6530 - LatinAmerica13; greedy; sorting 0.0
12834 Fetching from uHunt 3.4c, Involving Sorting, H greedy; sorting 0.0
13054 Fetching from uHunt 3.4c, Involving Sorting, H greedy; sorting 0.0
airconditioned airconditioned 3.4c, Involving Sorting, H greedy; sorting 1116 3.9
andrewant andrewant 3.4c, Involving Sorting, H greedy; sorting 97 4.9
birds birds 3.4c, Involving Sorting, H greedy; sorting 566 3.5
ceremony ceremony 3.4c, Involving Sorting, H greedy; sorting 849 4.3
dasort dasort 3.4c, Involving Sorting, H greedy; sorting 284 2.9
delivery delivery 3.4c, Involving Sorting, H greedy; sorting 253 3.3
fairdivision fairdivision 3.4c, Involving Sorting, H greedy; sorting 74 4.4
intergalacticbidding intergalacticbidding 3.4c, Involving Sorting, H greedy; sorting 346 3.4
keepitcool keepitcool 3.4c, Involving Sorting, H greedy; sorting 290 2.4
trip2007 trip2007 3.4c, Involving Sorting, H greedy; sorting; also available at UVa 11100 - The Trip, 2007 191 2.8
wffnproof wffnproof 3.4c, Involving Sorting, H greedy; sorting; also available at UVa 11103 - WFF'N Proof 117 2.9
01153 Fetching from uHunt 3.4d, Involving PQ greedy; priority queue 0.0
10954 Fetching from uHunt 3.4d, Involving PQ greedy; priority queue 0.0
12390 Fetching from uHunt 3.4d, Involving PQ greedy; priority queue 0.0
13177 Fetching from uHunt 3.4d, Involving PQ greedy; priority queue 0.0
ballotboxes ballotboxes 3.4d, Involving PQ greedy; priority queue 776 4.4
canvas canvas 3.4d, Involving PQ greedy; priority queue 214 3.5
entertainmentbox entertainmentbox 3.4d, Involving PQ sort; greedy simulation; Priority Queue with update key (we can use multiset) 274 6.0
vegetables vegetables 3.4d, Involving PQ greedy; priority queue 347 3.4
workstations workstations 3.4d, Involving PQ greedy; priority queue 1110 3.6
10152 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
10340 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
10440 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
10602 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
10656 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
10672 Fetching from uHunt 3.4e, Non Classical, Easier greedy; also available at Kattis - marblestree 0.0
10700 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
10714 Fetching from uHunt 3.4e, Non Classical, Easier greedy; also available at Kattis - ants 0.0
11054 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
11520 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
11532 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
12482 Fetching from uHunt 3.4e, Non Classical, Easier greedy 0.0
ants ants 3.4e, Non Classical, Easier greedy; also available at UVa 10714 - Ants 1145 2.5
applesack applesack 3.4e, Non Classical, Easier greedy 202 3.5
bank bank 3.4e, Non Classical, Easier greedy 2389 2.6
driver driver 3.4e, Non Classical, Easier greedy 198 3.8
horrorfilmnight horrorfilmnight 3.4e, Non Classical, Easier greedy 207 3.4
marblestree marblestree 3.4e, Non Classical, Easier greedy; also available at UVa 10672 - Marbles on a tree 258 3.0
pripreme pripreme 3.4e, Non Classical, Easier greedy 259 2.7
simplicity simplicity 3.4e, Non Classical, Easier greedy 694 2.5
skocimis skocimis 3.4e, Non Classical, Easier greedy 2156 1.6
teacherevaluation teacherevaluation 3.4e, Non Classical, Easier greedy 262 3.0
00311 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
00668 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
10718 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
10821 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
10982 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11157 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11230 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11240 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11330 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11335 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11491 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11567 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11583 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
11890 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
12124 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
12516 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
13082 Fetching from uHunt 3.4f, Non Classical, Harder greedy 0.0
cardtrading cardtrading 3.4f, Non Classical, Harder greedy 38 5.0
dvds dvds 3.4f, Non Classical, Harder greedy 731 2.9
logland logland 3.4f, Non Classical, Harder greedy 47 5.8
playground playground 3.4f, Non Classical, Harder greedy 60 4.7
stockbroker stockbroker 3.4f, Non Classical, Harder greedy 578 3.4
virus virus 3.4f, Non Classical, Harder greedy 753 3.6
00108 Fetching from uHunt 3.5a, Max 1D/2D Range Sum max 2D range sum 0.0
00507 Fetching from uHunt 3.5a, Max 1D/2D Range Sum standard problem 0.0
00787 Fetching from uHunt 3.5a, Max 1D/2D Range Sum max 1D range product; be careful with 0; use Java BigInteger 0.0
00836 Fetching from uHunt 3.5a, Max 1D/2D Range Sum convert '0' to -INF 0.0
00983 Fetching from uHunt 3.5a, Max 1D/2D Range Sum max 2D range sum; get submatrix 0.0
01105 Fetching from uHunt 3.5a, Max 1D/2D Range Sum LA 5132 - WorldFinals Orlando11; more advanced 2D Range Sum Queries 0.0
10074 Fetching from uHunt 3.5a, Max 1D/2D Range Sum standard problem 0.0
10667 Fetching from uHunt 3.5a, Max 1D/2D Range Sum standard problem 0.0
10684 Fetching from uHunt 3.5a, Max 1D/2D Range Sum standard; Kadane's algorithm 0.0
10755 Fetching from uHunt 3.5a, Max 1D/2D Range Sum max 2D range sum in 2 of the 3 dimensions; max 1D range sum with Kadane's algorithm on the 3rd dimension 0.0
10827 Fetching from uHunt 3.5a, Max 1D/2D Range Sum copy n*n matrix into n*2n matrix; then this problem becomes a standard max 2D range sum problem again 0.0
11951 Fetching from uHunt 3.5a, Max 1D/2D Range Sum use long long; max 2D range sum; prune the search space whenever possible 0.0
12640 Fetching from uHunt 3.5a, Max 1D/2D Range Sum standard; Kadane's algorithm 0.0
13095 Fetching from uHunt 3.5a, Max 1D/2D Range Sum create 10 range sum queries; you don't need Fenwick Tree actually 0.0
alicedigital alicedigital 3.5a, Max 1D/2D Range Sum max 1D range sum variant; the solution is not DP; notice that m is small 687 4.2
commercials commercials 3.5a, Max 1D/2D Range Sum transform each input by -P; Kadane's algorithm 1570 2.0
fieldtrip fieldtrip 3.5a, Max 1D/2D Range Sum necessary condition: s (sum of class section sizes) must be divisible by 3; use DP 1D range sum to do select(s/3) and se... 32 3.0
foldedmap foldedmap 3.5a, Max 1D/2D Range Sum 2D range sum; brute force the position of starting tile 49 4.6
nered nered 3.5a, Max 1D/2D Range Sum 2D range sum; brute force possible rectangular submatrix and keep the one with minimum modification 41 3.2
prozor prozor 3.5a, Max 1D/2D Range Sum 2D range sum with fix range; output formatting 558 1.6
purplerain purplerain 3.5a, Max 1D/2D Range Sum max 1D range sum variant; Kadane's algorithm 288 4.3
sellingspatulas sellingspatulas 3.5a, Max 1D/2D Range Sum -8 per time slot initially; read sale data; 1D range sum; complete search 109 8.0
shortsell shortsell 3.5a, Max 1D/2D Range Sum similar to Kadane's algorithm; linear pass; prefix sum 104 4.1
00111 Fetching from uHunt 3.5b, LIS be careful of the ranking system 0.0
00231 Fetching from uHunt 3.5b, LIS straightforward 0.0
00437 Fetching from uHunt 3.5b, LIS can be modeled as LIS 0.0
00481 Fetching from uHunt 3.5b, LIS O(n log k) LIS+solution 0.0
00497 Fetching from uHunt 3.5b, LIS solution must be printed 0.0
01196 Fetching from uHunt 3.5b, LIS LA 2815 - Kaohsiung03; sort all the blocks in increasing L[i]; then we get the classical LIS problem 0.0
10131 Fetching from uHunt 3.5b, LIS sort elephants based on decreasing IQ; LIS on increasing weight 0.0
10154 Fetching from uHunt 3.5b, LIS LIS variant 0.0
10534 Fetching from uHunt 3.5b, LIS must use O(n log k) LIS twice 0.0
11368 Fetching from uHunt 3.5b, LIS sort in one dimension; Dilworth's theorem; LIS in the other; also available at Kattis - nesteddolls 0.0
11456 Fetching from uHunt 3.5b, LIS max(LIS(i)+LDS(i)-1), ∀i ∈ [0...n-1]; also available at Kattis - trainsorting 0.0
11790 Fetching from uHunt 3.5b, LIS combination of LIS LDS; weighted 0.0
alphabet alphabet 3.5b, LIS find LIS of a short string; the answer is 26-LIS_length 666 3.2
increasingsubsequence increasingsubsequence 3.5b, LIS LIS; n ≤ 200$; print lexicographically smallest solution, 99% similar to 'longincsubseq' 352 4.1
longincsubseq longincsubseq 3.5b, LIS standard O(n log k) LIS; print any solution 579 5.7
manhattanmornings manhattanmornings 3.5b, LIS utilize symmetries to simplify the problem; then run LIS variant in O(N log K) 154 4.7
nesteddolls nesteddolls 3.5b, LIS sort in one dimension; Dilworth's theorem; LIS in the other; also available at UVa 11368 - Nested Dolls 115 7.1
trainsorting trainsorting 3.5b, LIS max(LIS(i)+LDS(i)-1), ∀i ∈ [0...n-1]; also available at UVa 11456 522 5.4
00431 Fetching from uHunt 3.5c, 0-1 KNAPSACK classic 0-1 Knapsack Problem; output any optimal solution as there is a special checker for this problem 0.0
00562 Fetching from uHunt 3.5c, 0-1 KNAPSACK use a one dimensional table 0.0
00990 Fetching from uHunt 3.5c, 0-1 KNAPSACK print the solution 0.0
01213 Fetching from uHunt 3.5c, 0-1 KNAPSACK LA 3619 - Yokohama06; extension of 0-1 KNAPSACK; s: (id, remN, remK) instead of s: (id, remN) 0.0
10130 Fetching from uHunt 3.5c, 0-1 KNAPSACK very basic 0-1 KNAPSACK problem 0.0
10261 Fetching from uHunt 3.5c, 0-1 KNAPSACK s: (current_car; left; right) 0.0
10616 Fetching from uHunt 3.5c, 0-1 KNAPSACK input can be -ve; use long long 0.0
10664 Fetching from uHunt 3.5c, 0-1 KNAPSACK Subset Sum 0.0
10690 Fetching from uHunt 3.5c, 0-1 KNAPSACK DP Subset Sum with negative offset technique; with addition of simple math 0.0
10819 Fetching from uHunt 3.5c, 0-1 KNAPSACK 0-1 knapsack with 'credit card' twist 0.0
11003 Fetching from uHunt 3.5c, 0-1 KNAPSACK try all max weight from 0 to max(weight[i] capacity[i]); forall i in [0..n-1]; if a max weight is known; how many boxes ... 0.0
11341 Fetching from uHunt 3.5c, 0-1 KNAPSACK s: (id; h_learned; h_left); t: learn module 'id' by 1 hour or skip it 0.0
11566 Fetching from uHunt 3.5c, 0-1 KNAPSACK KNAPSACK variant: double each dim sum; add one parameter to see if we have bought too many dishes 0.0
11658 Fetching from uHunt 3.5c, 0-1 KNAPSACK s: (id; share); t: form/ignore coalition with id 0.0
11832 Fetching from uHunt 3.5c, 0-1 KNAPSACK interesting DP; s: (id; val); use offset to handle negative numbers; t: plus or minus; print solution 0.0
12621 Fetching from uHunt 3.5c, 0-1 KNAPSACK DP Subset Sum; simplify the multiple of 10 0.0
knapsack knapsack 3.5c, 0-1 KNAPSACK basic DP KNAPSACK; print the solution 687 4.8
muzicari muzicari 3.5c, 0-1 KNAPSACK set Knapsack of size = T, each break length as item weight, and value = 1/2 (put that break at 'virtual knapsack 1/2', r... 343 4.9
ninepacks ninepacks 3.5c, 0-1 KNAPSACK brute force all possible sums; use DP SUBSET-SUM on each hotdog and bun packs; clever problem 499 4.4
orders orders 3.5c, 0-1 KNAPSACK interesting KNAPSACK variant; print the solution 713 4.5
presidentialelections presidentialelections 3.5c, 0-1 KNAPSACK pre-process the input to discard non winnable states; be careful of negative total voters; then standard DP KNAPSACK 116 5.7
00147 Fetching from uHunt 3.5d, COIN-CHANGE similar to UVa 357 and 674 0.0
00166 Fetching from uHunt 3.5d, COIN-CHANGE two coin change variants in one problem 0.0
00242 Fetching from uHunt 3.5d, COIN-CHANGE LA 5181 - WorldFinals Nashville95; Complete Search + DP Coin-Change 0.0
00357 Fetching from uHunt 3.5d, COIN-CHANGE similar to UVa 147 and 674 0.0
00674 Fetching from uHunt 3.5d, COIN-CHANGE basic coin change problem 0.0
10313 Fetching from uHunt 3.5d, COIN-CHANGE modified coin change and DP 1D range sum 0.0
10448 Fetching from uHunt 3.5d, COIN-CHANGE after dealing with traversal on tree; you can reduce the original problem into coin change; not trivial 0.0
11137 Fetching from uHunt 3.5d, COIN-CHANGE use long long 0.0
11259 Fetching from uHunt 3.5d, COIN-CHANGE part of the problem is DP COIN-CHANGE with restricted number of coins per type; inclusion-exclusion 0.0
11517 Fetching from uHunt 3.5d, COIN-CHANGE a variation to the coin change problem; also available at Kattis - exactchange2 0.0
bagoftiles bagoftiles 3.5d, COIN-CHANGE count number of ways to do COIN-CHANGE; meet in the middle; DP combinatorics (n choose k) to find the answer for a+b 102 6.5
canonical canonical 3.5d, COIN-CHANGE complete search possible range of counter examples; do both greedy COIN-CHANGE and DP COIN-CHANGE 502 5.7
exactchange2 exactchange2 3.5d, COIN-CHANGE a variation to the Coin-Change problem; also available at UVa 11517 - Exact Change 708 5.4
00216 Fetching from uHunt 3.5e, TSP LA 5155 - WorldFinals KansasCity92; DP TSP problem; but still solvable with backtracking 0.0
01281 Fetching from uHunt 3.5e, TSP LA 6028 - WorldFinals Warsaw12; DP TSP variant; also available at Kattis - bustour 0.0
10496 Fetching from uHunt 3.5e, TSP DP or recursive backtracking with sufficient pruning; also available at Kattis - beepers 0.0
11795 Fetching from uHunt 3.5e, TSP DP TSP variant; counting paths on DAG; DP+bitmask; let Mega Buster owned by a dummy 'Robot 0' 0.0
12841 Fetching from uHunt 3.5e, TSP simply find and print the lexicographically smallest Hamiltonian path; use DP-TSP technique 0.0
beepers beepers 3.5e, TSP DP or recursive backtracking with sufficient pruning; also available at UVa 10496 - Collecting Beepers 196 4.6
bustour bustour 3.5e, TSP LA 6028 - WorldFinals Warsaw12; DP TSP variant; also available at UVa 01281 - Bus Tour 124 6.1
cycleseasy cycleseasy 3.5e, TSP Count number of HAMILTONIAN-TOURs 108 4.1
errands errands 3.5e, TSP map location names to integer indices; DP TSP 51 7.0
maximizingyourpay maximizingyourpay 3.5e, TSP Max-Traveling-Salesman-Problem; can go back to vertex 0 early; use DP bitmask 60 6.4
pokemongogo pokemongogo 3.5e, TSP DP TSP variant; there can be more than one Pokemon in the same location 154 5.0
race race 3.5e, TSP try all possible subset of locations; run DP TSP variant from start to ending to see if the plan is doable; keep the bes... 65 7.5
00116 Fetching from uHunt 3.5f, DP level 1 similar to UVa 10337 0.0
00196 Fetching from uHunt 3.5f, DP level 1 3.5g 0.0
00215 Fetching from uHunt 3.5f, DP level 1 3.5g 0.0
01261 Fetching from uHunt 3.5f, DP level 1 LA 4844 - Daejeon10; a simple backtracking problem; but we use a setÿto prevent the same state (a substring) from being... 0.0
10003 Fetching from uHunt 3.5f, DP level 1 s: (l; r) 0.0
10036 Fetching from uHunt 3.5f, DP level 1 must use offset technique as value can be negative 0.0
10086 Fetching from uHunt 3.5f, DP level 1 3.5g 0.0
10337 Fetching from uHunt 3.5f, DP level 1 DP; shortest paths on DAG 0.0
10446 Fetching from uHunt 3.5f, DP level 1 edit the given recursive function a bit; add memoization 0.0
10520 Fetching from uHunt 3.5f, DP level 1 just write the given formula as a top-down DP with memoization 0.0
10721 Fetching from uHunt 3.5f, DP level 1 s: (n; k); t: try all from 1 to m 0.0
10910 Fetching from uHunt 3.5f, DP level 1 two dimensional DP table 0.0
10912 Fetching from uHunt 3.5f, DP level 1 s: (len; last; sum); t: try next char 0.0
10943 Fetching from uHunt 3.5f, DP level 1 s: (n; k); t: try all the possible splitting points; alternative solution is to use the closed form mathematical formula... 0.0
10980 Fetching from uHunt 3.5f, DP level 1 simple DP 0.0
11026 Fetching from uHunt 3.5f, DP level 1 DP; similar idea with binomial theorem 0.0
11407 Fetching from uHunt 3.5f, DP level 1 can be memoized 0.0
11420 Fetching from uHunt 3.5f, DP level 1 s: (prev; id; numlck); lock/unlock this chest 0.0
11450 Fetching from uHunt 3.5f, DP level 1 standard DP 0.0
11703 Fetching from uHunt 3.5f, DP level 1 can be memoized 0.0
12654 Fetching from uHunt 3.5f, DP level 1 s: (hole); t: use patch T1 or patch T2 0.0
12951 Fetching from uHunt 3.5f, DP level 1 s: (day, has_stock); t: ignore, buy (if does not have stock), or sell (if has stock) 0.0
13141 Fetching from uHunt 3.5f, DP level 1 s: (level, branch_previously); t: not branching if branch_previously or branching (one side) otherwise 0.0
keyboardconcert keyboardconcert 3.5f, DP level 1 s: (pos, cur); at tune[pos], playing instrument cur; t: try staying or switch; better solution exists 100 4.5
nikola nikola 3.5f, DP level 1 s: (pos, last_jump); t: jump forward or backward 295 3.6
permutationdescent permutationdescent 3.5f, DP level 1 derive the required formula; use memoization 291 1.8
spiderman spiderman 3.5f, DP level 1 simple DP; go up or down; print solution 1010 3.9
ticketpricing ticketpricing 3.5f, DP level 1 LA 6867 - Rocky Mountain15; similar with UVa 11450 discussed in this book; real life problem; print (the first) part of ... 138 4.9
weightofwords weightofwords 3.5f, DP level 1 s: (cur_l, cur_w); t: try all 26 characters; print any solution 286 2.6
wordclouds wordclouds 3.5f, DP level 1 s: (i); t: try breaking to next row at subsequent j = [i..N]; O(N^2) DP 104 5.0
00662 Fetching from uHunt 3.5g, DP level 2 s: (L; R; k); that denotes the minimum distance sum to cover restaurants at index [L..R] with k depots left 0.0
10039 Fetching from uHunt 3.5g, DP level 2 create the graph first; then apply DP; s: (city; curtime); t: try all feasible trains 0.0
10069 Fetching from uHunt 3.5g, DP level 2 use Java BigInteger 0.0
10081 Fetching from uHunt 3.5g, DP level 2 s: (i, j); #tight words of length i that end in digit j divided by #words: (k+1)^n; also available at Kattis - tight 0.0
10120 Fetching from uHunt 3.5g, DP level 2 DP; special case for N >= 49 0.0
10164 Fetching from uHunt 3.5g, DP level 2 a bit number theory (modulo); backtracking; do memoization on DP s: (sum; taken) 0.0
10239 Fetching from uHunt 3.5g, DP level 2 convert double to long long first; medium DP; either put this book in the current shelf (if possible) or put it in a new... 0.0
10400 Fetching from uHunt 3.5g, DP level 2 backtracking with clever pruning is sufficient 0.0
10465 Fetching from uHunt 3.5g, DP level 2 one dimensional DP table 0.0
10651 Fetching from uHunt 3.5g, DP level 2 small problem size; doable with backtracking 0.0
11485 Fetching from uHunt 3.5g, DP level 2 the problem description looks scary but the solution is not that complex 0.0
11514 Fetching from uHunt 3.5g, DP level 2 modified 0-1 Knapsack; Batman can use or skip a certain super power; check if the best configuration uses ≤ E calorie... 0.0
11908 Fetching from uHunt 3.5g, DP level 2 sort the advertisements based on starting level; ending level; and cost; DP 1 dimension 0.0
12324 Fetching from uHunt 3.5g, DP level 2 spheres > n are useless 0.0
12862 Fetching from uHunt 3.5g, DP level 2 1D DP to compute the path cost from every vertex that goes up to the mountain top; compute answer 0.0
12955 Fetching from uHunt 3.5g, DP level 2 there are only 8 eligible factorials under 100000; we can use DP; s: (i, sum); t: take/stay, take/move, don't take/move 0.0
debugging debugging 3.5g, DP level 2 s: (n); t: divide the program into [2..n] blocks 226 6.0
drivinglanes drivinglanes 3.5g, DP level 2 s: (st, ln); t: try all other lanes; be careful of corner cases 105 3.7
kutevi kutevi 3.5g, DP level 2 s: (360 integer degrees) 170 2.6
tight tight 3.5g, DP level 2 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 ... 100 3.5
walrusweights walrusweights 3.5g, DP level 2 backtracking with memoization 570 3.8
watersheds watersheds 3.5g, DP level 2 DP on an implicit DAG 41 3.2
00260 Fetching from uHunt 4.2a, Finding CCs 6 neighbors per cell 0.0
00280 Fetching from uHunt 4.2a, Finding CCs reachability check; traverse the graph 0.0
00459 Fetching from uHunt 4.2a, Finding CCs also solvable with UFDS 0.0
10687 Fetching from uHunt 4.2a, Finding CCs build graph; geometry; reachability 0.0
11518 Fetching from uHunt 4.2a, Finding CCs unlike UVa 11504, we treat SCCs as CCs; also available at Kattis - dominoes2 0.0
11749 Fetching from uHunt 4.2a, Finding CCs find the largest CC with highest average PPA; also solvable with UFDS 0.0
11841 Fetching from uHunt 4.2a, Finding CCs implicit graph; check if there is a CC from x = y = z = 0 to say 'Benny wins' 0.0
11902 Fetching from uHunt 4.2a, Finding CCs disable vertex one by one; check if the reachability from vertex 0 changes 0.0
11906 Fetching from uHunt 4.2a, Finding CCs DFS/BFS for reachability; several tricky cases; be careful when M = 0; N = 0; or M = N 0.0
cartrouble cartrouble 4.2a, Finding CCs graph traversal on forward and reverse graphs 106 4.4
daceydice daceydice 4.2a, Finding CCs reachability test of a state-space graph; s: (r, c, where_is_five) 171 3.5
dominoes2 dominoes2 4.2a, Finding CCs unlike UVa 11504, we treat SCCs as CCs; also available at UVa 11518 - Dominos 2 599 3.3
moneymatters moneymatters 4.2a, Finding CCs see if the sum of vertex weights of each CC = 0 990 3.1
pearwise pearwise 4.2a, Finding CCs clever problem wording; can be reduced into basic graph traversal 159 3.7
reachableroads reachableroads 4.2a, Finding CCs report number of CC-1 892 2.1
securitybadge securitybadge 4.2a, Finding CCs reachability test; clever idea to compress ids 87 6.6
terraces terraces 4.2a, Finding CCs group cells with similar height together; if it cannot flow to any other component with lower height, add the size of th... 339 3.6
wheresmyinternet wheresmyinternet 4.2a, Finding CCs check connectivity to vertex 1 1716 3.7
00352 Fetching from uHunt 4.2b, Flood Fill, Easier count number of CCs; see UVa 00572 0.0
00469 Fetching from uHunt 4.2b, Flood Fill, Easier count size of a CC 0.0
00572 Fetching from uHunt 4.2b, Flood Fill, Easier count number of CCs 0.0
00657 Fetching from uHunt 4.2b, Flood Fill, Easier there are three colors here; non-standard but still relatively easy floodfill problem 0.0
00722 Fetching from uHunt 4.2b, Flood Fill, Easier count the size of CCs 0.0
00871 Fetching from uHunt 4.2b, Flood Fill, Easier find the largest CC size 0.0
10336 Fetching from uHunt 4.2b, Flood Fill, Easier count and rank CCs with similar color 0.0
11244 Fetching from uHunt 4.2b, Flood Fill, Easier count number of CCs 0.0
11470 Fetching from uHunt 4.2b, Flood Fill, Easier you can do flood fill layer by layer; however; there is other way to solve this problem; e.g. by finding the patterns 0.0
11561 Fetching from uHunt 4.2b, Flood Fill, Easier flood fill with extra blocking constraint; also available at Kattis - gold 0.0
11953 Fetching from uHunt 4.2b, Flood Fill, Easier interesting twist of flood fill problem 0.0
amoebas amoebas 4.2b, Flood Fill, Easier easy floodfill 1079 1.8
countingstars countingstars 4.2b, Flood Fill, Easier basic flood fill problem; count CCs 1494 2.7
floodit floodit 4.2b, Flood Fill, Easier multiple calls of flood fill tests 74 2.9
fontan fontan 4.2b, Flood Fill, Easier modified multi-sources BFS/floodfill 101 2.2
gold gold 4.2b, Flood Fill, Easier flood fill with extra blocking constraint; also available at UVa 11561 - Getting Gold 735 2.2
00601 Fetching from uHunt 4.2c, Flood Fill, Harder floodfill is one of the component 0.0
00705 Fetching from uHunt 4.2c, Flood Fill, Harder build the implicit graph first 0.0
00758 Fetching from uHunt 4.2c, Flood Fill, Harder floodfill 0.0
00776 Fetching from uHunt 4.2c, Flood Fill, Harder label CCs with indices; format output 0.0
00782 Fetching from uHunt 4.2c, Flood Fill, Harder replace spaces with hexes in the grid; similar to UVa 784 and 785 0.0
00784 Fetching from uHunt 4.2c, Flood Fill, Harder similar to UVa 782 and 785 0.0
00785 Fetching from uHunt 4.2c, Flood Fill, Harder similar to UVa 782 and 784 0.0
00852 Fetching from uHunt 4.2c, Flood Fill, Harder interesting board game 'Go' 0.0
01103 Fetching from uHunt 4.2c, Flood Fill, Harder LA 5130 - WorldFinals Orlando11; major hint: each hieroglyph has unique number of white CCs 0.0
10592 Fetching from uHunt 4.2c, Flood Fill, Harder floodfill ; two layers 0.0
10707 Fetching from uHunt 4.2c, Flood Fill, Harder check graph isomorphism; a tedious problem; involving connected components 0.0
10946 Fetching from uHunt 4.2c, Flood Fill, Harder find CCs and rank them by their size 0.0
10kindsofpeople 10kindsofpeople 4.2c, Flood Fill, Harder intelligent flood fill; just run once to avoid TLE as there are many queries 2380 3.9
11094 Fetching from uHunt 4.2c, Flood Fill, Harder tricky flood fill; scrolling 0.0
11110 Fetching from uHunt 4.2c, Flood Fill, Harder flood fill satisfy the constraints given 0.0
11585 Fetching from uHunt 4.2c, Flood Fill, Harder polynomial-time verifier for an NP-complete puzzle Nurikabe; this verifier requires clever usage of flood fill algorithm 0.0
coast coast 4.2c, Flood Fill, Harder intelligent flood fill; just run once to avoid TLE as there are many queries 1339 3.2
island island 4.2c, Flood Fill, Harder super tedious flood fill; involving one directional flood fill involving bridges 'B's; bridges may connect islands in cy... 113 6.2
islands3 islands3 4.2c, Flood Fill, Harder optimistic flood fill; assume all Cs are Ls 936 2.1
vindiagrams vindiagrams 4.2c, Flood Fill, Harder challenging and tedious flood fill problem 76 5.3
00124 Fetching from uHunt 4.2d, Topological Sort use backtracking to generate valid toposorts 0.0
00200 Fetching from uHunt 4.2d, Topological Sort toposort 0.0
00872 Fetching from uHunt 4.2d, Topological Sort similar to UVa 00124; use backtracking 0.0
10305 Fetching from uHunt 4.2d, Topological Sort simply run toposort algorithm 0.0
11060 Fetching from uHunt 4.2d, Topological Sort Kahn's algorithm---modified BFS toposort 0.0
11686 Fetching from uHunt 4.2d, Topological Sort cycle check + toposort if DAG; also available at Kattis - pickupsticks 0.0
brexit brexit 4.2d, Topological Sort toposort; chain reaction; modified Kahn's algorithm 826 3.6
brexitnegotiations brexitnegotiations 4.2d, Topological Sort toposort with modified Kahn's algorithm; greedy 270 4.8
builddeps builddeps 4.2d, Topological Sort the graph is acyclic; toposort with DFS from the changed file 626 4.7
collapse collapse 4.2d, Topological Sort similar with Kattis - brexit 77 5.8
conservation conservation 4.2d, Topological Sort modified Kahn's algorithm; greedily process all steps in a certain lab before alternating to the other lab 133 4.2
curveknights curveknights 4.2d, Topological Sort input is a DAG; multi-sources, find toposort; propagate using topological order 46 3.3
digicomp2 digicomp2 4.2d, Topological Sort toposort helps avoid TLE; do not simulate the process n times as n can be as big as 10^18 288 5.9
grapevine grapevine 4.2d, Topological Sort BFS variant; like Kahn's algorithm, only propagate from a person once his/her skepticism level is cleared; be careful wi... 84 6.4
managingpackaging managingpackaging 4.2d, Topological Sort if the graph is cyclic, output 'cannot be ordered'; otherwise, find the lexicographically smallest topological order 128 5.9
pickupsticks pickupsticks 4.2d, Topological Sort cycle check + toposort if DAG; also available at item UVa 11686 - Pick up sticks 373 4.7
00840 Fetching from uHunt 4.2e, Graph Properties Check a simple problem to detect cycle in a graph; however the output format is not clearly specified 0.0
10004 Fetching from uHunt 4.2e, Graph Properties Check bipartite graph check 0.0
10116 Fetching from uHunt 4.2e, Graph Properties Check traversal on implicit graph; cycle check 0.0
10505 Fetching from uHunt 4.2e, Graph Properties Check bipartite; take max(left; right) 0.0
10510 Fetching from uHunt 4.2e, Graph Properties Check use DFS to identify forward/cross edges; involving Strongly Connected graph 0.0
11080 Fetching from uHunt 4.2e, Graph Properties Check bipartite graph check; tricky cases 0.0
11396 Fetching from uHunt 4.2e, Graph Properties Check it is just a bipartite graph check 0.0
amanda amanda 4.2e, Graph Properties Check add edge only among airports where only one end point has lounge; bicolouring/bipartite check; pick colour with smaller ... 368 5.2
ballsandneedles ballsandneedles 4.2e, Graph Properties Check cycle check on 2 similar graphs; easier solution exists 161 3.2
breakingbad breakingbad 4.2e, Graph Properties Check check if we can decompose the vertices into two disjoint sets; bipartite graph check 643 4.2
hoppers hoppers 4.2e, Graph Properties Check the answer is number of CC-1 if there is at least one non-bipartite component in the graph; or number of CC otherwise 234 3.9
molekule molekule 4.2e, Graph Properties Check undirected tree is also Bipartite/bi-colorable; bi-color it with 0 and 1; direct all edges from 0 to 1 (or vice versa) 175 3.5
pubs pubs 4.2e, Graph Properties Check isolated vertex has no solution; this is actually not a bipartite graph check; we can do alternate labeling of vertices ... 216 3.5
runningmom runningmom 4.2e, Graph Properties Check find a cycle in a directed graph 591 3.8
torn2pieces torn2pieces 4.2e, Graph Properties Check construct graph from strings; traversal from source to target; reachability check; print path 1115 3.6
00315 Fetching from uHunt 4.2f, Cut Vertices/Bridges finding articulation points 0.0
00610 Fetching from uHunt 4.2f, Cut Vertices/Bridges finding bridges 0.0
00796 Fetching from uHunt 4.2f, Cut Vertices/Bridges finding bridges 0.0
10199 Fetching from uHunt 4.2f, Cut Vertices/Bridges finding articulation points 0.0
10765 Fetching from uHunt 4.2f, Cut Vertices/Bridges finding articulation points 0.0
12363 Fetching from uHunt 4.2f, Cut Vertices/Bridges LA 5796 - Latin America; transform input to graph of its bridges; see if b is reachable from a with only the bridges 0.0
12783 Fetching from uHunt 4.2f, Cut Vertices/Bridges finding bridges 0.0
birthday birthday 4.2f, Cut Vertices/Bridges check if the input graph contains any bridge; N is small though so weaker solution can still be accepted 323 4.3
caveexploration caveexploration 4.2f, Cut Vertices/Bridges find size of bi-connected components that contains vertex 0; identify the bridges 306 3.4
intercept intercept 4.2f, Cut Vertices/Bridges Articulation Points in SSSP Spanning DAG; clever modification of Dijkstra's 112 6.6
kingpinescape kingpinescape 4.2f, Cut Vertices/Bridges DFS from headquarter (may also be a leaf); find all L leaves; add ceil(L/2.0) edges to connect 2 leaves (correctly) to p... 54 6.5
00247 Fetching from uHunt 4.2g, Finding SCCs SCC + printing solution 0.0
01229 Fetching from uHunt 4.2g, Finding SCCs LA 4099 - Iran07; identify the SCC of the graph; these vertices and the vertices that have path towards them are the ans... 0.0
10731 Fetching from uHunt 4.2g, Finding SCCs SCC + printing solution; also available at Kattis - test2 0.0
11504 Fetching from uHunt 4.2g, Finding SCCs count the number of SCCs without incoming edge from a vertex outside that SCC; also available at Kattis - dominos 0.0
11709 Fetching from uHunt 4.2g, Finding SCCs find the number of SCCs 0.0
11770 Fetching from uHunt 4.2g, Finding SCCs similar to UVa 11504 0.0
11838 Fetching from uHunt 4.2g, Finding SCCs see if input graph is an SCC 0.0
cantinaofbabel cantinaofbabel 4.2g, Finding SCCs build directed graph 'can_speak'; compute the largest SCC of 'can_speak'; keep this largest SCC 379 3.5
dominos dominos 4.2g, Finding SCCs count the number of SCCs without incoming edge from a vertex outside that SCC; also available at UVa 11504 - Dominos 248 6.2
equivalences equivalences 4.2g, Finding SCCs contract input directed graph into SCCs; count SCCs that have in-/out-degrees = 0; report the max 281 5.4
loopycabdrivers loopycabdrivers 4.2g, Finding SCCs print all SCCs that have size ≥ 2; tricky output ordering 55 5.5
reversingroads reversingroads 4.2g, Finding SCCs small graph; if #SCC = 1, print 'valid'; otherwise try reversing one of the m directed edges one by one until we either ... 274 4.4
test2 test2 4.2g, Finding SCCs SCC + printing solution; also available at UVa 10731 - Test 20 5.5
00118 Fetching from uHunt 4.2h, Really Ad Hoc traversal on implicit graph 0.0
00168 Fetching from uHunt 4.2h, Really Ad Hoc Adjacency Matrix; parsing; traversal 0.0
00173 Fetching from uHunt 4.2h, Really Ad Hoc non classic graph traversal variant; use bitmask to record vertices visited by Paskill and Lisper as they move through t... 0.0
00318 Fetching from uHunt 4.2h, Really Ad Hoc graph traversal; be careful of corner cases 0.0
00614 Fetching from uHunt 4.2h, Really Ad Hoc traversal on implicit graph 0.0
00824 Fetching from uHunt 4.2h, Really Ad Hoc traversal on implicit graph 0.0
10113 Fetching from uHunt 4.2h, Really Ad Hoc just graph traversal; but uses fraction and GCD 0.0
10377 Fetching from uHunt 4.2h, Really Ad Hoc traversal on implicit graph 0.0
11831 Fetching from uHunt 4.2h, Really Ad Hoc traversal on implicit graph 0.0
12376 Fetching from uHunt 4.2h, Really Ad Hoc simulated greedy traversal on DAG 0.0
12442 Fetching from uHunt 4.2h, Really Ad Hoc modified DFS; special graph 0.0
12582 Fetching from uHunt 4.2h, Really Ad Hoc given graph DFS traversal; count the degree of each vertex 0.0
12648 Fetching from uHunt 4.2h, Really Ad Hoc simple graph (DAG) traversal; DFS 0.0
13015 Fetching from uHunt 4.2h, Really Ad Hoc modified DFS; special graph; DAG; also available at Kattis - promotions 0.0
13038 Fetching from uHunt 4.2h, Really Ad Hoc simple, use DFS to find the length of the deepest branch 0.0
droppingdirections droppingdirections 4.2h, Really Ad Hoc modified graph: a vertex is (origin intersection id, intersection id); modified DFS from vertices leading to goal; count... 87 3.5
faultyrobot faultyrobot 4.2h, Really Ad Hoc interesting graph traversal variant 182 4.5
promotions promotions 4.2h, Really Ad Hoc modified DFS; special graph; DAG; also available at UVa 13015 - Promotions 129 5.5
silueta silueta 4.2h, Really Ad Hoc 2D grid processing initially; modified DFS to count perimeter of polygon in grid 37 5.3
succession succession 4.2h, Really Ad Hoc (upwards) traversal of family DAG; use unordered_maps; make the founder has very large starting blood to avoid fraction 165 3.1
00908 Fetching from uHunt 4.3a, MST, Standard basic MST problem 0.0
01174 Fetching from uHunt 4.3a, MST, Standard LA 3988 - SouthWesternEurope07; classic MST; just need a mapper to map city names to indices 0.0
01208 Fetching from uHunt 4.3a, MST, Standard LA 3171 - Manila06; MST 0.0
01235 Fetching from uHunt 4.3a, MST, Standard LA 4138 - Jakarta08; the underlying problem is MST 0.0
10034 Fetching from uHunt 4.3a, MST, Standard straightforward MST problem; also available at Kattis - freckles 0.0
11228 Fetching from uHunt 4.3a, MST, Standard split output for short vs long edges 0.0
11631 Fetching from uHunt 4.3a, MST, Standard weight of (all graph edges - all MST edges) 0.0
11710 Fetching from uHunt 4.3a, MST, Standard output 'Impossible' if the graph is still disconnected after running MST 0.0
11733 Fetching from uHunt 4.3a, MST, Standard maintain cost at every update 0.0
11747 Fetching from uHunt 4.3a, MST, Standard sum the edge weights of the chords 0.0
11857 Fetching from uHunt 4.3a, MST, Standard find weight of the last edge added to MST by Kruskal's; also available at Kattis - drivingrange 0.0
cats cats 4.3a, MST, Standard standard MST 456 4.1
communicationssatellite communicationssatellite 4.3a, MST, Standard standard MST; complete graph with n ≤ 2 000 227 3.5
drivingrange drivingrange 4.3a, MST, Standard find weight of the last edge added to MST by Kruskal's; also available at UVa 11857 - Driving Range 336 3.5
freckles freckles 4.3a, MST, Standard straightforward MST problem; also available at UVa 10034 - Freckles 412 4.6
islandhopping islandhopping 4.3a, MST, Standard MST on small complete graph 440 3.0
jurassicjigsaw jurassicjigsaw 4.3a, MST, Standard just a reading comprehension problem; afterwards it is just a basic MST problem 110 2.2
lostmap lostmap 4.3a, MST, Standard actually just a standard MST problem 782 2.1
minspantree minspantree 4.3a, MST, Standard very standard MST problem; check if a spanning tree is formed; also output the edges in any spanning tree in lexicograph... 862 4.0
00534 Fetching from uHunt 4.3b, MST, Variants minimax; also solvable with Floyd Warshall's 0.0
00544 Fetching from uHunt 4.3b, MST, Variants maximin; also solvable with Floyd Warshall's 0.0
01013 Fetching from uHunt 4.3b, MST, Variants LA 2478 - WorldFinals Honolulu02; very interesting MST variant 0.0
01160 Fetching from uHunt 4.3b, MST, Variants LA 3644 - SouthWesternEurope06; count the number of edges not taken by Kruskal's 0.0
01216 Fetching from uHunt 4.3b, MST, Variants LA 3678 - Kaohsiung06; minimum 'spanning forest' 0.0
01234 Fetching from uHunt 4.3b, MST, Variants LA 4110 - Singapore07; 'maximum' spanning tree 0.0
01265 Fetching from uHunt 4.3b, MST, Variants LA 4848 - Daejeon10; very interesting non-standard variant of 'maximum' spanning tree 0.0
10048 Fetching from uHunt 4.3b, MST, Variants classic MiniMax path problem 0.0
10099 Fetching from uHunt 4.3b, MST, Variants maximin; also solvable with Floyd Warshall's 0.0
10147 Fetching from uHunt 4.3b, MST, Variants 'minimum' spanning subgraph 0.0
10369 Fetching from uHunt 4.3b, MST, Variants minimum spanning 'forest'; also available at Kattis - arcticnetwork 0.0
10397 Fetching from uHunt 4.3b, MST, Variants 'minimum' spanning subgraph 0.0
10457 Fetching from uHunt 4.3b, MST, Variants interesting MST modeling 0.0
10462 Fetching from uHunt 4.3b, MST, Variants second best spanning tree 0.0
10600 Fetching from uHunt 4.3b, MST, Variants second best spanning tree 0.0
10842 Fetching from uHunt 4.3b, MST, Variants find min weighted edge in 'max' spanning tree 0.0
arcticnetwork arcticnetwork 4.3b, MST, Variants minimum spanning 'forest'; also available at UVa 10369 - Arctic Networks 435 4.4
firetrucksarered firetrucksarered 4.3b, MST, Variants output any spanning tree that connects n people 162 3.4
landline landline 4.3b, MST, Variants MST with special leaf vertices; get (M)ST of secure buildings; connect unsecure buildings (new leaf) to (M)ST of secure ... 168 5.7
millionairemadness millionairemadness 4.3b, MST, Variants MiniMax path problem 649 2.4
muddyhike muddyhike 4.3b, MST, Variants MiniMax path problem 209 3.9
naturereserve naturereserve 4.3b, MST, Variants Prim's algorithm from multiple sources 180 4.6
treehouses treehouses 4.3b, MST, Variants 'minimum' spanning subgraph; very similar to UVa 10397 185 4.2
00336 Fetching from uHunt 4.4a, SSSP, BFS, Easier simple SSSP; BFS 0.0
00388 Fetching from uHunt 4.4a, SSSP, BFS, Easier key idea: we want to minimize planet movements because every edge used decreases value by 5% 0.0
00429 Fetching from uHunt 4.4a, SSSP, BFS, Easier each word is a vertex; connect 2 words with an edge if differ by 1 letter 0.0
00627 Fetching from uHunt 4.4a, SSSP, BFS, Easier also print the path 0.0
00762 Fetching from uHunt 4.4a, SSSP, BFS, Easier simple SSSP solvable with BFS; use mapper 0.0
00924 Fetching from uHunt 4.4a, SSSP, BFS, Easier the spread is like BFS traversal 0.0
01148 Fetching from uHunt 4.4a, SSSP, BFS, Easier LA 3502 - SouthWesternEurope05; single source single target shortest path problem but exclude endpoints 0.0
10009 Fetching from uHunt 4.4a, SSSP, BFS, Easier simple SSSP solvable with BFS 0.0
10610 Fetching from uHunt 4.4a, SSSP, BFS, Easier simple SSSP solvable with BFS 0.0
10653 Fetching from uHunt 4.4a, SSSP, BFS, Easier need efficient BFS implementation 0.0
10959 Fetching from uHunt 4.4a, SSSP, BFS, Easier SSSP from source 0 to the rest 0.0
12160 Fetching from uHunt 4.4a, SSSP, BFS, Easier LA 4408 - KualaLumpur08; s: (4-digits number); edges: button pushes; BFS 0.0
buttonbashing buttonbashing 4.4a, SSSP, BFS, Easier very similar to UVa 12160 728 3.4
elevatortrouble elevatortrouble 4.4a, SSSP, BFS, Easier s: (cur_level); only 1M floors; go up/down; BFS 362 3.1
grid grid 4.4a, SSSP, BFS, Easier modified BFS with step size multiplier 1026 2.8
horror horror 4.4a, SSSP, BFS, Easier SSSP from all sources = horror movies; report lowest ID with the highest unweighted SSSP distance 500 3.3
spiral spiral 4.4a, SSSP, BFS, Easier generate the 2D 100x100 spiraling grid first; involving small primes; BFS 148 3.5
wettiles wettiles 4.4a, SSSP, BFS, Easier multi-sources BFS; limited flood fill or unweighted SSSP limited to step T 227 3.6
00314 Fetching from uHunt 4.4b, SSSP, BFS, Harder pre-process the input graph first; s: (r, c, dir); 5 edges: turn left/right or move 1/2/3 steps; BFS 0.0
00383 Fetching from uHunt 4.4b, SSSP, BFS, Harder simple SSSP solvable with BFS; use mapper 0.0
00532 Fetching from uHunt 4.4b, SSSP, BFS, Harder 3D BFS; also available at Kattis - dungeon 0.0
00859 Fetching from uHunt 4.4b, SSSP, BFS, Harder BFS 0.0
00949 Fetching from uHunt 4.4b, SSSP, BFS, Harder interesting graph data structure twist 0.0
10044 Fetching from uHunt 4.4b, SSSP, BFS, Harder the input parsing part is troublesome 0.0
10067 Fetching from uHunt 4.4b, SSSP, BFS, Harder implicit graph in problem statement 0.0
10977 Fetching from uHunt 4.4b, SSSP, BFS, Harder BFS with blocked states 0.0
10993 Fetching from uHunt 4.4b, SSSP, BFS, Harder s: (the current number modulo N); BFS 0.0
11049 Fetching from uHunt 4.4b, SSSP, BFS, Harder some restricted moves; print the path 0.0
11101 Fetching from uHunt 4.4b, SSSP, BFS, Harder multi-sources BFS from m1; get minimum at border of m2; also available at Kattis - mallmania 0.0
11352 Fetching from uHunt 4.4b, SSSP, BFS, Harder filter the graph first; then it becomes SSSP 0.0
11377 Fetching from uHunt 4.4b, SSSP, BFS, Harder a city to another city without/with airport has edge weight 1/0, respectively; BFS+deque; if the start and end city are ... 0.0
11573 Fetching from uHunt 4.4b, SSSP, BFS, Harder 0/1-weighted SSSP; BFS+deque; also available at Kattis - oceancurrents 0.0
11624 Fetching from uHunt 4.4b, SSSP, BFS, Harder multi-sources BFS; also available at Kattis - fire3 0.0
11792 Fetching from uHunt 4.4b, SSSP, BFS, Harder be careful with 'important station' 0.0
12826 Fetching from uHunt 4.4b, SSSP, BFS, Harder SSSP from (r1; c1) to (r2; c2) avoiding (r3; c3); BFS 0.0
beehives2 beehives2 4.4b, SSSP, BFS, Harder find the girth (length of shortest cycle) of input graph; multiple calls of BFS 98 4.4
bryr bryr 4.4b, SSSP, BFS, Harder 0/1-weighted SSSP; solvable with BFS and deque; 0-weight for single-lane bridge, 1-weight for double-lane bridge 70 2.5
conquestcampaign conquestcampaign 4.4b, SSSP, BFS, Harder multi-sources BFS 353 1.9
dungeon dungeon 4.4b, SSSP, BFS, Harder 3D BFS; also available at UVa 00532 - Dungeon Master 288 3.6
erdosnumbers erdosnumbers 4.4b, SSSP, BFS, Harder use unordered_map as Adjacency List of author names; BFS from 'PAUL_ERDOS' 159 4.4
erraticants erraticants 4.4b, SSSP, BFS, Harder simulate; move twice per single move to differentiate the path; revisit the path using BFS 340 5.1
escapewallmaria escapewallmaria 4.4b, SSSP, BFS, Harder BFS on grid graph; generate edges dynamically according to the rules 32 2.7
fire2 fire2 4.4b, SSSP, BFS, Harder very similar to UVa 11624 395 4.2
fire3 fire3 4.4b, SSSP, BFS, Harder multi-sources BFS; also available at UVa 11624 - Fire! 289 5.4
landlocked landlocked 4.4b, SSSP, BFS, Harder 0/1-weighted SSSP; 0-weight for same country; 1-weight for different country; multi-sources; BFS+deque; 8 directions 42 4.6
lava lava 4.4b, SSSP, BFS, Harder BFS; interesting output; very real life situation 79 4.5
lost lost 4.4b, SSSP, BFS, Harder interesting twist of BFS/SSSP spanning tree 168 4.1
mallmania mallmania 4.4b, SSSP, BFS, Harder multi-sources BFS from m1; get minimum at border of m2; also available at UVa 11101 - Mall Mania 48 4.9
oceancurrents oceancurrents 4.4b, SSSP, BFS, Harder 0/1-weighted SSSP; BFS+deque; also available at UVa 11573 - Ocean Currents 118 5.4
showroom showroom 4.4b, SSSP, BFS, Harder 0/1-weighted SSSP; solvable with BFS and deque; 0-weight for passing a door, 1-weight for passing a car 256 4.4
sixdegrees sixdegrees 4.4b, SSSP, BFS, Harder map strings to integers; BFS from all sources; prune at depth 6; compare size of unreachable vertices with the size of a... 83 5.3
slikar slikar 4.4b, SSSP, BFS, Harder very similar to Kattis - fire2 and UVa 11624 204 3.4
zoning zoning 4.4b, SSSP, BFS, Harder multi-sources BFS 140 4.5
00439 Fetching from uHunt 4.4c, Knight Moves one BFS per query is enough 0.0
00633 Fetching from uHunt 4.4c, Knight Moves alternating Knight Moves and Bishop Moves (limited to distance 2)); solvable with just one BFS per query 0.0
10426 Fetching from uHunt 4.4c, Knight Moves for each knight, do BFS when the monster is sleep/awake; try: one awake the monster, the rest go around 0.0
10477 Fetching from uHunt 4.4c, Knight Moves s: (row; col; knight_state); implicit unweighted graph; different edges per different knight_state 0.0
grasshopper grasshopper 4.4c, Knight Moves BFS on implicit Knight jump graph 136 4.0
hidingplaces hidingplaces 4.4c, Knight Moves SSSP from (r, c); find cells with max distance; print 607 1.9
knightjump knightjump 4.4c, Knight Moves unweighted SSSP from the cell that contains 'K' to (1, 1) using Knight jump movements; avoid '#' cells 292 2.5
00929 Fetching from uHunt 4.4d, SSSP, Dijkstra, Easier on a 2D maze/implicit graph 0.0
01112 Fetching from uHunt 4.4d, SSSP, Dijkstra, Easier LA 2425 - SouthwesternEurope01; SDSP 0.0
10389 Fetching from uHunt 4.4d, SSSP, Dijkstra, Easier use basic geometry skill to build the weighted graph; then run Dijkstra's; also available at Kattis - subway2 0.0
10986 Fetching from uHunt 4.4d, SSSP, Dijkstra, Easier direct Dijkstra's application 0.0
12878 Fetching from uHunt 4.4d, SSSP, Dijkstra, Easier Dijkstra's; record predecessor graph as there can be multiple shortest paths; also available at Kattis - flowerytrails 0.0
13127 Fetching from uHunt 4.4d, SSSP, Dijkstra, Easier Dijkstra's from multiple sources 0.0
flowerytrails flowerytrails 4.4d, SSSP, Dijkstra, Easier Dijkstra's; record predecessor graph as there can be multiple shortest paths; also available at UVa 12878 - Flowery Trai... 305 3.9
george george 4.4d, SSSP, Dijkstra, Easier not easy, rating deceptive: Dijkstra's but with a few constraints; some roads are blocked at certain timings; similar wi... 205 2.0
getshorty getshorty 4.4d, SSSP, Dijkstra, Easier log(f) when f in [0..1] is negative; log(f1 * f2 * ... * fn) = log(f1) + log(f2) + ... + log(fn); longest path; use max... 1572 3.4
hopscotch50 hopscotch50 4.4d, SSSP, Dijkstra, Easier MSSP from all 1s; implicit weighted graph; stop at first cell with value k 200 2.3
shortestpath1 shortestpath1 4.4d, SSSP, Dijkstra, Easier very standard Dijkstra's problem 1470 3.5
shortestpath2 shortestpath2 4.4d, SSSP, Dijkstra, Easier Dijkstra's with modification; edges only available periodically; be careful with P = 0 case 423 3.9
subway2 subway2 4.4d, SSSP, Dijkstra, Easier use basic geometry skill to build the weighted graph; then run Dijkstra's; also available at UVa 10389 - Subway 70 5.9
texassummers texassummers 4.4d, SSSP, Dijkstra, Easier Dijkstra's; complete weighted graph; print path 97 4.0
00157 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder tedious input parsing; SSSP on graph with 2-valued weighted graph (1 or 3 units of time); print the shortest path 0.0
00523 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder this is actually an SSSP problem on weighted graph solvable with Dijkstra's; use the vertex splitting technique to handl... 0.0
00589 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder weighted SSSP: move box from s to t + unweighted SSSP: move player to correct position to push the box 0.0
00721 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder essentially this problem is just about SSSP from vertex 1 to all vertices and SDestinationSP from all vertices to vertex... 0.0
01202 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder LA 3133 - Beijing04; SSSP; Dijkstra's on a grid: treat each cell as a vertex; the idea is simple but one should be caref... 0.0
10166 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder this can be modeled as an SSSP problem 0.0
10187 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder special cases: start = destination: 0 litre; starting or destination city not found or destination city not reachable fr... 0.0
10278 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder Dijkstra's from fire stations to all intersections; need pruning to pass the time limit; also available at Kattis - fire... 0.0
10280 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder Dijkstra's; also available at Kattis - wine 0.0
10356 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder attach one extra info to each vertex: do we come to that vertex using cycle or not; Dijkstra's 0.0
10603 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder state: (a; b; c); source: (0; 0; c); 6 possible transitions 0.0
10801 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder model the graph carefully 0.0
10967 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder model the graph; SSSP 0.0
11338 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder the test data is weaker than what the problem description says (n ≤ 10 000); we use O(n^2) loop to build the w... 0.0
11367 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder model the graph carefully; state: (location, fuel), source s = (s, 0), sink t = (e, any), only enqueue fuel+1; also avai... 0.0
11492 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder vertex = word; edges as per problem description; connect source/sink to all words in start/finish language, respectively... 0.0
11833 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder stop Dijkstra's at service route path plus some modification 0.0
12047 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder clever usage of Dijkstra's; run Dijkstra's from source and from d from destination 0.0
12144 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder Dijkstra's; store multiple predecessors 0.0
12950 Fetching from uHunt 4.4e, SSSP, Dijkstra, Harder clever usage of Dijstra's; instead of extending by one edge, we can extend by two edges at a time 0.0
blockcrusher blockcrusher 4.4e, SSSP, Dijkstra, Harder Dijkstra's from top row to bottom row (or vice versa); print path 257 5.1
detour detour 4.4e, SSSP, Dijkstra, Harder SSSP from destination/Amsterdam; from all vertices, block outgoing edge that is part of the shortest paths to destinatio... 167 4.0
emptyingbaltic emptyingbaltic 4.4e, SSSP, Dijkstra, Harder Dijkstra's variant; grow spanning tree from drain/source 287 5.4
firestation firestation 4.4e, SSSP, Dijkstra, Harder Dijkstra's from fire stations to all intersections; need pruning to pass the time limit; also available at UVa 10278 - F... 67 6.5
forestfruits forestfruits 4.4e, SSSP, Dijkstra, Harder Dijkstra's from clearing 1; sort clearings with fruits by increasing distances; find the required formula; be careful of... 103 4.1
fulltank fulltank 4.4e, SSSP, Dijkstra, Harder model the graph carefully; state: (location, fuel), source s = (s, 0), sink t = (e, any), only enqueue fuel+1; also avai... 192 4.8
gruesomecave gruesomecave 4.4e, SSSP, Dijkstra, Harder need to understand the meaning of 'risk' of an empty cell; SSSP from E to D using least risky path; Dijkstra's 87 3.6
invasion invasion 4.4e, SSSP, Dijkstra, Harder SSSP with multiple and successive sources; multiple calls of Dijkstra's (gets lighter each time if pruned properly) 46 4.3
passingsecrets passingsecrets 4.4e, SSSP, Dijkstra, Harder harder form of Dijkstra's; print path 36 4.9
shoppingmalls shoppingmalls 4.4e, SSSP, Dijkstra, Harder special graph construction; multiple queries; Dijkstra's and print path 79 4.5
tide tide 4.4e, SSSP, Dijkstra, Harder SSSP with complex rules; 3 different weights (0, 1, or 10 seconds); Dijkstra's 21 5.4
visualgo visualgo 4.4e, SSSP, Dijkstra, Harder Dijkstra's produces SSSP spanning DAG if there are multiple shortest paths from s to t; counting paths on DAG 496 3.4
00423 Fetching from uHunt 4.4f, SSSP, -ve weight the graph is small; Bellman-Ford or Floyd-Warshall 0.0
00558 Fetching from uHunt 4.4f, SSSP, -ve weight check if negative cycle exists 0.0
10449 Fetching from uHunt 4.4f, SSSP, -ve weight find the minimum weight path; which may be negative; be careful: INF negative weight is lower than INF 0.0
10557 Fetching from uHunt 4.4f, SSSP, -ve weight check 'positive' cycle; check connectedness; also available at Kattis - xyzzy 0.0
11280 Fetching from uHunt 4.4f, SSSP, -ve weight modified Bellman-Ford 0.0
12768 Fetching from uHunt 4.4f, SSSP, -ve weight insert -F as edge weight; see if negative cycle exists; or find min SSSP value from s = 1 0.0
crosscountry crosscountry 4.4f, SSSP, -ve weight medium complete graph with N ≤ 1000; Bellman-Ford can still pass (or use Dijkstra's) 217 3.0
hauntedgraveyard hauntedgraveyard 4.4f, SSSP, -ve weight Bellman-Ford; negative cycle check needed 95 8.2
shortestpath3 shortestpath3 4.4f, SSSP, -ve weight Bellman-Ford; do DFS/BFS from vertices that are part of any negative cycle 524 5.1
xyzzy xyzzy 4.4f, SSSP, -ve weight check 'positive' cycle; check connectedness; also available at UVa 10557 152 6.7
00341 Fetching from uHunt 4.5a, APSP, Standard the graph is small 0.0
00567 Fetching from uHunt 4.5a, APSP, Standard simple SSSP solvable with BFS; but the graph is small, so can be solved easier with Floyd-Warshall 0.0
00821 Fetching from uHunt 4.5a, APSP, Standard LA 5221 - WorldFinals Orlando00; one of the easiest ICPC WorldFinals problem 0.0
01233 Fetching from uHunt 4.5a, APSP, Standard LA 4109 - Singapore07; Floyd-Warshall can be used to find the minimum cost cycle in the graph 0.0
01247 Fetching from uHunt 4.5a, APSP, Standard LA 4524 - Hsinchu09; Floyd-Warshall with modification: prefer shortest path with less intermediate vertices 0.0
10171 Fetching from uHunt 4.5a, APSP, Standard easy with APSP information 0.0
10354 Fetching from uHunt 4.5a, APSP, Standard find and remove edges involved in boss's shortest paths; re-run shortest paths from home to market 0.0
10525 Fetching from uHunt 4.5a, APSP, Standard use two adjacency matrices: time and length; use modified Floyd-Warshall 0.0
10724 Fetching from uHunt 4.5a, APSP, Standard adding one edge only changes a few things 0.0
10793 Fetching from uHunt 4.5a, APSP, Standard Floyd-Warshall simplifies this problem 0.0
10803 Fetching from uHunt 4.5a, APSP, Standard graph is small 0.0
10947 Fetching from uHunt 4.5a, APSP, Standard graph is small 0.0
11015 Fetching from uHunt 4.5a, APSP, Standard graph is small 0.0
11463 Fetching from uHunt 4.5a, APSP, Standard solution is easy with APSP information 0.0
12319 Fetching from uHunt 4.5a, APSP, Standard Floyd-Warshall 2x and compare 0.0
13249 Fetching from uHunt 4.5a, APSP, Standard Floyd-Warshall; use O(N^2) check, not O(N^4) check to avoid TLE 0.0
allpairspath allpairspath 4.5a, APSP, Standard basic Floyd-Warshall; tricky negative cycle checks 772 5.5
importspaghetti importspaghetti 4.5a, APSP, Standard smallest cycle; print path by breaking the self-loop into i - other vertex j - i 292 5.1
slowleak slowleak 4.5a, APSP, Standard APSP; FW twice 279 5.6
transportationplanning transportationplanning 4.5a, APSP, Standard APSP; FW; for each unused edge, use it and see how much distance is reduced; get minimum; O(n^4) 65 3.9
00104 Fetching from uHunt 4.5b, APSP, Variants small arbitrage problem solvable with Floyd-Warshall 0.0
00125 Fetching from uHunt 4.5b, APSP, Variants modified Floyd-Warshall 0.0
00186 Fetching from uHunt 4.5b, APSP, Variants graph is small; print path 0.0
00274 Fetching from uHunt 4.5b, APSP, Variants variant of transitive closure problem 0.0
00334 Fetching from uHunt 4.5b, APSP, Variants transitive closure 0.0
00436 Fetching from uHunt 4.5b, APSP, Variants another arbitrage problem 0.0
00869 Fetching from uHunt 4.5b, APSP, Variants run Warshall's 2x on different graph; compare the two Adjacency Matrices 0.0
00925 Fetching from uHunt 4.5b, APSP, Variants transitive closure 0.0
01056 Fetching from uHunt 4.5b, APSP, Variants LA 3569 - WorldFinals SanAntonio06; finding diameter of a small graph with Floyd-Warshall 0.0
01198 Fetching from uHunt 4.5b, APSP, Variants LA 2818 - Kaohsiung03; transitive closure 0.0
01757 Fetching from uHunt 4.5b, APSP, Variants LA 8047 - WorldFinals RapidCity17; Warshall's transitive closure; also available at Kattis - secretchamber 0.0
10246 Fetching from uHunt 4.5b, APSP, Variants modify the Floyd-Warshall recurrence a bit to handle the maximum cost to hold feast for Obelix 0.0
10331 Fetching from uHunt 4.5b, APSP, Variants use Floyd-Warshall to obtain the APSP information; then use brute force to count the time an edge is used; report accord... 0.0
10342 Fetching from uHunt 4.5b, APSP, Variants Floyd-Warshall to get APSP values; to get the second best shortest path, try to make a single mistake 0.0
10436 Fetching from uHunt 4.5b, APSP, Variants as there is vertex weight, use vertex splitting technique; run Floyd-Warshall on the still-small graph; print path 0.0
10987 Fetching from uHunt 4.5b, APSP, Variants creative usage of Floyd-Warshall algorithm; if we can detour without increasing cost, then delete the direct edge 0.0
11047 Fetching from uHunt 4.5b, APSP, Variants print path; special case: if origin = destination; print twice 0.0
arbitrage arbitrage 4.5b, APSP, Variants arbitrage problem; similar to UVa 00104 and 00436 324 3.3
assembly assembly 4.5b, APSP, Variants we can model the problem as a small connectivity graph; use Warshall's transitive closure algorithm to check if there is... 305 3.9
isahasa isahasa 4.5b, APSP, Variants map strings to integers; the real n is ≤ 500; Warshall's transitive closure algorithm 2x; first on 'is' relationships... 171 7.2
kastenlauf kastenlauf 4.5b, APSP, Variants n ≤ 100; Warshall's transitive closure problem 713 3.8
secretchamber secretchamber 4.5b, APSP, Variants LA 8047 - WorldFinals RapidCity17; Warshall's transitive closure; also available at UVa 01757 - Secret Chamber ... 1187 2.2
00103 Fetching from uHunt 4.6a, S/Longest Paths on DAG longest paths on DAG; backtracking OK 0.0
00452 Fetching from uHunt 4.6a, S/Longest Paths on DAG longest paths on DAG 0.0
10000 Fetching from uHunt 4.6a, S/Longest Paths on DAG longest paths on DAG; backtracking OK 0.0
10051 Fetching from uHunt 4.6a, S/Longest Paths on DAG longest paths on DAG; DP 0.0
10259 Fetching from uHunt 4.6a, S/Longest Paths on DAG longest paths on implicit DAG; DP 0.0
10285 Fetching from uHunt 4.6a, S/Longest Paths on DAG longest paths on implicit DAG; however; the graph is small enough for recursive backtracking solution 0.0
10350 Fetching from uHunt 4.6a, S/Longest Paths on DAG shortest paths; implicit DAG; DP 0.0
baas baas 4.6a, S/Longest Paths on DAG try all possible vertex to be 'optimized'; LONGEST-PATH on DAG 55 4.5
excavatorexpedition excavatorexpedition 4.6a, S/Longest Paths on DAG s: (pos); t: try all directed edge; +1/-1 weight; LONGEST-PATH on DAG problem; be careful of negative final answer 70 5.4
fibtour fibtour 4.6a, S/Longest Paths on DAG only ~90 Fibonacci numbers not more than 10^18; LONGEST-PATH on DAG problem; special case for first two Fibonacci number... 105 6.4
monopoly monopoly 4.6a, S/Longest Paths on DAG K, b, r are all irrelevant; vertex value is either +ve (salary) or -ve (tax); LONGEST-PATH on DAG (u < v); exclude so... 69 3.0
mravi mravi 4.6a, S/Longest Paths on DAG reverse edge directions to change the input tree into a DAG; find longest path from leaf that contains ant to root 197 2.7
safepassage safepassage 4.6a, S/Longest Paths on DAG SSSP; implicit DAG; s: (cloak_pos, bitmask); try all ways to go back and forth between gate and dorm; report minimum 387 4.9
savinguniverse savinguniverse 4.6a, S/Longest Paths on DAG s: (cur_SE; Q_pos); t: stay in this search engine or switch to one other; unweighted SSSP on DAG 122 4.7
00825 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in grid (implicit DAG); DP; similar to UVa 00926 and 11067 0.0
00926 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in grid (implicit DAG); DP; similar to UVa 825 and 11067 0.0
00986 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in DAG; DP; s: (x; y; lastmove; peaksfound); t: try NE/SE 0.0
00988 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in DAG; DP 0.0
10401 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in implicit DAG; DP; s: (col; row); t: next col; avoid 2 or 3 adjacent rows 0.0
10544 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in implicit DAG 0.0
10564 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in implicit DAG (top-down); print one solution 0.0
10926 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in DAG; DP 0.0
11067 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in grid (implicit DAG); DP; similar to UVa 825 and 926 0.0
11569 Fetching from uHunt 4.6b, Counting Paths, Easier determine the length of one of the longest paths and then count the number of such longest paths in DAG 0.0
11655 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in DAG and one more similar task: counting the number of vertices involved in the paths 0.0
11957 Fetching from uHunt 4.6b, Counting Paths, Easier counting paths in implicit DAG; DP 0.0
compositions compositions 4.6b, Counting Paths, Easier LA 7365 - Greater NY15; s: (N_left); t: try all values, skip some numbers 160 2.3
helpfulcurrents helpfulcurrents 4.6b, Counting Paths, Easier problem description ensures a DAG; counting path modulo 1000003; output "begin repairs" if Lysias's castle is unreachabl... 51 5.3
marypartitions marypartitions 4.6b, Counting Paths, Easier 3 ≤ m, so we will only use a few power values; counting paths on DAG 245 3.5
robotsonagrid robotsonagrid 4.6b, Counting Paths, Easier counting paths in grid (implicit DAG); DP 147 4.3
runningsteps runningsteps 4.6b, Counting Paths, Easier 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... 168 2.6
scenes scenes 4.6b, Counting Paths, Easier s: (pos, ribbon_left); t: try all possible heights; ignore the flat scenes first and subtract those cases at the end 407 3.6
00590 Fetching from uHunt 4.6c, Conversion to DAG s: (pos; day_left) 0.0
00607 Fetching from uHunt 4.6c, Conversion to DAG returns pair of information 0.0
00757 Fetching from uHunt 4.6c, Conversion to DAG s: (lake_id, time_left); this time_left is best left as multiple of 5 minutes; output the optimal solution too 0.0
00907 Fetching from uHunt 4.6c, Conversion to DAG s: (pos; night_left) 0.0
00910 Fetching from uHunt 4.6c, Conversion to DAG s: (pos; move_left) 0.0
01025 Fetching from uHunt 4.6c, Conversion to DAG s: (station, cur_t); t: stay until meeting time (if at station N), or either go to right or go to left using any of the ... 0.0
10201 Fetching from uHunt 4.6c, Conversion to DAG s: (pos, fuel_left); also available at Kattis - adventuremoving4 0.0
10271 Fetching from uHunt 4.6c, Conversion to DAG Observation: The 3rd chopstick can be any chopstick; s: (pos, K_left); t: ignore this chopstick, or take this chopstick ... 0.0
10543 Fetching from uHunt 4.6c, Conversion to DAG s: (pos; speech_given) 0.0
10681 Fetching from uHunt 4.6c, Conversion to DAG s: (pos; day_left) 0.0
10702 Fetching from uHunt 4.6c, Conversion to DAG s: (pos; T_left); similar to UVa 12875 0.0
10874 Fetching from uHunt 4.6c, Conversion to DAG s: (row; left/right); t: go left/right 0.0
10913 Fetching from uHunt 4.6c, Conversion to DAG s: (r; c; neg_left; stat); t: down/(left/right) 0.0
11307 Fetching from uHunt 4.6c, Conversion to DAG Min Chromatic Sum; max 6 colors 0.0
11487 Fetching from uHunt 4.6c, Conversion to DAG s: (r; c; cur_food; len); t: 4 dirs 0.0
11545 Fetching from uHunt 4.6c, Conversion to DAG s: (cPos; cTime; cWTime); t: move forward/rest 0.0
11782 Fetching from uHunt 4.6c, Conversion to DAG s: (id; rem_K); t: take root/try left-right subtree 0.0
12875 Fetching from uHunt 4.6c, Conversion to DAG LA 6853 - Bangkok14; similar to UVa 10702; s: (cur_store; cur_concert); t: pick any next store for next concert 0.0
13122 Fetching from uHunt 4.6c, Conversion to DAG s: (pos, K_left); knapsack style DP; jump 1, 2, ..., K_left points; connect with the two points with a line with cost eq... 0.0
cardmagic cardmagic 4.6c, Conversion to DAG s: (deck, tgt_left); t: val 1 to K ≤ tgt_left 133 3.9
drinkresponsibly drinkresponsibly 4.6c, Conversion to DAG s: (cur_drink, money_left, u_left); be careful with precision errors; print solution 98 4.2
maximizingwinnings maximizingwinnings 4.6c, Conversion to DAG separate the maximizing and minimizing problem; s: (cur_room, turns_left); t: go to other room or stay 193 3.9
quantumsuperposition quantumsuperposition 4.6c, Conversion to DAG s: (id, u, step); id is either DAG 1 or DAG 2, u is current vertex, step is the number of step used; t: try all neighbor... 172 6.0
shortestpath4 shortestpath4 4.6c, Conversion to DAG s: (u, vtx_left); t: neighbors of u 76 3.0
00112 Fetching from uHunt 4.6d, Tree backtracking 0.0
00115 Fetching from uHunt 4.6d, Tree tree traversal to determine relationships between vertices 0.0
00122 Fetching from uHunt 4.6d, Tree tree traversal 0.0
00536 Fetching from uHunt 4.6d, Tree reconstructing binary tree from preorder and inorder binary tree traversal 0.0
00548 Fetching from uHunt 4.6d, Tree reconstructing tree from in postorder 0.0
00615 Fetching from uHunt 4.6d, Tree graph property check 0.0
00699 Fetching from uHunt 4.6d, Tree preorder traversal 0.0
00712 Fetching from uHunt 4.6d, Tree simple binary tree traversal variant 0.0
00839 Fetching from uHunt 4.6d, Tree can be viewed as a recursive problem on tree 0.0
10308 Fetching from uHunt 4.6d, Tree diameter of tree 0.0
10459 Fetching from uHunt 4.6d, Tree diameter of tree 0.0
10701 Fetching from uHunt 4.6d, Tree reconstructing tree from pre inorder 0.0
10805 Fetching from uHunt 4.6d, Tree involving diameter of tree 0.0
11131 Fetching from uHunt 4.6d, Tree read tree; produce two postorder traversals 0.0
11234 Fetching from uHunt 4.6d, Tree converting post-order to level-order; binary tree 0.0
11615 Fetching from uHunt 4.6d, Tree counting size of subtrees 0.0
11695 Fetching from uHunt 4.6d, Tree cut the worst edge along the tree diameter; link two centers; also available at Kattis - flight 0.0
12186 Fetching from uHunt 4.6d, Tree the input graph is a tree 0.0
12347 Fetching from uHunt 4.6d, Tree given pre-order traversal of a BST; use BST property to get the BST; output the post-order traversal that BST 0.0
12379 Fetching from uHunt 4.6d, Tree find the diameter of tree first; we only traverse the diameter once and we traverse the other edges twice 0.0
adjoin adjoin 4.6d, Tree the key parts are finding tree diameter and its center (along that diameter); also see UVa 11695 373 5.3
appealtotheaudience appealtotheaudience 4.6d, Tree LONGEST-PATH on tree + greedy matching (strongest player plays the most and so on) 31 3.1
decisions decisions 4.6d, Tree collapse a sub-tree into a super vertex if all f values on its leaves are equal; count size of min BDD tree recursively 151 3.1
flight flight 4.6d, Tree cut the worst edge along the tree diameter; link two centers; also available at UVa 11695 - Flight Planning 46 6.3
frozenrose frozenrose 4.6d, Tree tree traversal; is it better to close the valve that goes in to a vertex u or close subset of valve(s) in subtree of u 56 3.5
kitten kitten 4.6d, Tree simple rooted tree traversal; from a vertex back to root 1278 1.7
mazemakers mazemakers 4.6d, Tree long problem statement to describe a custom 2D grid graph; just a graph traversal: check if all cells are visited and th... 171 2.8
tourists tourists 4.6d, Tree APSP on Tree (special requirements); LCA 431 3.8
whostheboss whostheboss 4.6d, Tree sort; create the tree graph; DFS from root; parent array and size of subtree (a bit of DP) 29 6.1
00663 Fetching from uHunt 4.6e, Bipartite Graph try disallowing an edge to see if MCBM changes; which implies that the edge has to be used 0.0
00670 Fetching from uHunt 4.6e, Bipartite Graph MCBM 0.0
00753 Fetching from uHunt 4.6e, Bipartite Graph initially a non standard matching problem but this problem can be reduced to a simple MCBM problem 0.0
10080 Fetching from uHunt 4.6e, Bipartite Graph MCBM; also available at Kattis - gopher2 0.0
11138 Fetching from uHunt 4.6e, Bipartite Graph a pure MCBM problem 0.0
12644 Fetching from uHunt 4.6e, Bipartite Graph classic MCBM problem wrapped inside a creative problem statement 0.0
12668 Fetching from uHunt 4.6e, Bipartite Graph LA 6525 - LatinAmerica13; split rows/columns due to the presence of pawns; then run MCBM 0.0
absurdistan3 absurdistan3 4.6e, Bipartite Graph can be modeled as MCBM; or greedy graph construction with PQ 312 5.6
bookclub bookclub 4.6e, Bipartite Graph check if perfect MCBM is possible 307 4.5
elementarymath elementarymath 4.6e, Bipartite Graph left set: (a, b); right set: possible scores; possible if MCBM = n; use long long 365 5.1
escapeplan escapeplan 4.6e, Bipartite Graph left set: robots; right set: holes; 3 version of similar bipartite graphs; MCBM 98 5.7
flippingcards flippingcards 4.6e, Bipartite Graph left set: n card numbers; right set: 2*n picture numbers; possible if MCBM = n; need fast algorithm 169 7.0
gopher2 gopher2 4.6e, Bipartite Graph MCBM; also available at UVa 10080 - Gopher II 337 4.3
paintball paintball 4.6e, Bipartite Graph very similar with bookclub 335 4.3
pianolessons pianolessons 4.6e, Bipartite Graph straightforward MCBM 151 4.5
00117 Fetching from uHunt 4.6f, Eulerian Graph Euler tour; get cost of tour 0.0
00291 Fetching from uHunt 4.6f, Eulerian Graph Euler tour on a small graph; backtracking is sufficient 0.0
00302 Fetching from uHunt 4.6f, Eulerian Graph Euler tour; print the tour 0.0
10054 Fetching from uHunt 4.6f, Eulerian Graph printing the Euler tour 0.0
10129 Fetching from uHunt 4.6f, Eulerian Graph Euler Graph property check 0.0
10203 Fetching from uHunt 4.6f, Eulerian Graph the underlying graph is Euler graph 0.0
10596 Fetching from uHunt 4.6f, Eulerian Graph Euler Graph property check 0.0
catenyms catenyms 4.6f, Eulerian Graph Euler graph property check; 26 vertices; directed non simple graph; printing the Euler tour in lexicographic order 67 7.1
eulerianpath eulerianpath 4.6f, Eulerian Graph Euler graph property check; directed graph; printing the Euler tour 219 5.6
grandopening grandopening 4.6f, Eulerian Graph false alarm case is trivial; model the movement as a directed graph; check if Eulerian path exists 89 5.9
railroad2 railroad2 4.6f, Eulerian Graph x-shaped level junctions have even degrees - ignore X; y-shaped switches have degree 3 - Y has to be even 2188 1.4
01315 Fetching from uHunt 5.2a, Finding Formula, Easier find the pattern; hint: odd indices 0.0
10014 Fetching from uHunt 5.2a, Finding Formula, Easier derive the required formula 0.0
10110 Fetching from uHunt 5.2a, Finding Formula, Easier check if n is a square number 0.0
10170 Fetching from uHunt 5.2a, Finding Formula, Easier one liner formula exists 0.0
10499 Fetching from uHunt 5.2a, Finding Formula, Easier simple formula exists 0.0
10696 Fetching from uHunt 5.2a, Finding Formula, Easier very simple formula simplification 0.0
10751 Fetching from uHunt 5.2a, Finding Formula, Easier trivial for N = 1 and N = 2; derive the formula first for N > 2; hint: use diagonal as much as possible 0.0
10773 Fetching from uHunt 5.2a, Finding Formula, Easier several tricky cases 0.0
10940 Fetching from uHunt 5.2a, Finding Formula, Easier find the pattern with brute force solution; then submit the optimized solution 0.0
11202 Fetching from uHunt 5.2a, Finding Formula, Easier consider symmetry and flip 0.0
11393 Fetching from uHunt 5.2a, Finding Formula, Easier draw several small Kn; derive the pattern 0.0
12004 Fetching from uHunt 5.2a, Finding Formula, Easier try small n; get the pattern; use long long 0.0
12027 Fetching from uHunt 5.2a, Finding Formula, Easier sqrt trick 0.0
12502 Fetching from uHunt 5.2a, Finding Formula, Easier must understand the wording trick first 0.0
12725 Fetching from uHunt 5.2a, Finding Formula, Easier simple O(1) adhoc math formula manipulation 0.0
12918 Fetching from uHunt 5.2a, Finding Formula, Easier sum of arithmetic progression; long long 0.0
12992 Fetching from uHunt 5.2a, Finding Formula, Easier simple formula, just 2*N-1 0.0
13049 Fetching from uHunt 5.2a, Finding Formula, Easier simple; for each digit, you should not do more than 5 steps 0.0
13071 Fetching from uHunt 5.2a, Finding Formula, Easier simple formula involving sum of arithmetic progression 0.0
13216 Fetching from uHunt 5.2a, Finding Formula, Easier print the first few answer to see the clear pattern; use Big Integer 0.0
alloys alloys 5.2a, Finding Formula, Easier easy formula; be careful when c < 1.0 202 3.8
averageseasy averageseasy 5.2a, Finding Formula, Easier find O(n) formula; also see Kattis - averageshard 758 2.4
averageshard averageshard 5.2a, Finding Formula, Easier find O(n) formula; also see Kattis - averageseasy 605 2.6
bishops bishops 5.2a, Finding Formula, Easier chess pattern involving bishops; from IPSC 2004