Lower Fall Programming Contest 2017

Size: px

Start display at page:

Download "Lower Fall Programming Contest 2017"

Cory Wilkerson
5 years ago
Views:

1 Lower Fall Programming Contest 2017 Lower Division Oct. 28th 2017 Do not open until contest starts Instructions for Participants Contest URL: You have 5 hours to answer questions. You may submit solutions in the following languages: C/C++ (1999, 2011) 1

2 Java 8 C# ( ) Python (2.7 or 3.x) Perl Javascript (Node.js v4.2.6) You are only allowed access to official language documentation and COP3014 reference material. You are restricted to: C/C++: Java: C#: Python 2.7: Python 3.x: Perl: Javascript: COP3014 Reference: vastola/cop3014/ jayarama/prog1.php You are also allowed one textbook or material no larger than 8.5 x 11 x 2 volume. No other resources (e.g. Stack Overflow, Google, Wikipedia) are permitted. Using nonpermitted materials will lead to disqualification. Teams are restricted to using one workstation (computer) each. Use of a cell phone to circumvent these restrictions will lead to disqualification. Use of cell phones in contest rooms is not permitted. The Clarifications tab on Domjudge may be used to submit questions pertaining to each problem. Do not use this feature to request troubleshooting help. All input is redirected via STDIN. All output must be formatted to specification in terms of capitalization and spacing. Please refer to the example output for each question. Do not include a shebang in your submissions. Scoring: Teams are ranked according to score. A higher score is rewarded by answering more questions while acquiring fewer penalties. The team that solves the greatest number of questions in the quickest time wins. Teams which solve the same number of problems are ranked by least total time. Teams may resubmit solutions as many times as needed, but incorrect submission attempts will result in time penalties (and thus a lower score.) The scoreboard may be accessed during the first four hours of the contest. The scoreboard will freeze during the final hour. 2

3 1 Augustus Math Homework Many have thought that most of ancient Rome s secrets have been discovered, but recently ancient tomes belonging to Emperor Augustus have been unearthed! It seems to be mathematical equations written in Roman numerals, but sadly our translator has gotten lost in an Aqueduct, so we need your help to translate! Have we discovered equations that could change our understanding of the world!? Or is this simply homework that his pet lion ate. 1.1 Input The first line of input will be a single integer n representing the number of test cases for the program s execution. There will then be n expressions, for you to translate, each on their own line. Your can assume that all Roman numerals will be in uppercase, only in the range [1-10], and that each expression only has one operation. Furthermore, there will be a single space separating the Roman numerals and the operation. For reference, here are the Roman numerals 1-10: 1.2 Output Roman Decimal Roman Decimal I 1 VI 6 II 2 VII 7 III 3 VIII 8 IV 4 IX 9 V 5 X 10 You output should be a translation of each equation as well as a solution to the equation separated by an =. Include a single space between each number and operation, as well as a single space before and after the =. 1.3 Sample Input/Output = 2 I + I = 6 II + IV 5-2 = 3 V - II 3

4 2 Cycles Within Cycles Within Cycles Researchers at FSU have just made a shocking discovery... Everything has a cycle, and the cycles have cycles, and those cycles have cycles that have cycles that have cycles that have cycles that have cycles that have cycles that have cycles that have cycles that have cycles that have cycles that have cycles that have cycles that have cycles Even words have cycles in them, for example, if we take the word: cycles And shift all the letters to the left by three, we get: lescyc The letters at the beginning of the word, somehow end up at the end, and if we shift all letters to the left by three again: We end up where we started...with cycles. cycles However, in attempt to publish our discovery, some cynical people are not persuaded by our cyclical findings, so we (meaning you) must show them how these cycles work. 2.1 Input The first line of input will be a single integer representing the size of the string, followed by the string itself, and then finally the amount to left shift the string by per cycle. 2.2 Output Your output should be each cycle of the string, with the left shift performed on it. Each cycle must be on its own line, and the amount of cycles you need to perform is the size of the string. 2.3 Sample Input/Output 4 abcd 3 dabc cdab bcda abcd

5 3 Middle-Out Sorting After many hours of coffee and sugary treats from a nearby vending machine, a group of sleep deprived grad students at FSU have come up with a new sorting algorithm that will be sure to end all other sorting algorithms! The algorithm works like this, given a list of integers: The integers are sorted into ascending order The integers are then sorted with an alternating pattern: Lowest integer is placed first. Second lowest integer is placed last. Third lowest is placed second. Fourth lowest is placed second from last. This continues until the largest value is in the center of the pattern. Example of the algorithm in action: Given: Asc. order: Final Sort: It should be noted that it is possible that there can be repeating values in the list, and an even number of values to be sorted. 3.1 Input The first line of input will be a single integer n representing the number of integers that you will need to sort. The following line will be the n integers separated by whitespace. 3.2 Output Your output should be the integers sorted as described above, all on one line and separated by whitespace. 3.3 Sample Input/Output Sample Input Sample Output

6 4 Palindrome Primes 2: The Legend of Curly s Gold A positive integer is called a prime if it has exactly two distinct positive integer divisors: 1 and itself. A positive integer is called a palindrome if its base-10 representation reads the same forwards and backwards. Some palindromes: 2, 77, 101, 33333, A positive integer is called a palindromic prime if it is both a palindrome and a prime. 4.1 Input The first line of input will be a single integer n representing the number of test cases for the program s execution. There will then be n integers, each on their own line and greater than 10, and you are tasked with determining the total number of positive palindrome primes up to and including each number. It should be noted that one can say the palindrome primes up to and including 16 are 2,3,5,7,11. However, to avoid debate on single digit numbers being palindromes, you should only count 11 in this example, and in other examples only those greater then Output For each test case, output one line containing the number of positive palindrome primes up to and including that test case. 4.3 Sample Input/Output

7 5 A Not So Pascal Triangle Many people around the world know of Pascal s triangle, but few people are aware of Blaise s triangle. Blaise s triangle is similar to Pascal s, but far simpler. For any entry in the triangle, that is not on the bottom row, the value is determined by the two entries below: A B C D E F A = B + C B = D + E C = E + F Our computer has been trying to print out many of these triangles for use in *insert math class name here*, but has bugged out and now prints incomplete triangles. Your task is to determine the missing values. 5.1 Input The first line of input will be a single integer representing the number of missing variables in the additive pyramid. The following lines will be the pyramid itself, and you may assume the following: The pyramid always has a height of 3. The pyramid can have 1, 2, or 3 variables to solve for. The variable names will always be A, B, C. If there is one variable to solve, it will be labeled A; if two are to be solved, they will be A, B; If there are three they will be, A, B, C. All values are positive integers up to 100. It is possible for there to be two unknowns on same level. There will only be one solution per unknown. There is a single space between multiple values/unknowns 5.2 Output Your output should be the triangle with the value of the missing variables in place of the variables. To print out the triangle, first you should print the top of the triangle on its own line. The next line will be the second layer will be two integers separated by a single space, and the final layer will be three integers, each separated by a single space 5.3 Sample Input/Output 3 9 A B C 1 7

8 6 It Is Simply Chess...Yes? Ahhh yes, Chess, one of the most popular strategy games in the world. It is also quite hard. So we simply made a simple version. Known simply as Simple Chess, the rules are quite simple. Instead of that hard setup that normal chess has, we simply take the pieces and place them randomly on the board, and see if a piece can capture an enemy piece. To simplify things even more, there are only 4 types of pieces: Knight, which can move in an L shape two ways: Up, or down 2 spaces, then left or right 1 space. Left or right 2 spaces, then up or down 1 space. Rook, which can move going up, down, left, or right any distance. Bishop, which can move diagonally any distance. Queen, which can move up, down, left, right, or diagonally any distance. 6.2 Output The chess board is a standard 8x8 board, as shown here, and the labels A-H act as the x-coordinates for a piece, and the labels 1-8 act as the y- coordinates for a piece. 6.1 Input The first line of input will be a single integer n representing the number of chess pieces on the board. The following n lines are in the following format: White/Black piece, type of piece, x-coordinate, y-coordinate. Your output will be the move that a piece can take to capture an enemy piece. The format will be: The piece that can make the move, followed by a >,followed by the enemy piece being captured. There will be only one possible capture per input case, and each input will always have a capture move. Also, there will never be a case where two pieces can technically go at same time, e.g. no case where two rooks can capture each other. Finally, the pieces do not require line of sight, e.g. if a friendly piece is blocking the path of a rook to an enemy, the rook can still capture the enemy. 6.3 Sample Input/Output 4 WQB4>BKF8 WBA1 WQB4 BKF8 BBA2 8

A1 Problem Statement Unit Pricing

A1 Problem Statement Unit Pricing Given up to 10 items (weight in ounces and cost in dollars) determine which one by order (e.g. third) is the cheapest item in terms of cost per ounce. Also output the