section .data
fib_array db 0, 1, 1, 2, 3, 5, 8, 13, 21, 34
msg db “Fibonacci numbers:”, 10, 0

section .text
global _start

_start:
; Print message
mov rax, 1 ; syscall: write
mov rdi, 1 ; file descriptor: stdout
mov rsi, msg ; pointer to message
mov rdx, 18 ; message length
syscall

; Print Fibonacci numbers
mov rcx, 10 ; counter for 10 Fibonacci numbers
mov rbx, fib_array ; pointer to the Fibonacci array

print_fib:
mov al, [rbx] ; load the Fibonacci number
add al, ‘0’ ; convert to ASCII
mov rax, 1 ; syscall: write
mov rdi, 1 ; file descriptor: stdout
mov rsi, rax ; pointer to the number (in AL)
mov rdx, 1 ; number length
syscall

mov rax, 1 ; syscall: write
mov rdi, 1 ; file descriptor: stdout
mov rsi, newline ; pointer to newline character
mov rdx, 1 ; length of newline
syscall

inc rbx ; move to the next Fibonacci number
loop print_fib ; repeat until all printed

; Exit program
mov rax, 60 ; syscall: exit
xor rdi, rdi ; status 0
syscall

section .bss
newline resb 1 ; allocate space for newline character
db 10 ; newline character in the bss section

import std.stdio;

void main() {
ubyte[] fibonacci = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]; // Array with the first ten Fibonacci numbers
int arraySize = fibonacci.length; // Size of the array

foreach (i; 0 .. arraySize) {
// Load current Fibonacci number
ubyte currentNum = fibonacci[i];
// Convert to ASCII
char asciiChar = cast(char)(currentNum + ‘0’);

// Print the number
std.stdout.write(asciiChar);
}

// Exit the program
std.exit(0);
}

section .data
prompt db “Enter a positive integer: “, 0
result_msg db “The factorial is: “, 0
newline db 10, 0

section .bss
num resb 4
fact resq 1

section .text
extern printf, scanf
global _start

_start:
; Prompt user for input
mov rdi, prompt
xor rax, rax
call printf

; Read integer
mov rdi, num
xor rax, rax
call scanf

; Convert input string to integer
mov rax, [num]
sub rax, ‘0’ ; Convert ASCII to integer
mov rbx, rax ; Store number in rbx
mov rax, 1 ; Initialize factorial result

factorial:
cmp rbx, 1
jbe .done ; If rbx <= 1, we are done mul rbx ; Multiply rax by rbx dec rbx ; Decrement rbx jmp factorial .done: mov [fact], rax ; Store result in fact ; Print result message mov rdi, result_msg xor rax, rax call printf ; Print factorial result mov rdi, [fact] call print_number ; Print newline mov rdi, newline xor rax, rax call printf ; Exit program mov rax, 60 ; syscall: exit xor rdi, rdi ; status 0 syscall print_number: ; Print a number in rdi (assumes number is in rdi) mov rsi, rdi mov rdi, num add rdi, 1 mov rax, 0 call itoa ; Convert integer to string mov rdi, num call printf ret itoa: ; Converts number in rsi to string in rdi xor rax, rax mov rbx, 10 itoa_loop: xor rdx, rdx div rbx add dl, '0' dec rdi mov [rdi], dl inc rax test rax, rax jnz itoa_loop ret

import std.stdio;

void main() {
// Data
string prompt = “Enter a positive integer: “;
string result_msg = “The factorial is: “;
writeln(); // For newline
int num;
ulong fact = 1;

// Prompt user for input
write(prompt);
import std.conv : to;
num = readln().to!int;

// Calculate factorial
if (num <= 1) { fact = 1; } else { for (int i = 2; i <= num; ++i) { fact *= i; } } // Print result message write(result_msg); print_number(fact); // Print newline writeln(); // For newline } void print_number(ulong number) { // Print a number write(number); }