Introduction
It’s Halloween! You know what that means, right? It’s time to go trick-or-treating! With all the restrictions in place this year, it’s more important than ever to plan out the ideal routes. To minimize the number of people on the doorsteps at once, everyone has agreed to only trick-ortreat for so long and to take turns. The hero of our assignment, Bryan the Bold, needs your help making sure that his friends and him can collect as much candy as possible before their designated trick-or-treating time ends. He brought a map of the neighbourhoods he’s going to go trick or treating in and heard that you’ve been studying some computer science recently that will help him plan this all out. To help Bryan the Bold out, you will create a Java program to help him navigate the neighbourhood. The program needs to determine whether Bryan or a friend can reach enough candy to fill his bag from a starting point on the map, given a maximum distance from the start point (Bryan and friends can only run so fast!).
Get Free Quote!
433 Experts Online