Winners:
!st place: Team PM
2nd place: Team ReactToChallenge
3rd place: Little Lads
Raffle Prize Winners:
Pranav B.
Neela
Santosh
Overview:
Number of Registrations: 41
Total Participants: 33
Number of Teams: 31
Total Countries: 4+
Total Prizes: 6
Total Judges: 4
Total States: 8+
PROBLEMS
Five problems were presented in the Andromeda AI Hackathon on the 24th of October. They were ordered in difficulty from 1 being the least complex to 5 being the most complex. For problems 1,2,3 each team was given 5 minutes to read the problem, 15 minutes to solve the problem, and 5 minutes to submit the solution. For problems 4,5 each team was given 5 minutes to read the question, 30 minutes to solve the problem, and 5 minutes to submit the solution.
Problem 1
The Andromeda AI galaxy has finally gone to the big ranks! We have become popular enough to sit with the other galaxies. Now we are competing about who has the most vowels in their name. To prove our intelligence, the galaxies has tasked us with naming the galaxy with the most vowels (a,e,i,o,u). We are letting you and your team help us, don't let us down! Create a function that takes an array as an input, and returns the galaxy with the most vowels.
Input:
-
String[] arr: a list of strings(different galaxy names)
Output:
-
An string from the array arr containing the most vowels
Problem 2
The Andromeda Galaxy is participating in the universal golf tournament. The rules of this game is that you can score points equal to the displacement of the golf ball (goal-starting position) relative to the goal. The Andromeda Galaxy team goes last, so we must choose a starting point that will let us win. What is the closest starting point from which the Andromeda Galaxy team can hit the golf ball while scoring the highest, winning the tournament?
Note: It’s guaranteed that there’s a way to win.
Input:
-
Int s: length of array of starting position
-
Int k: highest score so far
-
Int[] pos: Array of length s; integers indicating possible starting position relative to the goal
Output:
-
Int indicating the starting position
Example:
Input: 3, 2, [1, 2, 3]
Output: 3
Problem 3
You and your friend take turns (you go first) popping balloons. Each turn, you or your friend can pop 1 or 2 balloons from the front of a line of balloons. Whoever pops the last balloon loses. Predict whether or not you will win, assuming that each player plays optimally.
Note: You go first
Input:
-
Int num: an integer representing the number of balloons in the start
Output:
-
String: "WIN" or "LOSE"
Example:
Input: 3
Output: WIN
Problem 4
In the year 2121, the Andromeda Galaxy team is participating in the international foosball competition, each team is required to play every other team x time(s). If y number of games were played, how many teams total played in the competition? Write a function that takes an integer x representing the number of games each team has to play with the other and y representing the number of total games played, and returns the number of teams that were a part of the foosball competition.
Input:
-
Int x: the number of games each team has to play with the other
-
Int y: the number of total games played
Output:
-
Int: the number of teams that were a part of the foosball competition
Problem 5
There are some mysterious planets that have joined the Solar System. Earth scientists want to send rovers to investigate these new planets. However, to find out the precautions that need to be taken to protect the rover from extreme temperatures, scientists need to know what temperatures to expect on these new planets. Use this data to create a function to predict the average distance in Astronomical units of an unknown planet revolving around the sun from its average temperature in C°.
Input:
-
Float x: average temperature in C°
Output:
-
Float: distance in AU (astronomical units)
Team | score (1) | score (2) | score (3) | score (4) | score (5) | total |
---|---|---|---|---|---|---|
I'm solo for now | 0 | 0 | 0 | 0 | 0 | 0 |
PM: 1ST PLACE | 25 | 25 | 25 | 25 | 25 | 125 |
Ageria | 5 | 5 | 5 | 0 | 5 | 20 |
No | 0 | 0 | 0 | 0 | 0 | 0 |
ShootingStar | 5 | 0 | 0 | 0 | 0 | 5 |
The Singularity | 0 | 0 | 0 | 0 | 0 | 0 |
CSE | 5 | 0 | 0 | 0 | 0 | 5 |
Cat Squad: RUNNER UP | 5 | 5 | 25 | 5 | 0 | 40 |
ReactToChallenge: 2ND PLACE | 25 | 25 | 25 | 25 | 24 | 124 |
little lads: 3RD PLACE | 15 | 5 | 14 | 5 | 23 | 62 |
Shree | 0 | 0 | 0 | 0 | 0 | 0 |
TBD(To Be Determined) | 5 | 0 | 0 | 0 | 0 | 5 |
Pranav | 5 | 0 | 0 | 0 | 0 | 5 |
Anish | 5 | 0 | 0 | 0 | 0 | 5 |
Eagles | 5 | 0 | 5 | 0 | 0 | 10 |
Kodinng
| 5 | 5 | 5 | 0 | 5 | 20 |
Be creative
| 5 | 0 | 0 | 0 | 0 | 5 |
Smart Smurf
| 5 | 25 | 5 | 0 | 0 | 35 |
Noobatcoding
| 5 | 0 | 0 | 0 | 0 | 5 |