summaryrefslogtreecommitdiff
path: root/exercises/064_builtins.zig
diff options
context:
space:
mode:
authorIbrahim Muftee <ibrahim@muftee.net>2026-06-29 15:11:40 -0500
committerIbrahim Muftee <ibrahim@muftee.net>2026-06-29 15:15:14 -0500
commitbdfe3df2947f8787c8a4ef8c534f6a8932e13871 (patch)
treef2df9a5f56b6c7f95c0978a861cb0ecf60560391 /exercises/064_builtins.zig
parentd093f37e1e4c5aed4a4c8d4999001134aec251ca (diff)
feat: begin solving exercises
Diffstat (limited to 'exercises/064_builtins.zig')
-rw-r--r--exercises/064_builtins.zig4
1 files changed, 2 insertions, 2 deletions
diff --git a/exercises/064_builtins.zig b/exercises/064_builtins.zig
index e91dfbe..b1c23fb 100644
--- a/exercises/064_builtins.zig
+++ b/exercises/064_builtins.zig
@@ -63,7 +63,7 @@ pub fn main() void {
//
// If there was no overflow at all while adding 5 to a, what value would
// 'my_result' hold? Write the answer in into 'expected_result'.
- const expected_result: u8 = ???;
+ const expected_result: u8 = 0b10010;
print(". Without overflow: {b:0>8}. ", .{expected_result});
print("Furthermore, ", .{});
@@ -78,6 +78,6 @@ pub fn main() void {
// Now it's your turn. See if you can fix this attempt to use
// this builtin to reverse the bits of a u8 integer.
const input: u8 = 0b11110000;
- const tupni: u8 = @bitReverse(input, tupni);
+ const tupni: u8 = @bitReverse(input);
print("{b:0>8} backwards is {b:0>8}.\n", .{ input, tupni });
}