Official Suncoast Programming Competition!
Each problem has a filename, make sure to name your file for that problem as so
When you push your changes to github it will show you in the actions tab the status for each problem You MUST get the points for each question in order to actually complete the problem. Points are not reflective of your score.
Filename: pizza.py
Problem: Joe is ordering pizza for a party. He wants to know if the leftover slices will be able to be evenly split among his family. Assume that everyone at the party will eat all the pizza slices until they can no longer be evanly split between them. Take the input of 3 variables The amount of pizza slices ordered, the party size, and the size of Joe's family. Return True if the leftover pizza can be evenly split among the family, return False if it cannot.
Example Input 1:
73
13
4
Example Output 1:
True
Example Input 2:
49
11
3
Example Output 2:
False
Filename: data.py
Problem: A company is collecting data on how many families plan on attendeing an event. The company wants to data store about how many people are attending their event but they may not have enough room to store the number if it is to long. The average family attending is a family of 5. Given the number of familys attending return the length of the number of people attending.
Example Input:
392
Example Output:
4
Filename: crossword.py
Problem: Phelipe is wants to know if he combines a prefix with a word if it will fit in his crossword puzzle. You will be given two stings, a prefix and a word, and you wil be given the length of the correct answer. If the word is the correct length return the word (prefix then body), if the word does not fit return False. Tip: The prefix will always be shoreter than the body.
Example Input 1:
value
de
7
Example Output 1:
devalue
Example Input 2:
dis
appear
8
Example Output 2:
False
Filename: lazer.py
Problem: A lazer tag company wants a program that will retern a games team scores ordered. The first number inputed will be how many people played there is always an even number of players. Then each players socre will be inputed. Each team is grouped together so the first and second palyer would be on a team, the third and frouth player will be on a team, and so on. You should out put the team scores in an list ordered from least to greatest.
Example Input:
8
48
53
24
36
62
23
45
57
Example Output:
[60, 85, 101, 102]
Filename: diamonds.py
Problem: A student is bored in class and is trying to make diamond shapes out of asterics. The student wants the diamonds to be symetrical and vary in size. Your input will be how many diamonds you should output (it will always be and odd amount). You should output teh amount of diomands requested with a space between each one. The middle diamond should be the largest and the first and last diamonds should be the smallest. Your output should be symmetrical.
Example Input 1:
7
Example Output 1:
*
*
***
*
*
***
*****
***
*
*
***
*****
*******
*****
***
*
*
***
*****
***
*
*
***
*
*
Example Input 2:
3
Example Output 2:
*
*
***
*
*
Hint: First try to make code that can make diamond given the number of lines long it should be. For example given 5 the code should retrurn a diamond that is 5 lines long. Diamonds should only ever have an odd number of lines.
Hint Example Input 1:
5
Hint Example Output 1:
*
***
*****
***
*
Hint Example Input 2:
3
Hint Example Output 2:
*
***
*
Hint Example Input 3:
1
Hint Example Output 3:
*