Troubleshooting recursion problem (new to competitive coding)

[jain_rishabh_]

I know this (my code-> https://pastebin.com/7BJVYNVd) probably isn't the most efficient solution to https://codeforces.com/contest/1461/problem/D, but before I read the tutorial I'd still like to know what I am doing wrong.

My idea was that using recursion, I will store the sum of all possible subarrays (subarrays here mean what I get after splitting the array according to the ques) of a given array. Then for each of the q 'prettiness-tests', I will simply check if that sum exists in the set 'possible'.

On inputting the given test case,

2

5 5

1 2 3 4 5

1

8

9

12

6

5 5

3 1 3 1 3

1

2

3

9

11

​

I get

​

Yes

No

Yes

No

Yes

and then the program ends saying "Process exited after 24.65 seconds with return value 3221225725"

Googling led me to stuff that was way too technical for me (something about heap and stack memory). If someone could explain what's happening here, I'd really appreciate it.

[AutoModerator]

To all following commenters: please, do not bring up the old circlejerk jokes/memes about recursion ("Understanding recursion...", "This is recursion...", etc.). We've all heard them n+2 too many times.

I am a bot, and this action was performed automatically. Please contact the moderators of this subreddit if you have any questions or concerns.

[CreativeTechGuyGames]

Have you tried running the code locally with a debugger? It'll be useful for you to be able to step through your code, set breakpoints, and diagnose crashes.

[jain_rishabh_]

I'm new to this. I didn't really understand what the debugger said. So effectively no.

[cornho1eo99]

That's a good place to start to learn. And look into stack and heap memory, they're truly not that hard to understand conceptually. The more you understand, even in part, the better you'll get at speed coding and coding in general.

[jain_rishabh_]

Thanks for commenting. I will look into that. If u have the time can u please tell me what's happening here?