【HDOJ】2045 不容易系列之(3)—— LELE的RPG难题

#include <stdio.h>

#define MAXNUM 52

long long kinds[MAXNUM] = {0,3,6,6};

int main() {
int n;
int i;

for (i=4; i<MAXNUM; ++i)
kinds[i] = kinds[i-2]*2 + kinds[i-1];

while (scanf("%d", &n) != EOF) {
printf("%I64d\n", kinds
);
}

return 0;
}