Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 8 additions & 0 deletions config.json
Original file line number Diff line number Diff line change
Expand Up @@ -406,6 +406,14 @@
"prerequisites": [],
"difficulty": 4
},
{
"slug": "all-your-base",
"name": "All Your Base",
"uuid": "db7caf7b-a9db-452d-830c-7840f6aa03fc",
"practices": [],
"prerequisites": [],
"difficulty": 5
},
{
"slug": "camicia",
"name": "Camicia",
Expand Down
28 changes: 28 additions & 0 deletions exercises/practice/all-your-base/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
# Instructions

Convert a sequence of digits in one base, representing a number, into a sequence of digits in another base, representing the same number.

~~~~exercism/note
Try to implement the conversion yourself.
Do not use something else to perform the conversion for you.
~~~~

## About [Positional Notation][positional-notation]

In positional notation, a number in base **b** can be understood as a linear combination of powers of **b**.

The number 42, _in base 10_, means:

`(4 × 10¹) + (2 × 10⁰)`

The number 101010, _in base 2_, means:

`(1 × 2⁵) + (0 × 2⁴) + (1 × 2³) + (0 × 2²) + (1 × 2¹) + (0 × 2⁰)`

The number 1120, _in base 3_, means:

`(1 × 3³) + (1 × 3²) + (2 × 3¹) + (0 × 3⁰)`

_Yes. Those three numbers above are exactly the same. Congratulations!_

[positional-notation]: https://en.wikipedia.org/wiki/Positional_notation
8 changes: 8 additions & 0 deletions exercises/practice/all-your-base/.docs/introduction.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
# Introduction

You've just been hired as professor of mathematics.
Your first week went well, but something is off in your second week.
The problem is that every answer given by your students is wrong!
Luckily, your math skills have allowed you to identify the problem: the student answers _are_ correct, but they're all in base 2 (binary)!
Amazingly, it turns out that each week, the students use a different base.
To help you quickly verify the student answers, you'll be building a tool to translate between bases.
20 changes: 20 additions & 0 deletions exercises/practice/all-your-base/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
{
"authors": [
"IsaacG"
],
"files": {
"solution": [
"all_your_base.gd"
],
"test": [
"all_your_base_test.gd",
"run_tests",
"lib/test_runner.gd",
"project.godot"
],
"example": [
".meta/example.gd"
]
},
"blurb": "Convert a number, represented as a sequence of digits in one base, to any other base."
}
19 changes: 19 additions & 0 deletions exercises/practice/all-your-base/.meta/example.gd
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
func rebase(input_base, digits, output_base):
if input_base < 2 or output_base < 2:
return null

var value = 0
for digit in digits:
if digit < 0 or digit >= input_base:
return null
value = value * input_base + digit

if value == 0:
return [0]

var rebased = []
while value > 0:
rebased.append(value % output_base)
value /= output_base
rebased.reverse()
return rebased
12 changes: 12 additions & 0 deletions exercises/practice/all-your-base/.meta/template.j2
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
{% for case in cases %}
func test_{{ case.func_name }}(solution_script):
var got = solution_script.{{ case.property | camel_to_snake }}({{ case.input.inputBase | togdscript }}, {{ case.input.digits | togdscript }}, {{ case.input.outputBase | togdscript }})
{%- if not case.expect_error %}
var want = {{ case.expected | togdscript }}
{%- else %}
var want = null
{%- endif %}
return [got, want]

{% endfor %}

73 changes: 73 additions & 0 deletions exercises/practice/all-your-base/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,73 @@
# 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.

[5ce422f9-7a4b-4f44-ad29-49c67cb32d2c]
description = "single bit one to decimal"

[0cc3fea8-bb79-46ac-a2ab-5a2c93051033]
description = "binary to single decimal"

[f12db0f9-0d3d-42c2-b3ba-e38cb375a2b8]
description = "single decimal to binary"

[2c45cf54-6da3-4748-9733-5a3c765d925b]
description = "binary to multiple decimal"

[65ddb8b4-8899-4fcc-8618-181b2cf0002d]
description = "decimal to binary"

[8d418419-02a7-4824-8b7a-352d33c6987e]
description = "trinary to hexadecimal"

[d3901c80-8190-41b9-bd86-38d988efa956]
description = "hexadecimal to trinary"

[5d42f85e-21ad-41bd-b9be-a3e8e4258bbf]
description = "15-bit integer"

[d68788f7-66dd-43f8-a543-f15b6d233f83]
description = "empty list"

[5e27e8da-5862-4c5f-b2a9-26c0382b6be7]
description = "single zero"

[2e1c2573-77e4-4b9c-8517-6c56c5bcfdf2]
description = "multiple zeros"

[3530cd9f-8d6d-43f5-bc6e-b30b1db9629b]
description = "leading zeros"

[a6b476a1-1901-4f2a-92c4-4d91917ae023]
description = "input base is one"

[e21a693a-7a69-450b-b393-27415c26a016]
description = "input base is zero"

[54a23be5-d99e-41cc-88e0-a650ffe5fcc2]
description = "input base is negative"

[9eccf60c-dcc9-407b-95d8-c37b8be56bb6]
description = "negative digit"

[232fa4a5-e761-4939-ba0c-ed046cd0676a]
description = "invalid positive digit"

[14238f95-45da-41dc-95ce-18f860b30ad3]
description = "output base is one"

[73dac367-da5c-4a37-95fe-c87fad0a4047]
description = "output base is zero"

[13f81f42-ff53-4e24-89d9-37603a48ebd9]
description = "output base is negative"

[0e6c895d-8a5d-4868-a345-309d094cfe8d]
description = "both bases are negative"
2 changes: 2 additions & 0 deletions exercises/practice/all-your-base/all_your_base.gd
Original file line number Diff line number Diff line change
@@ -0,0 +1,2 @@
func rebase(input_base, digits, output_base):
pass
124 changes: 124 additions & 0 deletions exercises/practice/all-your-base/all_your_base_test.gd
Original file line number Diff line number Diff line change
@@ -0,0 +1,124 @@
func test_single_bit_one_to_decimal(solution_script):
var got = solution_script.rebase(2, [1], 10)
var want = [1]
return [got, want]


func test_binary_to_single_decimal(solution_script):
var got = solution_script.rebase(2, [1, 0, 1], 10)
var want = [5]
return [got, want]


func test_single_decimal_to_binary(solution_script):
var got = solution_script.rebase(10, [5], 2)
var want = [1, 0, 1]
return [got, want]


func test_binary_to_multiple_decimal(solution_script):
var got = solution_script.rebase(2, [1, 0, 1, 0, 1, 0], 10)
var want = [4, 2]
return [got, want]


func test_decimal_to_binary(solution_script):
var got = solution_script.rebase(10, [4, 2], 2)
var want = [1, 0, 1, 0, 1, 0]
return [got, want]


func test_trinary_to_hexadecimal(solution_script):
var got = solution_script.rebase(3, [1, 1, 2, 0], 16)
var want = [2, 10]
return [got, want]


func test_hexadecimal_to_trinary(solution_script):
var got = solution_script.rebase(16, [2, 10], 3)
var want = [1, 1, 2, 0]
return [got, want]


func test_15_bit_integer(solution_script):
var got = solution_script.rebase(97, [3, 46, 60], 73)
var want = [6, 10, 45]
return [got, want]


func test_empty_list(solution_script):
var got = solution_script.rebase(2, [], 10)
var want = [0]
return [got, want]


func test_single_zero(solution_script):
var got = solution_script.rebase(10, [0], 2)
var want = [0]
return [got, want]


func test_multiple_zeros(solution_script):
var got = solution_script.rebase(10, [0, 0, 0], 2)
var want = [0]
return [got, want]


func test_leading_zeros(solution_script):
var got = solution_script.rebase(7, [0, 6, 0], 10)
var want = [4, 2]
return [got, want]


func test_input_base_is_one(solution_script):
var got = solution_script.rebase(1, [0], 10)
var want = null
return [got, want]


func test_input_base_is_zero(solution_script):
var got = solution_script.rebase(0, [], 10)
var want = null
return [got, want]


func test_input_base_is_negative(solution_script):
var got = solution_script.rebase(-2, [1], 10)
var want = null
return [got, want]


func test_negative_digit(solution_script):
var got = solution_script.rebase(2, [1, -1, 1, 0, 1, 0], 10)
var want = null
return [got, want]


func test_invalid_positive_digit(solution_script):
var got = solution_script.rebase(2, [1, 2, 1, 0, 1, 0], 10)
var want = null
return [got, want]


func test_output_base_is_one(solution_script):
var got = solution_script.rebase(2, [1, 0, 1, 0, 1, 0], 1)
var want = null
return [got, want]


func test_output_base_is_zero(solution_script):
var got = solution_script.rebase(10, [7], 0)
var want = null
return [got, want]


func test_output_base_is_negative(solution_script):
var got = solution_script.rebase(2, [1], -7)
var want = null
return [got, want]


func test_both_bases_are_negative(solution_script):
var got = solution_script.rebase(-2, [1], -7)
var want = null
return [got, want]
Loading
Loading