Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Dead_Lock
//Title of this code #include <iostream> #include <thread> #include <mutex> using namespace std; int main() { std::mutex g_mutex; std::thread t1([&g_mutex]()->void{ std::lock_guard<std::mutex> lock1(g_mutex); std::thread t2([&g_mutex]()->void { std::lock_guard<std::mutex> lock2(g_mutex); cout << "This Cann't be executed forever!!!" << endl; }); t2.join(); }); t1.join(); }
run
|
edit
|
history
|
help
0
floyd alfa 2
inorder traversal
segmented sieve
NWD, algorytm Euklidesa
container access all elements
задача new
2d array sum
Lotto random number game {modify}
prime factorization trial division
subset sum=k(dp)