#include <iostream>
#include <algorithm>
#include <iterator>
#include <vector>
using namespace std;
int main() {
size_t n = 10;
// Best would be to use vectors. These are variable sized and dynamic
vector<int> varray(n);
cout<<varray.size()<<endl;
// But if you need raw arrays you can still go for:
int *array = new int[n];
for (int i=0; i<n; i++) // just filling some data
varray[i]=array[i]=i*7;
// here the solution with raw array
int last[5];
copy(array+n-5, array+n, last); // array version
copy(last, last+5, ostream_iterator<int>(cout," ")); // display result in one line
cout<<endl;
// here the solution with vectors
vector<int> vlast(5);
copy(varray.end()-vlast.size(), varray.end(), vlast.begin());
copy(vlast.begin(), vlast.end(), ostream_iterator<int>(cout," ")); // display
cout<<endl;
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgojaW5jbHVkZSA8aXRlcmF0b3I+CiNpbmNsdWRlIDx2ZWN0b3I+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCXNpemVfdCBuID0gMTA7IAoKICAgIC8vIEJlc3Qgd291bGQgYmUgdG8gdXNlIHZlY3RvcnMuIFRoZXNlIGFyZSB2YXJpYWJsZSBzaXplZCBhbmQgZHluYW1pYwoJdmVjdG9yPGludD4gdmFycmF5KG4pOyAKCWNvdXQ8PHZhcnJheS5zaXplKCk8PGVuZGw7IAoJCgkvLyBCdXQgaWYgeW91IG5lZWQgcmF3IGFycmF5cyB5b3UgY2FuIHN0aWxsIGdvIGZvcjogIAoJaW50ICphcnJheSA9IG5ldyBpbnRbbl07Cglmb3IgKGludCBpPTA7IGk8bjsgaSsrKSAgIC8vIGp1c3QgZmlsbGluZyBzb21lIGRhdGEgCgkgICAgdmFycmF5W2ldPWFycmF5W2ldPWkqNzsgCgkgICAgCgkvLyBoZXJlIHRoZSBzb2x1dGlvbiB3aXRoIHJhdyBhcnJheSAKCWludCBsYXN0WzVdOyAKCWNvcHkoYXJyYXkrbi01LCBhcnJheStuLCBsYXN0KTsgICAvLyBhcnJheSB2ZXJzaW9uCiAgICBjb3B5KGxhc3QsIGxhc3QrNSwgb3N0cmVhbV9pdGVyYXRvcjxpbnQ+KGNvdXQsIiAiKSk7ICAgLy8gZGlzcGxheSByZXN1bHQgaW4gb25lIGxpbmUgCiAgICBjb3V0PDxlbmRsOyAKCiAgICAvLyBoZXJlIHRoZSBzb2x1dGlvbiB3aXRoIHZlY3RvcnMKICAgIHZlY3RvcjxpbnQ+IHZsYXN0KDUpOwoJY29weSh2YXJyYXkuZW5kKCktdmxhc3Quc2l6ZSgpLCB2YXJyYXkuZW5kKCksIHZsYXN0LmJlZ2luKCkpOyAKCQogICAgY29weSh2bGFzdC5iZWdpbigpLCB2bGFzdC5lbmQoKSwgb3N0cmVhbV9pdGVyYXRvcjxpbnQ+KGNvdXQsIiAiKSk7IC8vIGRpc3BsYXkKICAgIGNvdXQ8PGVuZGw7IAoJcmV0dXJuIDA7Cn0=