\\ Programming problems form previous years.\\ ---- **Directed graphs** \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxpath |Maximum path]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=ski|Downhill skiing]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=circus|Travelling circus]]\\ [[http://cmp.felk.cvut.cz/~berezovs/algo/shortcutedges/desc.pdf|Shortcut edges ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=increasingload|Increasing Training Load]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=reverseedge |Reverse an Edge ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=canalsinspection|Leaking canals inspection ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wayfarers|Wayfarers ]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=bluepromenades|Blue Promenades]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=express|Express Paths in Directed Graphs]]\\ **Euler trail** \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maintenance|Winter Maintenance Service]]\\ **Generation of various combinatorial structures**\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=mastermind|The Mastermind-- Assistant Program ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=counting_spanning_trees|Counting Spanning Trees]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=puzzle|The Puzzle ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cave|The Deep Caves]] \\ [[http://cmp.felk.cvut.cz/~berezovs/algo/isomorpicpermutations/desc.pdf|Isomorphic permutations ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=segmentedbelts |Historical Segmented Belts]] \\ **Graph isomorphism** \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomorphism|Small Graphs Isomorphism ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=bintree_automorphism|Binary Rooted Tree Isomorphism ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cyclic_isomers|Cyclic Isomers ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomers|Acyclic Isomers ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=isomers2|Acyclic Isomers II ]]\\ [[http://cmp.felk.cvut.cz/~berezovs/algo/similartrees/desc.pdf|Similar weighted binary rooted trees ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=treematch3|Tree isomorphism ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=molecules|Molecules ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=networks|Connected Networks ]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=treecycle|Isomorphism of Tree-Cycle Graphs]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=fewcycles|Isomorphism of Graphs with Few Cycles]]\\ **Graph searching** \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=makefile_refactoring|Refactoring of a Simplified Makefile ]]\\ [[http://cmp.felk.cvut.cz/~berezovs/algo/augmentingtrees/desc.pdf|Maximum Augmenting Sequence ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=telescopes|Telescopes connection ]]\\ [[http://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=marshcauseway|Marsh Causeway]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=roadtrip|Road Trip ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wordgameb|Word Game ]]\\ **Minimum spanning tree**s \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cascade|Minimum Cascading Spanning Tree ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=campus|Campus]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=cable_TV|Cable TV]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=hedgehogMST|Hedgehog Minimum Spanning Tree ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=backupconnection|Backup Connection ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxduplmst|New advances in gravitational waves observations ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=mstriver|Electrification of a rural area ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=MSTpath|Minimum Spanning Tree with Optimal A-B Connection]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=clusteredMST|Minimum spanning tree in a graph with vertex potentials]]\\ **Number theory**\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=generator|Linear congruential generator ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=maxperiod|Counting linear congruential generators ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=primitiveroots|On Certain Lehmer Generators]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=BBSperiod|Sequence Periods of Some Blum Blum Shub Random Number Generators]]\\ **Priority queues**\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=binomialheaps2|Building Binomial Heaps ]]\\ **Properties of finite automata and regular language**s \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=dictionarynfa|Dictionary automaton ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=paldistance|PAL distance ]] \\ [[http://cmp.felk.cvut.cz/~berezovs/algo/nfa_language/zada2.pdf|Finite and infinite languages ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=word_counter|The Word Counter]] \\ [[http://cmp.felk.cvut.cz/~berezovs/algo/NFA_counter/task.pdf|The NFA Counter ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=identification_of_minimal_DFA|Identification of minimal DFA ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=incomplete_automaton|Incomplete Automaton ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=prefixinwords|Words with given prefix ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=automatabudwords|Bud words ]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=interword|Intermediate Words]]\\ **Text searching** \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=committee|Basic Committee Work Model]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=textsearch2|Text Search ]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=dictionaries|Dictionaries ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=wagons|Trains dispatching ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=polynomialinx|Search for a polynomial ]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=stringfactorization|String Factorization]]\\ [[https://cw.felk.cvut.cz/brute/data/ae/release/2018z_b4m33pal/b4m33pal_2018z/evaluation/input.php?task=geneng|Genetic engineering]]\\ ---- ---- **Older problems in Czech** **Directed graphs** \\ [[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=hradlova_sit|CZ Hradlová síť]]\\ **Generation of various combinatorial structures**\\ [[https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=polymino|CZ Polymino]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=sachy|CZ Šachová koncovka]] \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=shoda|CZ Shoda stromù]] \\ **Graph searching** \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=prumergrafu|CZ Průměr grafu ]]\\ [[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=mosty|CZ Nepostradatelný datový kanál]]\\ **Minimum spanning trees** \\ [[https://cw.felk.cvut.cz/courses/a4b33alg/task.php?task=asfalt|CZ Asfaltové silnice]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pripojeni|CZ Připojení ]]\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=pocitacova_sit|CZ Počítačová síť]]\\ **Priority queue(s)**\\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=sklad|CZ Výbìr nejlepších položek ve skladu]]\\ **Text searching** \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=geny|CZ Geny v DNA]] \\ [[http://cmp.felk.cvut.cz/cmp/courses/a4m33pal/task.php?task=DNA|CZ Zjednodušené hledání v DNA]] \\ ---- ---- **Older, less relevant problems (also in Czech) ** Minimum directed spanning tree (= optimum branching) \\ [[https://cw.felk.cvut.cz/courses/a4m33pal/task.php?task=potrubni_posta2|CZ Výstavba potrubní pošty]]\\ Pushdown automaton simulation \\ [[http://cmp.felk.cvut.cz/~berezovs/algo/automat/zadani.pdf|CZ Zasobníkový automat]] \\ Parsing \\ [[http://cmp.felk.cvut.cz/~berezovs/algo/vyrazy/zadani.pdf|CZ Vyhodnocování řetězcových výrazù]]\\