in the name of god
i'm new to python and i write recursion function in it for solving this problem and i get runtime error on test 5.
why recursion function in python gets runtime error?
its ok in c++.
thanks for your helping!
→ Обратите внимание
До соревнования
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
Refact.ai Match 1 (Codeforces Round 985)
4 дня
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 05.11.2024 11:31:58 (k3).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by ya_hossein (previous revision, new revision, compare).
Auto comment: topic has been updated by ya_hossein (previous revision, new revision, compare).
Auto comment: topic has been updated by ya_hossein (previous revision, new revision, compare).
The default limit on recursive calls in Python is 1000 or 10000. You can increase it by calling
sys.setrecursionlimit(...).thanks so much
i don't know why but after adding sys it doesn't work. here is my submission
Further to the comments about recursion limits, you may also find that even changing the max depth does not solve your problem. I certainly had that experience.
I found a solution in this thread and specifically this comment — it turns your recursion function into a non-recursive stack implementation.
Note that all recursions can be achieved using stacks instead, and (using DFS as an example), it is possible to code a DFS recursion using stacks instead, thus eliminating any concerns.
it doesn't work after using bootstrap...
did i forget something?
here is link
When you call the function from within itself, you must precede the call with "yield", so the correct version looks like this:
arr1[x] = num1[x] + max((yield(ans0(x + 1))), (yield(ans0(x + 2))))
and the same for your other function
The solutions are not equivalent.
When they are, the next thing is to learn to increase stack size in Python. You can refer here for an example.