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

