That is my submission for problem http://mirror.codeforces.com/problemset/problem/430/C
My program seems to handle previous inputs of equal size, what might be the problem?
№ | Пользователь | Рейтинг |
---|---|---|
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 |
That is my submission for problem http://mirror.codeforces.com/problemset/problem/430/C
My program seems to handle previous inputs of equal size, what might be the problem?
Название |
---|
I don't know python very well, but did you set an enough size for your arrays? or may you call the negative index from them?
Yes, I have set the size for arrays. It is not working only on that particular test case. When I run that test case (It seems to have a pattern in the input, so I figured it out) on my desktop machine, the recursion limit is exceeded. I tried resetting that limit but it just exits the program. Maybe an iterative solution in required.
woww... for the recursion, stack size is limit. for recursive functions that we usually use, you can call the function about 10^5 time in the good stack sized machine. I suggest you to see other's solution for this problem :)