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 #68

Merged
merged 1 commit into from
Oct 19, 2024
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 @@ -57,6 +57,14 @@
"practices": [],
"prerequisites": [],
"difficulty": 2
},
{
"slug": "eliuds-eggs",
"name": "Eliud's Eggs",
"uuid": "a37ab7a3-6757-43db-b09c-80a93fd46605",
"practices": [],
"prerequisites": [],
"difficulty": 3
}
]
},
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.s"
],
"test": [
"eliuds_eggs_test.c"
],
"example": [
".meta/example.s"
]
},
"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"
}
22 changes: 22 additions & 0 deletions exercises/practice/eliuds-eggs/.meta/example.s
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
.text
.globl egg_count

/* extern int egg_count(uint64_t number); */
egg_count:
mov x1, #1
mov x2, x0 /* current number */
ror x3, x1, #1 /* most significant bit 1, other bits 0 */
mov x0, #0 /* egg count */

.loop:
cmp x2, #0
beq .return

clz x4, x2 /* count leading zero bits */
ror x5, x3, x4
eor x2, x2, x5 /* clear highest bit */
add x0, x0, #1 /* increment egg count */
b .loop

.return:
ret
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"
36 changes: 36 additions & 0 deletions exercises/practice/eliuds-eggs/Makefile
Original file line number Diff line number Diff line change
@@ -0,0 +1,36 @@
AS = aarch64-linux-gnu-as
CC = aarch64-linux-gnu-gcc

CFLAGS = -g -Wall -Wextra -pedantic -Werror
LDFLAGS =

ALL_LDFLAGS = -pie -Wl,--fatal-warnings

ALL_CFLAGS = -std=c99 -fPIE $(CFLAGS)
ALL_LDFLAGS += $(LDFLAGS)

C_OBJS = $(patsubst %.c,%.o,$(wildcard *.c))
AS_OBJS = $(patsubst %.s,%.o,$(wildcard *.s))
ALL_OBJS = $(filter-out example.o,$(C_OBJS) $(AS_OBJS) vendor/unity.o)

CC_CMD = $(CC) $(ALL_CFLAGS) -c -o $@ $<

all: tests
qemu-aarch64 -L /usr/aarch64-linux-gnu ./$<

tests: $(ALL_OBJS)
@$(CC) $(ALL_CFLAGS) $(ALL_LDFLAGS) -o $@ $(ALL_OBJS)

%.o: %.s
@$(AS) -o $@ $<

%.o: %.c
@$(CC_CMD)

vendor/unity.o: vendor/unity.c vendor/unity.h vendor/unity_internals.h
@$(CC_CMD)

clean:
@rm -f *.o vendor/*.o tests

.PHONY: all clean
5 changes: 5 additions & 0 deletions exercises/practice/eliuds-eggs/eliuds_eggs.s
Original file line number Diff line number Diff line change
@@ -0,0 +1,5 @@
.text
.globl egg_count

egg_count:
ret
45 changes: 45 additions & 0 deletions exercises/practice/eliuds-eggs/eliuds_eggs_test.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,45 @@
#include "vendor/unity.h"

#include <stdint.h>

extern int egg_count(uint64_t number);

void setUp(void) {
}

void tearDown(void) {
}

void test_0_eggs(void) {
TEST_ASSERT_EQUAL_INT(0, egg_count(0));
}

void test_1_egg(void) {
TEST_IGNORE();
TEST_ASSERT_EQUAL_INT(1, egg_count(16));
}

void test_4_eggs(void) {
TEST_IGNORE();
TEST_ASSERT_EQUAL_INT(4, egg_count(89));
}

void test_13_eggs(void) {
TEST_IGNORE();
TEST_ASSERT_EQUAL_INT(13, egg_count(2000000000));
}

void test_25_eggs(void) {
TEST_IGNORE();
TEST_ASSERT_EQUAL_INT(25, egg_count(6005004003002001));
}

int main(void) {
UNITY_BEGIN();
RUN_TEST(test_0_eggs);
RUN_TEST(test_1_egg);
RUN_TEST(test_4_eggs);
RUN_TEST(test_13_eggs);
RUN_TEST(test_25_eggs);
return UNITY_END();
}
Loading