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 | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
10 | nor | 152 |
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 |
---|