Since the number of elements is determined by some conditions, I wrote a program like this;
int i = 0; int *layer; while (i != 12){ layer = new int; layer[i] = i; cout << layer[i] << endl; i++; } delete[] layer; return 0; 0 1 2 3 4 5 6 You have undefined behaviour. You allocate space for a single int, then you treat it as an array.
layer = new int; // single int layer[i] = i; // wat?? Then you leak the memory, then you call delete[] on the last newed int. Since it isn't clear what you want to do with your code, I can only offer some suggestions:
std::vector<int> as a dynamic array. It will save you a lot of trouble.new (you probably don't), you need new int[n] where n is the number of elements.delete [] for every new[] and delete for every new.
push_back elements into it, increasing its size by one each time.