Loading your saved progress…

programming tasks for middle school

loops
isPrime(n)
6 → "composite"
7 → "prime"
8 → "composite"
9 → "composite"
10 → "composite"
11 → "prime"
12 → "composite"
13 → "prime"
14 → "composite"
15 → "composite"
16 → "composite"
17 → "prime"
18 → "composite"
19 → "prime"
20 → "composite"
21 → "composite"
22 → "composite"
23 → "prime"
24 → "composite"
25 → "composite"
30 → "composite"
31 → "prime"
32 → "composite"
78 → "composite"
arrays
fewestBills(amount)
6 → [5, 1]
7 → [5, 1, 1]
11 → [10, 1]
18 → [10, 5, 1, 1, 1]
37 → [20, 10, 5, 1, 1]
58 → [50, 5, 1, 1, 1]
99 → [50, 20, 20, 5, 1, 1, 1, 1]
100 → [100]
101 → [100, 1]
157 → [100, 50, 5, 1, 1]
9 → [5, 1, 1, 1, 1]
10 → [10]
14 → [10, 1, 1, 1, 1]
15 → [10, 5]
16 → [10, 5, 1]
19 → [10, 5, 1, 1, 1, 1]
20 → [20]
21 → [20, 1]
24 → [20, 1, 1, 1, 1]
25 → [20, 5]
26 → [20, 5, 1]
29 → [20, 5, 1, 1, 1, 1]
30 → [20, 10]
31 → [20, 10, 1]
created by vitaly pavlenko