Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add eliuds-eggs exercise #411

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open
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 @@ -60,6 +60,14 @@
],
"difficulty": 1
},
{
"slug": "eliuds-eggs",
"name": "Eliuds Eggs",
"uuid": "493be46b-6cb3-4591-87db-b0a17e9238ee",
"practices": [],
"prerequisites": [],
"difficulty": 2
},
{
"slug": "difference-of-squares",
"name": "Difference of Squares",
Expand Down
8 changes: 8 additions & 0 deletions exercises/practice/eliuds-eggs/.docs/instructions.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,8 @@
# Instructions

Your task is to count the number of 1 bits in the binary representation of a number.

## Restrictions

Keep your hands off that bit-count functionality provided by your standard library!
Solve this one yourself using other basic tools instead.
47 changes: 47 additions & 0 deletions exercises/practice/eliuds-eggs/.docs/introduction.md
Original file line number Diff line number Diff line change
@@ -0,0 +1,47 @@
# Introduction

Your friend Eliud inherited a farm from her grandma Tigist.
Her granny was an inventor and had a tendency to build things in an overly complicated manner.
The chicken coop has a digital display showing an encoded number representing the positions of all eggs that could be picked up.

Eliud is asking you to write a program that shows the actual number of eggs in the coop.

The position information encoding is calculated as follows:

1. Scan the potential egg-laying spots and mark down a `1` for an existing egg or a `0` for an empty spot.
2. Convert the number from binary to decimal.
3. Show the result on the display.

Example 1:

```text
Chicken Coop:
_ _ _ _ _ _ _
|E| |E|E| | |E|

Resulting Binary:
1 0 1 1 0 0 1

Decimal number on the display:
89

Actual eggs in the coop:
4
```

Example 2:

```text
Chicken Coop:
_ _ _ _ _ _ _ _
| | | |E| | | | |

Resulting Binary:
0 0 0 1 0 0 0 0

Decimal number on the display:
16

Actual eggs in the coop:
1
```
19 changes: 19 additions & 0 deletions exercises/practice/eliuds-eggs/.meta/config.json
Original file line number Diff line number Diff line change
@@ -0,0 +1,19 @@
{
"authors": [
"keiravillekode"
],
"files": {
"solution": [
"eliuds_eggs.zig"
],
"test": [
"test_eliuds_eggs.zig"
],
"example": [
".meta/example.zig"
]
},
"blurb": "Help Eliud count the number of eggs in her chicken coop by counting the number of 1 bits in a binary representation.",
"source": "Christian Willner, Eric Willigers",
"source_url": "https://forum.exercism.org/t/new-exercise-suggestion-pop-count/7632/5"
}
9 changes: 9 additions & 0 deletions exercises/practice/eliuds-eggs/.meta/example.zig
Original file line number Diff line number Diff line change
@@ -0,0 +1,9 @@
pub fn eggCount(number: usize) usize {
var result: usize = 0;
var n = number;
while (n > 0) {
n -= n & (0 -% n);
result += 1;
}
return result;
}
22 changes: 22 additions & 0 deletions exercises/practice/eliuds-eggs/.meta/tests.toml
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
# 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.

[559e789d-07d1-4422-9004-3b699f83bca3]
description = "0 eggs"

[97223282-f71e-490c-92f0-b3ec9e275aba]
description = "1 egg"

[1f8fd18f-26e9-4144-9a0e-57cdfc4f4ff5]
description = "4 eggs"

[0c18be92-a498-4ef2-bcbb-28ac4b06cb81]
description = "13 eggs"
4 changes: 4 additions & 0 deletions exercises/practice/eliuds-eggs/eliuds_eggs.zig
Original file line number Diff line number Diff line change
@@ -0,0 +1,4 @@
pub fn eggCount(number: usize) usize {
_ = number;
@compileError("please implement the eggCount function");
}
28 changes: 28 additions & 0 deletions exercises/practice/eliuds-eggs/test_eliuds_eggs.zig
Original file line number Diff line number Diff line change
@@ -0,0 +1,28 @@
const std = @import("std");
const testing = std.testing;

const eliuds_eggs = @import("eliuds_eggs.zig");

test "0 eggs" {
const expected: usize = 0;
const actual = eliuds_eggs.eggCount(0);
try testing.expectEqual(expected, actual);
}

test "1 egg" {
const expected: usize = 1;
const actual = eliuds_eggs.eggCount(16);
try testing.expectEqual(expected, actual);
}

test "4 eggs" {
const expected: usize = 4;
const actual = eliuds_eggs.eggCount(89);
try testing.expectEqual(expected, actual);
}

test "13 eggs" {
const expected: usize = 13;
const actual = eliuds_eggs.eggCount(2000000000);
try testing.expectEqual(expected, actual);
}