Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
pointer
//Title of this code //g++ 4.8.2 #include <iostream> int main() { int *p,*q; p=new (int); q=new (int); *p=7;*q= *p; std::cout<<p; }
run
|
edit
|
history
|
help
0
Cours C++
integer division
Get smallest dividers
Graph DFS
Graph Theory 2
Treap (making range queries(that are not possible on seg_Trees) possible with no effort) : (863D)
thread
Expected types
HashTabFold
Click 5