HDU 1297 （大数）

Children’s Queue

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3314    Accepted Submission(s): 941

Problem Description

There are many students in PHT School. One day, the headmaster whose name is PigHeader wanted all students stand in a line. He prescribed that girl can not be in single. In other words, either no girl in the queue or more than one girl stands side by side. The case n=4 (n is the number of children) is like
FFFF, FFFM, MFFF, FFMM, MFFM, MMFF, MMMM
Here F stands for a girl and M stands for a boy. The total number of queue satisfied the headmaster’s needs is 7. Can you make a program to find the total number of queue with n children?

 

 

Input

There are multiple cases in this problem and ended by the EOF. In each case, there is only one integer n means the number of children (1<=n<=1000)

 

 

Output

For each test case, there is only one integer means the number of queue satisfied the headmaster’s needs.

 

 

Sample Input

  
  

   
   1
2
3
  
  

 

 

Sample Output

  
  

   
   1
2
4
  
  

 

思路：找出规律：f[i]=f[i-4]+f[i-2]+f[i-1]; 还有考虑的一点是大数的相加，因为涉及到1000的结果为12748494904808148294446671041721884239818005733501580815621713101333980596197474
74433619974245291299822523591089179822154130383839594330018972951428262366519975
47955743099808702532134666561848656816661065088789701201682837073071502397487823
19037

代码如下：

#include <stdio.h> int rrr[1001][1000]; void big_add(int a[],int b[],int c[]) { int i,len; len=a[0]>b[0]?a[0]:b[0]; for(i=1;i<(len+3);i++) c[i]=0; for(i=1;i<=len;i++) { c[i]+=a[i]+b[i]; if(c[i]>=10) { c[i]-=10; c[i+1]++; } } if(c[i]>0) len++; c[0]=len; } int main() { int x[1000]; int n; rrr[1][0]=1; rrr[1][1]=1; rrr[2][0]=1; rrr[2][1]=2; rrr[3][0]=1; rrr[3][1]=4; rrr[4][0]=1; rrr[4][1]=7; int i=5; while(i<=1000) { big_add(rrr[i-4],rrr[i-2],x); big_add(x,rrr[i-1],rrr[i]); i++; } while(scanf("%d",&n)!=EOF) { for(i=rrr[n][0];i>=1;i--) { printf("%d",rrr[n][i]); } printf("/n"); } return 0; }