This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ngthanhtrung23/ACM_Notebook_new
// Source: https://codeforces.com/blog/entry/120772 #include <bits/stdc++.h> using namespace std; void main_() { // implement your solution here } static void run_with_stack_size(void (*func)(void), size_t stsize) { char *stack, *send; stack = (char *)malloc(stsize); send = stack + stsize - 16; send = (char *)((uintptr_t)send / 16 * 16); asm volatile( "mov %%rsp, (%0)\n" "mov %0, %%rsp\n" : : "r"(send)); func(); asm volatile("mov (%0), %%rsp\n" : : "r"(send)); free(stack); } int main() { run_with_stack_size(main_, 1024 * 1024 * 1024); // run with a 1 GiB stack return 0; }
#line 1 "stack_increase.cpp" // Source: https://codeforces.com/blog/entry/120772 #include <bits/stdc++.h> using namespace std; void main_() { // implement your solution here } static void run_with_stack_size(void (*func)(void), size_t stsize) { char *stack, *send; stack = (char *)malloc(stsize); send = stack + stsize - 16; send = (char *)((uintptr_t)send / 16 * 16); asm volatile( "mov %%rsp, (%0)\n" "mov %0, %%rsp\n" : : "r"(send)); func(); asm volatile("mov (%0), %%rsp\n" : : "r"(send)); free(stack); } int main() { run_with_stack_size(main_, 1024 * 1024 * 1024); // run with a 1 GiB stack return 0; }