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

question 33 i mod 7 + 3 for i in range 1 to 99

Browse Source
This commit is contained in:
Xevion
2019-11-20 01:11:36 -06:00
parent 66a4563b12
commit ca1eca7675
1 changed files with 9 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
uil/uil-practice-armstrong/test-1/EXPLANATIOn.md
View File

@@ -538,6 +538,15 @@ Otherwise, for primitives, it will use **Dual-Pivot Quicksort**.
## Question 33
Here, you build an ArrayList of ArrayLists and print out the third array.
Here, you'll want to concentrate on every number from 1 to 100 that is both odd, and when divided by 7, has a remainder of 3.
It needs to be odd because you start at 1 and move along by 2 each iteration (`3 % 2 = 1`), and it needs to have a remainder of 3 when divided by 7 because it selects the correlating ArrayList based on the current number mod `7`, and since we focus on the ArrayList at index `3`,
To find all of them, start looking at every odd number that is divisible by both 7 and 2 in the range [1, 100), a good way to do this is start at 3 and add 14 continuously until your reach 99 or less.
The list of these numbers is the output.
## Question 34
## Question 35