class Solution {
public:
int fib(int n) {
if(n==0){
return 0;
}
if(n==1){
return 1;
}
return fib(n - 1) + fib(n - 2)
; }
};
class Solution {
public:
int tribonacci(int n) {
if(n==0){
return 0;
}else if(n==1){
return 1;
}else if(n==2){
return 1;
}
int p = 0,q = 0,r = 1,s = 1;
for(int i = 3;i <= n;++i){
p = q;
q = r;
r = s;
s = p + q + r;
}
return s;
}
};