#include <stdlib.h>
#include <stdio.h>

void fib(int *result, int n) {
    result = malloc(sizeof(int) * n);
    result[0] = 0;
    result[1] = 1;
    int i;
    for (i = 2; i < n; i++) {
        result[i] = result[i-2] + result[i-1];
    }
}

int main(int argc, char **argv) {
    /* do not change this main function */
    int count = strtol(argv[1], NULL, 10);
    int *fib_sequence;

    fib(&fib_sequence, count);
    for (int i = 0; i < count; i++) {
        printf("%d ", fib_sequence[i]);
    }
    free(fib_sequence);
    return 0;
}
build a dynamic array containing the first n elements of the Fibonacci sequence