Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
mua
#include <iostream> #include <memory> int main() { auto array = std::make_unique<int[]>(50*50); std::cout << *(array.get() + 50*50-1); }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
Caminho das Pontes
Jilebi Nimki
Shortest path in binary tree
Rectangle overlap
Matrix spiral print
MACRO
minmax
Binary tree balanced or not
member initial list
sample1
Please log in to post a comment.