-
-
Notifications
You must be signed in to change notification settings - Fork 69
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
add new practice exercise two bucket
- Loading branch information
Showing
7 changed files
with
161 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,46 @@ | ||
# Instructions | ||
|
||
Given two buckets of different size and which bucket to fill first, determine how many actions are required to measure an exact number of liters by strategically transferring fluid between the buckets. | ||
|
||
There are some rules that your solution must follow: | ||
|
||
- You can only do one action at a time. | ||
- There are only 3 possible actions: | ||
1. Pouring one bucket into the other bucket until either: | ||
a) the first bucket is empty | ||
b) the second bucket is full | ||
2. Emptying a bucket and doing nothing to the other. | ||
3. Filling a bucket and doing nothing to the other. | ||
- After an action, you may not arrive at a state where the initial starting bucket is empty and the other bucket is full. | ||
|
||
Your program will take as input: | ||
|
||
- the size of bucket one | ||
- the size of bucket two | ||
- the desired number of liters to reach | ||
- which bucket to fill first, either bucket one or bucket two | ||
|
||
Your program should determine: | ||
|
||
- the total number of actions it should take to reach the desired number of liters, including the first fill of the starting bucket | ||
- which bucket should end up with the desired number of liters - either bucket one or bucket two | ||
- how many liters are left in the other bucket | ||
|
||
Note: any time a change is made to either or both buckets counts as one (1) action. | ||
|
||
Example: | ||
Bucket one can hold up to 7 liters, and bucket two can hold up to 11 liters. | ||
Let's say at a given step, bucket one is holding 7 liters and bucket two is holding 8 liters (7,8). | ||
If you empty bucket one and make no change to bucket two, leaving you with 0 liters and 8 liters respectively (0,8), that counts as one action. | ||
Instead, if you had poured from bucket one into bucket two until bucket two was full, resulting in 4 liters in bucket one and 11 liters in bucket two (4,11), that would also only count as one action. | ||
|
||
Another Example: | ||
Bucket one can hold 3 liters, and bucket two can hold up to 5 liters. | ||
You are told you must start with bucket one. | ||
So your first action is to fill bucket one. | ||
You choose to empty bucket one for your second action. | ||
For your third action, you may not fill bucket two, because this violates the third rule -- you may not end up in a state after any action where the starting bucket is empty and the other bucket is full. | ||
|
||
Written with <3 at [Fullstack Academy][fullstack] by Lindsay Levine. | ||
|
||
[fullstack]: https://www.fullstackacademy.com/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,17 @@ | ||
{ | ||
"authors": [], | ||
"files": { | ||
"solution": [ | ||
"two-bucket.jl" | ||
], | ||
"test": [ | ||
"runtests.jl" | ||
], | ||
"example": [ | ||
".meta/example.jl" | ||
] | ||
}, | ||
"blurb": "Given two buckets of different size, demonstrate how to measure an exact number of liters.", | ||
"source": "Water Pouring Problem", | ||
"source_url": "https://demonstrations.wolfram.com/WaterPouringProblem/" | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,9 @@ | ||
function twobucket(bucket1, bucket2, goal, start) | ||
goal == (bucket1, bucket2)[start] && return (1, start, 0) | ||
goal == (bucket1, bucket2)[mod1(start+1,2)] && return (2, mod1(start+1,2), (bucket1, bucket2)[start]) | ||
b1, b2 = isone(start) ? (bucket1, bucket2) : (bucket2, bucket1) | ||
n = findfirst(==(goal), b1 < b2 ? (b1:b1:lcm(b1,b2)) .% b2 : reverse((b2:b2:lcm(b1,b2)-1) .% b1)) | ||
isnothing(n) && throw(DomainError(goal, "impossible")) | ||
empties = min(b1, b2)n ÷ max(b1, b2) - (goal < b1 < b2) | ||
goal < b1 ? (2n + 2empties, start, b2) : (2n + 2empties, 2, 0) | ||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,37 @@ | ||
# This is an auto-generated file. | ||
# | ||
# Regenerating this file via `configlet sync` will: | ||
# - Recreate every `description` key/value pair | ||
# - Recreate every `reimplements` key/value pair, where they exist in problem-specifications | ||
# - Remove any `include = true` key/value pair (an omitted `include` key implies inclusion) | ||
# - Preserve any other key/value pair | ||
# | ||
# As user-added comments (using the # character) will be removed when this file | ||
# is regenerated, comments can be added via a `comment` key. | ||
|
||
[a6f2b4ba-065f-4dca-b6f0-e3eee51cb661] | ||
description = "Measure using bucket one of size 3 and bucket two of size 5 - start with bucket one" | ||
|
||
[6c4ea451-9678-4926-b9b3-68364e066d40] | ||
description = "Measure using bucket one of size 3 and bucket two of size 5 - start with bucket two" | ||
|
||
[3389f45e-6a56-46d5-9607-75aa930502ff] | ||
description = "Measure using bucket one of size 7 and bucket two of size 11 - start with bucket one" | ||
|
||
[fe0ff9a0-3ea5-4bf7-b17d-6d4243961aa1] | ||
description = "Measure using bucket one of size 7 and bucket two of size 11 - start with bucket two" | ||
|
||
[0ee1f57e-da84-44f7-ac91-38b878691602] | ||
description = "Measure one step using bucket one of size 1 and bucket two of size 3 - start with bucket two" | ||
|
||
[eb329c63-5540-4735-b30b-97f7f4df0f84] | ||
description = "Measure using bucket one of size 2 and bucket two of size 3 - start with bucket one and end with bucket two" | ||
|
||
[449be72d-b10a-4f4b-a959-ca741e333b72] | ||
description = "Not possible to reach the goal" | ||
|
||
[aac38b7a-77f4-4d62-9b91-8846d533b054] | ||
description = "With the same buckets but a different goal, then it is possible" | ||
|
||
[74633132-0ccf-49de-8450-af4ab2e3b299] | ||
description = "Goal larger than both buckets is impossible" |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,41 @@ | ||
using Test | ||
|
||
include("two-bucket.jl") | ||
|
||
@testset verbose = true "tests" begin | ||
@testset "Measure using bucket one of size 3 and bucket two of size 5 - start with bucket one" begin | ||
@test twobucket(3, 5, 1, 1) == (4, 1, 5) | ||
end | ||
|
||
@testset "Measure using bucket one of size 3 and bucket two of size 5 - start with bucket two" begin | ||
@test twobucket(3, 5, 1, 2) == (8, 2, 3) | ||
end | ||
|
||
@testset "Measure using bucket one of size 7 and bucket two of size 11 - start with bucket one" begin | ||
@test twobucket(7, 11, 2, 1) == (14, 1, 11) | ||
end | ||
|
||
@testset "Measure using bucket one of size 7 and bucket two of size 11 - start with bucket two" begin | ||
@test twobucket(7, 11, 2, 2) == (18, 2, 7) | ||
end | ||
|
||
@testset "Measure one step using bucket one of size 1 and bucket two of size 3 - start with bucket two" begin | ||
@test twobucket(1, 3, 3, 2) == (1, 2, 0) | ||
end | ||
|
||
@testset "Measure using bucket one of size 2 and bucket two of size 3 - start with bucket one and end with bucket two" begin | ||
@test twobucket(2, 3, 3, 1) == (2, 2, 2) | ||
end | ||
|
||
@testset "Not possible to reach the goal" begin | ||
@test_throws DomainError twobucket(6, 15, 5, 1) | ||
end | ||
|
||
@testset "With the same buckets but a different goal, then it is possible" begin | ||
@test twobucket(6, 15, 9, 1) == (10, 2, 0) | ||
end | ||
|
||
@testset "Goal larger than both buckets is impossible" begin | ||
@test_throws DomainError twobucket(5, 7, 8, 1) | ||
end | ||
end |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,3 @@ | ||
function twobucket(bucket1, bucket2, goal, start) | ||
# Your code here | ||
end |