This shows you the differences between two versions of the page.

Link to this comparison view

courses:a4b36acm1:2013_ls:seminar2 [2018/10/03 03:51] (current)
Line 1: Line 1:
 +====== Contest Problem Sets====== 
 +===== Contest 21.2.2013 ===== 
 +  * [[http://​www.spoj.com/​problems/​SHPATH/​|The Shortest Path (Graphs)]] - Find shortest paths between pairs of cities.\\ 
 +  * [[http://​www.spoj.com/​problems/​SAMER08F/​|Feynman (Classical)]] - Find the number of squares in a NxN grid.\\ 
 +  * [[http://​www.spoj.com/​problems/​NGM/​|A Game with Numbers (Games)]] - An easy problem from the game theory, yet it is not needed to solve this problem.\\ 
 +  * [[http://​www.spoj.com/​problems/​PT07Z/​|Longest Path in a Tree (Graphs)]] - Well-known problem of finding the diameter of a tree.\\ 
 +  * [[http://​www.spoj.com/​problems/​PT07Y/​|Is it a tree (Graphs)]] - Determine, whether the graph on the input is a tree.\\ 
 +  * [[http://​www.spoj.com/​problems/​MARBLES/​|Marbles (Combinatorics)]] - Find out the number of ways to choose marbles given the requirements.\\ 
 +  * [[http://​www.spoj.com/​problems/​FIBOSUM/​|Fibonnaci Sum (Maths)]] - Finding sum of consecutive terms in Fibonacci sequence in the given range.\\ 
 +  * [[http://​www.spoj.com/​problems/​NY10A/​|Penney Game (Classical)]] - Finding the number of occurences of particular coin toss sequences in a 40 tosses long sequence.\\ 
 +  * [[http://​www.spoj.com/​problems/​CANTON/​|Count on Cantor (Classical)]] - Telling what is the n-th rational number in the "​Cantor'​s sequence"​. 
 +  * [[http://​www.spoj.com/​problems/​POUR1/​|Pouring Water (Classical)]] - Determine the least number of steps to acquire a given amount of water using 2 vessels. 
 +  * [[http://​www.spoj.com/​problems/​LABYR1/​|Labyrinth (Graphs)]] - The same as the problem - [[http://​www.spoj.com/​problems/​PT07Z/​|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)