UC知道ACM大数据问题
来源：百度知道 编辑：UC知道 时间：2024/09/26 13:08:49
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
算法我知道了，数据规模太大了用__int64还是溢出了。。高手指点下写下代码。。要C语言的喔。。。
算法
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
算法我知道了，数据规模太大了用__int64还是溢出了。。高手指点下写下代码。。要C语言的喔。。。
算法
给，VC上OK了。
#include<stdio.h>
short a[1002][500];
void find()
{
int i=5;
int j=0;
int d=0;
while(i<1001)
{
j=1;
while(j<=a[i-1][0])
{
if(a[i-1][j]+a[i-2][j]+a[i-4][j]+d>=10)
{
a[i][j]=(a[i-1][j]+a[i-2][j]+a[i-4][j]+d)%10;
d=(a[i-1][j]+a[i-2][j]+a[i-4][j]+d)/10;
}
else
{
a[i][j]=a[i-1][j]+a[i-2][j]+a[i-4][j]+d;
d=0;
}
j++;
}
while(d>=10)
{
a[i][j++]=d%10;
d=d/10;
}
if(d>0)
{
a[i][j]=d;
}
else
{
j--;
}
a[i][0]=j;
d=0;
i+