ACM的一道题,看着很简单,提交却WA了,

来源：学生作业帮编辑：作业帮分类：英语作业时间：2024/07/04 18:34:08

ACM的一道题,看着很简单,提交却WA了,
More than Fibonacci
Time Limit:1000ms
Memory Limit:65536kb
Description
The New Fibonacci numbers (0,1,2,3,6,11,20,37,68,...) are defined by the recurrence:F(0) = 0; F(1) = 1; F(2) = 2;
F(n) = F(n-1) + F(n-2) + F(n-3) for all n>2
Write a program to calculate the New Fibonacci numbers.
Input
The input is a sequence of integers not more than 36,each on a separate line,specifying which New Fibonacci number to calculate.
Output
Print the New Fibonacci numbers in the format shown in Sample Output.
Sample Input
5
7
11
Sample Output
The New Fibonacci number for 5 is 11
The New Fibonacci number for 7 is 37
The New Fibonacci number for 11 is 423
我的代码:
#include
main()
{
\x05long F[37];
\x05int i,n;
\x05while(scanf("%d",&n)!=EOF)
\x05{
\x05\x05F[0]=0;F[1]=1;F[2]=2;
\x05\x05for(i=3;i

#include
int main()
{
long F[37];
int i,n;
F[0]=0;F[1]=1;F[2]=2;
for(i=3;i

ACM的一道题,看着很简单,提交却WA了, 一道杭电ACM的测试题,我运行的没问题,但是提交却是WA, 问一道acm的题,提交时老实说超时. ACM 的一道题提交总是Time Limit Exceeded，求救一道简单的ACM题目,快速排序的,老是提交不成功,大家帮我看看 ACM一道算法题,我的算法为何WA 一个很简单的ACM题,这个提交后怎么会“Time Limit Exceed”? 一道很简单的ACM题,求大神看看我错在哪儿了,C++ 一道很简单的ACM编程题,新人,帮忙看下哪儿错了, ACM题求助为啥WA acm pku 2062题wa, 一个简单的acm题,超时了,求改进算法