CourseWare Wiki
Switch Term
Winter 2024 / 2025
Summer 2023 / 2024
Winter 2023 / 2024
Summer 2021 / 2022
Winter 2021 / 2022
Summer 2020 / 2021
Winter 2020 / 2021
Summer 2019 / 2020
Winter 2019 / 2020
Summer 2018 / 2019
Winter 2018 / 2019
Summer 2017 / 2018
Search
Log In
b191
courses
a4b36acm1
2013_ls
seminar2
Warning
This page is located in archive. Go to the latest version of this
course pages
. Go the latest version of
this page
.
Contest Problem Sets
Contest 21.2.2013
The Shortest Path (Graphs)
- Find shortest paths between pairs of cities.
Feynman (Classical)
- Find the number of squares in a NxN grid.
A Game with Numbers (Games)
- An easy problem from the game theory, yet it is not needed to solve this problem.
Longest Path in a Tree (Graphs)
- Well-known problem of finding the diameter of a tree.
Is it a tree (Graphs)
- Determine, whether the graph on the input is a tree.
Marbles (Combinatorics)
- Find out the number of ways to choose marbles given the requirements.
Fibonnaci Sum (Maths)
- Finding sum of consecutive terms in Fibonacci sequence in the given range.
Penney Game (Classical)
- Finding the number of occurences of particular coin toss sequences in a 40 tosses long sequence.
Count on Cantor (Classical)
- Telling what is the n-th rational number in the “Cantor's sequence”.
Pouring Water (Classical)
- Determine the least number of steps to acquire a given amount of water using 2 vessels.
Labyrinth (Graphs)
- The same as the problem -
Longest Path in a Tree
- but it is not as simple as that - you need to parse the input and build the tree.
courses/a4b36acm1/2013_ls/seminar2.txt
· Last modified: 2018/10/03 03:51 (external edit)