Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
thread
//Title of this code #include <iostream> #include <thread> #include <chrono> using namespace std; void foo(){ cout << "fooo\n"; } int main() { thread th(foo); th.detach(); std::this_thread::sleep_for(std::chrono::seconds(2)); }
run
|
edit
|
history
|
help
0
Test
Wuninitialized
kadane's algorithm 2
subset sum=k(dp)
Dar
project
Find the row with max ones
DeltaX campus recruitment
HeapSort
K edit distance