xevion/contest
1
0
Fork 0
mirror of https://github.com/Xevion/contest.git synced 2025-12-06 17:14:40 -06:00
Code Issues Packages Projects Releases Wiki Activity

Update READMEs

Browse Source
This commit is contained in:
Xevion
2019-09-15 17:49:45 -05:00
parent 537bf647ea
commit 79aaaa4124
2 changed files with 8 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
README.md
View File

@@ -1,3 +1,5 @@
# contest
Simple project for managing contests I've tested the waters in. Done primarily in Python as of now (Sep 9, 2019).
This repository manages my contest answers, UIL explanations and more.
Currently done in Python and Java.

8
uil/uil-practice-armstrong/UIL.md
View File

@@ -1,5 +1,7 @@
# UIL Eligibility Packet
Question 1-26 are done in full. From then on, only harder problems will be explained at much lighter levels to save time while completing this packet.
## Question 1
This can be guessed on pretty easily by analyzing the magnitudes of the powers. Every number here is within a mildly close range of eachother, and the highest numbers have some of the *lowest* powers, so we can assume that the one with the highest power will be the largest when evaluated.
@@ -193,7 +195,7 @@ Pre-increment `dragon.level++`
The final equation looks like `4 + 5 + 5 = 14`.
`x = 4 and y = 6` in the end, however.
`x = 4 and y = 6` in the end.
## Question 14
@@ -437,10 +439,10 @@ Matches!
## Question 26
This is a rather long problem, so let's split it up into the patrs.
This is a rather long problem, so let's split it up into parts.
### Class X
Class X is a implementation of the Comparable Interface, and is essentially a method for comparing Strings when sorted. Focus on the `compareTo` method.
The `compareTo` method
The `compareTo` method is how comparables "compare", and it returns a integer value to representation how it should be placed in the array. The array is sorted in descending order when `Collections.sort` is called on it.