Challenge #14 [easy]

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

int main(const int argc, const char * argv[]) {

        int b = atoi(argv[1]);

        int list[] = {1, 2, 3, 4, 5, 6};
        int listSize = sizeof list / sizeof (int);
        int origList[listSize];

        memcpy(origList, list, sizeof(int[listSize]));
        int blocks = listSize/b;

        int i, x;
        for (i = 0; i < blocks; i++) {
                for (x = 0; x < b; x++) {
                        if (!x) list[b*i+x] = origList[b*(i+1)-x-1];
                        else list[b*i+x] = origList[b*(i+1)-x-1];
                }
        }

        int z;
        for (z = 0; z < listSize; z++) printf("%d\t",origList[z]);
        puts("\n");
        for (z = 0; z < listSize; z++) printf("%d\t",list[z]);
        puts("\n");

        return 0;
}