Našega prijatelja, novopečenega geocacherja Marka zelo navdušujejo številke in statistika. Ponosen je na svojih 1560 zakladkov, s katerimi je vstopil v novo leto. Pri tem si je kajpada skrbno shranil vse trenutne statistične podatke.
Ni naključje, a trenutno povprečje tažavnosti vseh njegovih doslej najdenih zakladkov, znaša okroglih 1.9.
Mark si je za prvi del letošnjega leta postavil dva GC cilja.
1) Povprečje težavnosti svojih najdenih zakladov si želi dvigniti do natančnih 2.0
Odločil se je, da bo to naredil po najkrajši poti. To pomeni, da bo do izpolnitve zastavljenega cilja obiskoval samo zakladke, z oceno težavnosti 5.
Koliko tovrstnih zakladkov bo moral obiskati, da bo uresničil zastavljeni cilj? (A)
2) Odločil se je, da bo tudi druge iskalce zakladkov osrečil z nekaj lastnimi postavitvami.
Tudi tu ne more iz svoje kože. Za postavitev serije zakladkov se je dogovoril z lastnikom 50 ha velikega gozda pravilne kvadratne oblike. In v ta gozd želi postaviti največ zakladkov, kolikor jih je mogoče, ne da bi pri tem kršil pravilo, da morata biti sosednja zakladka najmanj 161 metrov narazen. Koliko škatlic naj torej kupi? (B)
nnn = 3 * (A + 3B) + 38
eee = 2 * (A + B) + 8
ENG:
Our friend, new geocacher Mark is very impressed by the numbers and statistics. He is proud of his 1560 caches found.
At the beginning of this year awerage difficulty of all his found caches was exactly 1.9. No coincidense, of course ;)
Mark has two GC goals for the first part of this year.
1) Average difficulty of all found caches wants to raise up to exactly 2.0
He has decided that he will do that by the shortest route. He is going to visit only Caches with difficulty level of 5, until he reaches his first goal.
How many D5 Caches does he have to find to achieve the goal? (A)
2) Mark is also thinking about other geocachers. Now he has already been experienced enough to set up a series of his own caches.
He ask the owner of 50 ha large forest (forest has proper square form) and he had allowed him. Into this forest Mark wants to hide as much caches as possible. (Of course he will respect the rule about minimum of 161 meters between two neighboring caches.
How many boxes should he buy? (B)
nnn = 3 * (A + 3B) + 38
eee = 2 * (A + B) + 8
