2014 HIGH SCHOOL PROGRAMMING CONTEST. Sponsors: University of Evansville Student Chapter of ACM University of Evansville Office of Admissions

Transcription

1 Sponsors: University of Evansville Student Chapter of ACM University of Evansville Office of Admissions Problem Packet STOP! Do NOT open this packet until instructed to do so! COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 1

2 Problem #1: Who s Still Around? Game of Thrones is the thrilling new fantasy series that is the latest obsession. Multiple families are vying for the throne, the king's council members plot and scheme, the Night's Watch in the north is doing its best to protect the realm from invaders, and to the east, an army is amassing. However, even for the most dedicated fans, keeping up with the countless characters is very difficult. To make matters worse, it's a rotating roster new characters are introduced and old favorites are killed off with astounding frequency. To help you and your friends to keep track of them all, you decide to write a program to keep track of all the characters who are alive at one time. You decide that you should be able to add a new character, remove a character who dies, and display all of the currently living characters. When the program begins, it should print a statement welcoming the user to the program. To choose whether you want to add a character, remove a character, or list all current characters, the program should prompt the user to input a, r, or l. When the program receives an 'a', the user is prompted to add a new character by name. When it receives a 'r', the program prompts the user for the name of the character to remove. If the user tries to remove a character that does not exist, print out a statement saying that the character cannot be found or is already dead. Finally, when the program receives an 'l', it outputs a list of all current characters. If there are no characters stored in the program when the list command is given, state that all characters are dead. The total number of characters will never be greater than 150. If the user has chosen to add or remove a character, the program should prompt the user to input the character s name, which may have one or more parts separated by spaces (i.e. a first and last name or just a first name). The program repeats this until a q character is received. This means the program should quit. An example run can be seen below. Input: Character representing operation to be performed, character names Output: Result of operation COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 2

3 Welcome to the Game of Thrones character index! Enter 'a', 'r', 'l', or 'q': l Everyone is dead! Enter 'a', 'r', 'l', or 'q': a Enter character name: Robert Baratheon Enter 'a', 'r', 'l', or 'q': a Enter character name: Cersei Enter 'a', 'r', 'l', or 'q': l Robert Baratheon Cersei Enter 'a', 'r', 'l', or 'q': r Enter character name: Robert Baratheon Enter 'a', 'r', 'l', or 'q': r Enter character name: Ned Stark Ned Stark not found or already dead. Enter 'a', 'r', 'l', or 'q': l Cersei Enter 'a', 'r', 'l', or 'q': q COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 3

4 Problem #2: Precisely When He Means To Gandalf the Grey is never late and never early, but rather arrives precisely when he means to. However, being over 2000 years old, Gandalf is starting to have trouble remembering exactly when he means to arrive. To solve this problem, Gandalf has developed an algorithm to calculate when he means to arrive. This algorithm has the following segments: 1. The hour that Gandalf arrives is computed as day (month/2) mod The minute that Gandalf arrives is computed as ((day*year) / month) mod 60. Since Gandalf is getting on in years, he is having trouble handling all of that math in his head. He s chosen you to help him by writing a program to calculate when he means to arrives on a given a date. Gandalf uses the Shire calendar that is used by the Hobbits. In this calendar there are 12 months each having 30 days. There are 5 extra days (as well as a 6th leap day ) that belong in no month. However, Gandalf never travels on those days so you don't need to worry about them in your program. The months are listed in a table below. Your program should loop until 0 QUIT 0 is received as input. For all division operations, answers should be rounded down to the nearest integer. All times must contain two digits thus, hours and minutes less than 10 should have a leading 0 added. Hint: mod is defined as the remainder when one number is divided by another. For example, 7 mod 2 is 1. Month Name Month Name 1 Afteryule 7 Afterlithe 2 Solmath 8 Wedmath 3 Rethe 9 Halimath 4 Astron 10 Winterfilth 5 Thrimidge 11 Blotmath 6 Forelithe 12 Foreyule COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 4

5 Input: Date in the form DAY MONTH YEAR (ex: 5 ASTRON 7658) in all capital letters. Output: Time at which Gandalf arrives Date: 5 ASTRON 7658 Gandalf arrives at 01:32 Date: 8 ASTRON 7659 Gandalf arrives at 16:18 Date: 10 WINTERFILTH 7660 Gandalf arrives at 16:40 Date: 1 AFTERLITHE 6543 Gandalf arrives at 01:34 Date: 0 QUIT 0 COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 5

6 Problem #3: Morsican Navigation One day, while you're sitting at your desk working on your latest programming project, you hear a strange whirring sound. You spin around quickly, looking for the source of the noise as it grows louder and see the TARDIS appear in your living room. You hold your breath as the door opens and the Doctor leans out. "Well, what are you waiting for?", he says, "Get in! We haven't got all day!" You jump up, leaving your project behind without a thought, and enter the time and space traveling box. On your first journey, you travel to the Morsican System, home of the Morsicus race. The Morsicans are threatening an invasion of Earth to feast on the hopes and dreams of aspiring programmers, which is their main source of food. Unfortunately, the TARDIS navigational system is down again. You successfully made it to the edge of the planetary system, but there s no good way to get to the Morsican home planet while the navigation system is still down. Luckily for you, this system contains mostly empty space and the only object of any legitimate size is the Morsican planet. You simply need to get close so that you can see it. The Doctor goes below the console to try and repair the system, but you decide to take matters into your own hands and write a program to navigate to the planet yourself. First, ask the user for the row and column of the planet. Then, read in a path (a path is a string of characters symbolizing up (u), down (d), left (l), and right(r)). Starting in the upper left hand square of the map (which is the space (1,1)), you should test the path to see if it will succeed in getting you to the planet. You may assume the path will never go off the edge of the map. If you end on a space marked by a *, your journey is successful and you will be able to meet the Morsicans (so you should print a statement letting you know)! Otherwise, your journey fails and you should print out that you didn t make it to the planet. If you pass over the planet but don't finish on it, you do not find the planet. The program loops until a single q is entered as the path, using the same map for every path. If you want to use a new map, you need to quit and restart the program. Use the pictures to help visualize the example runs. COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 6

7 Input: The row and column of the planet and a list of directions Output: A message letting you know if you reached the planet Enter the row of the planet: 4 Enter the column of the planet: 3 Please enter a path: rrrdlrllddrr You didn't get to the planet. Please enter a path: ddrurdd You got to the planet! Please enter a path: q COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 7

8 Problem #4: Are You a Vampire? Your mom just landed her dream job in California, suddenly uprooting you from your home on the east coast and moving to Sunnydale. You soon become friends with Buffy the Vampire Slayer and realize that knowing how to spot a vampire from a distance is actually very important. While Buffy never worries about knowing who is a vampire and who isn't, you find yourself quite concerned. There are, of course, physical cues that can lead you to know who is a vampire, but sometimes that just is not enough. After you help Buffy, Willow, and Xander slay a few of the creeps, you start to notice that all the vampire names follow a pattern they have 3 consonants for every 2 vowels in their first name ('y' is considered a consonant). This means that Buffy, Willow, and Xander can't be vampires (you find this soothing), but that Angel and Spike certainly are vampires. For a moment you become fearful of Giles, but you quickly remember that his first name is Rupert, so he also must be a human. Using your programming skills, you decide to write a program to recognize vampires by name so that you can distribute your new knowledge to the rest of the town. When the program starts up, it should prompt the user to enter a first name. It should print out whether or not the person is a vampire or not, based on the name. Entering 'quit' as the name will end the program. Input: A first name Output: Whether or not the name belongs to a vampire Enter a name: Buffy Buffy is not a vampire! Enter a name: Spike Spike is a vampire! Enter a name: George George is not a vampire! Enter a name: Stephannie Stephannie is a vampire! Enter a name: quit COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 8

9 Problem #5: The Parseltongue Conundrum Imagine you're a 4th year Hogwarts student and you have your eye on a pretty witch. After you do a bit of asking around, you discover that she has a soft spot for reptiles. One day, while trying to impress her, you casually mention that you're a Parseltongue, with the ability to speak the language of the snakes. Just one small problem you can't speak a word of Parseltongue. Rather than coming clean about your lie, you decide it can't be that hard to fake speaking Parseltongue. You decide to write a program that will translate from English to Parseltongue to help you continue to impress the witch. After a little research in the library, you discover that translating into Parseltongue isn't really that complicated. Strings of one or more consecutive vowels (including 'y') have an 'h' added to the beginning of the string, while strings of consecutive consonants have 'iss' appended to the end. Capitalization should be preserved. In the case where a capitalized word begins with a vowel, the new leading 'h' should be capitalized. For example, the world 'Harry' would become 'Hissharrisshy'. Your program should translate a single given word into Parseltongue and loop until it receives "QUIT" as an input. Input: An English word Output: That word s Parseltongue equivalent English to Parseltongue translator. Input word to translate: Do Dissho English to Parseltongue translator. Input word to translate: not nisshotiss English to Parseltongue translator. Input word to translate: Eat Heatiss English to Parseltongue translator. Input word to translate: my misshy English to Parseltongue translator. Input word to translate: friends frisshiendsiss English to Parseltongue translator. Input word to translate: QUIT COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 9

10 Problem #6: Skyhook Luke Skywalker might not need to use his targeting computer to hit the exhaust port and destroy the Death Star, but he does need the help of R2 D2 s navigation computer to safely fly a spaceship through the trench, and that computer needs a program to run. The X Wing would be flying along in a straight line, but it needs to maneuver in order to avoid turbo lasers, Imperial fighters, and other hazards of outer space. Your job is to come up with a program that will find a way around these obstacles. The program accepts a list of obstacles, starting with the closest horizontally, and ending with the furthest. Each obstacle covers a square area, defined by its center point and the length of one side. Obstacles never overlap, so there is always a way through. The output is a series of points that goes from one end of the trench to the other without intersecting any obstacles. The trench extends from (0, 100) to (500, 100), and the X Wing starts at (0, 50). It can never fly above 100 or below zero, although obstacles may be placed at any location. You do not need to find the best path/set of points, only one of the possible sets. The second example in example output shows a run that would compute the path shown in the above picture. The program loops until a 0 is entered for the number of obstacles, which ends the program. Input: Numbers signifying number of obstacles and the location of the obstacles Output: A path through the obstacles COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 10

11 Enter the number of obstacles: 3 Enter the obstacle s placement (centerx, centery, size): Enter the obstacle's placement (centerx, centery, size): Enter the obstacle's placement (centerx, centery, size): Path through the obstacles is (0, 50), (85, 65), (115, 65), (190, 30), (210, 30), (500, 80). Enter the number of obstacles: 5 Enter the obstacle s placement (centerx, centery, size): Enter the obstacle's placement (centerx, centery, size): Enter the obstacle's placement (centerx, centery, size): Enter the obstacle's placement (centerx, centery, size): Enter the obstacle's placement (centerx, centery, size): Path through the obstacles is (0, 50), (55, 50), (55, 55), (165, 55), (165, 25), (225, 25), (225, 50), (415, 50), (415, 40), (500, 40) Enter the number of obstacles: 0 COLLEGE OF ENGINEERING AND COMPUTER SCIENCE 11