Practice #1

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

int main() {
    int* a = (int*)malloc(sizeof(int) * 1000);
    int aSize = 0, x;
    while (scanf("%d", &x) == 1) a[aSize++] = x;
    int returnSize;
    int* result = reverse(a, aSize, &returnSize);
    for (int i = 0; i < returnSize; i++) printf("%d\n", result[i]);
    free(a);
    return 0;
}