Ok, firstly you'll have to understand how exactly elements are stored in a 2 D array.
In a 2D array(of integers, floats, doubles etc) you access the element array simply. The reason is that when you declare a 2 D array, the CPU stores them in contiguous(one after the another) memory locations. So, your int array would look something like this:
array array array array
1001 1005 1009 1013
where 1001,...,1013 are memory locations(I assume that the size of an integer in your machine is 4 bytes).
If you want to access array, then you just do
. But in C++, an array is treated somewhat like a pointer. The array name(in this case array) points to the base address of array(in this case array). So, when you do array, the CPU finds the element concerned as follows:
the address of array = ( base address of array + 4 * 0 ) + 1
Similarly, an array of integer pointers are also similarly stored. But if you are familiar with pointer arithmetic, I guess you'll figure out what your book says.
But in case of an array of pointers, you'll have to do something like this:
for(int r = 0; r < no_of_rows; r++)
for(int c = 0; c < no_of_columns; c++)
cin >> int_pointer_array[r * no_of_columns + c];
If you examine closely, you'll find the similarity between the two. In your case if you plug the values of the indices of your required elements and use the above formula in the code, you'll understand what I mean.
Hope this short lecture helped :)