题解 | 牛牛学数列6
牛牛学数列6
https://www.nowcoder.com/practice/b6321648517247b2ac2e2f80cbc63ae1
#include <stdio.h>
int main() {
int n;
scanf("%d", &n);
int shuzu[n];
shuzu[0] = 0;
shuzu[1] = shuzu[2] = 1;
if (n == 1){
printf("%d", shuzu[0]);
}
if ((n == 2) && (n == 3)){
printf("%d", shuzu[1]);
}
if (n >= 4){
for (int i = 3; i < n; i++){
shuzu[i] = shuzu[i - 3] + 2 * shuzu[i - 2] + shuzu[i - 1];
}
}
printf("%d", shuzu[n - 1]);
return 0;
}
