hdoj-2047-阿牛的EOF牛肉串
这个题是递推解得 当第i个是o时 i-1个可以为e/f 2*a(i-2) 当第i个不是o时 可以是e/f 2*a[i-1]
1 #include<stdio.h> 2 #include<string.h> 3 const int MAX = 40; 4 __int64 seq[MAX]; 5 void GenerateSeq(__int64 seq[], int n); 6 int main() 7 { 8 int n; 9 memset(seq,0,sizeof(seq)); 10 GenerateSeq(seq,MAX); 11 while(scanf("%d",&n)!=EOF) 12 { 13 printf("%I64d\n",seq[n]); 14 } 15 return 0; 16 } 17 18 void GenerateSeq(__int64 seq[], int n) 19 { 20 seq[1] = 3; 21 seq[2] = 8; 22 int i; 23 for(i = 3; i < n; i++) 24 { 25 seq[i] = 2 * (seq[i - 2] + seq[i - 1]); 26 } 27 }
