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 | 3803 |
2 | jiangly | 3707 |
3 | Benq | 3627 |
4 | ecnerwala | 3584 |
5 | orzdevinwang | 3573 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | Radewoosh | 3542 |
9 | jqdai0815 | 3532 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 163 |
1 | maomao90 | 163 |
3 | adamant | 161 |
4 | maroonrk | 152 |
5 | -is-this-fft- | 151 |
6 | nor | 150 |
7 | atcoder_official | 147 |
7 | SecondThread | 147 |
9 | TheScrasse | 146 |
10 | Petr | 145 |
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...