void solve(int N,int P){
if(N==0)
{
cout<<"yes\n";
return;
}
if(N-2>=0){
solve(N-2,P);
}
if(N-3>=0){
solve(N-3,P);
}
}
It's showing runtime error for N = 200000(Ignore P) . Why ??
# | User | Rating |
---|---|---|
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 |
# | User | Contrib. |
---|---|---|
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 |
void solve(int N,int P){
if(N==0)
{
cout<<"yes\n";
return;
}
if(N-2>=0){
solve(N-2,P);
}
if(N-3>=0){
solve(N-3,P);
}
}
It's showing runtime error for N = 200000(Ignore P) . Why ??
Name |
---|
Even if you write simple fibonacci recursive function, you will get RE at big tests. It is because program did a lot of recursive calls.
To know more and unterstand how to avoid it, learn basics of DP (dynamic programming).
wont work for n>=3 coz it will end up at n=1(which doesnt have any return statement), also there will be plenty of yes printed for every number and i dont think you would want that...