I'm using my Mac, and the hard limit of stack is 65520. This caused me not able to run my program with recursion using huge data. How can I solve it?
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
I'm using my Mac, and the hard limit of stack is 65520. This caused me not able to run my program with recursion using huge data. How can I solve it?
I know it's $$$\Theta\left(n^2\right)$$$ but I don't know how to build a case to hack it.
I read Blowing up unordered_map, and how to stop getting hacked on it but it doesn't work for GNU C++20 (64). Custom invocation of the hack shown in the blog shows:
x = 107897: 0.064 seconds, sum = 2666686666700000
x = 126271: 0.055 seconds, sum = 2666686666700000
which means that this hack doesn't work.
Name |
---|