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

questions and reformat with java

Browse Source
This commit is contained in:
Xevion
2019-09-15 14:17:48 -05:00
parent c3872f1309
commit 127f21b7fc
1 changed files with 20 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -21,7 +21,7 @@ Super simple math.
This one deals with integer division. This one deals with integer division.
``` ```java
27 / 2 = 13 27 / 2 = 13
13 / 2 = 6 13 / 2 = 6
6 / 2 = 3 6 / 2 = 3
@@ -42,7 +42,7 @@ The for loop operates on every index in the String up the center, which ends up
For each index in the String being operated upon, the String `t` has the index being accessed and the last index in the String `s` added (always `e`). For each index in the String being operated upon, the String `t` has the index being accessed and the last index in the String `s` added (always `e`).
``` ```java
0 => He 0 => He
1 => oe 1 => oe
2 => we 2 => we
@@ -68,7 +68,7 @@ The final array looks like `[0, 0, 4, 0, 0]`
This is just pretty awful parantheses aside from the initial solving. This is just pretty awful parantheses aside from the initial solving.
``` ```java
!(!(!(...))) !(!(!(...)))
!true || !false && !false !true || !false && !false
false || true && true false || true && true
@@ -77,11 +77,23 @@ This is just pretty awful parantheses aside from the initial solving.
!(!(!(true))) !(!(!(true)))
!(!(false)) !(!(false))
!(true) !(true)
false
``` ```
## Question 8 ## Question 8
This one actually tricked me because I'm really dumb and can't read; they are `if`s and `else if`s to look for here.
It's pretty easy modulus, I got `ABE`.
## Question 9 ## Question 9
Just a little
```java
```
## Question 10 ## Question 10
## Question 11 ## Question 11
## Question 12 ## Question 12
@@ -95,7 +107,7 @@ First parameter is the number, second is the base.
Remember for 123<sub>4</sub>, the maximum values for each digit in order from left-to-right (ending on the right), with the number it's used to build (right * 4 = left) would be... Remember for 123<sub>4</sub>, the maximum values for each digit in order from left-to-right (ending on the right), with the number it's used to build (right * 4 = left) would be...
``` ```java
n(n/4) - 256(64) - 64(16) - 16(4) - 4(1). n(n/4) - 256(64) - 64(16) - 16(4) - 4(1).
``` ```
@@ -161,7 +173,7 @@ Otherwise, it will recursively return `fOne(fTwo(s, s.lastIndexOf("#")))`, as me
Let's diagnose the output for real and see what is really going on. Let's diagnose the output for real and see what is really going on.
``` ```java
1 => H#i#t#h#i#s#i#s#f#u#n 1 => H#i#t#h#i#s#i#s#f#u#n
2 => H#i#t#h#i#s#i#s#f#un 2 => H#i#t#h#i#s#i#s#f#un
3 => Hi#t#h#i#s#i#s#f#un 3 => Hi#t#h#i#s#i#s#f#un
@@ -220,7 +232,7 @@ To start understanding the pattern, we should break it apart.
`@` matches a single `@` character. We should take a moment to note that the sections before and this match these these kinds of emails: `@` matches a single `@` character. We should take a moment to note that the sections before and this match these these kinds of emails:
``` ```java
jgu6oaouih23_6@ jgu6oaouih23_6@
d9hi@ d9hi@
i_3@ i_3@
@@ -229,7 +241,7 @@ f@
but not these but not these
``` ```java
@ @
^35a@ ^35a@
@ @